%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO226+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 05:00:11 EDT 2022 % Result : Theorem 0.09s 0.28s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : GEO226+2 : TPTP v8.1.0. Released v3.3.0. % 0.00/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.27 % Computer : n032.cluster.edu % 0.09/0.27 % Model : x86_64 x86_64 % 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.27 % Memory : 8042.1875MB % 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.27 % CPULimit : 300 % 0.09/0.27 % WCLimit : 600 % 0.09/0.27 % DateTime : Fri Jun 17 20:24:01 EDT 2022 % 0.09/0.28 % CPUTime : % 0.09/0.28 % SZS status Theorem % 0.09/0.28 % SZS output begin IncompleteProof % 0.09/0.28 cnf(c0, axiom, % 0.09/0.28 apart_point_and_line(X0,sK1) | apart_point_and_line(X0,sK0)). % 0.09/0.28 cnf(c1, plain, % 0.09/0.28 apart_point_and_line(X0,sK1) | apart_point_and_line(X0,sK0), % 0.09/0.28 inference(start, [], [c0])). % 0.09/0.28 % 0.09/0.28 cnf(c2, axiom, % 0.09/0.28 distinct_points(X1,intersection_point(X2,X3)) | ~apart_point_and_line(X1,X3) | ~convergent_lines(X2,X3)). % 0.09/0.28 cnf(a0, assumption, % 0.09/0.28 X0 = X1). % 0.09/0.28 cnf(a1, assumption, % 0.09/0.28 sK1 = X3). % 0.09/0.28 cnf(c3, plain, % 0.09/0.28 apart_point_and_line(X0,sK0), % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.09/0.28 cnf(c4, plain, % 0.09/0.28 distinct_points(X1,intersection_point(X2,X3)) | ~convergent_lines(X2,X3), % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.09/0.28 % 0.09/0.28 cnf(c5, axiom, % 0.09/0.28 ~distinct_points(X4,X4)). % 0.09/0.28 cnf(a2, assumption, % 0.09/0.28 X1 = X4). % 0.09/0.28 cnf(a3, assumption, % 0.09/0.28 intersection_point(X2,X3) = X4). % 0.09/0.28 cnf(c6, plain, % 0.09/0.28 ~convergent_lines(X2,X3), % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.09/0.28 cnf(c7, plain, % 0.09/0.28 $false, % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.09/0.28 % 0.09/0.28 cnf(c8, axiom, % 0.09/0.28 convergent_lines(sK0,sK1)). % 0.09/0.28 cnf(a4, assumption, % 0.09/0.28 X2 = sK0). % 0.09/0.28 cnf(a5, assumption, % 0.09/0.28 X3 = sK1). % 0.09/0.28 cnf(c9, plain, % 0.09/0.28 $false, % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.09/0.28 cnf(c10, plain, % 0.09/0.28 $false, % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.09/0.28 % 0.09/0.28 cnf(c11, axiom, % 0.09/0.28 distinct_points(X5,intersection_point(X6,X7)) | ~apart_point_and_line(X5,X6) | ~convergent_lines(X6,X7)). % 0.09/0.28 cnf(a6, assumption, % 0.09/0.28 X0 = X5). % 0.09/0.28 cnf(a7, assumption, % 0.09/0.28 sK0 = X6). % 0.09/0.28 cnf(c12, plain, % 0.09/0.28 $false, % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])). % 0.09/0.28 cnf(c13, plain, % 0.09/0.28 distinct_points(X5,intersection_point(X6,X7)) | ~convergent_lines(X6,X7), % 0.09/0.28 inference(strict_predicate_extension, [assumptions([a6, a7])], [c3, c11])). % 0.09/0.28 % 0.09/0.28 cnf(c14, plain, % 0.09/0.28 ~distinct_points(X1,intersection_point(X2,X3))). % 0.09/0.28 cnf(a8, assumption, % 0.09/0.28 X5 = X1). % 0.09/0.28 cnf(a9, assumption, % 0.09/0.28 intersection_point(X6,X7) = intersection_point(X2,X3)). % 0.09/0.28 cnf(c15, plain, % 0.09/0.28 ~convergent_lines(X6,X7), % 0.09/0.28 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])). % 0.09/0.28 % 0.09/0.28 cnf(c16, plain, % 0.09/0.28 convergent_lines(X2,X3)). % 0.09/0.28 cnf(a10, assumption, % 0.09/0.28 X6 = X2). % 0.09/0.28 cnf(a11, assumption, % 0.09/0.28 X7 = X3). % 0.09/0.28 cnf(c17, plain, % 0.09/0.28 $false, % 0.09/0.28 inference(predicate_reduction, [assumptions([a10, a11])], [c15, c16])). % 0.09/0.28 % 0.09/0.28 cnf(c18, plain, % 0.09/0.28 $false, % 0.09/0.28 inference(constraint_solving, [ % 0.09/0.28 bind(X0, intersection_point(X2,X3)), % 0.09/0.28 bind(X1, intersection_point(X2,X3)), % 0.09/0.28 bind(X2, sK0), % 0.09/0.28 bind(X3, sK1), % 0.09/0.28 bind(X4, intersection_point(X2,X3)), % 0.09/0.28 bind(X5, intersection_point(X2,X3)), % 0.09/0.28 bind(X6, sK0), % 0.09/0.28 bind(X7, sK1) % 0.09/0.28 ], % 0.09/0.28 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.09/0.28 % 0.09/0.28 % SZS output end IncompleteProof %------------------------------------------------------------------------------