TSTP Solution File: NUM504+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM504+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:44 EDT 2022
% Result : Theorem 9.30s 2.52s
% Output : CNFRefutation 9.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 37 ( 24 unt; 5 nHn; 37 RR)
% Number of literals : 73 ( 21 equ; 39 neg)
% Maximal clause size : 6 ( 1 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 : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_33,plain,
( X1 = X2
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_33) ).
cnf(i_0_96,hypothesis,
sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_96) ).
cnf(i_0_97,hypothesis,
sdtasdt0(xp,xm) != sdtasdt0(xn,xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_97) ).
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/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_54) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_6) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_72) ).
cnf(i_0_73,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_73) ).
cnf(i_0_75,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_75) ).
cnf(i_0_83,hypothesis,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_83) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_71) ).
cnf(i_0_94,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_94) ).
cnf(i_0_67,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_67) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_2) ).
cnf(i_0_76,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jpbpuco2/lgb.p',i_0_76) ).
cnf(c_0_112,plain,
( X1 = X2
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_33 ).
cnf(c_0_113,hypothesis,
sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
i_0_96 ).
cnf(c_0_114,hypothesis,
sdtasdt0(xp,xm) != sdtasdt0(xn,xm),
i_0_97 ).
cnf(c_0_115,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
i_0_54 ).
cnf(c_0_116,plain,
( ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xp,xm))
| ~ sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]) ).
cnf(c_0_117,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_118,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_119,hypothesis,
aNaturalNumber0(xn),
i_0_73 ).
cnf(c_0_120,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_115]) ).
cnf(c_0_121,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
i_0_75 ).
cnf(c_0_122,hypothesis,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
i_0_83 ).
cnf(c_0_123,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_124,plain,
( ~ aNaturalNumber0(sdtasdt0(xp,xm))
| ~ sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_119])]) ).
cnf(c_0_125,hypothesis,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| xp = sz00
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]),c_0_123])]) ).
cnf(c_0_126,plain,
~ sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_117]),c_0_118]),c_0_123])]) ).
cnf(c_0_127,plain,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| xp = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_117]),c_0_118]),c_0_119])]) ).
cnf(c_0_128,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
i_0_94 ).
cnf(c_0_129,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
i_0_67 ).
cnf(c_0_130,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_131,hypothesis,
isPrime0(xp),
i_0_76 ).
cnf(c_0_132,plain,
xp = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128])]) ).
cnf(c_0_133,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_129]),c_0_130])]) ).
cnf(c_0_134,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_132]),c_0_133]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM504+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jul 6 19:48:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 9.30/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.30/2.52 # No SInE strategy applied
% 9.30/2.52 # Trying AutoSched0 for 150 seconds
% 9.30/2.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 9.30/2.52 # and selection function PSelectNewComplexAHP.
% 9.30/2.52 #
% 9.30/2.52 # Preprocessing time : 0.016 s
% 9.30/2.52 # Presaturation interreduction done
% 9.30/2.52
% 9.30/2.52 # Proof found!
% 9.30/2.52 # SZS status Theorem
% 9.30/2.52 # SZS output start CNFRefutation
% See solution above
% 9.30/2.52 # Training examples: 0 positive, 0 negative
% 9.30/2.52
% 9.30/2.52 # -------------------------------------------------
% 9.30/2.52 # User time : 0.102 s
% 9.30/2.52 # System time : 0.009 s
% 9.30/2.52 # Total time : 0.111 s
% 9.30/2.52 # Maximum resident set size: 7124 pages
% 9.30/2.52
%------------------------------------------------------------------------------