%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO222+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 : n016.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 05:00:09 EDT 2022 % Result : Theorem 85.50s 11.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GEO222+1 : TPTP v8.1.0. Released v3.3.0. % 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n016.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 21:19:51 EDT 2022 % 0.13/0.34 % CPUTime : % 85.50/11.49 % SZS status Theorem % 85.50/11.49 % SZS output begin IncompleteProof % 85.50/11.49 cnf(c0, axiom, % 85.50/11.49 convergent_lines(sK2,orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1))). % 85.50/11.49 cnf(c1, plain, % 85.50/11.49 convergent_lines(sK2,orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)), % 85.50/11.49 inference(start, [], [c0])). % 85.50/11.49 % 85.50/11.49 cnf(c2, axiom, % 85.50/11.49 ~apart_point_and_line(intersection_point(X0,X1),X1) | ~convergent_lines(X0,X1)). % 85.50/11.49 cnf(a0, assumption, % 85.50/11.49 sK2 = X0). % 85.50/11.49 cnf(a1, assumption, % 85.50/11.49 orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1) = X1). % 85.50/11.49 cnf(c3, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 85.50/11.49 cnf(c4, plain, % 85.50/11.49 ~apart_point_and_line(intersection_point(X0,X1),X1), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 85.50/11.49 % 85.50/11.49 cnf(c5, axiom, % 85.50/11.49 unorthogonal_lines(X2,X3) | unorthogonal_lines(X4,X3) | apart_point_and_line(X5,X2) | apart_point_and_line(X5,X4) | ~distinct_lines(X4,X2)). % 85.50/11.49 cnf(a2, assumption, % 85.50/11.49 intersection_point(X0,X1) = X5). % 85.50/11.49 cnf(a3, assumption, % 85.50/11.49 X1 = X4). % 85.50/11.49 cnf(c6, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 85.50/11.49 cnf(c7, plain, % 85.50/11.49 unorthogonal_lines(X2,X3) | unorthogonal_lines(X4,X3) | apart_point_and_line(X5,X2) | ~distinct_lines(X4,X2), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 85.50/11.49 % 85.50/11.49 cnf(c8, axiom, % 85.50/11.49 unorthogonal_lines(X6,X7) | sP0(X7,X8) | ~unorthogonal_lines(X8,X6) | ~convergent_lines(X8,X6)). % 85.50/11.49 cnf(a4, assumption, % 85.50/11.49 X2 = X8). % 85.50/11.49 cnf(a5, assumption, % 85.50/11.49 X3 = X6). % 85.50/11.49 cnf(c9, plain, % 85.50/11.49 unorthogonal_lines(X4,X3) | apart_point_and_line(X5,X2) | ~distinct_lines(X4,X2), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 85.50/11.49 cnf(c10, plain, % 85.50/11.49 unorthogonal_lines(X6,X7) | sP0(X7,X8) | ~convergent_lines(X8,X6), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 85.50/11.49 % 85.50/11.49 cnf(c11, axiom, % 85.50/11.49 ~unorthogonal_lines(orthogonal_through_point(X9,X10),X9)). % 85.50/11.49 cnf(a6, assumption, % 85.50/11.49 X6 = orthogonal_through_point(X9,X10)). % 85.50/11.49 cnf(a7, assumption, % 85.50/11.49 X7 = X9). % 85.50/11.49 cnf(c12, plain, % 85.50/11.49 sP0(X7,X8) | ~convergent_lines(X8,X6), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 85.50/11.49 cnf(c13, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 85.50/11.49 % 85.50/11.49 cnf(c14, axiom, % 85.50/11.49 convergent_lines(X11,X12) | ~sP0(X12,X11)). % 85.50/11.49 cnf(a8, assumption, % 85.50/11.49 X7 = X12). % 85.50/11.49 cnf(a9, assumption, % 85.50/11.49 X8 = X11). % 85.50/11.49 cnf(c15, plain, % 85.50/11.49 ~convergent_lines(X8,X6), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 85.50/11.49 cnf(c16, plain, % 85.50/11.49 convergent_lines(X11,X12), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 85.50/11.49 % 85.50/11.49 cnf(c17, axiom, % 85.50/11.49 ~convergent_lines(X13,X13)). % 85.50/11.49 cnf(a10, assumption, % 85.50/11.49 X11 = X13). % 85.50/11.49 cnf(a11, assumption, % 85.50/11.49 X12 = X13). % 85.50/11.49 cnf(c18, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 85.50/11.49 cnf(c19, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 85.50/11.49 % 85.50/11.49 cnf(c20, axiom, % 85.50/11.49 convergent_lines(X14,X15) | convergent_lines(X16,X15) | ~convergent_lines(X16,X14)). % 85.50/11.49 cnf(a12, assumption, % 85.50/11.49 X8 = X14). % 85.50/11.49 cnf(a13, assumption, % 85.50/11.49 X6 = X15). % 85.50/11.49 cnf(c21, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a12, a13])], [c15, c20])). % 85.50/11.49 cnf(c22, plain, % 85.50/11.49 convergent_lines(X16,X15) | ~convergent_lines(X16,X14), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a12, a13])], [c15, c20])). % 85.50/11.49 % 85.50/11.49 cnf(c23, axiom, % 85.50/11.49 ~convergent_lines(X17,X17)). % 85.50/11.49 cnf(a14, assumption, % 85.50/11.49 X16 = X17). % 85.50/11.49 cnf(a15, assumption, % 85.50/11.49 X15 = X17). % 85.50/11.49 cnf(c24, plain, % 85.50/11.49 ~convergent_lines(X16,X14), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 85.50/11.49 cnf(c25, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 85.50/11.49 % 85.50/11.49 cnf(c26, axiom, % 85.50/11.49 unorthogonal_lines(X18,X19) | convergent_lines(X18,X19)). % 85.50/11.49 cnf(a16, assumption, % 85.50/11.49 X16 = X18). % 85.50/11.49 cnf(a17, assumption, % 85.50/11.49 X14 = X19). % 85.50/11.49 cnf(c27, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])). % 85.50/11.49 cnf(c28, plain, % 85.50/11.49 unorthogonal_lines(X18,X19), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])). % 85.50/11.49 % 85.50/11.49 cnf(c29, plain, % 85.50/11.49 ~unorthogonal_lines(X6,X7)). % 85.50/11.49 cnf(a18, assumption, % 85.50/11.49 X18 = X6). % 85.50/11.49 cnf(a19, assumption, % 85.50/11.49 X19 = X7). % 85.50/11.49 cnf(c30, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(predicate_reduction, [assumptions([a18, a19])], [c28, c29])). % 85.50/11.49 % 85.50/11.49 cnf(c31, axiom, % 85.50/11.49 ~unorthogonal_lines(orthogonal_through_point(X20,X21),X20)). % 85.50/11.49 cnf(a20, assumption, % 85.50/11.49 X4 = orthogonal_through_point(X20,X21)). % 85.50/11.49 cnf(a21, assumption, % 85.50/11.49 X3 = X20). % 85.50/11.49 cnf(c32, plain, % 85.50/11.49 apart_point_and_line(X5,X2) | ~distinct_lines(X4,X2), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a20, a21])], [c9, c31])). % 85.50/11.49 cnf(c33, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a20, a21])], [c9, c31])). % 85.50/11.49 % 85.50/11.49 cnf(c34, axiom, % 85.50/11.49 ~apart_point_and_line(intersection_point(X22,X23),X22) | ~convergent_lines(X22,X23)). % 85.50/11.49 cnf(a22, assumption, % 85.50/11.49 X5 = intersection_point(X22,X23)). % 85.50/11.49 cnf(a23, assumption, % 85.50/11.49 X2 = X22). % 85.50/11.49 cnf(c35, plain, % 85.50/11.49 ~distinct_lines(X4,X2), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a22, a23])], [c32, c34])). % 85.50/11.49 cnf(c36, plain, % 85.50/11.49 ~convergent_lines(X22,X23), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a22, a23])], [c32, c34])). % 85.50/11.49 % 85.50/11.49 cnf(c37, plain, % 85.50/11.49 convergent_lines(sK2,orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1))). % 85.50/11.49 cnf(a24, assumption, % 85.50/11.49 X22 = sK2). % 85.50/11.49 cnf(a25, assumption, % 85.50/11.49 X23 = orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)). % 85.50/11.49 cnf(c38, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(predicate_reduction, [assumptions([a24, a25])], [c36, c37])). % 85.50/11.49 % 85.50/11.49 cnf(c39, axiom, % 85.50/11.49 convergent_lines(X24,X25) | distinct_lines(X26,X25) | ~convergent_lines(X24,X26)). % 85.50/11.49 cnf(a26, assumption, % 85.50/11.49 X4 = X26). % 85.50/11.49 cnf(a27, assumption, % 85.50/11.49 X2 = X25). % 85.50/11.49 cnf(c40, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a26, a27])], [c35, c39])). % 85.50/11.49 cnf(c41, plain, % 85.50/11.49 convergent_lines(X24,X25) | ~convergent_lines(X24,X26), % 85.50/11.49 inference(strict_predicate_extension, [assumptions([a26, a27])], [c35, c39])). % 85.50/11.49 % 85.50/11.49 cnf(c42, plain, % 85.50/11.49 ~convergent_lines(X11,X12)). % 85.50/11.49 cnf(a28, assumption, % 85.50/11.49 X24 = X11). % 85.50/11.49 cnf(a29, assumption, % 85.50/11.49 X25 = X12). % 85.50/11.49 cnf(c43, plain, % 85.50/11.49 ~convergent_lines(X24,X26), % 85.50/11.49 inference(predicate_reduction, [assumptions([a28, a29])], [c41, c42])). % 85.50/11.49 % 85.50/11.49 cnf(c44, plain, % 85.50/11.49 convergent_lines(sK2,orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1))). % 85.50/11.49 cnf(a30, assumption, % 85.50/11.49 X24 = sK2). % 85.50/11.49 cnf(a31, assumption, % 85.50/11.49 X26 = orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)). % 85.50/11.49 cnf(c45, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(predicate_reduction, [assumptions([a30, a31])], [c43, c44])). % 85.50/11.49 % 85.50/11.49 cnf(c46, plain, % 85.50/11.49 $false, % 85.50/11.49 inference(constraint_solving, [ % 85.50/11.49 bind(X0, sK2), % 85.50/11.49 bind(X1, orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)), % 85.50/11.49 bind(X2, sK2), % 85.50/11.49 bind(X3, orthogonal_through_point(X9,X10)), % 85.50/11.49 bind(X4, orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)), % 85.50/11.49 bind(X5, intersection_point(X0,X1)), % 85.50/11.49 bind(X6, orthogonal_through_point(X9,X10)), % 85.50/11.49 bind(X7, sK2), % 85.50/11.49 bind(X8, sK2), % 85.50/11.49 bind(X9, sK2), % 85.50/11.49 bind(X10, sK1), % 85.50/11.49 bind(X11, sK2), % 85.50/11.49 bind(X12, sK2), % 85.50/11.49 bind(X13, sK2), % 85.50/11.49 bind(X14, sK2), % 85.50/11.49 bind(X15, orthogonal_through_point(X9,X10)), % 85.50/11.49 bind(X16, orthogonal_through_point(X9,X10)), % 85.50/11.49 bind(X17, orthogonal_through_point(X9,X10)), % 85.50/11.49 bind(X18, orthogonal_through_point(X9,X10)), % 85.50/11.49 bind(X19, sK2), % 85.50/11.49 bind(X20, orthogonal_through_point(sK2,sK1)), % 85.50/11.49 bind(X21, sK1), % 85.50/11.49 bind(X22, sK2), % 85.50/11.49 bind(X23, orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)), % 85.50/11.49 bind(X24, sK2), % 85.50/11.49 bind(X25, sK2), % 85.50/11.49 bind(X26, orthogonal_through_point(orthogonal_through_point(sK2,sK1),sK1)) % 85.50/11.49 ], % 85.50/11.49 [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])). % 85.50/11.49 % 85.50/11.49 % SZS output end IncompleteProof %------------------------------------------------------------------------------