%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM482+1 : 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 : 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 : Mon Jul 18 11:33:18 EDT 2022 % Result : Theorem 13.45s 2.19s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM482+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % 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 : Thu Jul 7 05:53:38 EDT 2022 % 0.12/0.34 % CPUTime : % 13.45/2.19 % SZS status Theorem % 13.45/2.19 % SZS output begin IncompleteProof % 13.45/2.19 cnf(c0, axiom, % 13.45/2.19 ~isPrime0(X0) | ~doDivides0(X0,xk) | ~aNaturalNumber0(X0)). % 13.45/2.19 cnf(c1, plain, % 13.45/2.19 ~isPrime0(X0) | ~doDivides0(X0,xk) | ~aNaturalNumber0(X0), % 13.45/2.19 inference(start, [], [c0])). % 13.45/2.19 % 13.45/2.19 cnf(c2, axiom, % 13.45/2.19 isPrime0(xk)). % 13.45/2.19 cnf(a0, assumption, % 13.45/2.19 X0 = xk). % 13.45/2.19 cnf(c3, plain, % 13.45/2.19 ~doDivides0(X0,xk) | ~aNaturalNumber0(X0), % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 13.45/2.19 cnf(c4, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 13.45/2.19 % 13.45/2.19 cnf(c5, axiom, % 13.45/2.19 doDivides0(X1,X2) | ~sP6(X2,X1) | ~sP7(X1,X2)). % 13.45/2.19 cnf(a1, assumption, % 13.45/2.19 X0 = X1). % 13.45/2.19 cnf(a2, assumption, % 13.45/2.19 xk = X2). % 13.45/2.19 cnf(c6, plain, % 13.45/2.19 ~aNaturalNumber0(X0), % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a1, a2])], [c3, c5])). % 13.45/2.19 cnf(c7, plain, % 13.45/2.19 ~sP6(X2,X1) | ~sP7(X1,X2), % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a1, a2])], [c3, c5])). % 13.45/2.19 % 13.45/2.19 cnf(c8, axiom, % 13.45/2.19 sP6(sdtasdt0(X3,X4),X3) | ~aNaturalNumber0(X4)). % 13.45/2.19 cnf(a3, assumption, % 13.45/2.19 X5 = X2). % 13.45/2.19 cnf(a4, assumption, % 13.45/2.19 X6 = X1). % 13.45/2.19 cnf(c9, plain, % 13.45/2.19 ~sP7(X1,X2), % 13.45/2.19 inference(lazy_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 13.45/2.19 cnf(c10, plain, % 13.45/2.19 ~aNaturalNumber0(X4), % 13.45/2.19 inference(lazy_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 13.45/2.19 cnf(c11, plain, % 13.45/2.19 sdtasdt0(X3,X4) != X5 | X3 != X6, % 13.45/2.19 inference(lazy_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 13.45/2.19 % 13.45/2.19 cnf(c12, axiom, % 13.45/2.19 sdtasdt0(X7,sz10) = X7 | ~aNaturalNumber0(X7)). % 13.45/2.19 cnf(a5, assumption, % 13.45/2.19 sdtasdt0(X3,X4) = sdtasdt0(X7,sz10)). % 13.45/2.19 cnf(c13, plain, % 13.45/2.19 X3 != X6, % 13.45/2.19 inference(strict_function_extension, [assumptions([a5])], [c11, c12])). % 13.45/2.19 cnf(c14, plain, % 13.45/2.19 ~aNaturalNumber0(X7), % 13.45/2.19 inference(strict_function_extension, [assumptions([a5])], [c11, c12])). % 13.45/2.19 cnf(c15, plain, % 13.45/2.19 X8 != X7 | X8 != X5, % 13.45/2.19 inference(strict_function_extension, [assumptions([a5])], [c11, c12])). % 13.45/2.19 % 13.45/2.19 cnf(a6, assumption, % 13.45/2.19 X8 = X7). % 13.45/2.19 cnf(c16, plain, % 13.45/2.19 X8 != X5, % 13.45/2.19 inference(reflexivity, [assumptions([a6])], [c15])). % 13.45/2.19 % 13.45/2.19 cnf(a7, assumption, % 13.45/2.19 X8 = X5). % 13.45/2.19 cnf(c17, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(reflexivity, [assumptions([a7])], [c16])). % 13.45/2.19 % 13.45/2.19 cnf(c18, axiom, % 13.45/2.19 aNaturalNumber0(xk)). % 13.45/2.19 cnf(a8, assumption, % 13.45/2.19 X7 = xk). % 13.45/2.19 cnf(c19, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a8])], [c14, c18])). % 13.45/2.19 cnf(c20, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a8])], [c14, c18])). % 13.45/2.19 % 13.45/2.19 cnf(a9, assumption, % 13.45/2.19 X3 = X6). % 13.45/2.19 cnf(c21, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(reflexivity, [assumptions([a9])], [c13])). % 13.45/2.19 % 13.45/2.19 cnf(c22, axiom, % 13.45/2.19 aNaturalNumber0(sz10)). % 13.45/2.19 cnf(a10, assumption, % 13.45/2.19 X4 = sz10). % 13.45/2.19 cnf(c23, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a10])], [c10, c22])). % 13.45/2.19 cnf(c24, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a10])], [c10, c22])). % 13.45/2.19 % 13.45/2.19 cnf(c25, axiom, % 13.45/2.19 sP7(X9,X10) | ~aNaturalNumber0(X10) | ~aNaturalNumber0(X9)). % 13.45/2.19 cnf(a11, assumption, % 13.45/2.19 X1 = X9). % 13.45/2.19 cnf(a12, assumption, % 13.45/2.19 X2 = X10). % 13.45/2.19 cnf(c26, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c25])). % 13.45/2.19 cnf(c27, plain, % 13.45/2.19 ~aNaturalNumber0(X10) | ~aNaturalNumber0(X9), % 13.45/2.19 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c25])). % 13.45/2.19 % 13.45/2.19 cnf(c28, plain, % 13.45/2.19 aNaturalNumber0(X7)). % 13.45/2.19 cnf(a13, assumption, % 13.45/2.19 X10 = X7). % 13.45/2.19 cnf(c29, plain, % 13.45/2.19 ~aNaturalNumber0(X9), % 13.45/2.19 inference(predicate_reduction, [assumptions([a13])], [c27, c28])). % 13.45/2.19 % 13.45/2.19 cnf(c30, plain, % 13.45/2.19 aNaturalNumber0(X7)). % 13.45/2.19 cnf(a14, assumption, % 13.45/2.19 X9 = X7). % 13.45/2.19 cnf(c31, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(predicate_reduction, [assumptions([a14])], [c29, c30])). % 13.45/2.19 % 13.45/2.19 cnf(c32, plain, % 13.45/2.19 aNaturalNumber0(X7)). % 13.45/2.19 cnf(a15, assumption, % 13.45/2.19 X0 = X7). % 13.45/2.19 cnf(c33, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(predicate_reduction, [assumptions([a15])], [c6, c32])). % 13.45/2.19 % 13.45/2.19 cnf(c34, plain, % 13.45/2.19 $false, % 13.45/2.19 inference(constraint_solving, [ % 13.45/2.19 bind(X0, xk), % 13.45/2.19 bind(X1, xk), % 13.45/2.19 bind(X2, xk), % 13.45/2.19 bind(X3, xk), % 13.45/2.19 bind(X4, sz10), % 13.45/2.19 bind(X5, xk), % 13.45/2.19 bind(X6, xk), % 13.45/2.19 bind(X7, xk), % 13.45/2.19 bind(X8, xk), % 13.45/2.19 bind(X9, xk), % 13.45/2.19 bind(X10, xk) % 13.45/2.19 ], % 13.45/2.19 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 13.45/2.19 % 13.45/2.19 % SZS output end IncompleteProof %------------------------------------------------------------------------------