TSTP Solution File: NUM500+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM500+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 : n027.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:28 EDT 2022
% Result : Theorem 19.24s 2.86s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM500+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jul 7 02:11:29 EDT 2022
% 0.11/0.33 % CPUTime :
% 19.24/2.86 % SZS status Theorem
% 19.24/2.86 % SZS output begin IncompleteProof
% 19.24/2.86 cnf(c0, axiom,
% 19.24/2.86 ~isPrime0(X0) | sP23(X0) | ~aNaturalNumber0(X0)).
% 19.24/2.86 cnf(c1, plain,
% 19.24/2.86 ~isPrime0(X0) | sP23(X0) | ~aNaturalNumber0(X0),
% 19.24/2.86 inference(start, [], [c0])).
% 19.24/2.86
% 19.24/2.86 cnf(c2, axiom,
% 19.24/2.86 isPrime0(sK27(X1)) | ~sP13(X1)).
% 19.24/2.86 cnf(a0, assumption,
% 19.24/2.86 X0 = sK27(X1)).
% 19.24/2.86 cnf(c3, plain,
% 19.24/2.86 sP23(X0) | ~aNaturalNumber0(X0),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 19.24/2.86 cnf(c4, plain,
% 19.24/2.86 ~sP13(X1),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 19.24/2.86
% 19.24/2.86 cnf(c5, axiom,
% 19.24/2.86 sP13(X2) | sz10 = X2 | sz00 = X2 | ~aNaturalNumber0(X2)).
% 19.24/2.86 cnf(a1, assumption,
% 19.24/2.86 X1 = X2).
% 19.24/2.86 cnf(c6, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 19.24/2.86 cnf(c7, plain,
% 19.24/2.86 sz10 = X2 | sz00 = X2 | ~aNaturalNumber0(X2),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 19.24/2.86
% 19.24/2.86 cnf(c8, axiom,
% 19.24/2.86 sz10 != xk).
% 19.24/2.86 cnf(a2, assumption,
% 19.24/2.86 xk = X2).
% 19.24/2.86 cnf(a3, assumption,
% 19.24/2.86 sz10 = X3).
% 19.24/2.86 cnf(c9, plain,
% 19.24/2.86 sz00 = X2 | ~aNaturalNumber0(X2),
% 19.24/2.86 inference(strict_subterm_extension, [assumptions([a2, a3])], [c7, c8])).
% 19.24/2.86 cnf(c10, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_subterm_extension, [assumptions([a2, a3])], [c7, c8])).
% 19.24/2.86 cnf(c11, plain,
% 19.24/2.86 sz10 != X3,
% 19.24/2.86 inference(strict_subterm_extension, [assumptions([a2, a3])], [c7, c8])).
% 19.24/2.86
% 19.24/2.86 cnf(a4, assumption,
% 19.24/2.86 sz10 = X3).
% 19.24/2.86 cnf(c12, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(reflexivity, [assumptions([a4])], [c11])).
% 19.24/2.86
% 19.24/2.86 cnf(c13, axiom,
% 19.24/2.86 sz00 != xk).
% 19.24/2.86 cnf(a5, assumption,
% 19.24/2.86 xk = X2).
% 19.24/2.86 cnf(a6, assumption,
% 19.24/2.86 sz00 = X4).
% 19.24/2.86 cnf(c14, plain,
% 19.24/2.86 ~aNaturalNumber0(X2),
% 19.24/2.86 inference(strict_subterm_extension, [assumptions([a5, a6])], [c9, c13])).
% 19.24/2.86 cnf(c15, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_subterm_extension, [assumptions([a5, a6])], [c9, c13])).
% 19.24/2.86 cnf(c16, plain,
% 19.24/2.86 sz00 != X4,
% 19.24/2.86 inference(strict_subterm_extension, [assumptions([a5, a6])], [c9, c13])).
% 19.24/2.86
% 19.24/2.86 cnf(a7, assumption,
% 19.24/2.86 sz00 = X4).
% 19.24/2.86 cnf(c17, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(reflexivity, [assumptions([a7])], [c16])).
% 19.24/2.86
% 19.24/2.86 cnf(c18, axiom,
% 19.24/2.86 aNaturalNumber0(xk)).
% 19.24/2.86 cnf(a8, assumption,
% 19.24/2.86 X2 = xk).
% 19.24/2.86 cnf(c19, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a8])], [c14, c18])).
% 19.24/2.86 cnf(c20, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a8])], [c14, c18])).
% 19.24/2.86
% 19.24/2.86 cnf(c21, axiom,
% 19.24/2.86 ~doDivides0(X5,xk) | ~sP23(X5)).
% 19.24/2.86 cnf(a9, assumption,
% 19.24/2.86 X0 = X5).
% 19.24/2.86 cnf(c22, plain,
% 19.24/2.86 ~aNaturalNumber0(X0),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a9])], [c3, c21])).
% 19.24/2.86 cnf(c23, plain,
% 19.24/2.86 ~doDivides0(X5,xk),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a9])], [c3, c21])).
% 19.24/2.86
% 19.24/2.86 cnf(c24, axiom,
% 19.24/2.86 doDivides0(sK27(X6),X6) | ~sP13(X6)).
% 19.24/2.86 cnf(a10, assumption,
% 19.24/2.86 X5 = sK27(X6)).
% 19.24/2.86 cnf(a11, assumption,
% 19.24/2.86 xk = X6).
% 19.24/2.86 cnf(c25, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a10, a11])], [c23, c24])).
% 19.24/2.86 cnf(c26, plain,
% 19.24/2.86 ~sP13(X6),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a10, a11])], [c23, c24])).
% 19.24/2.86
% 19.24/2.86 cnf(c27, plain,
% 19.24/2.86 sP13(X1)).
% 19.24/2.86 cnf(a12, assumption,
% 19.24/2.86 X6 = X1).
% 19.24/2.86 cnf(c28, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(predicate_reduction, [assumptions([a12])], [c26, c27])).
% 19.24/2.86
% 19.24/2.86 cnf(c29, axiom,
% 19.24/2.86 aNaturalNumber0(sK27(X7)) | ~sP13(X7)).
% 19.24/2.86 cnf(a13, assumption,
% 19.24/2.86 X0 = sK27(X7)).
% 19.24/2.86 cnf(c30, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a13])], [c22, c29])).
% 19.24/2.86 cnf(c31, plain,
% 19.24/2.86 ~sP13(X7),
% 19.24/2.86 inference(strict_predicate_extension, [assumptions([a13])], [c22, c29])).
% 19.24/2.86
% 19.24/2.86 cnf(c32, plain,
% 19.24/2.86 sP13(X1)).
% 19.24/2.86 cnf(a14, assumption,
% 19.24/2.86 X7 = X1).
% 19.24/2.86 cnf(c33, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(predicate_reduction, [assumptions([a14])], [c31, c32])).
% 19.24/2.86
% 19.24/2.86 cnf(c34, plain,
% 19.24/2.86 $false,
% 19.24/2.86 inference(constraint_solving, [
% 19.24/2.86 bind(X0, sK27(X1)),
% 19.24/2.86 bind(X1, xk),
% 19.24/2.86 bind(X2, xk),
% 19.24/2.86 bind(X3, sz10),
% 19.24/2.86 bind(X4, sz00),
% 19.24/2.86 bind(X5, sK27(X1)),
% 19.24/2.86 bind(X6, xk),
% 19.24/2.86 bind(X7, xk)
% 19.24/2.86 ],
% 19.24/2.86 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14])).
% 19.24/2.86
% 19.24/2.86 % SZS output end IncompleteProof
%------------------------------------------------------------------------------