%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO174+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 : n007.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:33 EDT 2022 % Result : Theorem 0.20s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GEO174+2 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n007.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 : Sat Jun 18 13:13:13 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.36 % SZS status Theorem % 0.20/0.36 % SZS output begin IncompleteProof % 0.20/0.36 cnf(c0, axiom, % 0.20/0.36 distinct_points(sK0,sK1)). % 0.20/0.36 cnf(c1, plain, % 0.20/0.36 distinct_points(sK0,sK1), % 0.20/0.36 inference(start, [], [c0])). % 0.20/0.36 % 0.20/0.36 cnf(c2, axiom, % 0.20/0.36 distinct_points(X0,X1) | ~apart_point_and_line(X0,line_connecting(X1,X2)) | ~distinct_points(X1,X2)). % 0.20/0.36 cnf(a0, assumption, % 0.20/0.36 sK0 = X1). % 0.20/0.36 cnf(a1, assumption, % 0.20/0.36 sK1 = X2). % 0.20/0.36 cnf(c3, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.36 cnf(c4, plain, % 0.20/0.36 distinct_points(X0,X1) | ~apart_point_and_line(X0,line_connecting(X1,X2)), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.36 % 0.20/0.36 cnf(c5, axiom, % 0.20/0.36 ~distinct_points(X3,X3)). % 0.20/0.36 cnf(a2, assumption, % 0.20/0.36 X0 = X3). % 0.20/0.36 cnf(a3, assumption, % 0.20/0.36 X1 = X3). % 0.20/0.36 cnf(c6, plain, % 0.20/0.36 ~apart_point_and_line(X0,line_connecting(X1,X2)), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.36 cnf(c7, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.36 % 0.20/0.36 cnf(c8, axiom, % 0.20/0.36 apart_point_and_line(X4,X5) | distinct_lines(X6,X5) | ~apart_point_and_line(X4,X6)). % 0.20/0.36 cnf(a4, assumption, % 0.20/0.36 X0 = X4). % 0.20/0.36 cnf(a5, assumption, % 0.20/0.36 line_connecting(X1,X2) = X5). % 0.20/0.36 cnf(c9, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.20/0.36 cnf(c10, plain, % 0.20/0.36 distinct_lines(X6,X5) | ~apart_point_and_line(X4,X6), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.20/0.36 % 0.20/0.36 cnf(c11, axiom, % 0.20/0.36 ~distinct_lines(sK2,line_connecting(sK0,sK1))). % 0.20/0.36 cnf(a6, assumption, % 0.20/0.36 X6 = sK2). % 0.20/0.36 cnf(a7, assumption, % 0.20/0.36 X5 = line_connecting(sK0,sK1)). % 0.20/0.36 cnf(c12, plain, % 0.20/0.36 ~apart_point_and_line(X4,X6), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.20/0.36 cnf(c13, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.20/0.36 % 0.20/0.36 cnf(c14, axiom, % 0.20/0.36 apart_point_and_line(sK1,sK2) | apart_point_and_line(sK0,sK2)). % 0.20/0.36 cnf(a8, assumption, % 0.20/0.36 X4 = sK0). % 0.20/0.36 cnf(a9, assumption, % 0.20/0.36 X6 = sK2). % 0.20/0.36 cnf(c15, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.20/0.36 cnf(c16, plain, % 0.20/0.36 apart_point_and_line(sK1,sK2), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.20/0.36 % 0.20/0.36 cnf(c17, axiom, % 0.20/0.36 apart_point_and_line(X7,X8) | distinct_lines(X9,X8) | ~apart_point_and_line(X7,X9)). % 0.20/0.36 cnf(a10, assumption, % 0.20/0.36 sK1 = X7). % 0.20/0.36 cnf(a11, assumption, % 0.20/0.36 sK2 = X9). % 0.20/0.36 cnf(c18, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.20/0.36 cnf(c19, plain, % 0.20/0.36 apart_point_and_line(X7,X8) | distinct_lines(X9,X8), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.20/0.36 % 0.20/0.36 cnf(c20, axiom, % 0.20/0.36 distinct_points(X10,X11) | ~apart_point_and_line(X10,line_connecting(X12,X11)) | ~distinct_points(X12,X11)). % 0.20/0.36 cnf(a12, assumption, % 0.20/0.36 X7 = X10). % 0.20/0.36 cnf(a13, assumption, % 0.20/0.36 X8 = line_connecting(X12,X11)). % 0.20/0.36 cnf(c21, plain, % 0.20/0.36 distinct_lines(X9,X8), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 0.20/0.36 cnf(c22, plain, % 0.20/0.36 distinct_points(X10,X11) | ~distinct_points(X12,X11), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])). % 0.20/0.36 % 0.20/0.36 cnf(c23, axiom, % 0.20/0.36 ~distinct_points(X13,X13)). % 0.20/0.36 cnf(a14, assumption, % 0.20/0.36 X10 = X13). % 0.20/0.36 cnf(a15, assumption, % 0.20/0.36 X11 = X13). % 0.20/0.36 cnf(c24, plain, % 0.20/0.36 ~distinct_points(X12,X11), % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 0.20/0.36 cnf(c25, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(strict_predicate_extension, [assumptions([a14, a15])], [c22, c23])). % 0.20/0.36 % 0.20/0.36 cnf(c26, plain, % 0.20/0.36 distinct_points(sK0,sK1)). % 0.20/0.36 cnf(a16, assumption, % 0.20/0.36 X12 = sK0). % 0.20/0.36 cnf(a17, assumption, % 0.20/0.36 X11 = sK1). % 0.20/0.36 cnf(c27, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c26])). % 0.20/0.36 % 0.20/0.36 cnf(c28, plain, % 0.20/0.36 ~distinct_lines(X6,X5)). % 0.20/0.36 cnf(a18, assumption, % 0.20/0.36 X9 = X6). % 0.20/0.36 cnf(a19, assumption, % 0.20/0.36 X8 = X5). % 0.20/0.36 cnf(c29, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(predicate_reduction, [assumptions([a18, a19])], [c21, c28])). % 0.20/0.36 % 0.20/0.36 cnf(c30, plain, % 0.20/0.36 $false, % 0.20/0.36 inference(constraint_solving, [ % 0.20/0.36 bind(X0, sK0), % 0.20/0.36 bind(X1, sK0), % 0.20/0.36 bind(X2, sK1), % 0.20/0.36 bind(X3, sK0), % 0.20/0.36 bind(X4, sK0), % 0.20/0.36 bind(X5, line_connecting(X1,X2)), % 0.20/0.36 bind(X6, sK2), % 0.20/0.36 bind(X7, sK1), % 0.20/0.36 bind(X8, line_connecting(X12,X11)), % 0.20/0.36 bind(X9, sK2), % 0.20/0.36 bind(X10, sK1), % 0.20/0.36 bind(X11, sK1), % 0.20/0.36 bind(X12, sK0), % 0.20/0.36 bind(X13, sK1) % 0.20/0.36 ], % 0.20/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 0.20/0.36 % 0.20/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------