%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM505+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 : n029.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:31 EDT 2022 % Result : Theorem 0.20s 0.43s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : NUM505+3 : TPTP v8.1.0. Released v4.0.0. % 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n029.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 : Thu Jul 7 13:59:44 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.43 % SZS status Theorem % 0.20/0.43 % SZS output begin IncompleteProof % 0.20/0.43 cnf(c0, axiom, % 0.20/0.43 ~sdtlseqdt0(xp,xk)). % 0.20/0.43 cnf(c1, plain, % 0.20/0.43 ~sdtlseqdt0(xp,xk), % 0.20/0.43 inference(start, [], [c0])). % 0.20/0.43 % 0.20/0.43 cnf(c2, axiom, % 0.20/0.43 sdtlseqdt0(X0,X1) | sdtlseqdt0(X1,X0) | ~aNaturalNumber0(X0) | ~aNaturalNumber0(X1)). % 0.20/0.43 cnf(a0, assumption, % 0.20/0.43 xp = X0). % 0.20/0.43 cnf(a1, assumption, % 0.20/0.43 xk = X1). % 0.20/0.43 cnf(c3, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.43 cnf(c4, plain, % 0.20/0.43 sdtlseqdt0(X1,X0) | ~aNaturalNumber0(X0) | ~aNaturalNumber0(X1), % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.43 % 0.20/0.43 cnf(c5, axiom, % 0.20/0.43 ~sdtlseqdt0(xk,xp) | xp = xk). % 0.20/0.43 cnf(a2, assumption, % 0.20/0.43 X1 = xk). % 0.20/0.43 cnf(a3, assumption, % 0.20/0.43 X0 = xp). % 0.20/0.43 cnf(c6, plain, % 0.20/0.43 ~aNaturalNumber0(X0) | ~aNaturalNumber0(X1), % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.43 cnf(c7, plain, % 0.20/0.43 xp = xk, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.43 % 0.20/0.43 cnf(c8, plain, % 0.20/0.43 ~sdtlseqdt0(xp,xk)). % 0.20/0.43 cnf(a4, assumption, % 0.20/0.43 xk = xk). % 0.20/0.43 cnf(a5, assumption, % 0.20/0.43 xp = X2). % 0.20/0.43 cnf(c9, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(subterm_reduction, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.43 cnf(c10, plain, % 0.20/0.43 ~sdtlseqdt0(xp,X2), % 0.20/0.43 inference(subterm_reduction, [assumptions([a4, a5])], [c7, c8])). % 0.20/0.43 % 0.20/0.43 cnf(c11, axiom, % 0.20/0.43 sdtlseqdt0(X3,X3) | ~aNaturalNumber0(X3)). % 0.20/0.43 cnf(a6, assumption, % 0.20/0.43 xp = X3). % 0.20/0.43 cnf(a7, assumption, % 0.20/0.43 X2 = X3). % 0.20/0.43 cnf(c12, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.20/0.43 cnf(c13, plain, % 0.20/0.43 ~aNaturalNumber0(X3), % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 0.20/0.43 % 0.20/0.43 cnf(c14, axiom, % 0.20/0.43 aNaturalNumber0(xp)). % 0.20/0.43 cnf(a8, assumption, % 0.20/0.43 X3 = xp). % 0.20/0.43 cnf(c15, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 0.20/0.43 cnf(c16, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a8])], [c13, c14])). % 0.20/0.43 % 0.20/0.43 cnf(c17, plain, % 0.20/0.43 aNaturalNumber0(X3)). % 0.20/0.43 cnf(a9, assumption, % 0.20/0.43 X0 = X3). % 0.20/0.43 cnf(c18, plain, % 0.20/0.43 ~aNaturalNumber0(X1), % 0.20/0.43 inference(predicate_reduction, [assumptions([a9])], [c6, c17])). % 0.20/0.43 % 0.20/0.43 cnf(c19, axiom, % 0.20/0.43 aNaturalNumber0(xk)). % 0.20/0.43 cnf(a10, assumption, % 0.20/0.43 X1 = xk). % 0.20/0.43 cnf(c20, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a10])], [c18, c19])). % 0.20/0.43 cnf(c21, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(strict_predicate_extension, [assumptions([a10])], [c18, c19])). % 0.20/0.43 % 0.20/0.43 cnf(c22, plain, % 0.20/0.43 $false, % 0.20/0.43 inference(constraint_solving, [ % 0.20/0.43 bind(X0, xp), % 0.20/0.43 bind(X1, xk), % 0.20/0.43 bind(X2, xp), % 0.20/0.43 bind(X3, xp) % 0.20/0.43 ], % 0.20/0.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.20/0.43 % 0.20/0.43 % SZS output end IncompleteProof %------------------------------------------------------------------------------