TSTP Solution File: NUM484+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM484+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 : n004.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:19 EDT 2022
% Result : Theorem 2.30s 0.66s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM484+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n004.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 13:42:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.30/0.66 % SZS status Theorem
% 2.30/0.66 % SZS output begin IncompleteProof
% 2.30/0.66 cnf(c0, axiom,
% 2.30/0.66 ~isPrime0(X0) | ~doDivides0(X0,xk) | ~aNaturalNumber0(X0)).
% 2.30/0.66 cnf(c1, plain,
% 2.30/0.66 ~isPrime0(X0) | ~doDivides0(X0,xk) | ~aNaturalNumber0(X0),
% 2.30/0.66 inference(start, [], [c0])).
% 2.30/0.66
% 2.30/0.66 cnf(c2, axiom,
% 2.30/0.66 isPrime0(xk)).
% 2.30/0.66 cnf(a0, assumption,
% 2.30/0.66 X0 = xk).
% 2.30/0.66 cnf(c3, plain,
% 2.30/0.66 ~doDivides0(X0,xk) | ~aNaturalNumber0(X0),
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.30/0.66 cnf(c4, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.30/0.66
% 2.30/0.66 cnf(c5, axiom,
% 2.30/0.66 doDivides0(X1,X2) | ~sP6(X2,X1) | ~sP7(X1,X2)).
% 2.30/0.66 cnf(a1, assumption,
% 2.30/0.66 X0 = X1).
% 2.30/0.66 cnf(a2, assumption,
% 2.30/0.66 xk = X2).
% 2.30/0.66 cnf(c6, plain,
% 2.30/0.66 ~aNaturalNumber0(X0),
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a1, a2])], [c3, c5])).
% 2.30/0.66 cnf(c7, plain,
% 2.30/0.66 ~sP6(X2,X1) | ~sP7(X1,X2),
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a1, a2])], [c3, c5])).
% 2.30/0.66
% 2.30/0.66 cnf(c8, axiom,
% 2.30/0.66 sP6(sdtasdt0(X3,X4),X3) | ~aNaturalNumber0(X4)).
% 2.30/0.66 cnf(a3, assumption,
% 2.30/0.66 X5 = X2).
% 2.30/0.66 cnf(a4, assumption,
% 2.30/0.66 X6 = X1).
% 2.30/0.66 cnf(c9, plain,
% 2.30/0.66 ~sP7(X1,X2),
% 2.30/0.66 inference(lazy_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 2.30/0.66 cnf(c10, plain,
% 2.30/0.66 ~aNaturalNumber0(X4),
% 2.30/0.66 inference(lazy_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 2.30/0.66 cnf(c11, plain,
% 2.30/0.66 sdtasdt0(X3,X4) != X5 | X3 != X6,
% 2.30/0.66 inference(lazy_predicate_extension, [assumptions([a3, a4])], [c7, c8])).
% 2.30/0.66
% 2.30/0.66 cnf(c12, axiom,
% 2.30/0.66 sdtasdt0(X7,sz10) = X7 | ~aNaturalNumber0(X7)).
% 2.30/0.66 cnf(a5, assumption,
% 2.30/0.66 sdtasdt0(X3,X4) = sdtasdt0(X7,sz10)).
% 2.30/0.66 cnf(c13, plain,
% 2.30/0.66 X3 != X6,
% 2.30/0.66 inference(strict_function_extension, [assumptions([a5])], [c11, c12])).
% 2.30/0.66 cnf(c14, plain,
% 2.30/0.66 ~aNaturalNumber0(X7),
% 2.30/0.66 inference(strict_function_extension, [assumptions([a5])], [c11, c12])).
% 2.30/0.66 cnf(c15, plain,
% 2.30/0.66 X8 != X7 | X8 != X5,
% 2.30/0.66 inference(strict_function_extension, [assumptions([a5])], [c11, c12])).
% 2.30/0.66
% 2.30/0.66 cnf(a6, assumption,
% 2.30/0.66 X8 = X7).
% 2.30/0.66 cnf(c16, plain,
% 2.30/0.66 X8 != X5,
% 2.30/0.66 inference(reflexivity, [assumptions([a6])], [c15])).
% 2.30/0.66
% 2.30/0.66 cnf(a7, assumption,
% 2.30/0.66 X8 = X5).
% 2.30/0.66 cnf(c17, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(reflexivity, [assumptions([a7])], [c16])).
% 2.30/0.66
% 2.30/0.66 cnf(c18, axiom,
% 2.30/0.66 aNaturalNumber0(xk)).
% 2.30/0.66 cnf(a8, assumption,
% 2.30/0.66 X7 = xk).
% 2.30/0.66 cnf(c19, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a8])], [c14, c18])).
% 2.30/0.66 cnf(c20, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a8])], [c14, c18])).
% 2.30/0.66
% 2.30/0.66 cnf(a9, assumption,
% 2.30/0.66 X3 = X6).
% 2.30/0.66 cnf(c21, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(reflexivity, [assumptions([a9])], [c13])).
% 2.30/0.66
% 2.30/0.66 cnf(c22, axiom,
% 2.30/0.66 aNaturalNumber0(sz10)).
% 2.30/0.66 cnf(a10, assumption,
% 2.30/0.66 X4 = sz10).
% 2.30/0.66 cnf(c23, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a10])], [c10, c22])).
% 2.30/0.66 cnf(c24, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a10])], [c10, c22])).
% 2.30/0.66
% 2.30/0.66 cnf(c25, axiom,
% 2.30/0.66 sP7(X9,X10) | ~aNaturalNumber0(X10) | ~aNaturalNumber0(X9)).
% 2.30/0.66 cnf(a11, assumption,
% 2.30/0.66 X1 = X9).
% 2.30/0.66 cnf(a12, assumption,
% 2.30/0.66 X2 = X10).
% 2.30/0.66 cnf(c26, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c25])).
% 2.30/0.66 cnf(c27, plain,
% 2.30/0.66 ~aNaturalNumber0(X10) | ~aNaturalNumber0(X9),
% 2.30/0.66 inference(strict_predicate_extension, [assumptions([a11, a12])], [c9, c25])).
% 2.30/0.66
% 2.30/0.66 cnf(c28, plain,
% 2.30/0.66 aNaturalNumber0(X7)).
% 2.30/0.66 cnf(a13, assumption,
% 2.30/0.66 X10 = X7).
% 2.30/0.66 cnf(c29, plain,
% 2.30/0.66 ~aNaturalNumber0(X9),
% 2.30/0.66 inference(predicate_reduction, [assumptions([a13])], [c27, c28])).
% 2.30/0.66
% 2.30/0.66 cnf(c30, plain,
% 2.30/0.66 aNaturalNumber0(X7)).
% 2.30/0.66 cnf(a14, assumption,
% 2.30/0.66 X9 = X7).
% 2.30/0.66 cnf(c31, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(predicate_reduction, [assumptions([a14])], [c29, c30])).
% 2.30/0.66
% 2.30/0.66 cnf(c32, plain,
% 2.30/0.66 aNaturalNumber0(X7)).
% 2.30/0.66 cnf(a15, assumption,
% 2.30/0.66 X0 = X7).
% 2.30/0.66 cnf(c33, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(predicate_reduction, [assumptions([a15])], [c6, c32])).
% 2.30/0.66
% 2.30/0.66 cnf(c34, plain,
% 2.30/0.66 $false,
% 2.30/0.66 inference(constraint_solving, [
% 2.30/0.66 bind(X0, xk),
% 2.30/0.66 bind(X1, xk),
% 2.30/0.66 bind(X2, xk),
% 2.30/0.66 bind(X3, xk),
% 2.30/0.66 bind(X4, sz10),
% 2.30/0.66 bind(X5, xk),
% 2.30/0.66 bind(X6, xk),
% 2.30/0.66 bind(X7, xk),
% 2.30/0.66 bind(X8, xk),
% 2.30/0.66 bind(X9, xk),
% 2.30/0.66 bind(X10, xk)
% 2.30/0.66 ],
% 2.30/0.66 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 2.30/0.66
% 2.30/0.66 % SZS output end IncompleteProof
%------------------------------------------------------------------------------