TSTP Solution File: NUM518+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM518+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:53 EDT 2022
% Result : Theorem 18.06s 3.61s
% Output : CNFRefutation 18.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 48 ( 26 unt; 11 nHn; 48 RR)
% Number of literals : 119 ( 28 equ; 70 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_100,hypothesis,
( doDivides0(xp,xm)
| doDivides0(xp,sdtsldt0(xn,xr)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_100) ).
cnf(i_0_101,negated_conjecture,
~ doDivides0(xp,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_101) ).
cnf(i_0_34,plain,
( sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X3,X2)
| ~ sdtlseqdt0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_34) ).
cnf(i_0_97,hypothesis,
sdtlseqdt0(sdtsldt0(xn,xr),xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_97) ).
cnf(i_0_73,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_73) ).
cnf(i_0_59,plain,
( X1 = sz00
| sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_59) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_71) ).
cnf(i_0_77,hypothesis,
~ sdtlseqdt0(xp,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_77) ).
cnf(i_0_55,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_55) ).
cnf(i_0_67,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_67) ).
cnf(i_0_88,hypothesis,
isPrime0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_88) ).
cnf(i_0_90,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_90) ).
cnf(i_0_54,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_54) ).
cnf(i_0_96,hypothesis,
doDivides0(xr,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_96) ).
cnf(i_0_50,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_50) ).
cnf(i_0_16,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_16) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_2) ).
cnf(i_0_102,negated_conjecture,
~ doDivides0(xp,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3dwbilx7/input.p',i_0_102) ).
cnf(c_0_121,hypothesis,
( doDivides0(xp,xm)
| doDivides0(xp,sdtsldt0(xn,xr)) ),
i_0_100 ).
cnf(c_0_122,negated_conjecture,
~ doDivides0(xp,xm),
i_0_101 ).
cnf(c_0_123,plain,
( sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X3,X2)
| ~ sdtlseqdt0(X1,X3) ),
i_0_34 ).
cnf(c_0_124,hypothesis,
sdtlseqdt0(sdtsldt0(xn,xr),xn),
i_0_97 ).
cnf(c_0_125,hypothesis,
aNaturalNumber0(xn),
i_0_73 ).
cnf(c_0_126,plain,
( X1 = sz00
| sdtlseqdt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1) ),
i_0_59 ).
cnf(c_0_127,hypothesis,
doDivides0(xp,sdtsldt0(xn,xr)),
inference(sr,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_128,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_129,hypothesis,
( sdtlseqdt0(X1,xn)
| ~ sdtlseqdt0(X1,sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]) ).
cnf(c_0_130,hypothesis,
( sdtsldt0(xn,xr) = sz00
| sdtlseqdt0(xp,sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128])]) ).
cnf(c_0_131,hypothesis,
~ sdtlseqdt0(xp,xn),
i_0_77 ).
cnf(c_0_132,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_133,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
i_0_67 ).
cnf(c_0_134,hypothesis,
isPrime0(xr),
i_0_88 ).
cnf(c_0_135,hypothesis,
aNaturalNumber0(xr),
i_0_90 ).
cnf(c_0_136,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
i_0_54 ).
cnf(c_0_137,hypothesis,
( sdtsldt0(xn,xr) = sz00
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_128])]),c_0_131]) ).
cnf(c_0_138,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_132]) ).
cnf(c_0_139,hypothesis,
doDivides0(xr,xn),
i_0_96 ).
cnf(c_0_140,hypothesis,
xr != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135])]) ).
cnf(c_0_141,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_142,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
i_0_16 ).
cnf(c_0_143,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_144,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_136]) ).
cnf(c_0_145,plain,
sdtsldt0(xn,xr) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139]),c_0_125]),c_0_135])]),c_0_140]) ).
cnf(c_0_146,negated_conjecture,
~ doDivides0(xp,xn),
i_0_102 ).
cnf(c_0_147,plain,
( doDivides0(X1,X2)
| X2 != sz00
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143])]) ).
cnf(c_0_148,plain,
sdtasdt0(xr,sz00) = xn,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_139]),c_0_125]),c_0_135])]),c_0_140]) ).
cnf(c_0_149,negated_conjecture,
xn != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_125]),c_0_128])]) ).
cnf(c_0_150,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_148]),c_0_135])]),c_0_149]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM518+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : Wed Jul 6 09:22:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 18.06/3.61 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 18.06/3.61 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 18; version: 991; iters: 150)
% 18.06/3.61 # Preprocessing time : 1.106 s
% 18.06/3.61
% 18.06/3.61 # Proof found!
% 18.06/3.61 # SZS status Theorem
% 18.06/3.61 # SZS output start CNFRefutation
% See solution above
% 18.06/3.61 # Training examples: 0 positive, 0 negative
% 18.06/3.61
% 18.06/3.61 # -------------------------------------------------
% 18.06/3.61 # User time : 1.065 s
% 18.06/3.61 # System time : 0.140 s
% 18.06/3.61 # Total time : 1.205 s
% 18.06/3.61 # ...preprocessing : 1.106 s
% 18.06/3.61 # ...main loop : 0.099 s
% 18.06/3.61 # Maximum resident set size: 175480 pages
% 18.06/3.61
%------------------------------------------------------------------------------