%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM472+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 : n007.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:12 EDT 2022 % Result : Theorem 0.20s 0.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM472+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.13/0.34 % Computer : n007.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 09:46:44 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.45 % SZS status Theorem % 0.20/0.45 % SZS output begin IncompleteProof % 0.20/0.45 cnf(c0, axiom, % 0.20/0.45 ~sdtlseqdt0(xm,sdtpldt0(xm,xn))). % 0.20/0.45 cnf(c1, plain, % 0.20/0.45 ~sdtlseqdt0(xm,sdtpldt0(xm,xn)), % 0.20/0.45 inference(start, [], [c0])). % 0.20/0.45 % 0.20/0.45 cnf(c2, axiom, % 0.20/0.45 sdtlseqdt0(X0,X1) | ~sP0(X1,X0) | ~sP1(X0,X1)). % 0.20/0.45 cnf(a0, assumption, % 0.20/0.45 xm = X0). % 0.20/0.45 cnf(a1, assumption, % 0.20/0.45 sdtpldt0(xm,xn) = X1). % 0.20/0.45 cnf(c3, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.45 cnf(c4, plain, % 0.20/0.45 ~sP0(X1,X0) | ~sP1(X0,X1), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.20/0.45 % 0.20/0.45 cnf(c5, axiom, % 0.20/0.45 sP0(sdtpldt0(X2,X3),X2) | ~aNaturalNumber0(X3)). % 0.20/0.45 cnf(a2, assumption, % 0.20/0.45 X1 = sdtpldt0(X2,X3)). % 0.20/0.45 cnf(a3, assumption, % 0.20/0.45 X0 = X2). % 0.20/0.45 cnf(c6, plain, % 0.20/0.45 ~sP1(X0,X1), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.45 cnf(c7, plain, % 0.20/0.45 ~aNaturalNumber0(X3), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.20/0.45 % 0.20/0.45 cnf(c8, axiom, % 0.20/0.45 aNaturalNumber0(xn)). % 0.20/0.45 cnf(a4, assumption, % 0.20/0.45 X3 = xn). % 0.20/0.45 cnf(c9, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.20/0.45 cnf(c10, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])). % 0.20/0.45 % 0.20/0.45 cnf(c11, axiom, % 0.20/0.45 sP1(X4,X5) | ~aNaturalNumber0(X5) | ~aNaturalNumber0(X4)). % 0.20/0.45 cnf(a5, assumption, % 0.20/0.45 X0 = X4). % 0.20/0.45 cnf(a6, assumption, % 0.20/0.45 X1 = X5). % 0.20/0.45 cnf(c12, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.20/0.45 cnf(c13, plain, % 0.20/0.45 ~aNaturalNumber0(X5) | ~aNaturalNumber0(X4), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c11])). % 0.20/0.45 % 0.20/0.45 cnf(c14, axiom, % 0.20/0.45 aNaturalNumber0(sdtpldt0(X6,X7)) | ~aNaturalNumber0(X7) | ~aNaturalNumber0(X6)). % 0.20/0.45 cnf(a7, assumption, % 0.20/0.45 X5 = sdtpldt0(X6,X7)). % 0.20/0.45 cnf(c15, plain, % 0.20/0.45 ~aNaturalNumber0(X4), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.20/0.45 cnf(c16, plain, % 0.20/0.45 ~aNaturalNumber0(X7) | ~aNaturalNumber0(X6), % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])). % 0.20/0.45 % 0.20/0.45 cnf(c17, plain, % 0.20/0.45 aNaturalNumber0(X3)). % 0.20/0.45 cnf(a8, assumption, % 0.20/0.45 X7 = X3). % 0.20/0.45 cnf(c18, plain, % 0.20/0.45 ~aNaturalNumber0(X6), % 0.20/0.45 inference(predicate_reduction, [assumptions([a8])], [c16, c17])). % 0.20/0.45 % 0.20/0.45 cnf(c19, axiom, % 0.20/0.45 aNaturalNumber0(xm)). % 0.20/0.45 cnf(a9, assumption, % 0.20/0.45 X6 = xm). % 0.20/0.45 cnf(c20, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a9])], [c18, c19])). % 0.20/0.45 cnf(c21, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(strict_predicate_extension, [assumptions([a9])], [c18, c19])). % 0.20/0.45 % 0.20/0.45 cnf(c22, plain, % 0.20/0.45 aNaturalNumber0(X6)). % 0.20/0.45 cnf(a10, assumption, % 0.20/0.45 X4 = X6). % 0.20/0.45 cnf(c23, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(predicate_reduction, [assumptions([a10])], [c15, c22])). % 0.20/0.45 % 0.20/0.45 cnf(c24, plain, % 0.20/0.45 $false, % 0.20/0.45 inference(constraint_solving, [ % 0.20/0.45 bind(X0, xm), % 0.20/0.45 bind(X1, sdtpldt0(xm,xn)), % 0.20/0.45 bind(X2, xm), % 0.20/0.45 bind(X3, xn), % 0.20/0.45 bind(X4, xm), % 0.20/0.45 bind(X5, sdtpldt0(xm,xn)), % 0.20/0.45 bind(X6, xm), % 0.20/0.45 bind(X7, xn) % 0.20/0.45 ], % 0.20/0.45 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])). % 0.20/0.45 % 0.20/0.45 % SZS output end IncompleteProof %------------------------------------------------------------------------------