%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO175+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 : n012.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:34 EDT 2022 % Result : Theorem 1.99s 0.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : GEO175+3 : TPTP v8.1.0. Released v4.0.0. % 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n012.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat Jun 18 12:23:38 EDT 2022 % 0.13/0.33 % CPUTime : % 1.99/0.60 % SZS status Theorem % 1.99/0.60 % SZS output begin IncompleteProof % 1.99/0.60 cnf(c0, axiom, % 1.99/0.60 convergent_lines(sK4,sK5)). % 1.99/0.60 cnf(c1, plain, % 1.99/0.60 convergent_lines(sK4,sK5), % 1.99/0.60 inference(start, [], [c0])). % 1.99/0.60 % 1.99/0.60 cnf(c2, axiom, % 1.99/0.60 ~apart_point_and_line(intersection_point(X0,X1),X0) | ~convergent_lines(X0,X1)). % 1.99/0.60 cnf(a0, assumption, % 1.99/0.60 sK4 = X0). % 1.99/0.60 cnf(a1, assumption, % 1.99/0.60 sK5 = X1). % 1.99/0.60 cnf(c3, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.99/0.60 cnf(c4, plain, % 1.99/0.60 ~apart_point_and_line(intersection_point(X0,X1),X0), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 1.99/0.60 % 1.99/0.60 cnf(c5, axiom, % 1.99/0.60 apart_point_and_line(X2,X3) | apart_point_and_line(X2,X4) | apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2)). % 1.99/0.60 cnf(a2, assumption, % 1.99/0.60 intersection_point(X0,X1) = X2). % 1.99/0.60 cnf(a3, assumption, % 1.99/0.60 X0 = X3). % 1.99/0.60 cnf(c6, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 1.99/0.60 cnf(c7, plain, % 1.99/0.60 apart_point_and_line(X2,X4) | apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 1.99/0.60 % 1.99/0.60 cnf(c8, axiom, % 1.99/0.60 ~apart_point_and_line(intersection_point(X6,X7),X7) | ~convergent_lines(X6,X7)). % 1.99/0.60 cnf(a4, assumption, % 1.99/0.60 X2 = intersection_point(X6,X7)). % 1.99/0.60 cnf(a5, assumption, % 1.99/0.60 X4 = X7). % 1.99/0.60 cnf(c9, plain, % 1.99/0.60 apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 1.99/0.60 cnf(c10, plain, % 1.99/0.60 ~convergent_lines(X6,X7), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 1.99/0.60 % 1.99/0.60 cnf(c11, plain, % 1.99/0.60 convergent_lines(sK4,sK5)). % 1.99/0.60 cnf(a6, assumption, % 1.99/0.60 X6 = sK4). % 1.99/0.60 cnf(a7, assumption, % 1.99/0.60 X7 = sK5). % 1.99/0.60 cnf(c12, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 1.99/0.60 % 1.99/0.60 cnf(c13, axiom, % 1.99/0.60 ~apart_point_and_line(sK2,sK4)). % 1.99/0.60 cnf(a8, assumption, % 1.99/0.60 X5 = sK2). % 1.99/0.60 cnf(a9, assumption, % 1.99/0.60 X3 = sK4). % 1.99/0.60 cnf(c14, plain, % 1.99/0.60 apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c13])). % 1.99/0.60 cnf(c15, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c13])). % 1.99/0.60 % 1.99/0.60 cnf(c16, axiom, % 1.99/0.60 ~apart_point_and_line(sK2,sK5)). % 1.99/0.60 cnf(a10, assumption, % 1.99/0.60 X5 = sK2). % 1.99/0.60 cnf(a11, assumption, % 1.99/0.60 X4 = sK5). % 1.99/0.60 cnf(c17, plain, % 1.99/0.60 ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])). % 1.99/0.60 cnf(c18, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a10, a11])], [c14, c16])). % 1.99/0.60 % 1.99/0.60 cnf(c19, axiom, % 1.99/0.60 convergent_lines(X8,X9) | distinct_lines(X10,X9) | ~convergent_lines(X8,X10)). % 1.99/0.60 cnf(a12, assumption, % 1.99/0.60 X4 = X10). % 1.99/0.60 cnf(a13, assumption, % 1.99/0.60 X3 = X9). % 1.99/0.60 cnf(c20, plain, % 1.99/0.60 ~distinct_points(X5,X2), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])). % 1.99/0.60 cnf(c21, plain, % 1.99/0.60 convergent_lines(X8,X9) | ~convergent_lines(X8,X10), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c19])). % 1.99/0.60 % 1.99/0.60 cnf(c22, axiom, % 1.99/0.60 ~convergent_lines(X11,X11)). % 1.99/0.60 cnf(a14, assumption, % 1.99/0.60 X8 = X11). % 1.99/0.60 cnf(a15, assumption, % 1.99/0.60 X9 = X11). % 1.99/0.60 cnf(c23, plain, % 1.99/0.60 ~convergent_lines(X8,X10), % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 1.99/0.60 cnf(c24, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])). % 1.99/0.60 % 1.99/0.60 cnf(c25, plain, % 1.99/0.60 convergent_lines(sK4,sK5)). % 1.99/0.60 cnf(a16, assumption, % 1.99/0.60 X8 = sK4). % 1.99/0.60 cnf(a17, assumption, % 1.99/0.60 X10 = sK5). % 1.99/0.60 cnf(c26, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(predicate_reduction, [assumptions([a16, a17])], [c23, c25])). % 1.99/0.60 % 1.99/0.60 cnf(c27, axiom, % 1.99/0.60 distinct_points(sK2,intersection_point(sK4,sK5))). % 1.99/0.60 cnf(a18, assumption, % 1.99/0.60 X5 = sK2). % 1.99/0.60 cnf(a19, assumption, % 1.99/0.60 X2 = intersection_point(sK4,sK5)). % 1.99/0.60 cnf(c28, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a18, a19])], [c20, c27])). % 1.99/0.60 cnf(c29, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(strict_predicate_extension, [assumptions([a18, a19])], [c20, c27])). % 1.99/0.60 % 1.99/0.60 cnf(c30, plain, % 1.99/0.60 $false, % 1.99/0.60 inference(constraint_solving, [ % 1.99/0.60 bind(X0, sK4), % 1.99/0.60 bind(X1, sK5), % 1.99/0.60 bind(X2, intersection_point(X0,X1)), % 1.99/0.60 bind(X3, sK4), % 1.99/0.60 bind(X4, sK5), % 1.99/0.60 bind(X5, sK2), % 1.99/0.60 bind(X6, sK4), % 1.99/0.60 bind(X7, sK5), % 1.99/0.60 bind(X8, sK4), % 1.99/0.60 bind(X9, sK4), % 1.99/0.60 bind(X10, sK5), % 1.99/0.60 bind(X11, sK4) % 1.99/0.60 ], % 1.99/0.60 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 1.99/0.60 % 1.99/0.60 % SZS output end IncompleteProof %------------------------------------------------------------------------------