%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM477+2 : 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 : n013.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:15 EDT 2022 % Result : Theorem 29.89s 4.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : NUM477+2 : TPTP v8.1.0. Released v4.0.0. % 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.35 % Computer : n013.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue Jul 5 16:49:44 EDT 2022 % 0.13/0.35 % CPUTime : % 29.89/4.39 % SZS status Theorem % 29.89/4.39 % SZS output begin IncompleteProof % 29.89/4.39 cnf(c0, axiom, % 29.89/4.39 ~sdtlseqdt0(xm,xn)). % 29.89/4.39 cnf(c1, plain, % 29.89/4.39 ~sdtlseqdt0(xm,xn), % 29.89/4.39 inference(start, [], [c0])). % 29.89/4.39 % 29.89/4.39 cnf(c2, axiom, % 29.89/4.39 sdtlseqdt0(X0,sdtasdt0(X0,X1)) | sz00 = X1 | ~aNaturalNumber0(X0) | ~aNaturalNumber0(X1)). % 29.89/4.39 cnf(a0, assumption, % 29.89/4.39 X2 = xm). % 29.89/4.39 cnf(a1, assumption, % 29.89/4.39 X3 = xn). % 29.89/4.39 cnf(c3, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 29.89/4.39 cnf(c4, plain, % 29.89/4.39 sz00 = X1 | ~aNaturalNumber0(X0) | ~aNaturalNumber0(X1), % 29.89/4.39 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 29.89/4.39 cnf(c5, plain, % 29.89/4.39 X0 != X2 | sdtasdt0(X0,X1) != X3, % 29.89/4.39 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 29.89/4.39 % 29.89/4.39 cnf(a2, assumption, % 29.89/4.39 X0 = X2). % 29.89/4.39 cnf(c6, plain, % 29.89/4.39 sdtasdt0(X0,X1) != X3, % 29.89/4.39 inference(reflexivity, [assumptions([a2])], [c5])). % 29.89/4.39 % 29.89/4.39 cnf(c7, axiom, % 29.89/4.39 xn = sdtasdt0(xm,sK12)). % 29.89/4.39 cnf(a3, assumption, % 29.89/4.39 sdtasdt0(X0,X1) = sdtasdt0(xm,sK12)). % 29.89/4.39 cnf(c8, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_function_extension, [assumptions([a3])], [c6, c7])). % 29.89/4.39 cnf(c9, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_function_extension, [assumptions([a3])], [c6, c7])). % 29.89/4.39 cnf(c10, plain, % 29.89/4.39 X4 != xn | X4 != X3, % 29.89/4.39 inference(strict_function_extension, [assumptions([a3])], [c6, c7])). % 29.89/4.39 % 29.89/4.39 cnf(a4, assumption, % 29.89/4.39 X4 = xn). % 29.89/4.39 cnf(c11, plain, % 29.89/4.39 X4 != X3, % 29.89/4.39 inference(reflexivity, [assumptions([a4])], [c10])). % 29.89/4.39 % 29.89/4.39 cnf(a5, assumption, % 29.89/4.39 X4 = X3). % 29.89/4.39 cnf(c12, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(reflexivity, [assumptions([a5])], [c11])). % 29.89/4.39 % 29.89/4.39 cnf(c13, axiom, % 29.89/4.39 xn = sdtasdt0(xm,sK12)). % 29.89/4.39 cnf(a6, assumption, % 29.89/4.39 sK12 = X1). % 29.89/4.39 cnf(a7, assumption, % 29.89/4.39 sz00 = X5). % 29.89/4.39 cnf(c14, plain, % 29.89/4.39 ~aNaturalNumber0(X0) | ~aNaturalNumber0(X1), % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a6, a7])], [c4, c13])). % 29.89/4.39 cnf(c15, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a6, a7])], [c4, c13])). % 29.89/4.39 cnf(c16, plain, % 29.89/4.39 xn = sdtasdt0(xm,X5), % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a6, a7])], [c4, c13])). % 29.89/4.39 % 29.89/4.39 cnf(c17, axiom, % 29.89/4.39 sz00 = sdtasdt0(X6,sz00) | ~aNaturalNumber0(X6)). % 29.89/4.39 cnf(a8, assumption, % 29.89/4.39 sdtasdt0(X6,sz00) = sdtasdt0(xm,X5)). % 29.89/4.39 cnf(a9, assumption, % 29.89/4.39 xn = X7). % 29.89/4.39 cnf(c18, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a8, a9])], [c16, c17])). % 29.89/4.39 cnf(c19, plain, % 29.89/4.39 ~aNaturalNumber0(X6), % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a8, a9])], [c16, c17])). % 29.89/4.39 cnf(c20, plain, % 29.89/4.39 sz00 = X7, % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a8, a9])], [c16, c17])). % 29.89/4.39 % 29.89/4.39 cnf(c21, axiom, % 29.89/4.39 sz00 != xn). % 29.89/4.39 cnf(a10, assumption, % 29.89/4.39 xn = X7). % 29.89/4.39 cnf(a11, assumption, % 29.89/4.39 sz00 = X8). % 29.89/4.39 cnf(c22, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a10, a11])], [c20, c21])). % 29.89/4.39 cnf(c23, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a10, a11])], [c20, c21])). % 29.89/4.39 cnf(c24, plain, % 29.89/4.39 sz00 != X8, % 29.89/4.39 inference(strict_subterm_extension, [assumptions([a10, a11])], [c20, c21])). % 29.89/4.39 % 29.89/4.39 cnf(a12, assumption, % 29.89/4.39 sz00 = X8). % 29.89/4.39 cnf(c25, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(reflexivity, [assumptions([a12])], [c24])). % 29.89/4.39 % 29.89/4.39 cnf(c26, axiom, % 29.89/4.39 aNaturalNumber0(xm)). % 29.89/4.39 cnf(a13, assumption, % 29.89/4.39 X6 = xm). % 29.89/4.39 cnf(c27, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_predicate_extension, [assumptions([a13])], [c19, c26])). % 29.89/4.39 cnf(c28, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_predicate_extension, [assumptions([a13])], [c19, c26])). % 29.89/4.39 % 29.89/4.39 cnf(c29, plain, % 29.89/4.39 aNaturalNumber0(X6)). % 29.89/4.39 cnf(a14, assumption, % 29.89/4.39 X0 = X6). % 29.89/4.39 cnf(c30, plain, % 29.89/4.39 ~aNaturalNumber0(X1), % 29.89/4.39 inference(predicate_reduction, [assumptions([a14])], [c14, c29])). % 29.89/4.39 % 29.89/4.39 cnf(c31, axiom, % 29.89/4.39 aNaturalNumber0(sK12)). % 29.89/4.39 cnf(a15, assumption, % 29.89/4.39 X1 = sK12). % 29.89/4.39 cnf(c32, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_predicate_extension, [assumptions([a15])], [c30, c31])). % 29.89/4.39 cnf(c33, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(strict_predicate_extension, [assumptions([a15])], [c30, c31])). % 29.89/4.39 % 29.89/4.39 cnf(c34, plain, % 29.89/4.39 $false, % 29.89/4.39 inference(constraint_solving, [ % 29.89/4.39 bind(X0, xm), % 29.89/4.39 bind(X1, sK12), % 29.89/4.39 bind(X2, xm), % 29.89/4.39 bind(X3, xn), % 29.89/4.39 bind(X4, xn), % 29.89/4.39 bind(X5, sz00), % 29.89/4.39 bind(X6, xm), % 29.89/4.39 bind(X7, xn), % 29.89/4.39 bind(X8, sz00) % 29.89/4.39 ], % 29.89/4.39 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])). % 29.89/4.39 % 29.89/4.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------