TSTP Solution File: NUM508+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM508+3 : 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:47 EDT 2022
% Result : Theorem 11.92s 3.02s
% Output : CNFRefutation 11.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 33 ( 25 unt; 4 nHn; 33 RR)
% Number of literals : 61 ( 6 equ; 32 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-f1j0l_fn/input.p',i_0_5) ).
cnf(i_0_246,hypothesis,
sdtpldt0(sdtpldt0(sdtpldt0(xn,xm),xr),esk16_0) = sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_246) ).
cnf(i_0_247,hypothesis,
aNaturalNumber0(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_247) ).
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-f1j0l_fn/input.p',i_0_49) ).
cnf(i_0_245,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_245) ).
cnf(i_0_248,hypothesis,
sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_248) ).
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-f1j0l_fn/input.p',i_0_74) ).
cnf(i_0_236,hypothesis,
doDivides0(xr,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_236) ).
cnf(i_0_227,hypothesis,
isPrime0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_227) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_72) ).
cnf(i_0_73,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_73) ).
cnf(i_0_235,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_235) ).
cnf(i_0_249,negated_conjecture,
~ doDivides0(xr,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_249) ).
cnf(i_0_251,negated_conjecture,
~ doDivides0(xr,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f1j0l_fn/input.p',i_0_251) ).
cnf(c_0_266,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_267,hypothesis,
sdtpldt0(sdtpldt0(sdtpldt0(xn,xm),xr),esk16_0) = sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_246 ).
cnf(c_0_268,hypothesis,
aNaturalNumber0(esk16_0),
i_0_247 ).
cnf(c_0_269,plain,
( X1 = X2
| iLess0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_49 ).
cnf(c_0_270,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp)),
i_0_245 ).
cnf(c_0_271,hypothesis,
sdtpldt0(sdtpldt0(xn,xm),xr) != sdtpldt0(sdtpldt0(xn,xm),xp),
i_0_248 ).
cnf(c_0_272,hypothesis,
( aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_267]),c_0_268])]) ).
cnf(c_0_273,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_274,hypothesis,
( iLess0(sdtpldt0(sdtpldt0(xn,xm),xr),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_269,c_0_270]),c_0_271]),c_0_272]) ).
cnf(c_0_275,hypothesis,
doDivides0(xr,sdtasdt0(xn,xm)),
i_0_236 ).
cnf(c_0_276,hypothesis,
isPrime0(xr),
i_0_227 ).
cnf(c_0_277,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_278,hypothesis,
aNaturalNumber0(xn),
i_0_73 ).
cnf(c_0_279,hypothesis,
aNaturalNumber0(xr),
i_0_235 ).
cnf(c_0_280,negated_conjecture,
~ doDivides0(xr,xm),
i_0_249 ).
cnf(c_0_281,negated_conjecture,
~ doDivides0(xr,xn),
i_0_251 ).
cnf(c_0_282,hypothesis,
~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xr)),
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_273,c_0_274]),c_0_275]),c_0_276]),c_0_277]),c_0_278]),c_0_279])]),c_0_280]),c_0_281]) ).
cnf(c_0_283,plain,
~ aNaturalNumber0(sdtpldt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_282,c_0_266]),c_0_279])]) ).
cnf(c_0_284,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_283,c_0_266]),c_0_277]),c_0_278])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM508+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.35 % Computer : n020.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Wed Jul 6 05:07:46 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 11.92/3.02 # ENIGMATIC: Solved by autoschedule:
% 11.92/3.02 # No SInE strategy applied
% 11.92/3.02 # Trying AutoSched0 for 150 seconds
% 11.92/3.02 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
% 11.92/3.02 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.92/3.02 #
% 11.92/3.02 # Preprocessing time : 0.030 s
% 11.92/3.02 # Presaturation interreduction done
% 11.92/3.02
% 11.92/3.02 # Proof found!
% 11.92/3.02 # SZS status Theorem
% 11.92/3.02 # SZS output start CNFRefutation
% See solution above
% 11.92/3.02 # Training examples: 0 positive, 0 negative
% 11.92/3.02
% 11.92/3.02 # -------------------------------------------------
% 11.92/3.02 # User time : 0.396 s
% 11.92/3.02 # System time : 0.017 s
% 11.92/3.02 # Total time : 0.413 s
% 11.92/3.02 # Maximum resident set size: 7120 pages
% 11.92/3.02
%------------------------------------------------------------------------------