%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO201+2 : TPTP v8.1.0. Released v3.3.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:54 EDT 2022 % Result : Theorem 9.90s 1.63s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.09 % Problem : GEO201+2 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.28 % Computer : n032.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 600 % 0.09/0.28 % DateTime : Fri Jun 17 17:01:31 EDT 2022 % 0.09/0.28 % CPUTime : % 9.90/1.63 % SZS status Theorem % 9.90/1.63 % SZS output begin IncompleteProof % 9.90/1.63 cnf(c0, axiom, % 9.90/1.63 convergent_lines(sK0,sK1)). % 9.90/1.63 cnf(c1, plain, % 9.90/1.63 convergent_lines(sK0,sK1), % 9.90/1.63 inference(start, [], [c0])). % 9.90/1.63 % 9.90/1.63 cnf(c2, axiom, % 9.90/1.63 distinct_points(X0,intersection_point(X1,X2)) | ~apart_point_and_line(X0,X2) | ~convergent_lines(X1,X2)). % 9.90/1.63 cnf(a0, assumption, % 9.90/1.63 sK0 = X1). % 9.90/1.63 cnf(a1, assumption, % 9.90/1.63 sK1 = X2). % 9.90/1.63 cnf(c3, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 9.90/1.63 cnf(c4, plain, % 9.90/1.63 distinct_points(X0,intersection_point(X1,X2)) | ~apart_point_and_line(X0,X2), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 9.90/1.63 % 9.90/1.63 cnf(c5, axiom, % 9.90/1.63 ~distinct_points(X3,X3)). % 9.90/1.63 cnf(a2, assumption, % 9.90/1.63 X0 = X3). % 9.90/1.63 cnf(a3, assumption, % 9.90/1.63 intersection_point(X1,X2) = X3). % 9.90/1.63 cnf(c6, plain, % 9.90/1.63 ~apart_point_and_line(X0,X2), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 9.90/1.63 cnf(c7, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 9.90/1.63 % 9.90/1.63 cnf(c8, axiom, % 9.90/1.63 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)). % 9.90/1.63 cnf(a4, assumption, % 9.90/1.63 X0 = X7). % 9.90/1.63 cnf(a5, assumption, % 9.90/1.63 X2 = X5). % 9.90/1.63 cnf(c9, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 9.90/1.63 cnf(c10, plain, % 9.90/1.63 apart_point_and_line(X4,X5) | apart_point_and_line(X4,X6) | apart_point_and_line(X7,X6) | ~distinct_lines(X6,X5) | ~distinct_points(X7,X4), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 9.90/1.63 % 9.90/1.63 cnf(c11, axiom, % 9.90/1.63 distinct_points(X8,intersection_point(X9,X10)) | ~apart_point_and_line(X8,X9) | ~convergent_lines(X9,X10)). % 9.90/1.63 cnf(a6, assumption, % 9.90/1.63 X4 = X8). % 9.90/1.63 cnf(a7, assumption, % 9.90/1.63 X5 = X9). % 9.90/1.63 cnf(c12, plain, % 9.90/1.63 apart_point_and_line(X4,X6) | apart_point_and_line(X7,X6) | ~distinct_lines(X6,X5) | ~distinct_points(X7,X4), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 9.90/1.63 cnf(c13, plain, % 9.90/1.63 distinct_points(X8,intersection_point(X9,X10)) | ~convergent_lines(X9,X10), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 9.90/1.63 % 9.90/1.63 cnf(c14, axiom, % 9.90/1.63 ~distinct_points(X11,X11)). % 9.90/1.63 cnf(a8, assumption, % 9.90/1.63 X8 = X11). % 9.90/1.63 cnf(a9, assumption, % 9.90/1.63 intersection_point(X9,X10) = X11). % 9.90/1.63 cnf(c15, plain, % 9.90/1.63 ~convergent_lines(X9,X10), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 9.90/1.63 cnf(c16, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])). % 9.90/1.63 % 9.90/1.63 cnf(c17, axiom, % 9.90/1.63 convergent_lines(X12,X13) | convergent_lines(X14,X13) | ~convergent_lines(X14,X12)). % 9.90/1.63 cnf(a10, assumption, % 9.90/1.63 X9 = X12). % 9.90/1.63 cnf(a11, assumption, % 9.90/1.63 X10 = X13). % 9.90/1.63 cnf(c18, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 9.90/1.63 cnf(c19, plain, % 9.90/1.63 convergent_lines(X14,X13) | ~convergent_lines(X14,X12), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])). % 9.90/1.63 % 9.90/1.63 cnf(c20, axiom, % 9.90/1.63 ~convergent_lines(X15,X15)). % 9.90/1.63 cnf(a12, assumption, % 9.90/1.63 X14 = X15). % 9.90/1.63 cnf(a13, assumption, % 9.90/1.63 X13 = X15). % 9.90/1.63 cnf(c21, plain, % 9.90/1.63 ~convergent_lines(X14,X12), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 9.90/1.63 cnf(c22, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 9.90/1.63 % 9.90/1.63 cnf(c23, plain, % 9.90/1.63 convergent_lines(sK0,sK1)). % 9.90/1.63 cnf(a14, assumption, % 9.90/1.63 X14 = sK0). % 9.90/1.63 cnf(a15, assumption, % 9.90/1.63 X12 = sK1). % 9.90/1.63 cnf(c24, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(predicate_reduction, [assumptions([a14, a15])], [c21, c23])). % 9.90/1.63 % 9.90/1.63 cnf(c25, axiom, % 9.90/1.63 distinct_points(X16,intersection_point(X17,X18)) | ~apart_point_and_line(X16,X18) | ~convergent_lines(X17,X18)). % 9.90/1.63 cnf(a16, assumption, % 9.90/1.63 X4 = X16). % 9.90/1.63 cnf(a17, assumption, % 9.90/1.63 X6 = X18). % 9.90/1.63 cnf(c26, plain, % 9.90/1.63 apart_point_and_line(X7,X6) | ~distinct_lines(X6,X5) | ~distinct_points(X7,X4), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a16, a17])], [c12, c25])). % 9.90/1.63 cnf(c27, plain, % 9.90/1.63 distinct_points(X16,intersection_point(X17,X18)) | ~convergent_lines(X17,X18), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a16, a17])], [c12, c25])). % 9.90/1.63 % 9.90/1.63 cnf(c28, plain, % 9.90/1.63 ~distinct_points(X8,intersection_point(X9,X10))). % 9.90/1.63 cnf(a18, assumption, % 9.90/1.63 X16 = X8). % 9.90/1.63 cnf(a19, assumption, % 9.90/1.63 intersection_point(X17,X18) = intersection_point(X9,X10)). % 9.90/1.63 cnf(c29, plain, % 9.90/1.63 ~convergent_lines(X17,X18), % 9.90/1.63 inference(predicate_reduction, [assumptions([a18, a19])], [c27, c28])). % 9.90/1.63 % 9.90/1.63 cnf(c30, plain, % 9.90/1.63 convergent_lines(X9,X10)). % 9.90/1.63 cnf(a20, assumption, % 9.90/1.63 X17 = X9). % 9.90/1.63 cnf(a21, assumption, % 9.90/1.63 X18 = X10). % 9.90/1.63 cnf(c31, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(predicate_reduction, [assumptions([a20, a21])], [c29, c30])). % 9.90/1.63 % 9.90/1.63 cnf(c32, axiom, % 9.90/1.63 distinct_points(X19,intersection_point(X20,X21)) | ~apart_point_and_line(X19,X20) | ~convergent_lines(X20,X21)). % 9.90/1.63 cnf(a22, assumption, % 9.90/1.63 X7 = X19). % 9.90/1.63 cnf(a23, assumption, % 9.90/1.63 X6 = X20). % 9.90/1.63 cnf(c33, plain, % 9.90/1.63 ~distinct_lines(X6,X5) | ~distinct_points(X7,X4), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a22, a23])], [c26, c32])). % 9.90/1.63 cnf(c34, plain, % 9.90/1.63 distinct_points(X19,intersection_point(X20,X21)) | ~convergent_lines(X20,X21), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a22, a23])], [c26, c32])). % 9.90/1.63 % 9.90/1.63 cnf(c35, plain, % 9.90/1.63 ~distinct_points(X0,intersection_point(X1,X2))). % 9.90/1.63 cnf(a24, assumption, % 9.90/1.63 X19 = X0). % 9.90/1.63 cnf(a25, assumption, % 9.90/1.63 intersection_point(X20,X21) = intersection_point(X1,X2)). % 9.90/1.63 cnf(c36, plain, % 9.90/1.63 ~convergent_lines(X20,X21), % 9.90/1.63 inference(predicate_reduction, [assumptions([a24, a25])], [c34, c35])). % 9.90/1.63 % 9.90/1.63 cnf(c37, plain, % 9.90/1.63 convergent_lines(sK0,sK1)). % 9.90/1.63 cnf(a26, assumption, % 9.90/1.63 X20 = sK0). % 9.90/1.63 cnf(a27, assumption, % 9.90/1.63 X21 = sK1). % 9.90/1.63 cnf(c38, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(predicate_reduction, [assumptions([a26, a27])], [c36, c37])). % 9.90/1.63 % 9.90/1.63 cnf(c39, axiom, % 9.90/1.63 distinct_lines(X22,X23) | ~convergent_lines(X22,X23)). % 9.90/1.63 cnf(a28, assumption, % 9.90/1.63 X6 = X22). % 9.90/1.63 cnf(a29, assumption, % 9.90/1.63 X5 = X23). % 9.90/1.63 cnf(c40, plain, % 9.90/1.63 ~distinct_points(X7,X4), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a28, a29])], [c33, c39])). % 9.90/1.63 cnf(c41, plain, % 9.90/1.63 ~convergent_lines(X22,X23), % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a28, a29])], [c33, c39])). % 9.90/1.63 % 9.90/1.63 cnf(c42, plain, % 9.90/1.63 convergent_lines(sK0,sK1)). % 9.90/1.63 cnf(a30, assumption, % 9.90/1.63 X22 = sK0). % 9.90/1.63 cnf(a31, assumption, % 9.90/1.63 X23 = sK1). % 9.90/1.63 cnf(c43, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(predicate_reduction, [assumptions([a30, a31])], [c41, c42])). % 9.90/1.63 % 9.90/1.63 cnf(c44, axiom, % 9.90/1.63 distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0))). % 9.90/1.63 cnf(a32, assumption, % 9.90/1.63 X7 = intersection_point(sK0,sK1)). % 9.90/1.63 cnf(a33, assumption, % 9.90/1.63 X4 = intersection_point(sK1,sK0)). % 9.90/1.63 cnf(c45, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a32, a33])], [c40, c44])). % 9.90/1.63 cnf(c46, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(strict_predicate_extension, [assumptions([a32, a33])], [c40, c44])). % 9.90/1.63 % 9.90/1.63 cnf(c47, plain, % 9.90/1.63 $false, % 9.90/1.63 inference(constraint_solving, [ % 9.90/1.63 bind(X0, intersection_point(X1,X2)), % 9.90/1.63 bind(X1, sK0), % 9.90/1.63 bind(X2, sK1), % 9.90/1.63 bind(X3, intersection_point(X1,X2)), % 9.90/1.63 bind(X4, intersection_point(X9,X10)), % 9.90/1.63 bind(X5, sK1), % 9.90/1.63 bind(X6, sK0), % 9.90/1.63 bind(X7, intersection_point(X1,X2)), % 9.90/1.63 bind(X8, intersection_point(X9,X10)), % 9.90/1.63 bind(X9, sK1), % 9.90/1.63 bind(X10, sK0), % 9.90/1.63 bind(X11, intersection_point(X9,X10)), % 9.90/1.63 bind(X12, sK1), % 9.90/1.63 bind(X13, sK0), % 9.90/1.63 bind(X14, sK0), % 9.90/1.63 bind(X15, sK0), % 9.90/1.63 bind(X16, intersection_point(X9,X10)), % 9.90/1.63 bind(X17, sK1), % 9.90/1.63 bind(X18, sK0), % 9.90/1.63 bind(X19, intersection_point(X1,X2)), % 9.90/1.63 bind(X20, sK0), % 9.90/1.64 bind(X21, sK1), % 9.90/1.64 bind(X22, sK0), % 9.90/1.64 bind(X23, sK1) % 9.90/1.64 ], % 9.90/1.64 [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, a26, a27, a28, a29, a30, a31, a32, a33])). % 9.90/1.64 % 9.90/1.64 % SZS output end IncompleteProof %------------------------------------------------------------------------------