TSTP Solution File: NUM517+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM517+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 11.50s 2.98s
% Output : CNFRefutation 11.50s
% 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 : 5 ( 2 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_5) ).
cnf(i_0_271,hypothesis,
sdtpldt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),esk21_0) = sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_271) ).
cnf(i_0_272,hypothesis,
aNaturalNumber0(esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_272) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_71) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_72) ).
cnf(i_0_261,hypothesis,
aNaturalNumber0(sdtsldt0(xn,xr)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_261) ).
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-kri34a5u/input.p',i_0_49) ).
cnf(i_0_270,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_270) ).
cnf(i_0_275,hypothesis,
sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_275) ).
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/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_74) ).
cnf(i_0_265,hypothesis,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_265) ).
cnf(i_0_203,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_203) ).
cnf(i_0_278,negated_conjecture,
~ doDivides0(xp,xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_278) ).
cnf(i_0_280,negated_conjecture,
~ doDivides0(xp,sdtsldt0(xn,xr)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kri34a5u/input.p',i_0_280) ).
cnf(c_0_295,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_296,hypothesis,
sdtpldt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),esk21_0) = sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_271 ).
cnf(c_0_297,hypothesis,
aNaturalNumber0(esk21_0),
i_0_272 ).
cnf(c_0_298,hypothesis,
( aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_295,c_0_296]),c_0_297])]) ).
cnf(c_0_299,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_300,plain,
( aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_298,c_0_295]),c_0_299])]) ).
cnf(c_0_301,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_302,hypothesis,
aNaturalNumber0(sdtsldt0(xn,xr)),
i_0_261 ).
cnf(c_0_303,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_49 ).
cnf(c_0_304,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
i_0_270 ).
cnf(c_0_305,hypothesis,
sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_275 ).
cnf(c_0_306,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_300,c_0_295]),c_0_301]),c_0_302])]) ).
cnf(c_0_307,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_308,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_303,c_0_304]),c_0_305]),c_0_306])]) ).
cnf(c_0_309,hypothesis,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
i_0_265 ).
cnf(c_0_310,hypothesis,
isPrime0(xp),
i_0_203 ).
cnf(c_0_311,negated_conjecture,
~ doDivides0(xp,xm),
i_0_278 ).
cnf(c_0_312,negated_conjecture,
~ doDivides0(xp,sdtsldt0(xn,xr)),
i_0_280 ).
cnf(c_0_313,hypothesis,
~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,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_307,c_0_308]),c_0_309]),c_0_310]),c_0_301]),c_0_302]),c_0_299])]),c_0_311]),c_0_312]) ).
cnf(c_0_314,plain,
~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_313,c_0_295]),c_0_299])]) ).
cnf(c_0_315,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_314,c_0_295]),c_0_301]),c_0_302])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM517+3 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jul 7 01:42:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 11.50/2.98 # ENIGMATIC: Solved by autoschedule:
% 11.50/2.98 # No SInE strategy applied
% 11.50/2.98 # Trying AutoSched0 for 150 seconds
% 11.50/2.98 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
% 11.50/2.98 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.50/2.98 #
% 11.50/2.98 # Preprocessing time : 0.034 s
% 11.50/2.98 # Presaturation interreduction done
% 11.50/2.98
% 11.50/2.98 # Proof found!
% 11.50/2.98 # SZS status Theorem
% 11.50/2.98 # SZS output start CNFRefutation
% See solution above
% 11.50/2.98 # Training examples: 0 positive, 0 negative
% 11.50/2.98
% 11.50/2.98 # -------------------------------------------------
% 11.50/2.98 # User time : 0.366 s
% 11.50/2.98 # System time : 0.016 s
% 11.50/2.98 # Total time : 0.382 s
% 11.50/2.98 # Maximum resident set size: 7116 pages
% 11.50/2.98
%------------------------------------------------------------------------------