%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO206+3 : TPTP v8.1.0. Bugfixed v4.0.1. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n008.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:58 EDT 2022 % Result : Theorem 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : GEO206+3 : TPTP v8.1.0. Bugfixed v4.0.1. % 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n008.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sat Jun 18 15:36:22 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.35 % SZS status Theorem % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~equal_lines(sK3,parallel_through_point(sK4,sK2))). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~equal_lines(sK3,parallel_through_point(sK4,sK2)), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 equal_lines(X0,X1) | distinct_lines(X0,X1)). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 sK3 = X0). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 parallel_through_point(sK4,sK2) = X1). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 distinct_lines(X0,X1), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 convergent_lines(X2,X3) | ~distinct_lines(X2,X3)). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 X0 = X2). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 X1 = X3). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 convergent_lines(X2,X3), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 convergent_lines(X4,X5) | convergent_lines(X6,X5) | ~convergent_lines(X6,X4)). % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 X2 = X6). % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 X3 = X4). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 convergent_lines(X4,X5) | convergent_lines(X6,X5), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c11, axiom, % 0.14/0.35 ~convergent_lines(parallel_through_point(X7,X8),X7)). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 X4 = parallel_through_point(X7,X8)). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 X5 = X7). % 0.14/0.35 cnf(c12, plain, % 0.14/0.35 convergent_lines(X6,X5), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.14/0.35 cnf(c13, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.14/0.35 % 0.14/0.35 cnf(c14, axiom, % 0.14/0.35 ~convergent_lines(X9,X10) | ~parallel_lines(X9,X10)). % 0.14/0.35 cnf(a8, assumption, % 0.14/0.35 X6 = X9). % 0.14/0.35 cnf(a9, assumption, % 0.14/0.35 X5 = X10). % 0.14/0.35 cnf(c15, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.14/0.35 cnf(c16, plain, % 0.14/0.35 ~parallel_lines(X9,X10), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c14])). % 0.14/0.35 % 0.14/0.35 cnf(c17, axiom, % 0.14/0.35 parallel_lines(sK3,sK4)). % 0.14/0.35 cnf(a10, assumption, % 0.14/0.35 X9 = sK3). % 0.14/0.35 cnf(a11, assumption, % 0.14/0.35 X10 = sK4). % 0.14/0.35 cnf(c18, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.14/0.35 cnf(c19, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])). % 0.14/0.35 % 0.14/0.35 cnf(c20, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, sK3), % 0.14/0.35 bind(X1, parallel_through_point(sK4,sK2)), % 0.14/0.35 bind(X2, sK3), % 0.14/0.35 bind(X3, parallel_through_point(sK4,sK2)), % 0.14/0.35 bind(X4, parallel_through_point(sK4,sK2)), % 0.14/0.35 bind(X5, sK4), % 0.14/0.35 bind(X6, sK3), % 0.14/0.35 bind(X7, sK4), % 0.14/0.35 bind(X8, sK2), % 0.14/0.35 bind(X9, sK3), % 0.14/0.35 bind(X10, sK4) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------