%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO203+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 : n014.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 0.16s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.14 % Problem : GEO203+1 : TPTP v8.1.0. Released v3.3.0. % 0.09/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.16/0.37 % Computer : n014.cluster.edu % 0.16/0.37 % Model : x86_64 x86_64 % 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.37 % Memory : 8042.1875MB % 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.37 % CPULimit : 300 % 0.16/0.37 % WCLimit : 600 % 0.16/0.37 % DateTime : Sat Jun 18 06:13:04 EDT 2022 % 0.16/0.37 % CPUTime : % 0.16/0.39 % SZS status Theorem % 0.16/0.39 % SZS output begin IncompleteProof % 0.16/0.39 cnf(c0, axiom, % 0.16/0.39 distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))). % 0.16/0.39 cnf(c1, plain, % 0.16/0.39 distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)), % 0.16/0.39 inference(start, [], [c0])). % 0.16/0.39 % 0.16/0.39 cnf(c2, axiom, % 0.16/0.39 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)). % 0.16/0.39 cnf(a0, assumption, % 0.16/0.39 intersection_point(sK0,sK1) = X3). % 0.16/0.39 cnf(a1, assumption, % 0.16/0.39 intersection_point(sK0,sK2) = X0). % 0.16/0.39 cnf(c3, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.16/0.39 cnf(c4, plain, % 0.16/0.39 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), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.16/0.39 % 0.16/0.39 cnf(c5, axiom, % 0.16/0.39 ~apart_point_and_line(intersection_point(X4,X5),X4) | ~convergent_lines(X4,X5)). % 0.16/0.39 cnf(a2, assumption, % 0.16/0.39 X0 = intersection_point(X4,X5)). % 0.16/0.39 cnf(a3, assumption, % 0.16/0.39 X1 = X4). % 0.16/0.39 cnf(c6, plain, % 0.16/0.39 apart_point_and_line(X0,X2) | apart_point_and_line(X3,X1) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.16/0.39 cnf(c7, plain, % 0.16/0.39 ~convergent_lines(X4,X5), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.16/0.39 % 0.16/0.39 cnf(c8, axiom, % 0.16/0.39 convergent_lines(sK0,sK2)). % 0.16/0.39 cnf(a4, assumption, % 0.16/0.39 X4 = sK0). % 0.16/0.39 cnf(a5, assumption, % 0.16/0.39 X5 = sK2). % 0.16/0.39 cnf(c9, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.16/0.39 cnf(c10, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.16/0.39 % 0.16/0.39 cnf(c11, axiom, % 0.16/0.39 ~apart_point_and_line(X6,line_connecting(X7,X6)) | ~distinct_points(X7,X6)). % 0.16/0.39 cnf(a6, assumption, % 0.16/0.39 X0 = X6). % 0.16/0.39 cnf(a7, assumption, % 0.16/0.39 X2 = line_connecting(X7,X6)). % 0.16/0.39 cnf(c12, plain, % 0.16/0.39 apart_point_and_line(X3,X1) | apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 0.16/0.39 cnf(c13, plain, % 0.16/0.39 ~distinct_points(X7,X6), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a6, a7])], [c6, c11])). % 0.16/0.39 % 0.16/0.39 cnf(c14, plain, % 0.16/0.39 distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))). % 0.16/0.39 cnf(a8, assumption, % 0.16/0.39 X7 = intersection_point(sK0,sK1)). % 0.16/0.39 cnf(a9, assumption, % 0.16/0.39 X6 = intersection_point(sK0,sK2)). % 0.16/0.39 cnf(c15, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])). % 0.16/0.39 % 0.16/0.39 cnf(c16, axiom, % 0.16/0.39 ~apart_point_and_line(intersection_point(X8,X9),X8) | ~convergent_lines(X8,X9)). % 0.16/0.39 cnf(a10, assumption, % 0.16/0.39 X3 = intersection_point(X8,X9)). % 0.16/0.39 cnf(a11, assumption, % 0.16/0.39 X1 = X8). % 0.16/0.39 cnf(c17, plain, % 0.16/0.39 apart_point_and_line(X3,X2) | ~distinct_lines(X2,X1), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])). % 0.16/0.39 cnf(c18, plain, % 0.16/0.39 ~convergent_lines(X8,X9), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a10, a11])], [c12, c16])). % 0.16/0.39 % 0.16/0.39 cnf(c19, axiom, % 0.16/0.39 convergent_lines(sK0,sK1)). % 0.16/0.39 cnf(a12, assumption, % 0.16/0.39 X8 = sK0). % 0.16/0.39 cnf(a13, assumption, % 0.16/0.39 X9 = sK1). % 0.16/0.39 cnf(c20, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])). % 0.16/0.39 cnf(c21, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])). % 0.16/0.39 % 0.16/0.39 cnf(c22, axiom, % 0.16/0.39 ~apart_point_and_line(X10,line_connecting(X10,X11)) | ~distinct_points(X10,X11)). % 0.16/0.39 cnf(a14, assumption, % 0.16/0.39 X3 = X10). % 0.16/0.39 cnf(a15, assumption, % 0.16/0.39 X2 = line_connecting(X10,X11)). % 0.16/0.39 cnf(c23, plain, % 0.16/0.39 ~distinct_lines(X2,X1), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c22])). % 0.16/0.39 cnf(c24, plain, % 0.16/0.39 ~distinct_points(X10,X11), % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a14, a15])], [c17, c22])). % 0.16/0.39 % 0.16/0.39 cnf(c25, plain, % 0.16/0.39 distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))). % 0.16/0.39 cnf(a16, assumption, % 0.16/0.39 X10 = intersection_point(sK0,sK1)). % 0.16/0.39 cnf(a17, assumption, % 0.16/0.39 X11 = intersection_point(sK0,sK2)). % 0.16/0.39 cnf(c26, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])). % 0.16/0.39 % 0.16/0.39 cnf(c27, axiom, % 0.16/0.39 distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)). % 0.16/0.39 cnf(a18, assumption, % 0.16/0.39 X2 = line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))). % 0.16/0.39 cnf(a19, assumption, % 0.16/0.39 X1 = sK0). % 0.16/0.39 cnf(c28, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])). % 0.16/0.39 cnf(c29, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])). % 0.16/0.39 % 0.16/0.39 cnf(c30, plain, % 0.16/0.39 $false, % 0.16/0.39 inference(constraint_solving, [ % 0.16/0.39 bind(X0, intersection_point(sK0,sK2)), % 0.16/0.39 bind(X1, sK0), % 0.16/0.39 bind(X2, line_connecting(X7,X6)), % 0.16/0.39 bind(X3, intersection_point(sK0,sK1)), % 0.16/0.39 bind(X4, sK0), % 0.16/0.39 bind(X5, sK2), % 0.16/0.39 bind(X6, intersection_point(sK0,sK2)), % 0.16/0.39 bind(X7, intersection_point(sK0,sK1)), % 0.16/0.39 bind(X8, sK0), % 0.16/0.39 bind(X9, sK1), % 0.16/0.39 bind(X10, intersection_point(sK0,sK1)), % 0.16/0.39 bind(X11, intersection_point(sK0,sK2)) % 0.16/0.39 ], % 0.16/0.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 0.16/0.39 % 0.16/0.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------