%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : GEO300+1 : TPTP v8.1.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n028.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:34 EDT 2022 % Result : Theorem 0.20s 0.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : GEO300+1 : TPTP v8.1.0. Released v4.1.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n028.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sat Jun 18 14:37:44 EDT 2022 % 0.12/0.33 % CPUTime : % 0.20/0.51 % SZS status Theorem % 0.20/0.51 % SZS output begin IncompleteProof % 0.20/0.51 cnf(c0, axiom, % 0.20/0.51 vf(sK44,sK40) != vplus(vf(sK44,sK46),vf(sK46,sK40))). % 0.20/0.51 cnf(c1, plain, % 0.20/0.51 vf(sK44,sK40) != vplus(vf(sK44,sK46),vf(sK46,sK40)), % 0.20/0.51 inference(start, [], [c0])). % 0.20/0.51 % 0.20/0.51 cnf(c2, axiom, % 0.20/0.51 vf(X0,X1) = vplus(vf(X0,X2),vf(X2,X1)) | ~rpoint(X0) | ~rpoint(X2) | ~rpoint(X1) | ~rR(X2,X0,X1)). % 0.20/0.51 cnf(a0, assumption, % 0.20/0.51 vplus(vf(sK44,sK46),vf(sK46,sK40)) = vplus(vf(X0,X2),vf(X2,X1))). % 0.20/0.51 cnf(c3, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.51 cnf(c4, plain, % 0.20/0.51 ~rpoint(X0) | ~rpoint(X2) | ~rpoint(X1) | ~rR(X2,X0,X1), % 0.20/0.51 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.51 cnf(c5, plain, % 0.20/0.51 X3 != vf(X0,X1) | vf(sK44,sK40) != X3, % 0.20/0.51 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.51 % 0.20/0.51 cnf(a1, assumption, % 0.20/0.51 X3 = vf(X0,X1)). % 0.20/0.51 cnf(c6, plain, % 0.20/0.51 vf(sK44,sK40) != X3, % 0.20/0.51 inference(reflexivity, [assumptions([a1])], [c5])). % 0.20/0.51 % 0.20/0.51 cnf(a2, assumption, % 0.20/0.51 vf(sK44,sK40) = X3). % 0.20/0.51 cnf(c7, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(reflexivity, [assumptions([a2])], [c6])). % 0.20/0.51 % 0.20/0.51 cnf(c8, axiom, % 0.20/0.51 rpoint(sK44)). % 0.20/0.51 cnf(a3, assumption, % 0.20/0.51 X0 = sK44). % 0.20/0.51 cnf(c9, plain, % 0.20/0.51 ~rpoint(X2) | ~rpoint(X1) | ~rR(X2,X0,X1), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a3])], [c4, c8])). % 0.20/0.51 cnf(c10, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a3])], [c4, c8])). % 0.20/0.51 % 0.20/0.51 cnf(c11, axiom, % 0.20/0.51 rpoint(sK46)). % 0.20/0.51 cnf(a4, assumption, % 0.20/0.51 X2 = sK46). % 0.20/0.51 cnf(c12, plain, % 0.20/0.51 ~rpoint(X1) | ~rR(X2,X0,X1), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a4])], [c9, c11])). % 0.20/0.51 cnf(c13, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a4])], [c9, c11])). % 0.20/0.51 % 0.20/0.51 cnf(c14, axiom, % 0.20/0.51 rpoint(sK40)). % 0.20/0.51 cnf(a5, assumption, % 0.20/0.51 X1 = sK40). % 0.20/0.51 cnf(c15, plain, % 0.20/0.51 ~rR(X2,X0,X1), % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a5])], [c12, c14])). % 0.20/0.51 cnf(c16, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a5])], [c12, c14])). % 0.20/0.51 % 0.20/0.51 cnf(c17, axiom, % 0.20/0.51 rR(sK46,sK44,sK40)). % 0.20/0.51 cnf(a6, assumption, % 0.20/0.51 X2 = sK46). % 0.20/0.51 cnf(a7, assumption, % 0.20/0.51 X0 = sK44). % 0.20/0.51 cnf(a8, assumption, % 0.20/0.51 X1 = sK40). % 0.20/0.51 cnf(c18, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c15, c17])). % 0.20/0.51 cnf(c19, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c15, c17])). % 0.20/0.51 % 0.20/0.51 cnf(c20, plain, % 0.20/0.51 $false, % 0.20/0.51 inference(constraint_solving, [ % 0.20/0.51 bind(X0, sK44), % 0.20/0.51 bind(X1, sK40), % 0.20/0.51 bind(X2, sK46), % 0.20/0.51 bind(X3, vf(X0,X1)) % 0.20/0.51 ], % 0.20/0.51 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 0.20/0.51 % 0.20/0.51 % SZS output end IncompleteProof %------------------------------------------------------------------------------