%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO219+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 : n015.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:07 EDT 2022 % Result : Theorem 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GEO219+2 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n015.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 04:09:13 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Theorem % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~convergent_lines(sK1,sK3)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~convergent_lines(sK1,sK3), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 ~unorthogonal_lines(X0,X1) | ~convergent_lines(X0,X1) | convergent_lines(X2,X1) | sP0(X0,X2)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 sK1 = X2). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 sK3 = X1). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 ~unorthogonal_lines(X0,X1) | ~convergent_lines(X0,X1) | sP0(X0,X2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, axiom, % 0.13/0.35 unorthogonal_lines(sK2,sK3)). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 X0 = sK2). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X1 = sK3). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~convergent_lines(X0,X1) | sP0(X0,X2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c8, axiom, % 0.13/0.35 convergent_lines(X3,X4) | convergent_lines(X5,X4) | ~convergent_lines(X5,X3)). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X0 = X3). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X1 = X4). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 sP0(X0,X2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 convergent_lines(X5,X4) | ~convergent_lines(X5,X3), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.13/0.35 % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 ~convergent_lines(sK1,sK3)). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X5 = sK1). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 X4 = sK3). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 ~convergent_lines(X5,X3), % 0.13/0.35 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 0.13/0.35 % 0.13/0.35 cnf(c13, axiom, % 0.13/0.35 unorthogonal_lines(X6,X7) | convergent_lines(X6,X7)). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 X5 = X6). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 X3 = X7). % 0.13/0.35 cnf(c14, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 unorthogonal_lines(X6,X7), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c13])). % 0.13/0.35 % 0.13/0.35 cnf(c16, axiom, % 0.13/0.35 ~unorthogonal_lines(sK1,sK2)). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X6 = sK1). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 X7 = sK2). % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])). % 0.13/0.35 cnf(c18, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c16])). % 0.13/0.35 % 0.13/0.35 cnf(c19, axiom, % 0.13/0.35 unorthogonal_lines(X8,X9) | ~sP0(X9,X8)). % 0.13/0.35 cnf(a12, assumption, % 0.13/0.35 X0 = X9). % 0.13/0.35 cnf(a13, assumption, % 0.13/0.35 X2 = X8). % 0.13/0.35 cnf(c20, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c19])). % 0.13/0.35 cnf(c21, plain, % 0.13/0.35 unorthogonal_lines(X8,X9), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a12, a13])], [c9, c19])). % 0.13/0.35 % 0.13/0.35 cnf(c22, plain, % 0.13/0.35 ~unorthogonal_lines(X6,X7)). % 0.13/0.35 cnf(a14, assumption, % 0.13/0.35 X8 = X6). % 0.13/0.35 cnf(a15, assumption, % 0.13/0.35 X9 = X7). % 0.13/0.35 cnf(c23, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a14, a15])], [c21, c22])). % 0.13/0.35 % 0.13/0.35 cnf(c24, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, sK2), % 0.13/0.35 bind(X1, sK3), % 0.13/0.35 bind(X2, sK1), % 0.13/0.35 bind(X3, sK2), % 0.13/0.35 bind(X4, sK3), % 0.13/0.35 bind(X5, sK1), % 0.13/0.35 bind(X6, sK1), % 0.13/0.35 bind(X7, sK2), % 0.13/0.35 bind(X8, sK1), % 0.13/0.35 bind(X9, sK2) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------