ast string | certificates list | difficulty int64 | findings list | goals list | id string | kernel string | kind string | mode string | narrative string | points unknown | results unknown | seed int64 | sha256 string | status string | tag string | termination string | text string | title string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
(Problem (LineEq l "-x-2y" "13") (LineEq m "x+2y" "-13") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 1 x) (* 2 y) 13) 0) (not (= (+ (* 1 x) (* 2 y) 13) 0))))"
],
"declarations": [
"(decla... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00001 | line_intersection | construction | numeric | Problem: Line l: -x - 2y = 13. Line m: x + 2y = -13. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- The determinant of the 2... | {} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | 06c6c2582d76ee00fe000ca59b2acfd6daeb6f8768b29496d556658a1d75c756 | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Line l: -x - 2y = 13. Line m: x + 2y = -13. Find the intersection of line l and line m. | null |
(Problem (LineEq l "8x-9y" "5") (LineEq m "-y" "-8") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (77/8, 8)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 8 x) (* (- 9) y) (- 5)) 0) (= (+ (* 0 x) (* 1 y) (- 8)) 0) (not (and (= x (/ 77 8)) (= y 8)))) (not (and (= (+ (* 8 (/ 77 8... | 1 | [] | [] | geo-line_intersection-00002 | line_intersection | construction | numeric | Problem: Line l: 8x - 9y = 5. Line m: -y = -8. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear system ... | {} | {
"q0": {
"determinant": "8",
"kind": "intersection",
"outcome": "point",
"point": [
"77/8",
"8"
]
}
} | 20,261,117 | 3178760b850d3854dd827d349a01fe99deb9a622bb5cb27f9cbf60a1d88c4282 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 8x - 9y = 5. Line m: -y = -8. Find the intersection of line l and line m. | null |
(Problem (Point A "0" "0") (Point B "2" "2") (Point C "1" "3") (Point D "0" "-5/2") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (5/9, 5/9)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* (- 1) y) 0) 0) (= (+ (* 11 x) (* (- 2) y) (- 5)) 0) (not (and (= x (/ 5 9)) (= y (/ 5 9))))) (not (and (= (+ (* 1 ... | 2 | [] | [] | geo-line_intersection-00003 | line_intersection | construction | numeric | Problem: Point A = (0, 0). Point B = (2, 2). Point C = (1, 3). Point D = (0, -5/2). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact re... | {
"A": [
"0",
"0"
],
"B": [
"2",
"2"
],
"C": [
"1",
"3"
],
"D": [
"0",
"-5/2"
]
} | {
"q0": {
"determinant": "9",
"kind": "intersection",
"outcome": "point",
"point": [
"5/9",
"5/9"
]
}
} | 20,261,117 | bb91c783e3565a8674fde807d7f4d4b6a44cec2bcf8b8d31a86aebf11d834721 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (0, 0). Point B = (2, 2). Point C = (1, 3). Point D = (0, -5/2). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "-7" "0") (Point B "2" "-3/4") (Point C "8" "2") (Point D "-1" "-3") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (67/23, -19/23)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 12 y) 7) 0) (= (+ (* 5 x) (* (- 9) y) (- 22)) 0) (not (and (= x (/ 67 23)) (= y (- (/ 19 23)))))) (not (and (... | 1 | [] | [] | geo-line_intersection-00004 | line_intersection | construction | numeric | Problem: Point A = (-7, 0). Point B = (2, -3/4). Point C = (8, 2). Point D = (-1, -3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected... | {
"A": [
"-7",
"0"
],
"B": [
"2",
"-3/4"
],
"C": [
"8",
"2"
],
"D": [
"-1",
"-3"
]
} | {
"q0": {
"determinant": "-69",
"kind": "intersection",
"outcome": "point",
"point": [
"67/23",
"-19/23"
]
}
} | 20,261,117 | 6fc9e02fba33f7435822596b27ba4d5bf32f100815d5fa30114067daa7e18aae | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-7, 0). Point B = (2, -3/4). Point C = (8, 2). Point D = (-1, -3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "x+44y" "-84") (LineEq m "40x+31y" "-147") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-552/247, -459/247)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 44 y) 84) 0) (= (+ (* 40 x) (* 31 y) 147) 0) (not (and (= x (- (/ 552 247))) (= y (- (/ 459 247)))))) (n... | 1 | [] | [] | geo-line_intersection-00005 | line_intersection | construction | numeric | Problem: Line l: x + 44y = -84. Line m: 40x + 31y = -147. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 lin... | {} | {
"q0": {
"determinant": "-1729",
"kind": "intersection",
"outcome": "point",
"point": [
"-552/247",
"-459/247"
]
}
} | 20,261,117 | 6698fa86185de106bd14c97796bee7ae7910c4c6b1c90f30a158777ef507aa16 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: x + 44y = -84. Line m: 40x + 31y = -147. Find the intersection of line l and line m. | null |
(Problem (Point A "2" "-3") (Point B "1" "4") (Point C "-4" "8/3") (Point D "-6" "-5") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-42/65, 1009/65)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 7 x) (* 1 y) (- 11)) 0) (= (+ (* 23 x) (* (- 6) y) 108) 0) (not (and (= x (- (/ 42 65))) (= y (/ 1009 65))))) (not ... | 2 | [] | [] | geo-line_intersection-00006 | line_intersection | construction | numeric | Problem: Point A = (2, -3). Point B = (1, 4). Point C = (-4, 8/3). Point D = (-6, -5). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact... | {
"A": [
"2",
"-3"
],
"B": [
"1",
"4"
],
"C": [
"-4",
"8/3"
],
"D": [
"-6",
"-5"
]
} | {
"q0": {
"determinant": "-65",
"kind": "intersection",
"outcome": "point",
"point": [
"-42/65",
"1009/65"
]
}
} | 20,261,117 | 1cc66e6e768bbd37a1b6b3c075b6b7a1bcd3a7f9dfe2a1f544c2b2be4ed84860 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (2, -3). Point B = (1, 4). Point C = (-4, 8/3). Point D = (-6, -5). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "-7x+y" "-23") (LineEq m "-x+y" "3") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (13/3, 22/3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 7 x) (* (- 1) y) (- 23)) 0) (= (+ (* 1 x) (* (- 1) y) 3) 0) (not (and (= x (/ 13 3)) (= y (/ 22 3))))) (not (and (= (+ (... | 1 | [] | [] | geo-line_intersection-00007 | line_intersection | construction | numeric | Problem: Line l: -7x + y = -23. Line m: -x + y = 3. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear sy... | {} | {
"q0": {
"determinant": "-6",
"kind": "intersection",
"outcome": "point",
"point": [
"13/3",
"22/3"
]
}
} | 20,261,117 | b0a5164aa8edbe37f5db1a39cf20e77427f839c79d7104c7792f964d560b8d7b | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -7x + y = -23. Line m: -x + y = 3. Find the intersection of line l and line m. | null |
(Problem (Point A "-1/2" "7") (Point B "-2" "-8/3") (Point C "6" "-5/3") (Point D "-7" "-3/2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-2764/1511, -7100/4533)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 58 x) (* (- 9) y) 92) 0) (= (+ (* 1 x) (* 78 y) 124) 0) (not (and (= x (- (/ 2764 1511))) (= y (- (/ 7100 45... | 1 | [] | [] | geo-line_intersection-00008 | line_intersection | construction | numeric | Problem: Point A = (-1/2, 7). Point B = (-2, -8/3). Point C = (6, -5/3). Point D = (-7, -3/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (... | {
"A": [
"-1/2",
"7"
],
"B": [
"-2",
"-8/3"
],
"C": [
"6",
"-5/3"
],
"D": [
"-7",
"-3/2"
]
} | {
"q0": {
"determinant": "4533",
"kind": "intersection",
"outcome": "point",
"point": [
"-2764/1511",
"-7100/4533"
]
}
} | 20,261,117 | c6de02197b83b9377addd257c8e04b1648d1237676ca60b87dae8d4ee69737d8 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1/2, 7). Point B = (-2, -8/3). Point C = (6, -5/3). Point D = (-7, -3/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "8" "4") (Point B "-2" "-5") (Point C "3" "-3") (Point D "-7" "1") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (14/13, -29/13)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 9 x) (* (- 10) y) (- 32)) 0) (= (+ (* 2 x) (* 5 y) 9) 0) (not (and (= x (/ 14 13)) (= y (- (/ 29 13)))))) (not (and (... | 1 | [] | [] | geo-line_intersection-00009 | line_intersection | construction | numeric | Problem: Point A = (8, 4). Point B = (-2, -5). Point C = (3, -3). Point D = (-7, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected b... | {
"A": [
"8",
"4"
],
"B": [
"-2",
"-5"
],
"C": [
"3",
"-3"
],
"D": [
"-7",
"1"
]
} | {
"q0": {
"determinant": "65",
"kind": "intersection",
"outcome": "point",
"point": [
"14/13",
"-29/13"
]
}
} | 20,261,117 | e0555ed138cb21bf4678222548a7b8e9c2356c3aab5710e8746355f4040ddb53 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (8, 4). Point B = (-2, -5). Point C = (3, -3). Point D = (-7, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-8" "-4") (Point B "-8" "6") (Point C "-7/2" "-1/3") (Point D "1" "6") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-8, -20/3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 0 y) 8) 0) (= (+ (* 38 x) (* (- 27) y) 124) 0) (not (and (= x (- 8)) (= y (- (/ 20 3)))))) (not (and (= (+ (* 1 (... | 2 | [] | [] | geo-line_intersection-00010 | line_intersection | construction | numeric | Problem: Point A = (-8, -4). Point B = (-8, 6). Point C = (-7/2, -1/3). Point D = (1, 6). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the ex... | {
"A": [
"-8",
"-4"
],
"B": [
"-8",
"6"
],
"C": [
"-7/2",
"-1/3"
],
"D": [
"1",
"6"
]
} | {
"q0": {
"determinant": "-27",
"kind": "intersection",
"outcome": "point",
"point": [
"-8",
"-20/3"
]
}
} | 20,261,117 | 3f15dea6db26cac1e5c9df31408088c8e2c6e57aa379e3e0a1138823d146e631 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-8, -4). Point B = (-8, 6). Point C = (-7/2, -1/3). Point D = (1, 6). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "13x-8y" "-75") (LineEq m "8x-y" "-23") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-109/51, 301/51)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 13 x) (* (- 8) y) 75) 0) (= (+ (* 8 x) (* (- 1) y) 23) 0) (not (and (= x (- (/ 109 51))) (= y (/ 301 51))))) (not (... | 1 | [] | [] | geo-line_intersection-00011 | line_intersection | construction | numeric | Problem: Line l: 13x - 8y = -75. Line m: 8x - y = -23. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear... | {} | {
"q0": {
"determinant": "51",
"kind": "intersection",
"outcome": "point",
"point": [
"-109/51",
"301/51"
]
}
} | 20,261,117 | 8f79acc74b572ff8a8b96083f92a236525ff283dbae7ca2cdf0beadd0a90f1a9 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 13x - 8y = -75. Line m: 8x - y = -23. Find the intersection of line l and line m. | null |
(Problem (Point A "1" "-4") (Point B "0" "-1") (Point C "1/4" "-4") (Point D "2" "0") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (25/37, -112/37)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 1 y) 1) 0) (= (+ (* 16 x) (* (- 7) y) (- 32)) 0) (not (and (= x (/ 25 37)) (= y (- (/ 112 37)))))) (not (and... | 1 | [] | [] | geo-line_intersection-00012 | line_intersection | construction | numeric | Problem: Point A = (1, -4). Point B = (0, -1). Point C = (1/4, -4). Point D = (2, 0). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected ... | {
"A": [
"1",
"-4"
],
"B": [
"0",
"-1"
],
"C": [
"1/4",
"-4"
],
"D": [
"2",
"0"
]
} | {
"q0": {
"determinant": "-37",
"kind": "intersection",
"outcome": "point",
"point": [
"25/37",
"-112/37"
]
}
} | 20,261,117 | 4d92f90d77b33a721e64c86f3becf7b1d19de8558808512056c46018b8718cd6 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (1, -4). Point B = (0, -1). Point C = (1/4, -4). Point D = (2, 0). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-6" "-6") (Point B "3" "-3") (Point C "-5" "-4") (Point D "-7/4" "-5/2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-18, -10)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* (- 3) y) (- 12)) 0) (= (+ (* 6 x) (* (- 13) y) (- 22)) 0) (not (and (= x (- 18)) (= y (- 10))))) (not (and (= (+ (... | 1 | [] | [] | geo-line_intersection-00013 | line_intersection | construction | numeric | Problem: Point A = (-6, -6). Point B = (3, -3). Point C = (-5, -4). Point D = (-7/4, -5/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (sel... | {
"A": [
"-6",
"-6"
],
"B": [
"3",
"-3"
],
"C": [
"-5",
"-4"
],
"D": [
"-7/4",
"-5/2"
]
} | {
"q0": {
"determinant": "5",
"kind": "intersection",
"outcome": "point",
"point": [
"-18",
"-10"
]
}
} | 20,261,117 | 17063225382e9fd781f3c9c3c8c63cf99ee6ee34ea6ea0b7c5c09ec0ee9b4921 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-6, -6). Point B = (3, -3). Point C = (-5, -4). Point D = (-7/4, -5/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-5/4" "6") (Point B "-8" "1") (Point C "3" "0") (Point D "5" "1") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-35, -19)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 20 x) (* (- 27) y) 187) 0) (= (+ (* 1 x) (* (- 2) y) (- 3)) 0) (not (and (= x (- 35)) (= y (- 19))))) (not (and (= (+ (* 2... | 1 | [] | [] | geo-line_intersection-00014 | line_intersection | construction | numeric | Problem: Point A = (-5/4, 6). Point B = (-8, 1). Point C = (3, 0). Point D = (5, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected b... | {
"A": [
"-5/4",
"6"
],
"B": [
"-8",
"1"
],
"C": [
"3",
"0"
],
"D": [
"5",
"1"
]
} | {
"q0": {
"determinant": "-13",
"kind": "intersection",
"outcome": "point",
"point": [
"-35",
"-19"
]
}
} | 20,261,117 | 6a05b8a0d62a2e1815284dd4cbc830e1195951911ead1a970f6b23f148b6c914 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-5/4, 6). Point B = (-8, 1). Point C = (3, 0). Point D = (5, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "5" "7") (Point B "-8" "4") (Point C "2/3" "1") (Point D "3" "3/2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-908/3, -64)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* (- 13) y) 76) 0) (= (+ (* 3 x) (* (- 14) y) 12) 0) (not (and (= x (- (/ 908 3))) (= y (- 64))))) (not (and (= (... | 1 | [] | [] | geo-line_intersection-00015 | line_intersection | construction | numeric | Problem: Point A = (5, 7). Point B = (-8, 4). Point C = (2/3, 1). Point D = (3, 3/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected ... | {
"A": [
"5",
"7"
],
"B": [
"-8",
"4"
],
"C": [
"2/3",
"1"
],
"D": [
"3",
"3/2"
]
} | {
"q0": {
"determinant": "-3",
"kind": "intersection",
"outcome": "point",
"point": [
"-908/3",
"-64"
]
}
} | 20,261,117 | bcd73de2615a20b127f1a7aaf62a2447f8749e6914961ecb20043a297862505a | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (5, 7). Point B = (-8, 4). Point C = (2/3, 1). Point D = (3, 3/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "8" "6") (Point B "5" "6") (Point C "4" "-6") (Point D "3" "-5") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-8, 6)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 0 x) (* 1 y) (- 6)) 0) (= (+ (* 1 x) (* 1 y) 2) 0) (not (and (= x (- 8)) (= y 6)))) (not (and (= (+ (* 0 (- 8)) (* 1 6) (- 6)... | 2 | [] | [] | geo-line_intersection-00016 | line_intersection | construction | numeric | Problem: Point A = (8, 6). Point B = (5, 6). Point C = (4, -6). Point D = (3, -5). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact res... | {
"A": [
"8",
"6"
],
"B": [
"5",
"6"
],
"C": [
"4",
"-6"
],
"D": [
"3",
"-5"
]
} | {
"q0": {
"determinant": "-1",
"kind": "intersection",
"outcome": "point",
"point": [
"-8",
"6"
]
}
} | 20,261,117 | 845d434cdbdc8f90987d6a1693a25f4e37ea08d2df764a113f7343fad3b11c41 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (8, 6). Point B = (5, 6). Point C = (4, -6). Point D = (3, -5). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "-6" "4") (Point B "-3" "-7") (Point C "0" "7") (Point D "8" "3") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-150/19, 208/19)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 11 x) (* 3 y) 54) 0) (= (+ (* 1 x) (* 2 y) (- 14)) 0) (not (and (= x (- (/ 150 19))) (= y (/ 208 19))))) (not (and ... | 1 | [] | [] | geo-line_intersection-00017 | line_intersection | construction | numeric | Problem: Point A = (-6, 4). Point B = (-3, -7). Point C = (0, 7). Point D = (8, 3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by... | {
"A": [
"-6",
"4"
],
"B": [
"-3",
"-7"
],
"C": [
"0",
"7"
],
"D": [
"8",
"3"
]
} | {
"q0": {
"determinant": "19",
"kind": "intersection",
"outcome": "point",
"point": [
"-150/19",
"208/19"
]
}
} | 20,261,117 | e41d795602cc3ca389a973e69d47d00e2560d4d0169d915323fed549bac07727 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-6, 4). Point B = (-3, -7). Point C = (0, 7). Point D = (8, 3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-2" "7") (Point B "-2" "4") (Point C "-4" "7") (Point D "-1" "-3") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-2, 1/3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 0 y) 2) 0) (= (+ (* 10 x) (* 3 y) 19) 0) (not (and (= x (- 2)) (= y (/ 1 3))))) (not (and (= (+ (* 1 (- 2)) (* 0 (/... | 1 | [] | [] | geo-line_intersection-00018 | line_intersection | construction | numeric | Problem: Point A = (-2, 7). Point B = (-2, 4). Point C = (-4, 7). Point D = (-1, -3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected ... | {
"A": [
"-2",
"7"
],
"B": [
"-2",
"4"
],
"C": [
"-4",
"7"
],
"D": [
"-1",
"-3"
]
} | {
"q0": {
"determinant": "3",
"kind": "intersection",
"outcome": "point",
"point": [
"-2",
"1/3"
]
}
} | 20,261,117 | acf94d53d0f2370521ff95e91a57ab2ac5b0f02feb53adf897f3c5f32a5987f2 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-2, 7). Point B = (-2, 4). Point C = (-4, 7). Point D = (-1, -3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "7" "-2") (Point B "-7" "4") (Point C "7" "7") (Point D "-3/2" "3/2") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-175/128, 203/128)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 7 y) (- 7)) 0) (= (+ (* 11 x) (* (- 17) y) 42) 0) (not (and (= x (- (/ 175 128))) (= y (/ 203 128))))) (n... | 2 | [] | [] | geo-line_intersection-00019 | line_intersection | construction | numeric | Problem: Point A = (7, -2). Point B = (-7, 4). Point C = (7, 7). Point D = (-3/2, 3/2). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exac... | {
"A": [
"7",
"-2"
],
"B": [
"-7",
"4"
],
"C": [
"7",
"7"
],
"D": [
"-3/2",
"3/2"
]
} | {
"q0": {
"determinant": "-128",
"kind": "intersection",
"outcome": "point",
"point": [
"-175/128",
"203/128"
]
}
} | 20,261,117 | 47b88377a2ccea20c8f5fff101b523def7a6c70a3ae75a65b07ae14168475276 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (7, -2). Point B = (-7, 4). Point C = (7, 7). Point D = (-3/2, 3/2). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "-2" "-7/2") (Point B "-1" "3") (Point C "-6" "-2") (Point D "1" "7") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-53/73, 349/73)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 13 x) (* (- 2) y) 19) 0) (= (+ (* 9 x) (* (- 7) y) 40) 0) (not (and (= x (- (/ 53 73))) (= y (/ 349 73))))) (not (an... | 2 | [] | [] | geo-line_intersection-00020 | line_intersection | construction | numeric | Problem: Point A = (-2, -7/2). Point B = (-1, 3). Point C = (-6, -2). Point D = (1, 7). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exac... | {
"A": [
"-2",
"-7/2"
],
"B": [
"-1",
"3"
],
"C": [
"-6",
"-2"
],
"D": [
"1",
"7"
]
} | {
"q0": {
"determinant": "-73",
"kind": "intersection",
"outcome": "point",
"point": [
"-53/73",
"349/73"
]
}
} | 20,261,117 | 3bac00c1331d2d0392c9822a5711f8719989a014bbdc7b08ee8f0b430a238c6b | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-2, -7/2). Point B = (-1, 3). Point C = (-6, -2). Point D = (1, 7). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "-5/4" "7") (Point B "-7" "5") (Point C "5" "5/4") (Point D "-1" "6") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-1229/629, 4249/629)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 8 x) (* (- 23) y) 171) 0) (= (+ (* 19 x) (* 24 y) (- 125)) 0) (not (and (= x (- (/ 1229 629))) (= y (/ 4249 629... | 1 | [] | [] | geo-line_intersection-00021 | line_intersection | construction | numeric | Problem: Point A = (-5/4, 7). Point B = (-7, 5). Point C = (5, 5/4). Point D = (-1, 6). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selecte... | {
"A": [
"-5/4",
"7"
],
"B": [
"-7",
"5"
],
"C": [
"5",
"5/4"
],
"D": [
"-1",
"6"
]
} | {
"q0": {
"determinant": "629",
"kind": "intersection",
"outcome": "point",
"point": [
"-1229/629",
"4249/629"
]
}
} | 20,261,117 | bc7015f84bf3d2ea85493628ac1f8d7f52bbe05063099f1624e998c7c2ed3ca7 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-5/4, 7). Point B = (-7, 5). Point C = (5, 5/4). Point D = (-1, 6). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-1/4" "5") (Point B "-3" "-4") (Point C "-1" "7") (Point D "5" "-2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-1/15, 28/5)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 36 x) (* (- 11) y) 64) 0) (= (+ (* 3 x) (* 2 y) (- 11)) 0) (not (and (= x (- (/ 1 15))) (= y (/ 28 5))))) (not (and (= ... | 1 | [] | [] | geo-line_intersection-00022 | line_intersection | construction | numeric | Problem: Point A = (-1/4, 5). Point B = (-3, -4). Point C = (-1, 7). Point D = (5, -2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selecte... | {
"A": [
"-1/4",
"5"
],
"B": [
"-3",
"-4"
],
"C": [
"-1",
"7"
],
"D": [
"5",
"-2"
]
} | {
"q0": {
"determinant": "105",
"kind": "intersection",
"outcome": "point",
"point": [
"-1/15",
"28/5"
]
}
} | 20,261,117 | b539516fe10b4a9ac38a891ac4e0bb7d3f667a6ad388329382d4be09214b7f18 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1/4, 5). Point B = (-3, -4). Point C = (-1, 7). Point D = (5, -2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "5/4" "2") (Point B "5" "4/3") (Point C "-8" "-2") (Point D "0" "2") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (20/61, 132/61)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 8 x) (* 45 y) (- 100)) 0) (= (+ (* 1 x) (* (- 2) y) 4) 0) (not (and (= x (/ 20 61)) (= y (/ 132 61))))) (not (and (= ... | 2 | [] | [] | geo-line_intersection-00023 | line_intersection | construction | numeric | Problem: Point A = (5/4, 2). Point B = (5, 4/3). Point C = (-8, -2). Point D = (0, 2). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact... | {
"A": [
"5/4",
"2"
],
"B": [
"5",
"4/3"
],
"C": [
"-8",
"-2"
],
"D": [
"0",
"2"
]
} | {
"q0": {
"determinant": "-61",
"kind": "intersection",
"outcome": "point",
"point": [
"20/61",
"132/61"
]
}
} | 20,261,117 | dc87858b8bc6ddc7b4ad0fedf000d1f94e5e1d5b76b5054cc23a646bb8fc0472 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (5/4, 2). Point B = (5, 4/3). Point C = (-8, -2). Point D = (0, 2). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "6" "-3") (Point B "-7" "0") (Point C "-6" "-4") (Point D "6" "-8") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-171/4, 33/4)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 13 y) 21) 0) (= (+ (* 1 x) (* 3 y) 18) 0) (not (and (= x (- (/ 171 4))) (= y (/ 33 4))))) (not (and (= (+ (* 3... | 2 | [] | [] | geo-line_intersection-00024 | line_intersection | construction | numeric | Problem: Point A = (6, -3). Point B = (-7, 0). Point C = (-6, -4). Point D = (6, -8). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact ... | {
"A": [
"6",
"-3"
],
"B": [
"-7",
"0"
],
"C": [
"-6",
"-4"
],
"D": [
"6",
"-8"
]
} | {
"q0": {
"determinant": "-4",
"kind": "intersection",
"outcome": "point",
"point": [
"-171/4",
"33/4"
]
}
} | 20,261,117 | c74117d67c111c4dc2b1a7fe30cb7db36baaed1a0f6eb12ead5ca90c4b3fa58c | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (6, -3). Point B = (-7, 0). Point C = (-6, -4). Point D = (6, -8). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "5" "7") (Point B "3" "8") (Point C "-4" "8") (Point D "-7" "1/4") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-106/37, 809/74)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 2 y) (- 19)) 0) (= (+ (* 31 x) (* (- 12) y) 220) 0) (not (and (= x (- (/ 106 37))) (= y (/ 809 74))))) (not... | 2 | [] | [] | geo-line_intersection-00025 | line_intersection | construction | numeric | Problem: Point A = (5, 7). Point B = (3, 8). Point C = (-4, 8). Point D = (-7, 1/4). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact r... | {
"A": [
"5",
"7"
],
"B": [
"3",
"8"
],
"C": [
"-4",
"8"
],
"D": [
"-7",
"1/4"
]
} | {
"q0": {
"determinant": "-74",
"kind": "intersection",
"outcome": "point",
"point": [
"-106/37",
"809/74"
]
}
} | 20,261,117 | 745ec1a258f882a19ef78881cf520623529192479a9361d4eb0a28b9ab0de574 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (5, 7). Point B = (3, 8). Point C = (-4, 8). Point D = (-7, 1/4). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "4" "-7") (Point B "-2" "-7") (Point C "7" "3") (Point D "-3" "0") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-79/3, -7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 0 x) (* 1 y) 7) 0) (= (+ (* 3 x) (* (- 10) y) 9) 0) (not (and (= x (- (/ 79 3))) (= y (- 7))))) (not (and (= (+ (* 0 (- (... | 1 | [] | [] | geo-line_intersection-00026 | line_intersection | construction | numeric | Problem: Point A = (4, -7). Point B = (-2, -7). Point C = (7, 3). Point D = (-3, 0). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected b... | {
"A": [
"4",
"-7"
],
"B": [
"-2",
"-7"
],
"C": [
"7",
"3"
],
"D": [
"-3",
"0"
]
} | {
"q0": {
"determinant": "-3",
"kind": "intersection",
"outcome": "point",
"point": [
"-79/3",
"-7"
]
}
} | 20,261,117 | 85438ec169dc3b9c9588fbca7af3ac5bd0bacb6fc133cb77d6600cc9992b0522 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (4, -7). Point B = (-2, -7). Point C = (7, 3). Point D = (-3, 0). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "x+3y" "-6") (LineEq m "x-y" "-8") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-15/2, 1/2)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 3 y) 6) 0) (= (+ (* 1 x) (* (- 1) y) 8) 0) (not (and (= x (- (/ 15 2))) (= y (/ 1 2))))) (not (and (= (+ (* 1 (-... | 1 | [] | [] | geo-line_intersection-00027 | line_intersection | construction | numeric | Problem: Line l: x + 3y = -6. Line m: x - y = -8. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear syst... | {} | {
"q0": {
"determinant": "-4",
"kind": "intersection",
"outcome": "point",
"point": [
"-15/2",
"1/2"
]
}
} | 20,261,117 | 233a21a09820e9decb0a578e4f2b85ef69026e953c3c4274b0ee5c3895b0d9c6 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: x + 3y = -6. Line m: x - y = -8. Find the intersection of line l and line m. | null |
(Problem (Point A "-6" "-8/3") (Point B "-4" "-1") (Point C "7" "6") (Point D "9" "23/3") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines are parallel and distinct: no common point",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 5 x) (* (- 6) y) 14) 0) (= (+ (* 5 x) (* (- 6) y) 1) 0)))"
],
"declarations": [
"(declare-... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are parallel: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00028 | line_intersection | construction | numeric | Problem: Point A = (-6, -8/3). Point B = (-4, -1). Point C = (7, 6). Point D = (9, 23/3). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the ex... | {
"A": [
"-6",
"-8/3"
],
"B": [
"-4",
"-1"
],
"C": [
"7",
"6"
],
"D": [
"9",
"23/3"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "parallel"
}
} | 20,261,117 | 3e5aa23c70c0bf48e3ef0ac539f3f80b927131800625d3a18702394ecab0be9c | CERTIFIED | parallel | Z3_SAT_CONVERGENCE | Point A = (-6, -8/3). Point B = (-4, -1). Point C = (7, 6). Point D = (9, 23/3). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "-6" "0") (Point B "-6" "-5") (Point C "2" "-5") (Point D "4/3" "-6") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-6, -17)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 0 y) 6) 0) (= (+ (* 3 x) (* (- 2) y) (- 16)) 0) (not (and (= x (- 6)) (= y (- 17))))) (not (and (= (+ (* 1 (- 6)) (... | 1 | [] | [] | geo-line_intersection-00029 | line_intersection | construction | numeric | Problem: Point A = (-6, 0). Point B = (-6, -5). Point C = (2, -5). Point D = (4/3, -6). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selecte... | {
"A": [
"-6",
"0"
],
"B": [
"-6",
"-5"
],
"C": [
"2",
"-5"
],
"D": [
"4/3",
"-6"
]
} | {
"q0": {
"determinant": "-2",
"kind": "intersection",
"outcome": "point",
"point": [
"-6",
"-17"
]
}
} | 20,261,117 | a631286ed9083393bf704067e1bd3afe480da13b6ae302dca975f9ddd2979e70 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-6, 0). Point B = (-6, -5). Point C = (2, -5). Point D = (4/3, -6). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-5" "-1") (Point B "-1/2" "1") (Point C "-6" "1") (Point D "-2" "5") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-52/5, -17/5)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 4 x) (* (- 9) y) 11) 0) (= (+ (* 1 x) (* (- 1) y) 7) 0) (not (and (= x (- (/ 52 5))) (= y (- (/ 17 5)))))) (not (and (... | 2 | [] | [] | geo-line_intersection-00030 | line_intersection | construction | numeric | Problem: Point A = (-5, -1). Point B = (-1/2, 1). Point C = (-6, 1). Point D = (-2, 5). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exac... | {
"A": [
"-5",
"-1"
],
"B": [
"-1/2",
"1"
],
"C": [
"-6",
"1"
],
"D": [
"-2",
"5"
]
} | {
"q0": {
"determinant": "5",
"kind": "intersection",
"outcome": "point",
"point": [
"-52/5",
"-17/5"
]
}
} | 20,261,117 | d738f6a48672d99802342efc06f8f11c95094f3335bbcfa7569334f8029e742b | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-5, -1). Point B = (-1/2, 1). Point C = (-6, 1). Point D = (-2, 5). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "7/3" "4") (Point B "-3/2" "8") (Point C "-6" "4") (Point D "-49/12" "2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines are parallel and distinct: no common point",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 24 x) (* 23 y) (- 148)) 0) (= (+ (* 24 x) (* 23 y) 52) 0)))"
],
"declarations": [
"(declar... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are parallel: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00031 | line_intersection | construction | numeric | Problem: Point A = (7/3, 4). Point B = (-3/2, 8). Point C = (-6, 4). Point D = (-49/12, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (sel... | {
"A": [
"7/3",
"4"
],
"B": [
"-3/2",
"8"
],
"C": [
"-6",
"4"
],
"D": [
"-49/12",
"2"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "parallel"
}
} | 20,261,117 | bd32e5d49d2b7cd23af65801b351952fc88fbb9db727fe042db62cc1a076642b | CERTIFIED | parallel | Z3_SAT_CONVERGENCE | Point A = (7/3, 4). Point B = (-3/2, 8). Point C = (-6, 4). Point D = (-49/12, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-7/2" "7") (Point B "5" "-1") (Point C "37/4" "-5") (Point D "-31/4" "11") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 16 x) (* 17 y) (- 63)) 0) (not (= (+ (* 16 x) (* 17 y) (- 63)) 0))))"
],
"declarations": [
... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00032 | line_intersection | construction | numeric | Problem: Point A = (-7/2, 7). Point B = (5, -1). Point C = (37/4, -5). Point D = (-31/4, 11). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute th... | {
"A": [
"-7/2",
"7"
],
"B": [
"5",
"-1"
],
"C": [
"37/4",
"-5"
],
"D": [
"-31/4",
"11"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | 914496bf8ca33ae00ba0989867b4c7588ed631f651dabca5aad609dd5d174d70 | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Point A = (-7/2, 7). Point B = (5, -1). Point C = (37/4, -5). Point D = (-31/4, 11). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "8/3" "-8") (Point B "-6" "2") (Point C "8" "1") (Point D "-7" "-7/3") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-485/161, -233/161)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 15 x) (* 13 y) 64) 0) (= (+ (* 2 x) (* (- 9) y) (- 7)) 0) (not (and (= x (- (/ 485 161))) (= y (- (/ 233 161))))... | 2 | [] | [] | geo-line_intersection-00033 | line_intersection | construction | numeric | Problem: Point A = (8/3, -8). Point B = (-6, 2). Point C = (8, 1). Point D = (-7, -7/3). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exa... | {
"A": [
"8/3",
"-8"
],
"B": [
"-6",
"2"
],
"C": [
"8",
"1"
],
"D": [
"-7",
"-7/3"
]
} | {
"q0": {
"determinant": "-161",
"kind": "intersection",
"outcome": "point",
"point": [
"-485/161",
"-233/161"
]
}
} | 20,261,117 | 836f2cd032318b766b406a05182fd694211e4bba72762e9891732ec807a2e680 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (8/3, -8). Point B = (-6, 2). Point C = (8, 1). Point D = (-7, -7/3). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "3x+4y" "24") (LineEq m "9x+5y" "26") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-16/21, 46/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 4 y) (- 24)) 0) (= (+ (* 9 x) (* 5 y) (- 26)) 0) (not (and (= x (- (/ 16 21))) (= y (/ 46 7))))) (not (and (= ... | 1 | [] | [] | geo-line_intersection-00034 | line_intersection | construction | numeric | Problem: Line l: 3x + 4y = 24. Line m: 9x + 5y = 26. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear s... | {} | {
"q0": {
"determinant": "-21",
"kind": "intersection",
"outcome": "point",
"point": [
"-16/21",
"46/7"
]
}
} | 20,261,117 | 8714994a590c2410a6da7739ad0b6a0b672c8e9d4ca8d383751f8c0b5d63a297 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 3x + 4y = 24. Line m: 9x + 5y = 26. Find the intersection of line l and line m. | null |
(Problem (LineEq l "3x+2y" "-8") (LineEq m "-9x+7y" "58") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-172/39, 34/13)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 2 y) 8) 0) (= (+ (* 9 x) (* (- 7) y) 58) 0) (not (and (= x (- (/ 172 39))) (= y (/ 34 13))))) (not (and (= (... | 1 | [] | [] | geo-line_intersection-00035 | line_intersection | construction | numeric | Problem: Line l: 3x + 2y = -8. Line m: -9x + 7y = 58. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear ... | {} | {
"q0": {
"determinant": "-39",
"kind": "intersection",
"outcome": "point",
"point": [
"-172/39",
"34/13"
]
}
} | 20,261,117 | 095897dbe1161a8cce00ee5a26e75c1ed9c85517e824369c5b3590164cc4b860 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 3x + 2y = -8. Line m: -9x + 7y = 58. Find the intersection of line l and line m. | null |
(Problem (Point A "2" "-1") (Point B "3" "2/3") (Point C "1" "-2") (Point D "8" "6") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (25/11, -6/11)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 5 x) (* (- 3) y) (- 13)) 0) (= (+ (* 8 x) (* (- 7) y) (- 22)) 0) (not (and (= x (/ 25 11)) (= y (- (/ 6 11)))))) (not ... | 2 | [] | [] | geo-line_intersection-00036 | line_intersection | construction | numeric | Problem: Point A = (2, -1). Point B = (3, 2/3). Point C = (1, -2). Point D = (8, 6). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact r... | {
"A": [
"2",
"-1"
],
"B": [
"3",
"2/3"
],
"C": [
"1",
"-2"
],
"D": [
"8",
"6"
]
} | {
"q0": {
"determinant": "-11",
"kind": "intersection",
"outcome": "point",
"point": [
"25/11",
"-6/11"
]
}
} | 20,261,117 | 255245d6a85702896e9346f241c4cbe02d46ab260e174d17df842c1029f2c53e | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (2, -1). Point B = (3, 2/3). Point C = (1, -2). Point D = (8, 6). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "x-9y" "21") (LineEq m "x-9y" "21") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 1 x) (* (- 9) y) (- 21)) 0) (not (= (+ (* 1 x) (* (- 9) y) (- 21)) 0))))"
],
"declarations": [... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00037 | line_intersection | construction | numeric | Problem: Line l: x - 9y = 21. Line m: x - 9y = 21. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- The determinant of the 2x2... | {} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | cff9b5226e6535c88ab1b0588ebdd650a2e81d35393087be7b96ba6045d1e2dc | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Line l: x - 9y = 21. Line m: x - 9y = 21. Find the intersection of line l and line m. | null |
(Problem (Point A "1" "-3/4") (Point B "7" "7") (Point C "7" "4") (Point D "2" "-8") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (1291/133, 1396/133)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 31 x) (* (- 24) y) (- 49)) 0) (= (+ (* 12 x) (* (- 5) y) (- 64)) 0) (not (and (= x (/ 1291 133)) (= y (/ 1396 13... | 1 | [] | [] | geo-line_intersection-00038 | line_intersection | construction | numeric | Problem: Point A = (1, -3/4). Point B = (7, 7). Point C = (7, 4). Point D = (2, -8). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected b... | {
"A": [
"1",
"-3/4"
],
"B": [
"7",
"7"
],
"C": [
"7",
"4"
],
"D": [
"2",
"-8"
]
} | {
"q0": {
"determinant": "133",
"kind": "intersection",
"outcome": "point",
"point": [
"1291/133",
"1396/133"
]
}
} | 20,261,117 | 278c3cbcf290a228fb53377e9003df0bdfeca184887e34ce09a129914c098613 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (1, -3/4). Point B = (7, 7). Point C = (7, 4). Point D = (2, -8). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "8/3" "-2") (Point B "8" "6") (Point C "4" "-2") (Point D "-6" "5/4") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (212/73, -120/73)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* (- 2) y) (- 12)) 0) (= (+ (* 13 x) (* 40 y) 28) 0) (not (and (= x (/ 212 73)) (= y (- (/ 120 73)))))) (not ... | 1 | [] | [] | geo-line_intersection-00039 | line_intersection | construction | numeric | Problem: Point A = (8/3, -2). Point B = (8, 6). Point C = (4, -2). Point D = (-6, 5/4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selecte... | {
"A": [
"8/3",
"-2"
],
"B": [
"8",
"6"
],
"C": [
"4",
"-2"
],
"D": [
"-6",
"5/4"
]
} | {
"q0": {
"determinant": "146",
"kind": "intersection",
"outcome": "point",
"point": [
"212/73",
"-120/73"
]
}
} | 20,261,117 | 8c4e291490a135c39654658e7c875fbb752c8facef408c6b4fc8b028ebf0a20f | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (8/3, -2). Point B = (8, 6). Point C = (4, -2). Point D = (-6, 5/4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-1" "6") (Point B "3" "-1") (Point C "4" "3") (Point D "-7/4" "-3") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (499/257, 219/257)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 7 x) (* 4 y) (- 17)) 0) (= (+ (* 24 x) (* (- 23) y) (- 27)) 0) (not (and (= x (/ 499 257)) (= y (/ 219 257))))) (n... | 1 | [] | [] | geo-line_intersection-00040 | line_intersection | construction | numeric | Problem: Point A = (-1, 6). Point B = (3, -1). Point C = (4, 3). Point D = (-7/4, -3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected... | {
"A": [
"-1",
"6"
],
"B": [
"3",
"-1"
],
"C": [
"4",
"3"
],
"D": [
"-7/4",
"-3"
]
} | {
"q0": {
"determinant": "-257",
"kind": "intersection",
"outcome": "point",
"point": [
"499/257",
"219/257"
]
}
} | 20,261,117 | 63ba8cf85e5e7fac88cada102442bd18727e780d9ff6dfca18e366e577ed6229 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1, 6). Point B = (3, -1). Point C = (4, 3). Point D = (-7/4, -3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-3/2" "-6") (Point B "1" "1") (Point C "7" "-7") (Point D "-1" "0") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (37/147, -23/21)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 14 x) (* (- 5) y) (- 9)) 0) (= (+ (* 7 x) (* 8 y) 7) 0) (not (and (= x (/ 37 147)) (= y (- (/ 23 21)))))) (not (and ... | 1 | [] | [] | geo-line_intersection-00041 | line_intersection | construction | numeric | Problem: Point A = (-3/2, -6). Point B = (1, 1). Point C = (7, -7). Point D = (-1, 0). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected... | {
"A": [
"-3/2",
"-6"
],
"B": [
"1",
"1"
],
"C": [
"7",
"-7"
],
"D": [
"-1",
"0"
]
} | {
"q0": {
"determinant": "147",
"kind": "intersection",
"outcome": "point",
"point": [
"37/147",
"-23/21"
]
}
} | 20,261,117 | dd608182d2fb2797938bc3e1d338dd8cb17e25b7f6b1f0f3e309f25e87c798c0 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-3/2, -6). Point B = (1, 1). Point C = (7, -7). Point D = (-1, 0). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "81x-16y" "-93") (LineEq m "x+5y" "-23") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-833/421, -1770/421)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 81 x) (* (- 16) y) 93) 0) (= (+ (* 1 x) (* 5 y) 23) 0) (not (and (= x (- (/ 833 421))) (= y (- (/ 1770 421)))))... | 1 | [] | [] | geo-line_intersection-00042 | line_intersection | construction | numeric | Problem: Line l: 81x - 16y = -93. Line m: x + 5y = -23. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linea... | {} | {
"q0": {
"determinant": "421",
"kind": "intersection",
"outcome": "point",
"point": [
"-833/421",
"-1770/421"
]
}
} | 20,261,117 | 8e229d5f38d21b59d9be9429c92dae628a591d5d1753862be189f823d5704de9 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 81x - 16y = -93. Line m: x + 5y = -23. Find the intersection of line l and line m. | null |
(Problem (Point A "-5" "-6") (Point B "0" "8") (Point C "5" "1") (Point D "4" "-2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (110, 316)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 14 x) (* (- 5) y) 40) 0) (= (+ (* 3 x) (* (- 1) y) (- 14)) 0) (not (and (= x 110) (= y 316)))) (not (and (= (+ (* 14 110) ... | 1 | [] | [] | geo-line_intersection-00043 | line_intersection | construction | numeric | Problem: Point A = (-5, -6). Point B = (0, 8). Point C = (5, 1). Point D = (4, -2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by... | {
"A": [
"-5",
"-6"
],
"B": [
"0",
"8"
],
"C": [
"5",
"1"
],
"D": [
"4",
"-2"
]
} | {
"q0": {
"determinant": "1",
"kind": "intersection",
"outcome": "point",
"point": [
"110",
"316"
]
}
} | 20,261,117 | b1f4b0ff8694c1b7c952282ad56760db39c1ee5200956a962774b05eecb58dde | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-5, -6). Point B = (0, 8). Point C = (5, 1). Point D = (4, -2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "1" "1/2") (Point B "1" "7") (Point C "-5" "-8") (Point D "-8" "1") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (1, -26)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 0 y) (- 1)) 0) (= (+ (* 3 x) (* 1 y) 23) 0) (not (and (= x 1) (= y (- 26))))) (not (and (= (+ (* 1 1) (* 0 (- 26)) (... | 1 | [] | [] | geo-line_intersection-00044 | line_intersection | construction | numeric | Problem: Point A = (1, 1/2). Point B = (1, 7). Point C = (-5, -8). Point D = (-8, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected ... | {
"A": [
"1",
"1/2"
],
"B": [
"1",
"7"
],
"C": [
"-5",
"-8"
],
"D": [
"-8",
"1"
]
} | {
"q0": {
"determinant": "1",
"kind": "intersection",
"outcome": "point",
"point": [
"1",
"-26"
]
}
} | 20,261,117 | f06a63bd4942cb6505bf4d13dcf7945de1c222af8ce192f5d74615318ec83821 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (1, 1/2). Point B = (1, 7). Point C = (-5, -8). Point D = (-8, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "x-3y" "2") (LineEq m "-x+y" "-4") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (5, 1)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* (- 3) y) (- 2)) 0) (= (+ (* 1 x) (* (- 1) y) (- 4)) 0) (not (and (= x 5) (= y 1)))) (not (and (= (+ (* 1 5) (* (- 3) 1... | 1 | [] | [] | geo-line_intersection-00045 | line_intersection | construction | numeric | Problem: Line l: x - 3y = 2. Line m: -x + y = -4. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear syst... | {} | {
"q0": {
"determinant": "2",
"kind": "intersection",
"outcome": "point",
"point": [
"5",
"1"
]
}
} | 20,261,117 | acc15cd12750270c04ef2d3eee358f5be35134c630092f0796d692b7f57f9cfb | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: x - 3y = 2. Line m: -x + y = -4. Find the intersection of line l and line m. | null |
(Problem (LineEq l "3x-y" "17") (LineEq m "-2x-3y" "18") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (3, -8)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* (- 1) y) (- 17)) 0) (= (+ (* 2 x) (* 3 y) 18) 0) (not (and (= x 3) (= y (- 8))))) (not (and (= (+ (* 3 3) (* (- 1) (-... | 1 | [] | [] | geo-line_intersection-00046 | line_intersection | construction | numeric | Problem: Line l: 3x - y = 17. Line m: -2x - 3y = 18. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear s... | {} | {
"q0": {
"determinant": "11",
"kind": "intersection",
"outcome": "point",
"point": [
"3",
"-8"
]
}
} | 20,261,117 | 362e06407be9535d405bbb5fdaaace8a47bcba0b39bf5f9262a5c0d039457445 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 3x - y = 17. Line m: -2x - 3y = 18. Find the intersection of line l and line m. | null |
(Problem (Point A "6" "2") (Point B "-2" "-5") (Point C "0" "2/3") (Point D "-5" "5") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (470/209, -268/209)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 7 x) (* (- 8) y) (- 26)) 0) (= (+ (* 13 x) (* 15 y) (- 10)) 0) (not (and (= x (/ 470 209)) (= y (- (/ 268 209))))... | 2 | [] | [] | geo-line_intersection-00047 | line_intersection | construction | numeric | Problem: Point A = (6, 2). Point B = (-2, -5). Point C = (0, 2/3). Point D = (-5, 5). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact ... | {
"A": [
"6",
"2"
],
"B": [
"-2",
"-5"
],
"C": [
"0",
"2/3"
],
"D": [
"-5",
"5"
]
} | {
"q0": {
"determinant": "209",
"kind": "intersection",
"outcome": "point",
"point": [
"470/209",
"-268/209"
]
}
} | 20,261,117 | 4dd30a60554e0c8e2b4e5f48ab67e130b4a8d7b08530858cae2bb4c561c9091f | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (6, 2). Point B = (-2, -5). Point C = (0, 2/3). Point D = (-5, 5). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "3" "2") (Point B "7" "-3") (Point C "-8" "-3") (Point D "-8" "-8") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-8, 63/4)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 5 x) (* 4 y) (- 23)) 0) (= (+ (* 1 x) (* 0 y) 8) 0) (not (and (= x (- 8)) (= y (/ 63 4))))) (not (and (= (+ (* 5 (- 8)) (*... | 2 | [] | [] | geo-line_intersection-00048 | line_intersection | construction | numeric | Problem: Point A = (3, 2). Point B = (7, -3). Point C = (-8, -3). Point D = (-8, -8). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact ... | {
"A": [
"3",
"2"
],
"B": [
"7",
"-3"
],
"C": [
"-8",
"-3"
],
"D": [
"-8",
"-8"
]
} | {
"q0": {
"determinant": "-4",
"kind": "intersection",
"outcome": "point",
"point": [
"-8",
"63/4"
]
}
} | 20,261,117 | 4e7519d7090e2eaa615e1817f53ab4ba7c136399b15add4299cfc718e3e158ac | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (3, 2). Point B = (7, -3). Point C = (-8, -3). Point D = (-8, -8). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "5x+28y" "-26") (LineEq m "-5x-28y" "-85") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines are parallel and distinct: no common point",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 5 x) (* 28 y) 26) 0) (= (+ (* 5 x) (* 28 y) (- 85)) 0)))"
],
"declarations": [
"(declare-c... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are parallel: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00049 | line_intersection | construction | numeric | Problem: Line l: 5x + 28y = -26. Line m: -5x - 28y = -85. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- The determinant of ... | {} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "parallel"
}
} | 20,261,117 | ee608f7aaaf95cdafbd4da6cde0869933f19da7eaee2aa29afa61b5be8fcffbf | CERTIFIED | parallel | Z3_SAT_CONVERGENCE | Line l: 5x + 28y = -26. Line m: -5x - 28y = -85. Find the intersection of line l and line m. | null |
(Problem (LineEq l "-6x+5y" "24") (LineEq m "-y" "2") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-17/3, -2)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 6 x) (* (- 5) y) 24) 0) (= (+ (* 0 x) (* 1 y) 2) 0) (not (and (= x (- (/ 17 3))) (= y (- 2))))) (not (and (= (+ (* 6 (- (... | 1 | [] | [] | geo-line_intersection-00050 | line_intersection | construction | numeric | Problem: Line l: -6x + 5y = 24. Line m: -y = 2. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear system... | {} | {
"q0": {
"determinant": "6",
"kind": "intersection",
"outcome": "point",
"point": [
"-17/3",
"-2"
]
}
} | 20,261,117 | b0ff0bd2bfd2d3eaeb074e12bcc229fc961b6432348778dc547cd7d80e3f8fe2 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -6x + 5y = 24. Line m: -y = 2. Find the intersection of line l and line m. | null |
(Problem (Point A "6" "3/4") (Point B "2" "2") (Point C "7" "-5") (Point D "-5" "-5/4") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines are parallel and distinct: no common point",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 5 x) (* 16 y) (- 42)) 0) (= (+ (* 5 x) (* 16 y) 45) 0)))"
],
"declarations": [
"(declare-c... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are parallel: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00051 | line_intersection | construction | numeric | Problem: Point A = (6, 3/4). Point B = (2, 2). Point C = (7, -5). Point D = (-5, -5/4). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exac... | {
"A": [
"6",
"3/4"
],
"B": [
"2",
"2"
],
"C": [
"7",
"-5"
],
"D": [
"-5",
"-5/4"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "parallel"
}
} | 20,261,117 | 841b711e9f228e2b676d250ee3eaf94cc96d1708041111eb3aec633929df2049 | CERTIFIED | parallel | Z3_SAT_CONVERGENCE | Point A = (6, 3/4). Point B = (2, 2). Point C = (7, -5). Point D = (-5, -5/4). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "7/2" "-3") (Point B "5" "-6") (Point C "-4" "-1") (Point D "-5" "-5/2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-2/7, 32/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 2 x) (* 1 y) (- 4)) 0) (= (+ (* 3 x) (* (- 2) y) 10) 0) (not (and (= x (- (/ 2 7))) (= y (/ 32 7))))) (not (and (= (+ (*... | 1 | [] | [] | geo-line_intersection-00052 | line_intersection | construction | numeric | Problem: Point A = (7/2, -3). Point B = (5, -6). Point C = (-4, -1). Point D = (-5, -5/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (sele... | {
"A": [
"7/2",
"-3"
],
"B": [
"5",
"-6"
],
"C": [
"-4",
"-1"
],
"D": [
"-5",
"-5/2"
]
} | {
"q0": {
"determinant": "-7",
"kind": "intersection",
"outcome": "point",
"point": [
"-2/7",
"32/7"
]
}
} | 20,261,117 | bef60a19c02416cc3cbb76e6ce91b3e45c0c9070a6db8c460f0cc6500561db14 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (7/2, -3). Point B = (5, -6). Point C = (-4, -1). Point D = (-5, -5/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "4" "8") (Point B "-3" "8") (Point C "-6" "3") (Point D "-2" "8") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-2, 8)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 0 x) (* 1 y) (- 8)) 0) (= (+ (* 5 x) (* (- 4) y) 42) 0) (not (and (= x (- 2)) (= y 8)))) (not (and (= (+ (* 0 (- 2)) (* 1 8) ... | 1 | [] | [] | geo-line_intersection-00053 | line_intersection | construction | numeric | Problem: Point A = (4, 8). Point B = (-3, 8). Point C = (-6, 3). Point D = (-2, 8). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by... | {
"A": [
"4",
"8"
],
"B": [
"-3",
"8"
],
"C": [
"-6",
"3"
],
"D": [
"-2",
"8"
]
} | {
"q0": {
"determinant": "-5",
"kind": "intersection",
"outcome": "point",
"point": [
"-2",
"8"
]
}
} | 20,261,117 | f5983a8d64df0707dd080afdff0ba1ee744948d7938e808a868ba7cad19b6d0a | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (4, 8). Point B = (-3, 8). Point C = (-6, 3). Point D = (-2, 8). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "0" "6") (Point B "2" "-8") (Point C "-1" "1") (Point D "6" "-3/2") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (25/31, 11/31)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 7 x) (* 1 y) (- 6)) 0) (= (+ (* 5 x) (* 14 y) (- 9)) 0) (not (and (= x (/ 25 31)) (= y (/ 11 31))))) (not (and (= (+ (... | 2 | [] | [] | geo-line_intersection-00054 | line_intersection | construction | numeric | Problem: Point A = (0, 6). Point B = (2, -8). Point C = (-1, 1). Point D = (6, -3/2). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact ... | {
"A": [
"0",
"6"
],
"B": [
"2",
"-8"
],
"C": [
"-1",
"1"
],
"D": [
"6",
"-3/2"
]
} | {
"q0": {
"determinant": "93",
"kind": "intersection",
"outcome": "point",
"point": [
"25/31",
"11/31"
]
}
} | 20,261,117 | f0a06fa2899b29975daa1d13a6f9cb556b1916c18c4379a683a41457a9040b4d | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (0, 6). Point B = (2, -8). Point C = (-1, 1). Point D = (6, -3/2). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "-1" "-3") (Point B "5/4" "-2") (Point C "8" "8") (Point D "4" "6") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-118, -55)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 4 x) (* (- 9) y) (- 23)) 0) (= (+ (* 1 x) (* (- 2) y) 8) 0) (not (and (= x (- 118)) (= y (- 55))))) (not (and (= (+ (* 4 ... | 1 | [] | [] | geo-line_intersection-00055 | line_intersection | construction | numeric | Problem: Point A = (-1, -3). Point B = (5/4, -2). Point C = (8, 8). Point D = (4, 6). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected ... | {
"A": [
"-1",
"-3"
],
"B": [
"5/4",
"-2"
],
"C": [
"8",
"8"
],
"D": [
"4",
"6"
]
} | {
"q0": {
"determinant": "1",
"kind": "intersection",
"outcome": "point",
"point": [
"-118",
"-55"
]
}
} | 20,261,117 | 80babd825e2a35a23214ffbad907f16843030ebb43357492831df2b988dff3f0 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1, -3). Point B = (5/4, -2). Point C = (8, 8). Point D = (4, 6). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-8" "1") (Point B "-3" "2") (Point C "-1" "5") (Point D "5" "2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (19/7, 22/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* (- 5) y) 13) 0) (= (+ (* 1 x) (* 2 y) (- 9)) 0) (not (and (= x (/ 19 7)) (= y (/ 22 7))))) (not (and (= (+ (* 1 ... | 1 | [] | [] | geo-line_intersection-00056 | line_intersection | construction | numeric | Problem: Point A = (-8, 1). Point B = (-3, 2). Point C = (-1, 5). Point D = (5, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by... | {
"A": [
"-8",
"1"
],
"B": [
"-3",
"2"
],
"C": [
"-1",
"5"
],
"D": [
"5",
"2"
]
} | {
"q0": {
"determinant": "7",
"kind": "intersection",
"outcome": "point",
"point": [
"19/7",
"22/7"
]
}
} | 20,261,117 | 143b0291a0d509ffa12671c0959fe432c0b8122e897a610eaf5d306fdf428e67 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-8, 1). Point B = (-3, 2). Point C = (-1, 5). Point D = (5, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "3x+10y" "64") (LineEq m "-x+5y" "-17") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (98/5, 13/25)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 10 y) (- 64)) 0) (= (+ (* 1 x) (* (- 5) y) (- 17)) 0) (not (and (= x (/ 98 5)) (= y (/ 13 25))))) (not (and (= ... | 1 | [] | [] | geo-line_intersection-00057 | line_intersection | construction | numeric | Problem: Line l: 3x + 10y = 64. Line m: -x + 5y = -17. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear... | {} | {
"q0": {
"determinant": "-25",
"kind": "intersection",
"outcome": "point",
"point": [
"98/5",
"13/25"
]
}
} | 20,261,117 | 004c28a790832e231eef157272e54a20e884449dfeda0a1d301e6761e179dcbc | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 3x + 10y = 64. Line m: -x + 5y = -17. Find the intersection of line l and line m. | null |
(Problem (LineEq l "-3x+4y" "29") (LineEq m "7x+13y" "-22") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-465/67, 137/67)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* (- 4) y) 29) 0) (= (+ (* 7 x) (* 13 y) 22) 0) (not (and (= x (- (/ 465 67))) (= y (/ 137 67))))) (not (and ... | 1 | [] | [] | geo-line_intersection-00058 | line_intersection | construction | numeric | Problem: Line l: -3x + 4y = 29. Line m: 7x + 13y = -22. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linea... | {} | {
"q0": {
"determinant": "67",
"kind": "intersection",
"outcome": "point",
"point": [
"-465/67",
"137/67"
]
}
} | 20,261,117 | 78b1f27a96ec72d977ad15c58e306074132ae27138b03c299a7875ab497084e2 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -3x + 4y = 29. Line m: 7x + 13y = -22. Find the intersection of line l and line m. | null |
(Problem (LineEq l "-6x-y" "41") (LineEq m "6x+y" "-41") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 6 x) (* 1 y) 41) 0) (not (= (+ (* 6 x) (* 1 y) 41) 0))))"
],
"declarations": [
"(decla... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00059 | line_intersection | construction | numeric | Problem: Line l: -6x - y = 41. Line m: 6x + y = -41. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- The determinant of the 2... | {} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | b6e59dd1b664178d5a1210a58336d01ab5f1909bdb5ec7d59fe9aeffaf6f23da | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Line l: -6x - y = 41. Line m: 6x + y = -41. Find the intersection of line l and line m. | null |
(Problem (LineEq l "-9x+4y" "42") (LineEq m "-x+2y" "-15") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-72/7, -177/14)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 9 x) (* (- 4) y) 42) 0) (= (+ (* 1 x) (* (- 2) y) (- 15)) 0) (not (and (= x (- (/ 72 7))) (= y (- (/ 177 14)))))) (n... | 1 | [] | [] | geo-line_intersection-00060 | line_intersection | construction | numeric | Problem: Line l: -9x + 4y = 42. Line m: -x + 2y = -15. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear... | {} | {
"q0": {
"determinant": "-14",
"kind": "intersection",
"outcome": "point",
"point": [
"-72/7",
"-177/14"
]
}
} | 20,261,117 | 04acfca32b81470981dc5b7d7fc9a01098e30b212d94276f3ee7dc42c74d5c34 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -9x + 4y = 42. Line m: -x + 2y = -15. Find the intersection of line l and line m. | null |
(Problem (Point A "0" "-3") (Point B "-1" "1") (Point C "-3" "5") (Point D "8" "-6") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-5/3, 11/3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 4 x) (* 1 y) 3) 0) (= (+ (* 1 x) (* 1 y) (- 2)) 0) (not (and (= x (- (/ 5 3))) (= y (/ 11 3))))) (not (and (= (+ (* 4 (-... | 2 | [] | [] | geo-line_intersection-00061 | line_intersection | construction | numeric | Problem: Point A = (0, -3). Point B = (-1, 1). Point C = (-3, 5). Point D = (8, -6). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact r... | {
"A": [
"0",
"-3"
],
"B": [
"-1",
"1"
],
"C": [
"-3",
"5"
],
"D": [
"8",
"-6"
]
} | {
"q0": {
"determinant": "3",
"kind": "intersection",
"outcome": "point",
"point": [
"-5/3",
"11/3"
]
}
} | 20,261,117 | 5d86805c720fdd3c4b5c76f6dba5abd1bd4b3fafeeb4b98907e246fe12c2c077 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (0, -3). Point B = (-1, 1). Point C = (-3, 5). Point D = (8, -6). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "2" "-3") (Point B "1" "-1/4") (Point C "7/2" "-5") (Point D "0" "5") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (70/3, -185/3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 11 x) (* 4 y) (- 10)) 0) (= (+ (* 20 x) (* 7 y) (- 35)) 0) (not (and (= x (/ 70 3)) (= y (- (/ 185 3)))))) (not (and (... | 1 | [] | [] | geo-line_intersection-00062 | line_intersection | construction | numeric | Problem: Point A = (2, -3). Point B = (1, -1/4). Point C = (7/2, -5). Point D = (0, 5). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selecte... | {
"A": [
"2",
"-3"
],
"B": [
"1",
"-1/4"
],
"C": [
"7/2",
"-5"
],
"D": [
"0",
"5"
]
} | {
"q0": {
"determinant": "-3",
"kind": "intersection",
"outcome": "point",
"point": [
"70/3",
"-185/3"
]
}
} | 20,261,117 | 95def47ee83b36280f1301d8272db856cfefddbff165145490c002e9e2275932 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (2, -3). Point B = (1, -1/4). Point C = (7/2, -5). Point D = (0, 5). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "-2x+3y" "-8") (LineEq m "x+7y" "-1") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (53/17, -10/17)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 2 x) (* (- 3) y) (- 8)) 0) (= (+ (* 1 x) (* 7 y) 1) 0) (not (and (= x (/ 53 17)) (= y (- (/ 10 17)))))) (not (and (= ... | 1 | [] | [] | geo-line_intersection-00063 | line_intersection | construction | numeric | Problem: Line l: -2x + 3y = -8. Line m: x + 7y = -1. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear s... | {} | {
"q0": {
"determinant": "17",
"kind": "intersection",
"outcome": "point",
"point": [
"53/17",
"-10/17"
]
}
} | 20,261,117 | 353c0efddcbf97c60a9e991c7916cd56eb4b81b87d271f45207f42c8c268f36a | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -2x + 3y = -8. Line m: x + 7y = -1. Find the intersection of line l and line m. | null |
(Problem (Point A "-8" "8") (Point B "-5/4" "3") (Point C "0" "-2") (Point D "81/4" "-17") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines are parallel and distinct: no common point",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 20 x) (* 27 y) (- 56)) 0) (= (+ (* 20 x) (* 27 y) 54) 0)))"
],
"declarations": [
"(declare... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are parallel: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00064 | line_intersection | construction | numeric | Problem: Point A = (-8, 8). Point B = (-5/4, 3). Point C = (0, -2). Point D = (81/4, -17). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (sele... | {
"A": [
"-8",
"8"
],
"B": [
"-5/4",
"3"
],
"C": [
"0",
"-2"
],
"D": [
"81/4",
"-17"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "parallel"
}
} | 20,261,117 | a5bc0b3ea1f2566e378716023a72a25b4f15b6cbb3b393a0bd285780e110cbb5 | CERTIFIED | parallel | Z3_SAT_CONVERGENCE | Point A = (-8, 8). Point B = (-5/4, 3). Point C = (0, -2). Point D = (81/4, -17). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "3" "-4") (Point B "7" "-2") (Point C "6" "4") (Point D "10" "6") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines are parallel and distinct: no common point",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 1 x) (* (- 2) y) (- 11)) 0) (= (+ (* 1 x) (* (- 2) y) 2) 0)))"
],
"declarations": [
"(decl... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are parallel: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00065 | line_intersection | construction | numeric | Problem: Point A = (3, -4). Point B = (7, -2). Point C = (6, 4). Point D = (10, 6). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact re... | {
"A": [
"3",
"-4"
],
"B": [
"7",
"-2"
],
"C": [
"6",
"4"
],
"D": [
"10",
"6"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "parallel"
}
} | 20,261,117 | 1412263ce18dc8d3ce04ebc5c4c2853f777b488bef0fcd7b85b03f658035dae3 | CERTIFIED | parallel | Z3_SAT_CONVERGENCE | Point A = (3, -4). Point B = (7, -2). Point C = (6, 4). Point D = (10, 6). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "15x+23y" "52") (LineEq m "6x-5y" "-47") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-821/213, 339/71)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 15 x) (* 23 y) (- 52)) 0) (= (+ (* 6 x) (* (- 5) y) 47) 0) (not (and (= x (- (/ 821 213))) (= y (/ 339 71))))) (no... | 1 | [] | [] | geo-line_intersection-00066 | line_intersection | construction | numeric | Problem: Line l: 15x + 23y = 52. Line m: 6x - 5y = -47. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linea... | {} | {
"q0": {
"determinant": "-213",
"kind": "intersection",
"outcome": "point",
"point": [
"-821/213",
"339/71"
]
}
} | 20,261,117 | 2e9556dc320dbd10a54edd5abaf8ded4e8cd389d81470e8d7dfdb4efeebbcd86 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: 15x + 23y = 52. Line m: 6x - 5y = -47. Find the intersection of line l and line m. | null |
(Problem (LineEq l "6x-y" "26") (LineEq m "6x-y" "26") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 6 x) (* (- 1) y) (- 26)) 0) (not (= (+ (* 6 x) (* (- 1) y) (- 26)) 0))))"
],
"declarations": [... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00067 | line_intersection | construction | numeric | Problem: Line l: 6x - y = 26. Line m: 6x - y = 26. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- The determinant of the 2x2... | {} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | db256d5101f47f8a2d1fc9f1962febe23aa897d17eeed0201f2934dc878aa8f6 | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Line l: 6x - y = 26. Line m: 6x - y = 26. Find the intersection of line l and line m. | null |
(Problem (Point A "-1" "1") (Point B "3/2" "0") (Point C "-3" "3/4") (Point D "1" "3/4") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-3/8, 3/4)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 2 x) (* 5 y) (- 3)) 0) (= (+ (* 0 x) (* 4 y) (- 3)) 0) (not (and (= x (- (/ 3 8))) (= y (/ 3 4))))) (not (and (= (+ (* 2 ... | 2 | [] | [] | geo-line_intersection-00068 | line_intersection | construction | numeric | Problem: Point A = (-1, 1). Point B = (3/2, 0). Point C = (-3, 3/4). Point D = (1, 3/4). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exa... | {
"A": [
"-1",
"1"
],
"B": [
"3/2",
"0"
],
"C": [
"-3",
"3/4"
],
"D": [
"1",
"3/4"
]
} | {
"q0": {
"determinant": "8",
"kind": "intersection",
"outcome": "point",
"point": [
"-3/8",
"3/4"
]
}
} | 20,261,117 | 2c052b7fff5f14375a94c9b024a926100a6ccb88ffbe8e184fd8492839274763 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1, 1). Point B = (3/2, 0). Point C = (-3, 3/4). Point D = (1, 3/4). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "-6x+34y" "-59") (LineEq m "-4x-3y" "-6") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (381/154, -100/77)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 6 x) (* (- 34) y) (- 59)) 0) (= (+ (* 4 x) (* 3 y) (- 6)) 0) (not (and (= x (/ 381 154)) (= y (- (/ 100 77)))))) (... | 1 | [] | [] | geo-line_intersection-00069 | line_intersection | construction | numeric | Problem: Line l: -6x + 34y = -59. Line m: -4x - 3y = -6. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 line... | {} | {
"q0": {
"determinant": "154",
"kind": "intersection",
"outcome": "point",
"point": [
"381/154",
"-100/77"
]
}
} | 20,261,117 | 5feb81f87ee4a5abd5fd8c2a06cdeca8b29fdbd10ffdab37f74bfb4f61bd0a47 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -6x + 34y = -59. Line m: -4x - 3y = -6. Find the intersection of line l and line m. | null |
(Problem (Point A "-1" "-2") (Point B "4" "-2") (Point C "-5" "2") (Point D "-7/4" "8") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-43/6, -2)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 0 x) (* 1 y) 2) 0) (= (+ (* 24 x) (* (- 13) y) 146) 0) (not (and (= x (- (/ 43 6))) (= y (- 2))))) (not (and (= (+ (* 0 (... | 2 | [] | [] | geo-line_intersection-00070 | line_intersection | construction | numeric | Problem: Point A = (-1, -2). Point B = (4, -2). Point C = (-5, 2). Point D = (-7/4, 8). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exac... | {
"A": [
"-1",
"-2"
],
"B": [
"4",
"-2"
],
"C": [
"-5",
"2"
],
"D": [
"-7/4",
"8"
]
} | {
"q0": {
"determinant": "-24",
"kind": "intersection",
"outcome": "point",
"point": [
"-43/6",
"-2"
]
}
} | 20,261,117 | 92c860dc3ac6e801044721af1297d6f4b7730542b88ee1c72b82382db23b7dbb | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1, -2). Point B = (4, -2). Point C = (-5, 2). Point D = (-7/4, 8). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "3" "-1") (Point B "1" "0") (Point C "6" "-4") (Point D "0" "-8") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (51/7, -22/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 2 y) (- 1)) 0) (= (+ (* 2 x) (* (- 3) y) (- 24)) 0) (not (and (= x (/ 51 7)) (= y (- (/ 22 7)))))) (not (and (=... | 2 | [] | [] | geo-line_intersection-00071 | line_intersection | construction | numeric | Problem: Point A = (3, -1). Point B = (1, 0). Point C = (6, -4). Point D = (0, -8). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact re... | {
"A": [
"3",
"-1"
],
"B": [
"1",
"0"
],
"C": [
"6",
"-4"
],
"D": [
"0",
"-8"
]
} | {
"q0": {
"determinant": "-7",
"kind": "intersection",
"outcome": "point",
"point": [
"51/7",
"-22/7"
]
}
} | 20,261,117 | 9c02bdd8ce272b8892fd15a814064d680647096494eb5c61cadb8e584b6d621b | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (3, -1). Point B = (1, 0). Point C = (6, -4). Point D = (0, -8). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "4" "-4") (Point B "-2" "7/2") (Point C "-2" "3") (Point D "0" "-2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-12/5, 4)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 5 x) (* 4 y) (- 4)) 0) (= (+ (* 5 x) (* 2 y) 4) 0) (not (and (= x (- (/ 12 5))) (= y 4)))) (not (and (= (+ (* 5 (- (/ 12 5... | 1 | [] | [] | geo-line_intersection-00072 | line_intersection | construction | numeric | Problem: Point A = (4, -4). Point B = (-2, 7/2). Point C = (-2, 3). Point D = (0, -2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected... | {
"A": [
"4",
"-4"
],
"B": [
"-2",
"7/2"
],
"C": [
"-2",
"3"
],
"D": [
"0",
"-2"
]
} | {
"q0": {
"determinant": "-10",
"kind": "intersection",
"outcome": "point",
"point": [
"-12/5",
"4"
]
}
} | 20,261,117 | 1ad9bc11635900752ce05e80a487ccb5f4644b2947e7166ae8f31539cfac7a3f | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (4, -4). Point B = (-2, 7/2). Point C = (-2, 3). Point D = (0, -2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-8" "0") (Point B "2" "5") (Point C "7/2" "-4") (Point D "-5" "2") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-188/41, 70/41)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* (- 2) y) 8) 0) (= (+ (* 12 x) (* 17 y) 26) 0) (not (and (= x (- (/ 188 41))) (= y (/ 70 41))))) (not (and (=... | 2 | [] | [] | geo-line_intersection-00073 | line_intersection | construction | numeric | Problem: Point A = (-8, 0). Point B = (2, 5). Point C = (7/2, -4). Point D = (-5, 2). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact ... | {
"A": [
"-8",
"0"
],
"B": [
"2",
"5"
],
"C": [
"7/2",
"-4"
],
"D": [
"-5",
"2"
]
} | {
"q0": {
"determinant": "41",
"kind": "intersection",
"outcome": "point",
"point": [
"-188/41",
"70/41"
]
}
} | 20,261,117 | 7a20b0456d42321f960d577fac6b2361886a3ba97c815f7045d5f3306e64061c | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-8, 0). Point B = (2, 5). Point C = (7/2, -4). Point D = (-5, 2). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "-y" "0") (LineEq m "3x-4y" "-8") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-8/3, 0)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 0 x) (* 1 y) 0) 0) (= (+ (* 3 x) (* (- 4) y) 8) 0) (not (and (= x (- (/ 8 3))) (= y 0)))) (not (and (= (+ (* 0 (- (/ 8 3)))... | 1 | [] | [] | geo-line_intersection-00074 | line_intersection | construction | numeric | Problem: Line l: -y = 0. Line m: 3x - 4y = -8. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear system ... | {} | {
"q0": {
"determinant": "-3",
"kind": "intersection",
"outcome": "point",
"point": [
"-8/3",
"0"
]
}
} | 20,261,117 | 966201aad9be8c7cd72ae247ec84cc1d279050884d3c6bf9748133f6bf8dbd05 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -y = 0. Line m: 3x - 4y = -8. Find the intersection of line l and line m. | null |
(Problem (Point A "-7" "0") (Point B "-3" "6") (Point C "-5" "1") (Point D "-5/2" "-4") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-39/7, 15/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* (- 2) y) 21) 0) (= (+ (* 2 x) (* 1 y) 9) 0) (not (and (= x (- (/ 39 7))) (= y (/ 15 7))))) (not (and (= (+ (* 3... | 2 | [] | [] | geo-line_intersection-00075 | line_intersection | construction | numeric | Problem: Point A = (-7, 0). Point B = (-3, 6). Point C = (-5, 1). Point D = (-5/2, -4). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exac... | {
"A": [
"-7",
"0"
],
"B": [
"-3",
"6"
],
"C": [
"-5",
"1"
],
"D": [
"-5/2",
"-4"
]
} | {
"q0": {
"determinant": "7",
"kind": "intersection",
"outcome": "point",
"point": [
"-39/7",
"15/7"
]
}
} | 20,261,117 | 70f049c0a8b836cccb4b531fc8a9ce82cf06541626819c8d2b15b1e5924460e1 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-7, 0). Point B = (-3, 6). Point C = (-5, 1). Point D = (-5/2, -4). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "2" "1") (Point B "1" "4") (Point C "-4" "-5") (Point D "6" "-5") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (4, -5)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* 1 y) (- 7)) 0) (= (+ (* 0 x) (* 1 y) 5) 0) (not (and (= x 4) (= y (- 5))))) (not (and (= (+ (* 3 4) (* 1 (- 5)) (- 7)... | 1 | [] | [] | geo-line_intersection-00076 | line_intersection | construction | numeric | Problem: Point A = (2, 1). Point B = (1, 4). Point C = (-4, -5). Point D = (6, -5). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by... | {
"A": [
"2",
"1"
],
"B": [
"1",
"4"
],
"C": [
"-4",
"-5"
],
"D": [
"6",
"-5"
]
} | {
"q0": {
"determinant": "3",
"kind": "intersection",
"outcome": "point",
"point": [
"4",
"-5"
]
}
} | 20,261,117 | 9eda6bf69500437f3a688fb693252755f6bb4ca75331e447f474f02b5f720942 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (2, 1). Point B = (1, 4). Point C = (-4, -5). Point D = (6, -5). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "0" "5") (Point B "-6" "3") (Point C "-6" "1") (Point D "-3" "1") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-12, 1)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* (- 3) y) 15) 0) (= (+ (* 0 x) (* 1 y) (- 1)) 0) (not (and (= x (- 12)) (= y 1)))) (not (and (= (+ (* 1 (- 12)) (* (-... | 1 | [] | [] | geo-line_intersection-00077 | line_intersection | construction | numeric | Problem: Point A = (0, 5). Point B = (-6, 3). Point C = (-6, 1). Point D = (-3, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by... | {
"A": [
"0",
"5"
],
"B": [
"-6",
"3"
],
"C": [
"-6",
"1"
],
"D": [
"-3",
"1"
]
} | {
"q0": {
"determinant": "1",
"kind": "intersection",
"outcome": "point",
"point": [
"-12",
"1"
]
}
} | 20,261,117 | 9650143048f8af3f32210ba5fdf9fc2b614f75d45cf06e076d5ea50236c79b7e | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (0, 5). Point B = (-6, 3). Point C = (-6, 1). Point D = (-3, 1). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "1" "1") (Point B "-4" "-1") (Point C "8" "-2") (Point D "7/4" "2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (63/26, 102/65)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 2 x) (* (- 5) y) 3) 0) (= (+ (* 16 x) (* 25 y) (- 78)) 0) (not (and (= x (/ 63 26)) (= y (/ 102 65))))) (not (and (= ... | 1 | [] | [] | geo-line_intersection-00078 | line_intersection | construction | numeric | Problem: Point A = (1, 1). Point B = (-4, -1). Point C = (8, -2). Point D = (7/4, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected ... | {
"A": [
"1",
"1"
],
"B": [
"-4",
"-1"
],
"C": [
"8",
"-2"
],
"D": [
"7/4",
"2"
]
} | {
"q0": {
"determinant": "130",
"kind": "intersection",
"outcome": "point",
"point": [
"63/26",
"102/65"
]
}
} | 20,261,117 | e4ee766196b6ee59218d35e786bec3d983fff95fc328b78abb0d44edaff16ad0 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (1, 1). Point B = (-4, -1). Point C = (8, -2). Point D = (7/4, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (LineEq l "3x-4y" "-1") (LineEq m "-3x+4y" "1") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 3 x) (* (- 4) y) 1) 0) (not (= (+ (* 3 x) (* (- 4) y) 1) 0))))"
],
"declarations": [
"... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00079 | line_intersection | construction | numeric | Problem: Line l: 3x - 4y = -1. Line m: -3x + 4y = 1. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- The determinant of the 2... | {} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | 7308f20724dc623e8166f2467b2ac8e542be9630a0309a681ca965dc1a21df20 | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Line l: 3x - 4y = -1. Line m: -3x + 4y = 1. Find the intersection of line l and line m. | null |
(Problem (Point A "-1" "0") (Point B "1" "5/2") (Point C "-8/3" "-4") (Point D "3" "-4") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-21/5, -4)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 5 x) (* (- 4) y) 5) 0) (= (+ (* 0 x) (* 1 y) 4) 0) (not (and (= x (- (/ 21 5))) (= y (- 4))))) (not (and (= (+ (* 5 (- (/... | 1 | [] | [] | geo-line_intersection-00080 | line_intersection | construction | numeric | Problem: Point A = (-1, 0). Point B = (1, 5/2). Point C = (-8/3, -4). Point D = (3, -4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (select... | {
"A": [
"-1",
"0"
],
"B": [
"1",
"5/2"
],
"C": [
"-8/3",
"-4"
],
"D": [
"3",
"-4"
]
} | {
"q0": {
"determinant": "5",
"kind": "intersection",
"outcome": "point",
"point": [
"-21/5",
"-4"
]
}
} | 20,261,117 | 66c578321c0aadd284778a7e884a5b898b160324629adfbf0b11eefc45a4f968 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1, 0). Point B = (1, 5/2). Point C = (-8/3, -4). Point D = (3, -4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "7" "3") (Point B "-6" "-3") (Point C "-6" "3") (Point D "-5/4" "3") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (7, 3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 6 x) (* (- 13) y) (- 3)) 0) (= (+ (* 0 x) (* 1 y) (- 3)) 0) (not (and (= x 7) (= y 3)))) (not (and (= (+ (* 6 7) (* (- 13) 3) ... | 1 | [] | [] | geo-line_intersection-00081 | line_intersection | construction | numeric | Problem: Point A = (7, 3). Point B = (-6, -3). Point C = (-6, 3). Point D = (-5/4, 3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected... | {
"A": [
"7",
"3"
],
"B": [
"-6",
"-3"
],
"C": [
"-6",
"3"
],
"D": [
"-5/4",
"3"
]
} | {
"q0": {
"determinant": "6",
"kind": "intersection",
"outcome": "point",
"point": [
"7",
"3"
]
}
} | 20,261,117 | 435a8c07939e34446c156425e984393a34854513564aba9be60471ea54bdd47e | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (7, 3). Point B = (-6, -3). Point C = (-6, 3). Point D = (-5/4, 3). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-7" "7") (Point B "7" "6") (Point C "-1" "5") (Point D "-1" "-4/3") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-1, 46/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 14 y) (- 91)) 0) (= (+ (* 1 x) (* 0 y) 1) 0) (not (and (= x (- 1)) (= y (/ 46 7))))) (not (and (= (+ (* 1 (- 1)) (... | 2 | [] | [] | geo-line_intersection-00082 | line_intersection | construction | numeric | Problem: Point A = (-7, 7). Point B = (7, 6). Point C = (-1, 5). Point D = (-1, -4/3). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact... | {
"A": [
"-7",
"7"
],
"B": [
"7",
"6"
],
"C": [
"-1",
"5"
],
"D": [
"-1",
"-4/3"
]
} | {
"q0": {
"determinant": "-14",
"kind": "intersection",
"outcome": "point",
"point": [
"-1",
"46/7"
]
}
} | 20,261,117 | fa0a6fd8e9fad3711c27ac357c714ad213aa9e4fb785cdd96c8628b5785118a3 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-7, 7). Point B = (7, 6). Point C = (-1, 5). Point D = (-1, -4/3). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "-4x+5y" "-32") (LineEq m "-3x+8y" "0") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (256/17, 96/17)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 4 x) (* (- 5) y) (- 32)) 0) (= (+ (* 3 x) (* (- 8) y) 0) 0) (not (and (= x (/ 256 17)) (= y (/ 96 17))))) (not (and (... | 1 | [] | [] | geo-line_intersection-00083 | line_intersection | construction | numeric | Problem: Line l: -4x + 5y = -32. Line m: -3x + 8y = 0. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear... | {} | {
"q0": {
"determinant": "-17",
"kind": "intersection",
"outcome": "point",
"point": [
"256/17",
"96/17"
]
}
} | 20,261,117 | da262098f471d7172bb0c50a2ff3be2b0f0fba8e596378f9e1be66e76b3eb55d | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -4x + 5y = -32. Line m: -3x + 8y = 0. Find the intersection of line l and line m. | null |
(Problem (LineEq l "-x-8y" "-10") (LineEq m "27x-4y" "-70") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-26/11, 17/11)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 1 x) (* 8 y) (- 10)) 0) (= (+ (* 27 x) (* (- 4) y) 70) 0) (not (and (= x (- (/ 26 11))) (= y (/ 17 11))))) (not (and ... | 1 | [] | [] | geo-line_intersection-00084 | line_intersection | construction | numeric | Problem: Line l: -x - 8y = -10. Line m: 27x - 4y = -70. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linea... | {} | {
"q0": {
"determinant": "-220",
"kind": "intersection",
"outcome": "point",
"point": [
"-26/11",
"17/11"
]
}
} | 20,261,117 | 1f1d5e23913db7644644ddb290146fc96d8bd7fb8e399bb252fb59fce1f4ab18 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -x - 8y = -10. Line m: 27x - 4y = -70. Find the intersection of line l and line m. | null |
(Problem (Point A "3" "1/3") (Point B "-5/4" "-3") (Point C "-5/4" "-3") (Point D "-5" "4") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-5/4, -3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 40 x) (* (- 51) y) (- 103)) 0) (= (+ (* 28 x) (* 15 y) 80) 0) (not (and (= x (- (/ 5 4))) (= y (- 3))))) (not (and (= (+ (... | 1 | [] | [] | geo-line_intersection-00085 | line_intersection | construction | numeric | Problem: Point A = (3, 1/3). Point B = (-5/4, -3). Point C = (-5/4, -3). Point D = (-5, 4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (sel... | {
"A": [
"3",
"1/3"
],
"B": [
"-5/4",
"-3"
],
"C": [
"-5/4",
"-3"
],
"D": [
"-5",
"4"
]
} | {
"q0": {
"determinant": "2028",
"kind": "intersection",
"outcome": "point",
"point": [
"-5/4",
"-3"
]
}
} | 20,261,117 | 95837279d93128b2e6b47c15d2cabccf2c4d2124e9766c64696905355bb7b80c | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (3, 1/3). Point B = (-5/4, -3). Point C = (-5/4, -3). Point D = (-5, 4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-1" "-7") (Point B "2" "2") (Point C "-2" "-5/3") (Point D "5" "4") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (83/46, 65/46)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 3 x) (* (- 1) y) (- 4)) 0) (= (+ (* 17 x) (* (- 21) y) (- 1)) 0) (not (and (= x (/ 83 46)) (= y (/ 65 46))))) (not (an... | 1 | [] | [] | geo-line_intersection-00086 | line_intersection | construction | numeric | Problem: Point A = (-1, -7). Point B = (2, 2). Point C = (-2, -5/3). Point D = (5, 4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selected... | {
"A": [
"-1",
"-7"
],
"B": [
"2",
"2"
],
"C": [
"-2",
"-5/3"
],
"D": [
"5",
"4"
]
} | {
"q0": {
"determinant": "-46",
"kind": "intersection",
"outcome": "point",
"point": [
"83/46",
"65/46"
]
}
} | 20,261,117 | 9e4fdb3e0d776e1249cc9715743958517783f8e51e81325b14345164da7c47a1 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1, -7). Point B = (2, 2). Point C = (-2, -5/3). Point D = (5, 4). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "-1/4" "1") (Point B "-2" "-5") (Point C "-2" "1/3") (Point D "3" "3") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-3/19, 25/19)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 24 x) (* (- 7) y) 13) 0) (= (+ (* 8 x) (* (- 15) y) 21) 0) (not (and (= x (- (/ 3 19))) (= y (/ 25 19))))) (not (and (... | 2 | [] | [] | geo-line_intersection-00087 | line_intersection | construction | numeric | Problem: Point A = (-1/4, 1). Point B = (-2, -5). Point C = (-2, 1/3). Point D = (3, 3). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exa... | {
"A": [
"-1/4",
"1"
],
"B": [
"-2",
"-5"
],
"C": [
"-2",
"1/3"
],
"D": [
"3",
"3"
]
} | {
"q0": {
"determinant": "-304",
"kind": "intersection",
"outcome": "point",
"point": [
"-3/19",
"25/19"
]
}
} | 20,261,117 | 7bf99e075d20183fb51abc0318f5f1b2776051bcaf01b22eb76d5b00b0d4e2c5 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (-1/4, 1). Point B = (-2, -5). Point C = (-2, 1/3). Point D = (3, 3). Find the intersection of line A-B and line C-D. | null |
(Problem (Point A "6" "-8") (Point B "5/2" "-3") (Point C "59/4" "-41/2") (Point D "-1" "2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines coincide: every point of one lies on the other",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (and (= (+ (* 10 x) (* 7 y) (- 4)) 0) (not (= (+ (* 10 x) (* 7 y) (- 4)) 0))))"
],
"declarations": [
... | 3 | [
{
"code": "DEGENERACY_CONFIRMED",
"message": "lines are coincident: no unique intersection",
"severity": "info",
"where": "q0"
}
] | [] | geo-line_intersection-00088 | line_intersection | construction | numeric | Problem: Point A = (6, -8). Point B = (5/2, -3). Point C = (59/4, -41/2). Point D = (-1, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (se... | {
"A": [
"6",
"-8"
],
"B": [
"5/2",
"-3"
],
"C": [
"59/4",
"-41/2"
],
"D": [
"-1",
"2"
]
} | {
"q0": {
"determinant": "0",
"kind": "intersection",
"outcome": "coincident"
}
} | 20,261,117 | 5edde22c291555b5b0df1556670d8af6176c5d168171cbd2f4abf9ce52d5903b | CERTIFIED | coincident | Z3_SAT_CONVERGENCE | Point A = (6, -8). Point B = (5/2, -3). Point C = (59/4, -41/2). Point D = (-1, 2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
(Problem (Point A "1" "-1") (Point B "-4" "3") (Point C "-1" "-6") (Point D "-7" "-1") (Find (Intersection (LineVia A B) (LineVia C D)))) | [
{
"claim": "the lines meet exactly at (-199, 159)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 4 x) (* 5 y) 1) 0) (= (+ (* 5 x) (* 6 y) 41) 0) (not (and (= x (- 199)) (= y 159)))) (not (and (= (+ (* 4 (- 199)) (* 5 1... | 2 | [] | [] | geo-line_intersection-00089 | line_intersection | construction | numeric | Problem: Point A = (1, -1). Point B = (-4, 3). Point C = (-1, -6). Point D = (-7, -1). Find the intersection of line A-B and line C-D.
Step 1. The text was parsed into an abstract syntax tree of 5 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact... | {
"A": [
"1",
"-1"
],
"B": [
"-4",
"3"
],
"C": [
"-1",
"-6"
],
"D": [
"-7",
"-1"
]
} | {
"q0": {
"determinant": "-1",
"kind": "intersection",
"outcome": "point",
"point": [
"-199",
"159"
]
}
} | 20,261,117 | 3007f8e914e0d11ae5b24135cdbcfd937d77b823a9578f7e8a2aac8e3bd979c5 | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (1, -1). Point B = (-4, 3). Point C = (-1, -6). Point D = (-7, -1). Find the intersection of line A-B and line C-D. | null |
(Problem (LineEq l "-8x-3y" "64") (LineEq m "-x" "4") (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (-4, -32/3)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 8 x) (* 3 y) 64) 0) (= (+ (* 1 x) (* 0 y) 4) 0) (not (and (= x (- 4)) (= y (- (/ 32 3)))))) (not (and (= (+ (* 8 (- 4)) (... | 1 | [] | [] | geo-line_intersection-00090 | line_intersection | construction | numeric | Problem: Line l: -8x - 3y = 64. Line m: -x = 4. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 3 statements; the problem is numeric.
Step 2. The deterministic kernels (selected by Rete pattern matching) compute the exact results:
- Solving the 2x2 linear system... | {} | {
"q0": {
"determinant": "-3",
"kind": "intersection",
"outcome": "point",
"point": [
"-4",
"-32/3"
]
}
} | 20,261,117 | 841cd8a448de1f45fd4a5d5bd4f5aaf25032e8719b226e49b4684082b8311d4b | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Line l: -8x - 3y = 64. Line m: -x = 4. Find the intersection of line l and line m. | null |
(Problem (Point A "0" "-7") (Point B "-6" "3") (Point C "-3" "1") (Point D "-1" "-7/2") (LineThrough l A B) (LineThrough m C D) (Find (Intersection (LineRef l) (LineRef m)))) | [
{
"claim": "the lines meet exactly at (15/7, -74/7)",
"expected": "unsat",
"id": "q0",
"kind": "intersection",
"smt": {
"assertions": [
"(assert (or (and (= (+ (* 5 x) (* 3 y) 21) 0) (= (+ (* 9 x) (* 4 y) 23) 0) (not (and (= x (/ 15 7)) (= y (- (/ 74 7)))))) (not (and (= (+ (* 5 (/... | 1 | [] | [] | geo-line_intersection-00091 | line_intersection | construction | numeric | Problem: Point A = (0, -7). Point B = (-6, 3). Point C = (-3, 1). Point D = (-1, -7/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m.
Step 1. The text was parsed into an abstract syntax tree of 7 statements; the problem is numeric.
Step 2. The deterministic kernels (selecte... | {
"A": [
"0",
"-7"
],
"B": [
"-6",
"3"
],
"C": [
"-3",
"1"
],
"D": [
"-1",
"-7/2"
]
} | {
"q0": {
"determinant": "-7",
"kind": "intersection",
"outcome": "point",
"point": [
"15/7",
"-74/7"
]
}
} | 20,261,117 | 2221b68c39d194e6069fb6f22b6bb3ede7a2a62f00304cd501ab7195263e2e7f | CERTIFIED | generic | Z3_SAT_CONVERGENCE | Point A = (0, -7). Point B = (-6, 3). Point C = (-3, 1). Point D = (-1, -7/2). Line l through A and B. Line m through C and D. Find the intersection of line l and line m. | null |
- 1. Layout
- 2. Topology: blackboard with seven agents
- 3. Controlled language
- 4. The six kernels (
kernels/) - 5. Proof layer and what "complete" means here
- 6. Dataset
- 7. Closing audit
- Attestation at the moment of publication
- How to load the corpus
- What the corpus is for
- Limits, stated as they are
- Rights
- Citation
LingoLOGOS geometry topology and dataset
This dataset is the geometry track of LingoLOGOS, published as the folder that implements the technical specification "Multi-Agent Topology and Geometric Dataset": the seven-agent topology with its six exact Euclidean kernels, the proof layer (the Tarski reduction, Z3, Groebner bases and Wu's method), the corpus generator, the independent validator and the pytest closing audit, together with the corpus they produced. The code depends only on the Python standard library, z3-solver and pytest, and imports nothing from the rest of the project.
The sources and the data are the same objects: every record in the corpus can be regenerated from the recorded seed and checked again with the validator shipped here, so nothing on this page has to be taken on trust.
1. Layout
geometry/
__init__.py package marker: the folder is imported as geometry
kernels/ six exact Euclidean kernels (rational and quadratic-surd arithmetic)
line_intersection.py circumcircle.py tangents.py
triangle_centers.py power_of_point.py affine.py common.py
algebra/ sparse polynomials over Q, Groebner bases, Wu's method
logic/ SMT-LIB 2 / Z3 interface, reduction to Tarski's language
language.py controlled English -> abstract syntax tree (S-expressions)
model.py AST -> polynomial model (hypotheses, nondegeneracy, goals)
rete.py Rete network (alpha/beta memories, join nodes, agenda)
solver.py kernels driven by Rete productions
certify.py Z3 certificates for kernel results
agents/ blackboard + the seven agents + master
topology/geometry_topology.json topology in the format of an orchestrator configuration file
tools/ generate_dataset.py, validate_dataset.py, publish_dataset.py
data/ geometry_corpus.jsonl, geometry_corpus_stats.json
tests/ pytest suite (the closing audit)
2. Topology: blackboard with seven agents
| agent | role | task |
|---|---|---|
agente_parser_nlp |
Proponent | controlled English text -> abstract syntax tree |
agente_algebra_analyst |
Proponent | polynomial relations, implicit and parametric equations of the entities |
agente_kernel_solver |
Proponent | runs the deterministic kernels selected by Rete pattern matching |
agente_critic_omega |
Opponent | degeneracies, zero divisions, existence violations, counterexamples |
agente_arbitro_logico |
Validator | Z3 SMT-LIB 2 verification, Groebner/Wu fallback |
agente_sintesi_narrativa |
Proponent | step-by-step natural language explanation |
agente_orchestrazione_master |
Coordinator | turn cycle, task queue, termination |
Agents never call each other. They read and write a typed BoardState and exchange
JSON envelopes (sender, recipient, turn, volatileState, payload with
naturalLanguage, abstractSyntaxTree, smtConstraints) through the Blackboard,
which enforces the routing matrix of topology/geometry_topology.json and applies the
SMT gate: every message that carries SMT constraints is re-checked with Z3 and rejected
if its declared z3Status differs from the computed one.
Turn plan (asynchronous within a turn, deterministic overall):
- parse
- algebraic analysis and, for numeric problems, kernel solving (concurrently)
- critic
- arbiter
- narrative synthesis
Termination: Z3_SAT_CONVERGENCE when every obligation is discharged (each kernel
certificate is unsat in its body with a sat premise part, and each proof is
unsat with its hypotheses witnessed realizable), UNSAT_BREAKER when a
counterexample, an objection or a refutation appears, plus PARSE_ERROR,
MODEL_ERROR and MAX_TURNS. An obligation that is unsat only because its
premises cannot happen is a finding, not a discharge.
from geometry.agents import solve # add datasets/ to sys.path
res = solve("""Point A = (0, 0). Point B = (u1, 0). Point C = (u2, u3).
Assume u1 != 0 and u3 != 0.
Let G be the centroid of triangle A, B, C.
Let H be the orthocenter of triangle A, B, C.
Let O be the circumcenter of triangle A, B, C.
Prove that G, H and O are collinear.""")
res.status # "CERTIFIED"
res.goals[0]["routes"] # z3 unsat, Groebner proved, Wu proved
print(res.narrative)
3. Controlled language
A problem is a list of sentences ending with a full stop. Point names start with an upper case letter; lines, circles and transformations with a lower case letter. Coordinates are rational expressions; identifiers in coordinates are free parameters.
Point A = (0, 0). Point B = (u1, 0).
Line l through A and B. Line m: 2x + 3y = 6.
Circle c with center O and radius squared 9. Circle c with center O and radius 3.
Circle c through A, B and C.
Rotation r by (3/5, 4/5) about O. Translation t by (2, -1). Scaling s by (2, 3).
Reflection f across line A-B. Transformation u is r then t.
Let M be the midpoint of A and B. Let G be the centroid of triangle A, B, C.
Let H be the orthocenter of triangle A, B, C. Let O be the circumcenter of triangle A, B, C.
Let X be the intersection of line l and line A-B.
Assume A, B and C are not collinear. Assume A and B are distinct.
Assume u1 != 0 and u3 != 0. Assume u2*(u2 - u1) + u3^2 = 0.
Find the intersection of line l and line m. Find the circumcircle of A, B and C.
Find the tangents from P to circle c. Find the orthocenter and centroid of triangle A, B, C.
Find the power of P with respect to circle c.
Find the secant products from P to circle c along (1, 0) and (1, 1).
Find the image of P under t.
Prove that A, B and C are collinear. Prove that B lies between A and C.
Prove that line A-B is perpendicular to line C-D. (also: parallel to)
Prove that segment A-B is congruent to segment C-D.
Prove that P lies on the circle with center O through A.
Prove that M is the midpoint of A and B. Prove that angle A-B-C is a right angle.
4. The six kernels (kernels/)
All kernels use fractions.Fraction; floats are rejected. Irrational values live in
one quadratic extension (Surd, a + b*sqrt(m)) with exact sign and ordering.
- Line-line intersection: exact Cramer solution of the 2x2 system, with the
parallelandcoincidentoutcomes. - Circle through three points: solves the linear system for
x^2+y^2+Dx+Ey+F=0with the matrix of the monomials (x, y, 1) evaluated at the points, a generalized Vandermonde matrix whose determinant is twice the signed area; collinear points are reported as degenerate. - Tangents from a point: contact points, tangent lines and direction vectors are exact in Q(sqrt(m)); angles are also returned as floats.
- Orthocenter and centroid (plus circumcenter): altitudes and medians, with the Euler relation G = (H + 2 O) / 3 verified exactly.
- Power of a point: |PC|^2 - r^2, exact secant roots, secant-secant and tangent-secant relations. A direction whose line misses the circle raises, a direction that is tangent yields the double root of the tangency point, and a zero direction is refused rather than treated as a line.
- Affine maps: homogeneous 3x3 matrices (translation, rotation about a point with rational cos/sin, scaling, reflection), composition, inverse, rigidity test.
5. Proof layer and what "complete" means here
- Reduction to Tarski's language (
logic/tarski.py). Every predicate is defined by a first-order formula over Tarski's primitives betweennessBand congruenceCong, and has a polynomial reading in the Cartesian plane over the reals (a model of Tarski's axioms).audit_definitions()proves with Z3 that each definition and its coordinate reading are equivalent (every witness forces the reading, and the reading provides an explicit Skolem witness). - Z3 decides the resulting problems over the real closed field (QF_NRA, a
decision procedure). A theorem is proved when hypotheses + nondegeneracy +
negated goal is
unsat; the hypotheses are also shown to be satisfiable so the statement is not vacuous. Asatanswer yields a counterexample. - Algebraic fallback / double certification (
algebra/). Radical membership by Buchberger's algorithm with the Rabinowitsch variable (a finite decision procedure for the complex statement "conclusion vanishes wherever the hypotheses hold and the nondegeneracy polynomials do not") and Wu's characteristic-set method with an exact check that the user assumptions imply Wu's initials. - Kernel results are certified by SMT problems that state the geometric
definition and the negated claim, including uniqueness (
certify.py). - Every obligation carries the premises it needs. A goal and a kernel
certificate are split into a premise part (the configuration exists, the
nondegeneracy conditions hold) and a body (the negation of the claim). Both are
re-checked by the arbiter and by the corpus validator: an
unsatbody is a certificate only when the premise part issat; otherwise the verdict isVACUOUSand the findingVACUOUS_CERTIFICATEorUNWITNESSED_PREMISESis reported. This matters for the cases where the encoding, not the geometry, makes the premises impossible: a secant direction that is tangent, a degenerate triangle, an algebraic premise system with no common zero.system_is_consistentinalgebra/groebner.pyand thevacuousflag on the Wu and radical-membership results expose the same trap on the algebraic side, and noPROVEDverdict is issued without a witness that the premises can happen.
Honest limits: the algebraic route works over C, so it can fail on statements that
hold only over R (they are then proved by Z3 alone) and it can call a premise system
realizable when it has only non-real zeros (x^2 + 1 = 0 is realizable for
Buchberger and not for Z3); goals with inequalities (Between) have no algebraic
route; Wu's method does not prove distinctness
conclusions; Z3 may time out on very hard instances, in which case the verdict is
INCONCLUSIVE rather than guessed. "100%" refers to the closing audit shipped in this dataset: every kernel test, every certificate and every corpus record passes there, and the corpus validator re-derives each verdict independently.
6. Dataset
data/geometry_corpus.jsonl has 618 records, one JSON object per line, LF line
endings: 100 samples for each of the six kernels (generic cases plus parallel and
coincident lines, collinear points, points inside/on/outside circles, secants that
miss the circle, compositions of maps) and 18 curated theorems (15 proved, 3
deliberately false and refuted). 615 records end CERTIFIED, 3 end REFUTED.
Each record holds the text, the AST, the exact results, the SMT obligations with
their Z3 status, the Tarski form and routes of the goals, the critic findings, the
narrative and a sha256 seal.
A record has exactly these eighteen fields:
| field | content |
|---|---|
id, seed |
geo-<kernel>-<nnnnn> and the seed that produced the sample |
kind, kernel, tag, difficulty |
construction or theorem; one of the six kernel names or theorem; the case (generic, parallel, coincident, collinear, inside, on, outside, missing, euler, false_..., a map name); an integer 1 to 3 |
mode |
numeric (exact coordinates) or symbolic (free parameters) |
text, ast |
the problem in controlled English and its S-expression AST |
points, results |
exact rational and quadratic-surd values keyed by point name, and the kernel output per query key (q0, q1, ...) |
certificates |
one SMT obligation per query: id, kind, claim, expected, status and smt with declarations, assertions, z3Status, and for 489 of them also hypotheses and hypothesesStatus |
goals |
one entry per Prove that sentence: predicate, args, assumptions, existence_conditions, consistency, goal, tarski, smt, routes (z3, groebner, wu), status, premise, counterexample |
findings, narrative |
the critic objections (code, severity, detail) and the step-by-step explanation |
status, termination |
CERTIFIED or REFUTED; why the session stopped (Z3_SAT_CONVERGENCE, UNSAT_BREAKER, PARSE_ERROR, MODEL_ERROR, MAX_TURNS) |
sha256 |
seal over the canonical JSON of the other fields |
Totals in the shipped file: 552 certificates, 489 of them with a premise part (all
sat); 90 goals, all with witnessed premises, 87 PROVED and 3 REFUTED; 9
power-of-point samples where one of the two requested directions misses the circle
(tag missing, the kernel raises and the certificate is the claim that the line
misses).
Reading a record:
python3 -c "import json; rows=[json.loads(l) for l in open('data/geometry_corpus.jsonl', encoding='ascii')]; thm=next(r for r in rows if r['tag']=='euler_line'); g=thm['goals'][0]; print(thm['id'], thm['status'], thm['text'][-58:]); print('goal', g['status'], '| premises', g['premise'], '| z3', g['smt']['z3Status'], '| hypotheses', g['smt']['hypothesesStatus']); print('tarski', g['tarski']); print('routes', sorted(g['routes']), '| groebner proved', g['routes']['groebner']['proved'])"
geo-theorem-00001 CERTIFIED of triangle A, B, C. Prove that G, H and O are collinear.
goal PROVED | premises witnessed | z3 unsat | hypotheses sat
tarski B(G, H, O) | B(H, O, G) | B(O, G, H)
routes ['groebner', 'wu', 'z3'] | groebner proved True
Every obligation in a record states both of its halves. A certificate carries
smt.assertions (the negated claim on top of the configuration), smt.hypotheses
(the premises, absent when the claim is a statement of non-existence such as a
missing secant or three collinear points) and smt.hypothesesStatus, which is
sat wherever premises are stated. A goal carries smt.assertions,
smt.hypotheses, smt.hypothesesStatus and a premise label: witnessed when the
premises were shown realizable, vacuous when they were shown impossible,
unknown when neither decision procedure judged them. PROVED appears only next to
witnessed.
python3 tools/generate_dataset.py --per-kernel 100 --seed 20261117
python3 tools/validate_dataset.py # full: re-solves every record
python3 tools/validate_dataset.py --fast # seal, parse and Z3 re-check
Publication is a tool of this folder too: publish_dataset.py --plan builds the card you are reading from the folder README, refuses to upload unless the full validator and the closing audit pass, takes the token only from an environment variable, and uploads the folder as it stands so that the code and the data travel together. The card
attests to the digest and the counts of the file being uploaded, computed at that
moment, so the page cannot drift away from the data.
State of the published copy: this folder, byte for byte, is what the hub serves as
tailot/lingologos-geometry, published on 2026-11-18 from seed 20261117 with corpus
sha256 dd322b1ce332f454d8e4045cb13f945575324e7479cb32d3c94c4656370be60b. That digest
is the fast check that a working copy of this folder still matches the snapshot the hub
holds; publish_dataset.py --plan recomputes it, validates and audits, and says what it
would upload without touching the network.
The published copy is a working checkout of its own. In a clone of the dataset there
is no parent folder holding the package, so tests/conftest.py registers this folder
under the name geometry from its own __init__.py, and the checks that name the
repository layout notice that they are in a clone. publish_dataset.py runs the
closing audit twice, once here and once inside the copy it is about to upload, and the
card quotes both runs: the second is the one a clone of the dataset reproduces, and the
publication stops if it fails.
Generation is deterministic in the seed (the same seed and the same code give byte
identical files, which test_shipped_corpus_is_reproducible_from_its_seed checks by
rebuilding all 618 records); the generator aborts if any sample does not reach its
expected verdict and refuses to write outside geometry/. The shipped file
was written with seed 20261117.
What the seal does and does not prove: the sha256 field is unkeyed and covers the
canonical JSON of the other fields, so it detects corruption and accidental edits,
not a deliberate forgery - anyone who edits a record can recompute the digest. That
is why the independent validator does not trust the stored obligations: it re-solves
each text with the kernels, re-checks every stored SMT problem with Z3, re-derives
the certificates and goal obligations from the text and reports the first field where
the stored obligation and the regenerated one differ (smt.assertions, premise and
so on). It also rejects a record whose premise part is not sat and a goal marked
PROVED without witnessed premises.
7. Closing audit
pytest -v tests/
The attestation section below quotes the run and the environment used when this dataset was published, and two tests re-derive the corpus and re-check it from this folder, so the quoted run is not taken on trust. The suite covers:
- the kernels, including random exact property tests, and the guard that a line equation of degree above one is rejected instead of being solved as a curve;
- the algebra: Buchberger criterion, radical membership, Wu, and the cases where the
premise system has no common zero, which are reported
vacuousand never counted as proofs (system_is_consistent, thevacuousflag,covers_assumptions); - the Rete network: equivalence with exhaustive matching over all 120 insertion orders of a fact base that activates every production, plus random fact bases over several orders, counting activations as a multiset so a duplicated firing cannot hide;
- the Tarski audit, and a falsifiability control: a deliberately wrong
Betweendefinition is injected into the definitions table and the audit must catch it; - the language, its AST round trip and its rejections;
- the Z3 certificates of all fifteen fixture queries, each with a tamper control: a
wrong answer makes the body
sat, and the premise part is checkedsatfor the nine certificates that state premises and empty for the six claims of non-existence. A secant certificate quantifies over the direction of the line, so it cannot be satisfied by picking one accidental intersection, and a tangent direction is certified as a double intersection rather than as a missing one; - the seven-agent sessions: routing, the SMT gate, determinism, counterexamples, the
algebraic fallback, the turn budget, and a session whose hypotheses are impossible
ending
VACUOUSrather thanCERTIFIED; - the generator and the validator, with corruption controls for unsealed edits,
resealed edits, a weakened certificate, a whole obligation replaced by a trivially
unsat one, a vacuous premise part, a goal relabelled
PROVEDand a forgedpremiselabel; - the corpus: determinism of the generator from the seed, the full independent validation of the shipped file, and the record schema with its premise halves;
- publication: the published unit is this folder, the card refuses to be half
translated (a checkout sentence that no longer matches stops the build), the
attestation quotes the digest and the counts of the file being uploaded, the token
comes only from the environment and is never printed, a dry run changes no byte on
disk, and the folder copied as it would be uploaded - card in place of this README -
is a checkout in which the suite itself runs; there the eight tests that build a
card out of the folder README step aside, because in that copy
README.mdalready is the card; - integrity: an audit hook that is installed for the whole session, records what a
full session and a corpus generation write, and refuses any write under
data/while the suite runs, so the corpus on disk is the corpus the suite judges; the negative control of that refusal is part of the test; - the specification layout, the six kernels, the ASCII and English conventions, and the absence of any dependency on the core packages.
Attestation at the moment of publication
Written by tools/publish_dataset.py from the files being uploaded, at 2026-11-18 15:14 UTC.
data/geometry_corpus.jsonl: 618 records, 1783340 bytes, sha256dd322b1ce332f454d8e4045cb13f945575324e7479cb32d3c94c4656370be60b, 0 CRLF endings (the schema requires none).- composition: {"CERTIFIED": 615, "REFUTED": 3} by status; {"affine": 100, "circumcircle": 100, "line_intersection": 100, "power_of_point": 100, "tangents": 100, "theorem": 18, "triangle_centers": 100} by kernel; goals {"PROVED": 87, "REFUTED": 3}; 552 certificates, 489 of them with a premise part and all 489 premise parts
sat; 90 goals, 90 with premises witnessed realizable. - the independent validator ran in full mode over the uploaded file: 618 of 618 records with no complaint.
- the closing audit: 178 passed in 45.33s. The same suite was then run again inside the copy that is being uploaded, which is the layout a clone of this dataset has: 170 passed, 8 skipped in 22.96s. The tests that build a card out of the folder README skip there, because in that copy the README already is that card, so there is nothing left to rewrite.
- environment used for the run: Python 3.14.5 on Windows-11-10.0.26300-SP0, z3-solver 5.3.3.
Regenerating with the recorded seed reproduces the corpus byte for byte; test_shipped_corpus_is_reproducible_from_its_seed and test_the_shipped_corpus_passes_the_full_independent_validation assert exactly that, so the two statements above are checked, not promised.
How to load the corpus
With datasets:
from datasets import load_dataset
corpus = load_dataset("tailot/lingologos-geometry", split="train")
Plain Python, no extra dependency (values keep their exact shape: a fraction is a
"409/65" string, a quadratic surd is {"a": ..., "b": ..., "m": ...}):
import json
path = "data/geometry_corpus.jsonl" # a plain 1.8 MB blob in a clone
with open(path, encoding="ascii") as handle:
for line in handle:
record = json.loads(line)
if record["status"] == "REFUTED":
print(record["id"], record["tag"], record["findings"][0]["code"])
What the corpus is for
Every record pairs a machine-checkable obligation with the verdict of three
different decision procedures, so it supports work on certified neuro-symbolic
pipelines, on the cost of redundant proof routes, and on negative data (the three
deliberately false theorems, with the witness that refutes them). The narrative
field gives a step-by-step account of one session, usable for training or
evaluating explanation quality; the findings field gives the critic's objections
in a fixed vocabulary.
Limits, stated as they are
- The certificate is the authority. The Groebner and Wu routes read the
hypotheses over the complex numbers, so an algebraic verdict alone is not a
proof in the real plane:
x^2 + 1 = 0is an algebraically consistent premise with no real witness, and such a session is reported as vacuous, never as proved. covers_assumptionsin the Wu route is a syntactic cover check, not a completeness result for Tarski-style side conditions.- The unkeyed sha256 seal detects corruption, not forgery. The independent validator is what re-derives the obligations from the text and compares them.
- Three records are false on purpose and carry a
REFUTEDstatus and a concrete counterexample; a model trained on this corpus should not be scored on them as if they were theorems. - The numeric route refuses a line equation of total degree greater than one rather than silently treating a quadratic as a line.
Rights
This repository carries no LICENSE file, so this dataset asserts no license of its
own and the metadata says other for exactly that reason; ask the owner of the
tailot account for the terms of reuse. The geometry track is an original
contribution of the LingoLOGOS project and its mathematical content is classical
Euclidean geometry. The corpus contains no human-subject data and no third-party
text: every problem statement is generated from the controlled language described
above.
Citation
@misc{lingologos_geometry,
title = {LingoLOGOS Geometry: a certified multi-agent Euclidean corpus},
author = {LingoLOGOS project},
year = {2026},
howpublished = {\url{https://huggingface.co/datasets/tailot/lingologos-geometry}},
note = {includes the topology, kernels, proof layer, validator and test suite}
}
- Downloads last month
- -