%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO202+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 : n024.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:55 EDT 2022 % Result : Theorem 16.90s 2.63s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : GEO202+3 : TPTP v8.1.0. Released v4.0.0. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n024.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jun 17 17:08:02 EDT 2022 % 0.13/0.34 % CPUTime : % 16.90/2.63 % SZS status Theorem % 16.90/2.63 % SZS output begin IncompleteProof % 16.90/2.63 cnf(c0, axiom, % 16.90/2.63 distinct_points(sK2,sK4)). % 16.90/2.63 cnf(c1, plain, % 16.90/2.63 distinct_points(sK2,sK4), % 16.90/2.63 inference(start, [], [c0])). % 16.90/2.63 % 16.90/2.63 cnf(c2, axiom, % 16.90/2.63 ~apart_point_and_line(X0,line_connecting(X0,X1)) | ~distinct_points(X0,X1)). % 16.90/2.63 cnf(a0, assumption, % 16.90/2.63 sK2 = X0). % 16.90/2.63 cnf(a1, assumption, % 16.90/2.63 sK4 = X1). % 16.90/2.63 cnf(c3, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 16.90/2.63 cnf(c4, plain, % 16.90/2.63 ~apart_point_and_line(X0,line_connecting(X0,X1)), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 16.90/2.63 % 16.90/2.63 cnf(c5, axiom, % 16.90/2.63 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)). % 16.90/2.63 cnf(a2, assumption, % 16.90/2.63 X0 = X2). % 16.90/2.63 cnf(a3, assumption, % 16.90/2.63 line_connecting(X0,X1) = X4). % 16.90/2.63 cnf(c6, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 16.90/2.63 cnf(c7, plain, % 16.90/2.63 apart_point_and_line(X2,X3) | apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 16.90/2.63 % 16.90/2.63 cnf(c8, axiom, % 16.90/2.63 ~apart_point_and_line(X6,line_connecting(X6,X7)) | ~distinct_points(X6,X7)). % 16.90/2.63 cnf(a4, assumption, % 16.90/2.63 X2 = X6). % 16.90/2.63 cnf(a5, assumption, % 16.90/2.63 X3 = line_connecting(X6,X7)). % 16.90/2.63 cnf(c9, plain, % 16.90/2.63 apart_point_and_line(X5,X3) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 16.90/2.63 cnf(c10, plain, % 16.90/2.63 ~distinct_points(X6,X7), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 16.90/2.63 % 16.90/2.63 cnf(c11, axiom, % 16.90/2.63 distinct_points(sK2,sK3)). % 16.90/2.63 cnf(a6, assumption, % 16.90/2.63 X6 = sK2). % 16.90/2.63 cnf(a7, assumption, % 16.90/2.63 X7 = sK3). % 16.90/2.63 cnf(c12, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 16.90/2.63 cnf(c13, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 16.90/2.63 % 16.90/2.63 cnf(c14, axiom, % 16.90/2.63 ~apart_point_and_line(intersection_point(X8,X9),X8) | ~convergent_lines(X8,X9)). % 16.90/2.63 cnf(a8, assumption, % 16.90/2.63 X5 = intersection_point(X8,X9)). % 16.90/2.63 cnf(a9, assumption, % 16.90/2.63 X3 = X8). % 16.90/2.63 cnf(c15, plain, % 16.90/2.63 apart_point_and_line(X5,X4) | ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 16.90/2.63 cnf(c16, plain, % 16.90/2.63 ~convergent_lines(X8,X9), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 16.90/2.63 % 16.90/2.63 cnf(c17, axiom, % 16.90/2.63 convergent_lines(line_connecting(sK2,sK3),line_connecting(sK2,sK4))). % 16.90/2.63 cnf(a10, assumption, % 16.90/2.63 X8 = line_connecting(sK2,sK3)). % 16.90/2.63 cnf(a11, assumption, % 16.90/2.63 X9 = line_connecting(sK2,sK4)). % 16.90/2.63 cnf(c18, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 16.90/2.63 cnf(c19, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 16.90/2.63 % 16.90/2.63 cnf(c20, axiom, % 16.90/2.63 ~apart_point_and_line(intersection_point(X10,X11),X11) | ~convergent_lines(X10,X11)). % 16.90/2.63 cnf(a12, assumption, % 16.90/2.63 X5 = intersection_point(X10,X11)). % 16.90/2.63 cnf(a13, assumption, % 16.90/2.63 X4 = X11). % 16.90/2.63 cnf(c21, plain, % 16.90/2.63 ~distinct_lines(X4,X3) | ~distinct_points(X5,X2), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a12, a13])], [c15, c20])). % 16.90/2.63 cnf(c22, plain, % 16.90/2.63 ~convergent_lines(X10,X11), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a12, a13])], [c15, c20])). % 16.90/2.63 % 16.90/2.63 cnf(c23, plain, % 16.90/2.63 convergent_lines(X8,X9)). % 16.90/2.63 cnf(a14, assumption, % 16.90/2.63 X10 = X8). % 16.90/2.63 cnf(a15, assumption, % 16.90/2.63 X11 = X9). % 16.90/2.63 cnf(c24, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(predicate_reduction, [assumptions([a14, a15])], [c22, c23])). % 16.90/2.63 % 16.90/2.63 cnf(c25, axiom, % 16.90/2.63 convergent_lines(X12,X13) | distinct_lines(X14,X13) | ~convergent_lines(X12,X14)). % 16.90/2.63 cnf(a16, assumption, % 16.90/2.63 X4 = X14). % 16.90/2.63 cnf(a17, assumption, % 16.90/2.63 X3 = X13). % 16.90/2.63 cnf(c26, plain, % 16.90/2.63 ~distinct_points(X5,X2), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c25])). % 16.90/2.63 cnf(c27, plain, % 16.90/2.63 convergent_lines(X12,X13) | ~convergent_lines(X12,X14), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a16, a17])], [c21, c25])). % 16.90/2.63 % 16.90/2.63 cnf(c28, axiom, % 16.90/2.63 ~convergent_lines(X15,X15)). % 16.90/2.63 cnf(a18, assumption, % 16.90/2.63 X12 = X15). % 16.90/2.63 cnf(a19, assumption, % 16.90/2.63 X13 = X15). % 16.90/2.63 cnf(c29, plain, % 16.90/2.63 ~convergent_lines(X12,X14), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c28])). % 16.90/2.63 cnf(c30, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a18, a19])], [c27, c28])). % 16.90/2.63 % 16.90/2.63 cnf(c31, plain, % 16.90/2.63 convergent_lines(X8,X9)). % 16.90/2.63 cnf(a20, assumption, % 16.90/2.63 X12 = X8). % 16.90/2.63 cnf(a21, assumption, % 16.90/2.63 X14 = X9). % 16.90/2.63 cnf(c32, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(predicate_reduction, [assumptions([a20, a21])], [c29, c31])). % 16.90/2.63 % 16.90/2.63 cnf(c33, axiom, % 16.90/2.63 equal_points(X16,X17) | distinct_points(X16,X17)). % 16.90/2.63 cnf(a22, assumption, % 16.90/2.63 X5 = X16). % 16.90/2.63 cnf(a23, assumption, % 16.90/2.63 X2 = X17). % 16.90/2.63 cnf(c34, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a22, a23])], [c26, c33])). % 16.90/2.63 cnf(c35, plain, % 16.90/2.63 equal_points(X16,X17), % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a22, a23])], [c26, c33])). % 16.90/2.63 % 16.90/2.63 cnf(c36, axiom, % 16.90/2.63 ~equal_points(intersection_point(line_connecting(sK2,sK3),line_connecting(sK2,sK4)),sK2)). % 16.90/2.63 cnf(a24, assumption, % 16.90/2.63 X16 = intersection_point(line_connecting(sK2,sK3),line_connecting(sK2,sK4))). % 16.90/2.63 cnf(a25, assumption, % 16.90/2.63 X17 = sK2). % 16.90/2.63 cnf(c37, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])). % 16.90/2.63 cnf(c38, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(strict_predicate_extension, [assumptions([a24, a25])], [c35, c36])). % 16.90/2.63 % 16.90/2.63 cnf(c39, plain, % 16.90/2.63 $false, % 16.90/2.63 inference(constraint_solving, [ % 16.90/2.63 bind(X0, sK2), % 16.90/2.63 bind(X1, sK4), % 16.90/2.63 bind(X2, sK2), % 16.90/2.63 bind(X3, line_connecting(X6,X7)), % 16.90/2.63 bind(X4, line_connecting(X0,X1)), % 16.90/2.63 bind(X5, intersection_point(X8,X9)), % 16.90/2.63 bind(X6, sK2), % 16.90/2.63 bind(X7, sK3), % 16.90/2.63 bind(X8, line_connecting(X6,X7)), % 16.90/2.63 bind(X9, line_connecting(sK2,sK4)), % 16.90/2.63 bind(X10, line_connecting(X6,X7)), % 16.90/2.63 bind(X11, line_connecting(sK2,sK4)), % 16.90/2.63 bind(X12, line_connecting(X6,X7)), % 16.90/2.63 bind(X13, line_connecting(X6,X7)), % 16.90/2.63 bind(X14, line_connecting(X0,X1)), % 16.90/2.63 bind(X15, line_connecting(X6,X7)), % 16.90/2.63 bind(X16, intersection_point(X8,X9)), % 16.90/2.63 bind(X17, sK2) % 16.90/2.63 ], % 16.90/2.63 [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])). % 16.90/2.63 % 16.90/2.63 % SZS output end IncompleteProof %------------------------------------------------------------------------------