%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO172+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 : n005.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:32 EDT 2022 % Result : Theorem 12.10s 2.12s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : GEO172+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.12/0.33 % Computer : n005.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat Jun 18 00:53:53 EDT 2022 % 0.12/0.33 % CPUTime : % 12.10/2.12 % SZS status Theorem % 12.10/2.12 % SZS output begin IncompleteProof % 12.10/2.12 cnf(c0, axiom, % 12.10/2.12 convergent_lines(sK2,sK3)). % 12.10/2.12 cnf(c1, plain, % 12.10/2.12 convergent_lines(sK2,sK3), % 12.10/2.12 inference(start, [], [c0])). % 12.10/2.12 % 12.10/2.12 cnf(c2, axiom, % 12.10/2.12 convergent_lines(X0,X1) | distinct_lines(X2,X1) | ~convergent_lines(X0,X2)). % 12.10/2.12 cnf(a0, assumption, % 12.10/2.12 sK2 = X0). % 12.10/2.12 cnf(a1, assumption, % 12.10/2.12 sK3 = X2). % 12.10/2.12 cnf(c3, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 12.10/2.12 cnf(c4, plain, % 12.10/2.12 convergent_lines(X0,X1) | distinct_lines(X2,X1), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 12.10/2.12 % 12.10/2.12 cnf(c5, axiom, % 12.10/2.12 ~convergent_lines(X3,X3)). % 12.10/2.12 cnf(a2, assumption, % 12.10/2.12 X0 = X3). % 12.10/2.12 cnf(a3, assumption, % 12.10/2.12 X1 = X3). % 12.10/2.12 cnf(c6, plain, % 12.10/2.12 distinct_lines(X2,X1), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 12.10/2.12 cnf(c7, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 12.10/2.12 % 12.10/2.12 cnf(c8, axiom, % 12.10/2.12 apart_point_and_line(X4,X5) | apart_point_and_line(X4,X6) | apart_point_and_line(X7,X5) | apart_point_and_line(X7,X6) | ~distinct_lines(X6,X5) | ~distinct_points(X7,X4)). % 12.10/2.12 cnf(a4, assumption, % 12.10/2.12 X2 = X6). % 12.10/2.12 cnf(a5, assumption, % 12.10/2.12 X1 = X5). % 12.10/2.12 cnf(c9, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 12.10/2.12 cnf(c10, plain, % 12.10/2.12 apart_point_and_line(X4,X5) | apart_point_and_line(X4,X6) | apart_point_and_line(X7,X5) | apart_point_and_line(X7,X6) | ~distinct_points(X7,X4), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 12.10/2.12 % 12.10/2.12 cnf(c11, axiom, % 12.10/2.12 ~apart_point_and_line(intersection_point(X8,X9),X8) | ~convergent_lines(X8,X9)). % 12.10/2.12 cnf(a6, assumption, % 12.10/2.12 X4 = intersection_point(X8,X9)). % 12.10/2.12 cnf(a7, assumption, % 12.10/2.12 X5 = X8). % 12.10/2.12 cnf(c12, plain, % 12.10/2.12 apart_point_and_line(X4,X6) | apart_point_and_line(X7,X5) | apart_point_and_line(X7,X6) | ~distinct_points(X7,X4), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 12.10/2.12 cnf(c13, plain, % 12.10/2.12 ~convergent_lines(X8,X9), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 12.10/2.12 % 12.10/2.12 cnf(c14, plain, % 12.10/2.12 convergent_lines(sK2,sK3)). % 12.10/2.12 cnf(a8, assumption, % 12.10/2.12 X8 = sK2). % 12.10/2.12 cnf(a9, assumption, % 12.10/2.12 X9 = sK3). % 12.10/2.12 cnf(c15, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])). % 12.10/2.12 % 12.10/2.12 cnf(c16, axiom, % 12.10/2.12 ~apart_point_and_line(intersection_point(X10,X11),X11) | ~convergent_lines(X10,X11)). % 12.10/2.12 cnf(a10, assumption, % 12.10/2.12 X4 = intersection_point(X10,X11)). % 12.10/2.12 cnf(a11, assumption, % 12.10/2.12 X6 = X11). % 12.10/2.12 cnf(c17, plain, % 12.10/2.12 apart_point_and_line(X7,X5) | apart_point_and_line(X7,X6) | ~distinct_points(X7,X4), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])). % 12.10/2.12 cnf(c18, plain, % 12.10/2.12 ~convergent_lines(X10,X11), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])). % 12.10/2.12 % 12.10/2.12 cnf(c19, plain, % 12.10/2.12 convergent_lines(sK2,sK3)). % 12.10/2.12 cnf(a12, assumption, % 12.10/2.12 X10 = sK2). % 12.10/2.12 cnf(a13, assumption, % 12.10/2.12 X11 = sK3). % 12.10/2.12 cnf(c20, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(predicate_reduction, [assumptions([a12, a13])], [c18, c19])). % 12.10/2.12 % 12.10/2.12 cnf(c21, axiom, % 12.10/2.12 ~apart_point_and_line(X12,X13) | ~incident_point_and_line(X12,X13)). % 12.10/2.12 cnf(a14, assumption, % 12.10/2.12 X7 = X12). % 12.10/2.12 cnf(a15, assumption, % 12.10/2.12 X5 = X13). % 12.10/2.12 cnf(c22, plain, % 12.10/2.12 apart_point_and_line(X7,X6) | ~distinct_points(X7,X4), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c21])). % 12.10/2.12 cnf(c23, plain, % 12.10/2.12 ~incident_point_and_line(X12,X13), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c21])). % 12.10/2.12 % 12.10/2.12 cnf(c24, axiom, % 12.10/2.12 incident_point_and_line(sK4,sK2)). % 12.10/2.12 cnf(a16, assumption, % 12.10/2.12 X12 = sK4). % 12.10/2.12 cnf(a17, assumption, % 12.10/2.12 X13 = sK2). % 12.10/2.12 cnf(c25, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 12.10/2.12 cnf(c26, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c24])). % 12.10/2.12 % 12.10/2.12 cnf(c27, axiom, % 12.10/2.12 ~apart_point_and_line(X14,X15) | ~incident_point_and_line(X14,X15)). % 12.10/2.12 cnf(a18, assumption, % 12.10/2.12 X7 = X14). % 12.10/2.12 cnf(a19, assumption, % 12.10/2.12 X6 = X15). % 12.10/2.12 cnf(c28, plain, % 12.10/2.12 ~distinct_points(X7,X4), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a18, a19])], [c22, c27])). % 12.10/2.12 cnf(c29, plain, % 12.10/2.12 ~incident_point_and_line(X14,X15), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a18, a19])], [c22, c27])). % 12.10/2.12 % 12.10/2.12 cnf(c30, axiom, % 12.10/2.12 incident_point_and_line(sK4,sK3)). % 12.10/2.12 cnf(a20, assumption, % 12.10/2.12 X14 = sK4). % 12.10/2.12 cnf(a21, assumption, % 12.10/2.12 X15 = sK3). % 12.10/2.12 cnf(c31, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])). % 12.10/2.12 cnf(c32, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a20, a21])], [c29, c30])). % 12.10/2.12 % 12.10/2.12 cnf(c33, axiom, % 12.10/2.12 equal_points(X16,X17) | distinct_points(X16,X17)). % 12.10/2.12 cnf(a22, assumption, % 12.10/2.12 X7 = X16). % 12.10/2.12 cnf(a23, assumption, % 12.10/2.12 X4 = X17). % 12.10/2.12 cnf(c34, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a22, a23])], [c28, c33])). % 12.10/2.12 cnf(c35, plain, % 12.10/2.12 equal_points(X16,X17), % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a22, a23])], [c28, c33])). % 12.10/2.12 % 12.10/2.12 cnf(c36, axiom, % 12.10/2.12 ~equal_points(sK4,intersection_point(sK2,sK3))). % 12.10/2.12 cnf(a24, assumption, % 12.10/2.12 X16 = sK4). % 12.10/2.12 cnf(a25, assumption, % 12.10/2.12 X17 = intersection_point(sK2,sK3)). % 12.10/2.12 cnf(c37, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])). % 12.10/2.12 cnf(c38, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])). % 12.10/2.12 % 12.10/2.12 cnf(c39, plain, % 12.10/2.12 $false, % 12.10/2.12 inference(constraint_solving, [ % 12.10/2.12 bind(X0, sK2), % 12.10/2.12 bind(X1, sK2), % 12.10/2.12 bind(X2, sK3), % 12.10/2.12 bind(X3, sK2), % 12.10/2.12 bind(X4, intersection_point(X8,X9)), % 12.10/2.12 bind(X5, sK2), % 12.10/2.12 bind(X6, sK3), % 12.10/2.12 bind(X7, sK4), % 12.10/2.12 bind(X8, sK2), % 12.10/2.12 bind(X9, sK3), % 12.10/2.12 bind(X10, sK2), % 12.10/2.12 bind(X11, sK3), % 12.10/2.12 bind(X12, sK4), % 12.10/2.12 bind(X13, sK2), % 12.10/2.12 bind(X14, sK4), % 12.10/2.12 bind(X15, sK3), % 12.10/2.12 bind(X16, sK4), % 12.10/2.12 bind(X17, intersection_point(X8,X9)) % 12.10/2.12 ], % 12.10/2.12 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25])). % 12.10/2.12 % 12.10/2.12 % SZS output end IncompleteProof %------------------------------------------------------------------------------