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