%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM482+3 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n012.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 : Mon Jul 18 11:33:18 EDT 2022 % Result : Theorem 0.19s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : NUM482+3 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n012.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 : Tue Jul 5 04:44:00 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.43 % SZS status Theorem % 0.19/0.43 % SZS output begin IncompleteProof % 0.19/0.43 cnf(c0, axiom, % 0.19/0.43 isPrime0(xk)). % 0.19/0.43 cnf(c1, plain, % 0.19/0.43 isPrime0(xk), % 0.19/0.43 inference(start, [], [c0])). % 0.19/0.43 % 0.19/0.43 cnf(c2, axiom, % 0.19/0.43 ~isPrime0(X0) | sP18(X0) | ~aNaturalNumber0(X0)). % 0.19/0.43 cnf(a0, assumption, % 0.19/0.43 xk = X0). % 0.19/0.43 cnf(c3, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.43 cnf(c4, plain, % 0.19/0.43 sP18(X0) | ~aNaturalNumber0(X0), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.19/0.43 % 0.19/0.43 cnf(c5, axiom, % 0.19/0.43 sdtasdt0(X1,X2) != xk | ~aNaturalNumber0(X2) | ~sP18(X1)). % 0.19/0.43 cnf(a1, assumption, % 0.19/0.43 X0 = X1). % 0.19/0.43 cnf(c6, plain, % 0.19/0.43 ~aNaturalNumber0(X0), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.19/0.43 cnf(c7, plain, % 0.19/0.43 sdtasdt0(X1,X2) != xk | ~aNaturalNumber0(X2), % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.19/0.43 % 0.19/0.43 cnf(c8, axiom, % 0.19/0.43 sdtasdt0(X3,sz10) = X3 | ~aNaturalNumber0(X3)). % 0.19/0.43 cnf(a2, assumption, % 0.19/0.43 sdtasdt0(X1,X2) = sdtasdt0(X3,sz10)). % 0.19/0.43 cnf(c9, plain, % 0.19/0.43 ~aNaturalNumber0(X2), % 0.19/0.43 inference(strict_function_extension, [assumptions([a2])], [c7, c8])). % 0.19/0.43 cnf(c10, plain, % 0.19/0.43 ~aNaturalNumber0(X3), % 0.19/0.43 inference(strict_function_extension, [assumptions([a2])], [c7, c8])). % 0.19/0.43 cnf(c11, plain, % 0.19/0.43 X4 != X3 | X4 != xk, % 0.19/0.43 inference(strict_function_extension, [assumptions([a2])], [c7, c8])). % 0.19/0.43 % 0.19/0.43 cnf(a3, assumption, % 0.19/0.43 X4 = X3). % 0.19/0.43 cnf(c12, plain, % 0.19/0.43 X4 != xk, % 0.19/0.43 inference(reflexivity, [assumptions([a3])], [c11])). % 0.19/0.43 % 0.19/0.43 cnf(a4, assumption, % 0.19/0.43 X4 = xk). % 0.19/0.43 cnf(c13, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(reflexivity, [assumptions([a4])], [c12])). % 0.19/0.43 % 0.19/0.43 cnf(c14, axiom, % 0.19/0.43 aNaturalNumber0(xk)). % 0.19/0.43 cnf(a5, assumption, % 0.19/0.43 X3 = xk). % 0.19/0.43 cnf(c15, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a5])], [c10, c14])). % 0.19/0.43 cnf(c16, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a5])], [c10, c14])). % 0.19/0.43 % 0.19/0.43 cnf(c17, axiom, % 0.19/0.43 aNaturalNumber0(sz10)). % 0.19/0.43 cnf(a6, assumption, % 0.19/0.43 X2 = sz10). % 0.19/0.43 cnf(c18, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a6])], [c9, c17])). % 0.19/0.43 cnf(c19, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(strict_predicate_extension, [assumptions([a6])], [c9, c17])). % 0.19/0.43 % 0.19/0.43 cnf(c20, plain, % 0.19/0.43 aNaturalNumber0(X3)). % 0.19/0.43 cnf(a7, assumption, % 0.19/0.43 X0 = X3). % 0.19/0.43 cnf(c21, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(predicate_reduction, [assumptions([a7])], [c6, c20])). % 0.19/0.43 % 0.19/0.43 cnf(c22, plain, % 0.19/0.43 $false, % 0.19/0.43 inference(constraint_solving, [ % 0.19/0.43 bind(X0, xk), % 0.19/0.43 bind(X1, xk), % 0.19/0.43 bind(X2, sz10), % 0.19/0.43 bind(X3, xk), % 0.19/0.43 bind(X4, xk) % 0.19/0.43 ], % 0.19/0.43 [a0, a1, a2, a3, a4, a5, a6, a7])). % 0.19/0.43 % 0.19/0.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------