TSTP Solution File: NUM517+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM517+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:52 EDT 2022
% Result : Theorem 16.30s 3.57s
% Output : CNFRefutation 16.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 46 ( 30 unt; 8 nHn; 46 RR)
% Number of literals : 107 ( 13 equ; 66 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_74,hypothesis,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X1)
| ~ doDivides0(X1,sdtasdt0(X3,X2))
| ~ iLess0(sdtpldt0(sdtpldt0(X3,X2),X1),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_74) ).
cnf(i_0_49,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_49) ).
cnf(i_0_100,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_100) ).
cnf(i_0_99,hypothesis,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_99) ).
cnf(i_0_76,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_76) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_72) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_71) ).
cnf(i_0_101,hypothesis,
sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_101) ).
cnf(i_0_103,negated_conjecture,
~ doDivides0(xp,sdtsldt0(xn,xr)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_103) ).
cnf(i_0_102,negated_conjecture,
~ doDivides0(xp,xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_102) ).
cnf(i_0_5,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_5) ).
cnf(i_0_73,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_73) ).
cnf(i_0_55,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_55) ).
cnf(i_0_67,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_67) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_2) ).
cnf(i_0_96,hypothesis,
doDivides0(xr,xn),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_96) ).
cnf(i_0_90,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_90) ).
cnf(i_0_88,hypothesis,
isPrime0(xr),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_cbbe6pu/input.p',i_0_88) ).
cnf(c_0_122,hypothesis,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X1)
| ~ doDivides0(X1,sdtasdt0(X3,X2))
| ~ iLess0(sdtpldt0(sdtpldt0(X3,X2),X1),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
i_0_74 ).
cnf(c_0_123,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_49 ).
cnf(c_0_124,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtpldt0(xn,xm),xp)
| doDivides0(X3,X1)
| doDivides0(X3,X2)
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ sdtlseqdt0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ isPrime0(X3)
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(X1,X2),X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_125,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
i_0_100 ).
cnf(c_0_126,hypothesis,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
i_0_99 ).
cnf(c_0_127,hypothesis,
isPrime0(xp),
i_0_76 ).
cnf(c_0_128,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_129,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_130,hypothesis,
sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_101 ).
cnf(c_0_131,negated_conjecture,
~ doDivides0(xp,sdtsldt0(xn,xr)),
i_0_103 ).
cnf(c_0_132,negated_conjecture,
~ doDivides0(xp,xm),
i_0_102 ).
cnf(c_0_133,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),c_0_127]),c_0_128]),c_0_129])]),c_0_130]),c_0_131]),c_0_132]) ).
cnf(c_0_134,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_135,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_129])]) ).
cnf(c_0_136,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm))
| ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_134]),c_0_129])]) ).
cnf(c_0_137,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_134]),c_0_128])]) ).
cnf(c_0_138,hypothesis,
aNaturalNumber0(xn),
i_0_73 ).
cnf(c_0_139,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_140,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
i_0_67 ).
cnf(c_0_141,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_142,plain,
~ aNaturalNumber0(sdtsldt0(xn,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_134]),c_0_128]),c_0_138])]) ).
cnf(c_0_143,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_139]) ).
cnf(c_0_144,hypothesis,
doDivides0(xr,xn),
i_0_96 ).
cnf(c_0_145,hypothesis,
aNaturalNumber0(xr),
i_0_90 ).
cnf(c_0_146,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_140]),c_0_141])]) ).
cnf(c_0_147,plain,
sz00 = xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144]),c_0_138]),c_0_145])]) ).
cnf(c_0_148,hypothesis,
isPrime0(xr),
i_0_88 ).
cnf(c_0_149,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_146,c_0_147]),c_0_148])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : NUM517+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.28 % Computer : n020.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Thu Jul 7 20:26:00 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected complete mode:
% 16.30/3.57 # ENIGMATIC: Solved by autoschedule:
% 16.30/3.57 # No SInE strategy applied
% 16.30/3.57 # Trying AutoSched0 for 150 seconds
% 16.30/3.57 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 16.30/3.57 # and selection function SelectMaxLComplexAvoidPosPred.
% 16.30/3.57 #
% 16.30/3.57 # Preprocessing time : 0.027 s
% 16.30/3.57
% 16.30/3.57 # Proof found!
% 16.30/3.57 # SZS status Theorem
% 16.30/3.57 # SZS output start CNFRefutation
% See solution above
% 16.30/3.57 # Training examples: 0 positive, 0 negative
% 16.30/3.57
% 16.30/3.57 # -------------------------------------------------
% 16.30/3.57 # User time : 0.670 s
% 16.30/3.57 # System time : 0.021 s
% 16.30/3.57 # Total time : 0.691 s
% 16.30/3.57 # Maximum resident set size: 7116 pages
% 16.30/3.57
%------------------------------------------------------------------------------