%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO193+3 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n032.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sat Jul 16 04:59:48 EDT 2022 % Result : Theorem 0.12s 0.29s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : GEO193+3 : TPTP v8.1.0. Released v4.0.0. % 0.00/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.07/0.28 % Computer : n032.cluster.edu % 0.07/0.28 % Model : x86_64 x86_64 % 0.07/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.28 % Memory : 8042.1875MB % 0.07/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.28 % CPULimit : 300 % 0.07/0.28 % WCLimit : 600 % 0.07/0.28 % DateTime : Fri Jun 17 21:51:46 EDT 2022 % 0.07/0.28 % CPUTime : % 0.12/0.29 % SZS status Theorem % 0.12/0.29 % SZS output begin IncompleteProof % 0.12/0.29 cnf(c0, axiom, % 0.12/0.29 apart_point_and_line(intersection_point(sK2,sK3),sK4)). % 0.12/0.29 cnf(c1, plain, % 0.12/0.29 apart_point_and_line(intersection_point(sK2,sK3),sK4), % 0.12/0.29 inference(start, [], [c0])). % 0.12/0.29 % 0.12/0.29 cnf(c2, axiom, % 0.12/0.29 apart_point_and_line(X0,X1) | distinct_lines(X2,X1) | ~apart_point_and_line(X0,X2)). % 0.12/0.29 cnf(a0, assumption, % 0.12/0.29 intersection_point(sK2,sK3) = X0). % 0.12/0.29 cnf(a1, assumption, % 0.12/0.29 sK4 = X2). % 0.12/0.29 cnf(c3, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.29 cnf(c4, plain, % 0.12/0.29 apart_point_and_line(X0,X1) | distinct_lines(X2,X1), % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.29 % 0.12/0.29 cnf(c5, axiom, % 0.12/0.29 ~apart_point_and_line(X3,parallel_through_point(X4,X3))). % 0.12/0.29 cnf(a2, assumption, % 0.12/0.29 X0 = X3). % 0.12/0.29 cnf(a3, assumption, % 0.12/0.29 X1 = parallel_through_point(X4,X3)). % 0.12/0.29 cnf(c6, plain, % 0.12/0.29 distinct_lines(X2,X1), % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.29 cnf(c7, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.12/0.29 % 0.12/0.29 cnf(c8, axiom, % 0.12/0.29 distinct_lines(X5,X6) | distinct_lines(X7,X6) | ~distinct_lines(X7,X5)). % 0.12/0.29 cnf(a4, assumption, % 0.12/0.29 X2 = X7). % 0.12/0.29 cnf(a5, assumption, % 0.12/0.29 X1 = X5). % 0.12/0.29 cnf(c9, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.12/0.29 cnf(c10, plain, % 0.12/0.29 distinct_lines(X5,X6) | distinct_lines(X7,X6), % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.12/0.29 % 0.12/0.29 cnf(c11, axiom, % 0.12/0.29 convergent_lines(X8,X9) | ~distinct_lines(X8,X9)). % 0.12/0.29 cnf(a6, assumption, % 0.12/0.29 X5 = X8). % 0.12/0.29 cnf(a7, assumption, % 0.12/0.29 X6 = X9). % 0.12/0.29 cnf(c12, plain, % 0.12/0.29 distinct_lines(X7,X6), % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.29 cnf(c13, plain, % 0.12/0.29 convergent_lines(X8,X9), % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.12/0.29 % 0.12/0.29 cnf(c14, axiom, % 0.12/0.29 ~convergent_lines(parallel_through_point(X10,X11),X10)). % 0.12/0.29 cnf(a8, assumption, % 0.12/0.29 X8 = parallel_through_point(X10,X11)). % 0.12/0.29 cnf(a9, assumption, % 0.12/0.29 X9 = X10). % 0.12/0.29 cnf(c15, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 0.12/0.29 cnf(c16, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 0.12/0.29 % 0.12/0.29 cnf(c17, axiom, % 0.12/0.29 ~distinct_lines(X12,X12)). % 0.12/0.29 cnf(a10, assumption, % 0.12/0.29 X7 = X12). % 0.12/0.29 cnf(a11, assumption, % 0.12/0.29 X6 = X12). % 0.12/0.29 cnf(c18, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c17])). % 0.12/0.29 cnf(c19, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c17])). % 0.12/0.29 % 0.12/0.29 cnf(c20, plain, % 0.12/0.29 $false, % 0.12/0.29 inference(constraint_solving, [ % 0.12/0.29 bind(X0, intersection_point(sK2,sK3)), % 0.12/0.29 bind(X1, parallel_through_point(X4,X3)), % 0.12/0.29 bind(X2, sK4), % 0.12/0.29 bind(X3, intersection_point(sK2,sK3)), % 0.12/0.29 bind(X4, sK4), % 0.12/0.29 bind(X5, parallel_through_point(X4,X3)), % 0.12/0.29 bind(X6, sK4), % 0.12/0.29 bind(X7, sK4), % 0.12/0.29 bind(X8, parallel_through_point(X4,X3)), % 0.12/0.29 bind(X9, sK4), % 0.12/0.29 bind(X10, sK4), % 0.12/0.29 bind(X11, intersection_point(sK2,sK3)), % 0.12/0.29 bind(X12, sK4) % 0.12/0.29 ], % 0.12/0.29 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.12/0.29 % 0.12/0.29 % SZS output end IncompleteProof %------------------------------------------------------------------------------