TSTP Solution File: NUM495+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM495+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:38 EDT 2022
% Result : Theorem 10.17s 2.65s
% Output : CNFRefutation 10.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 35 ( 26 unt; 4 nHn; 35 RR)
% Number of literals : 64 ( 6 equ; 33 neg)
% Maximal clause size : 8 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_5) ).
cnf(i_0_222,hypothesis,
sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),esk13_0) = sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_222) ).
cnf(i_0_223,hypothesis,
aNaturalNumber0(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_223) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_71) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_72) ).
cnf(i_0_213,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_213) ).
cnf(i_0_49,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_49) ).
cnf(i_0_221,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_221) ).
cnf(i_0_224,hypothesis,
sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_224) ).
cnf(i_0_74,hypothesis,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| ~ doDivides0(X1,sdtasdt0(X2,X3))
| ~ iLess0(sdtpldt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_74) ).
cnf(i_0_218,hypothesis,
doDivides0(xp,sdtasdt0(xr,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_218) ).
cnf(i_0_203,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_203) ).
cnf(i_0_225,negated_conjecture,
~ doDivides0(xp,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_225) ).
cnf(i_0_227,negated_conjecture,
~ doDivides0(xp,xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jjf9ligk/input.p',i_0_227) ).
cnf(c_0_242,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_243,hypothesis,
sdtpldt0(sdtpldt0(sdtpldt0(xr,xm),xp),esk13_0) = sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_222 ).
cnf(c_0_244,hypothesis,
aNaturalNumber0(esk13_0),
i_0_223 ).
cnf(c_0_245,hypothesis,
( aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_244])]) ).
cnf(c_0_246,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_247,plain,
( aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(xr,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_242]),c_0_246])]) ).
cnf(c_0_248,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_249,hypothesis,
aNaturalNumber0(xr),
i_0_213 ).
cnf(c_0_250,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_49 ).
cnf(c_0_251,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
i_0_221 ).
cnf(c_0_252,hypothesis,
sdtpldt0(sdtpldt0(xr,xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_224 ).
cnf(c_0_253,plain,
aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_247,c_0_242]),c_0_248]),c_0_249])]) ).
cnf(c_0_254,hypothesis,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| ~ doDivides0(X1,sdtasdt0(X2,X3))
| ~ iLess0(sdtpldt0(sdtpldt0(X2,X3),X1),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
i_0_74 ).
cnf(c_0_255,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xr,xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_251]),c_0_252]),c_0_253])]) ).
cnf(c_0_256,hypothesis,
doDivides0(xp,sdtasdt0(xr,xm)),
i_0_218 ).
cnf(c_0_257,hypothesis,
isPrime0(xp),
i_0_203 ).
cnf(c_0_258,negated_conjecture,
~ doDivides0(xp,xm),
i_0_225 ).
cnf(c_0_259,negated_conjecture,
~ doDivides0(xp,xr),
i_0_227 ).
cnf(c_0_260,hypothesis,
~ aNaturalNumber0(sdtpldt0(sdtpldt0(xr,xm),xp)),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_256]),c_0_257]),c_0_248]),c_0_249]),c_0_246])]),c_0_258]),c_0_259]) ).
cnf(c_0_261,plain,
~ aNaturalNumber0(sdtpldt0(xr,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_260,c_0_242]),c_0_246])]) ).
cnf(c_0_262,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_242]),c_0_248]),c_0_249])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM495+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.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 02:08:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 10.17/2.65 # ENIGMATIC: Solved by autoschedule:
% 10.17/2.65 # No SInE strategy applied
% 10.17/2.65 # Trying AutoSched0 for 150 seconds
% 10.17/2.65 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
% 10.17/2.65 # and selection function SelectMaxLComplexAvoidPosPred.
% 10.17/2.65 #
% 10.17/2.65 # Preprocessing time : 0.033 s
% 10.17/2.65 # Presaturation interreduction done
% 10.17/2.65
% 10.17/2.65 # Proof found!
% 10.17/2.65 # SZS status Theorem
% 10.17/2.65 # SZS output start CNFRefutation
% See solution above
% 10.17/2.65 # Training examples: 0 positive, 0 negative
% 10.17/2.65
% 10.17/2.65 # -------------------------------------------------
% 10.17/2.65 # User time : 0.325 s
% 10.17/2.65 # System time : 0.009 s
% 10.17/2.65 # Total time : 0.334 s
% 10.17/2.65 # Maximum resident set size: 7120 pages
% 10.17/2.65
%------------------------------------------------------------------------------