TSTP Solution File: NUM469+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM469+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 08:36:20 EDT 2022
% Result : Theorem 7.32s 2.23s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 17 unt; 6 nHn; 32 RR)
% Number of literals : 49 ( 20 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_72,negated_conjecture,
( sdtpldt0(xm,xn) != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_72) ).
cnf(i_0_66,hypothesis,
( sz00 = xl
| sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) = sdtpldt0(xm,xn) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_66) ).
cnf(i_0_5,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_5) ).
cnf(i_0_70,hypothesis,
( sz00 = xl
| aNaturalNumber0(sdtsldt0(xm,xl)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_70) ).
cnf(i_0_68,hypothesis,
( sz00 = xl
| aNaturalNumber0(sdtsldt0(xn,xl)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_68) ).
cnf(i_0_61,hypothesis,
sdtasdt0(xl,esk4_0) = xn,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_61) ).
cnf(i_0_71,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_71) ).
cnf(i_0_15,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_15) ).
cnf(i_0_62,hypothesis,
aNaturalNumber0(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_62) ).
cnf(i_0_63,hypothesis,
doDivides0(xl,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_63) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_10) ).
cnf(i_0_58,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t6gxgp28/input.p',i_0_58) ).
cnf(c_0_85,negated_conjecture,
( sdtpldt0(xm,xn) != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
i_0_72 ).
cnf(c_0_86,hypothesis,
( sz00 = xl
| sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) = sdtpldt0(xm,xn) ),
i_0_66 ).
cnf(c_0_87,negated_conjecture,
( xl = sz00
| ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_88,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_89,hypothesis,
( sz00 = xl
| aNaturalNumber0(sdtsldt0(xm,xl)) ),
i_0_70 ).
cnf(c_0_90,hypothesis,
( sz00 = xl
| aNaturalNumber0(sdtsldt0(xn,xl)) ),
i_0_68 ).
cnf(c_0_91,hypothesis,
sdtasdt0(xl,esk4_0) = xn,
i_0_61 ).
cnf(c_0_92,plain,
xl = sz00,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
i_0_71 ).
cnf(c_0_94,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aNaturalNumber0(X1) ),
i_0_15 ).
cnf(c_0_95,hypothesis,
sdtasdt0(sz00,esk4_0) = xn,
inference(rw,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,hypothesis,
aNaturalNumber0(esk4_0),
i_0_62 ).
cnf(c_0_97,negated_conjecture,
~ doDivides0(sz00,sdtpldt0(xm,xn)),
inference(rw,[status(thm)],[c_0_93,c_0_92]) ).
cnf(c_0_98,plain,
xn = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]) ).
cnf(c_0_99,hypothesis,
doDivides0(xl,xm),
i_0_63 ).
cnf(c_0_100,negated_conjecture,
~ doDivides0(sz00,sdtpldt0(xm,sz00)),
inference(rw,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
i_0_10 ).
cnf(c_0_102,hypothesis,
doDivides0(sz00,xm),
inference(rw,[status(thm)],[c_0_99,c_0_92]) ).
cnf(c_0_103,hypothesis,
aNaturalNumber0(xm),
i_0_58 ).
cnf(c_0_104,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM469+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n016.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jul 5 04:41:49 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.32/2.23 # ENIGMATIC: Solved by autoschedule:
% 7.32/2.23 # No SInE strategy applied
% 7.32/2.23 # Trying AutoSched0 for 150 seconds
% 7.32/2.23 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AN
% 7.32/2.23 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.32/2.23 #
% 7.32/2.23 # Preprocessing time : 0.024 s
% 7.32/2.23 # Presaturation interreduction done
% 7.32/2.23
% 7.32/2.23 # Proof found!
% 7.32/2.23 # SZS status Theorem
% 7.32/2.23 # SZS output start CNFRefutation
% See solution above
% 7.32/2.23 # Training examples: 0 positive, 0 negative
% 7.32/2.23
% 7.32/2.23 # -------------------------------------------------
% 7.32/2.23 # User time : 0.029 s
% 7.32/2.23 # System time : 0.010 s
% 7.32/2.23 # Total time : 0.039 s
% 7.32/2.23 # Maximum resident set size: 7120 pages
% 7.32/2.23
%------------------------------------------------------------------------------