%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM500+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:41 EDT 2022
% Result : Theorem 7.27s 2.36s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 41 ( 21 unt; 11 nHn; 41 RR)
% Number of literals : 93 ( 30 equ; 45 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-xhp3bvdo/lgb.p',i_0_55) ).
cnf(i_0_75,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_75) ).
cnf(i_0_83,hypothesis,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_83) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_71) ).
cnf(i_0_88,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| ~ doDivides0(X1,xk) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_88) ).
cnf(i_0_69,plain,
( X1 = sz00
| X1 = sz10
| doDivides0(esk4_1(X1),X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_69) ).
cnf(i_0_86,hypothesis,
xk != sz10,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_86) ).
cnf(i_0_87,hypothesis,
sz00 != xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_87) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_6) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_72) ).
cnf(i_0_73,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_73) ).
cnf(i_0_70,plain,
( X1 = sz00
| X1 = sz10
| aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_70) ).
cnf(i_0_68,plain,
( X1 = sz00
| X1 = sz10
| isPrime0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_68) ).
cnf(i_0_67,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_67) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_2) ).
cnf(i_0_76,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhp3bvdo/lgb.p',i_0_76) ).
cnf(c_0_105,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_106,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_105]) ).
cnf(c_0_107,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
i_0_75 ).
cnf(c_0_108,hypothesis,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
i_0_83 ).
cnf(c_0_109,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_110,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| ~ doDivides0(X1,xk) ),
i_0_88 ).
cnf(c_0_111,plain,
( X1 = sz00
| X1 = sz10
| doDivides0(esk4_1(X1),X1)
| ~ aNaturalNumber0(X1) ),
i_0_69 ).
cnf(c_0_112,hypothesis,
xk != sz10,
i_0_86 ).
cnf(c_0_113,hypothesis,
sz00 != xk,
i_0_87 ).
cnf(c_0_114,hypothesis,
( xp = sz00
| aNaturalNumber0(xk)
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]),c_0_109])]) ).
cnf(c_0_115,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_116,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_117,hypothesis,
aNaturalNumber0(xn),
i_0_73 ).
cnf(c_0_118,negated_conjecture,
( ~ aNaturalNumber0(esk4_1(xk))
| ~ aNaturalNumber0(xk)
| ~ isPrime0(esk4_1(xk)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),c_0_113]) ).
cnf(c_0_119,plain,
( xp = sz00
| aNaturalNumber0(xk) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]),c_0_117])]) ).
cnf(c_0_120,negated_conjecture,
( xp = sz00
| ~ aNaturalNumber0(esk4_1(xk))
| ~ isPrime0(esk4_1(xk)) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_121,plain,
( X1 = sz00
| X1 = sz10
| aNaturalNumber0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
i_0_70 ).
cnf(c_0_122,plain,
( xp = sz00
| ~ isPrime0(esk4_1(xk)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_112]),c_0_113]),c_0_119]) ).
cnf(c_0_123,plain,
( X1 = sz00
| X1 = sz10
| isPrime0(esk4_1(X1))
| ~ aNaturalNumber0(X1) ),
i_0_68 ).
cnf(c_0_124,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
i_0_67 ).
cnf(c_0_125,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_126,hypothesis,
isPrime0(xp),
i_0_76 ).
cnf(c_0_127,plain,
xp = sz00,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_112]),c_0_113]),c_0_119]) ).
cnf(c_0_128,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_124]),c_0_125])]) ).
cnf(c_0_129,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_126,c_0_127]),c_0_128]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM500+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 : Thu Jul 7 14:09:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.27/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.27/2.36 # No SInE strategy applied
% 7.27/2.36 # Trying AutoSched0 for 150 seconds
% 7.27/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.27/2.36 # and selection function SelectNewComplexAHP.
% 7.27/2.36 #
% 7.27/2.36 # Preprocessing time : 0.013 s
% 7.27/2.36 # Presaturation interreduction done
% 7.27/2.36
% 7.27/2.36 # Proof found!
% 7.27/2.36 # SZS status Theorem
% 7.27/2.36 # SZS output start CNFRefutation
% See solution above
% 7.27/2.36 # Training examples: 0 positive, 0 negative
% 7.27/2.36
% 7.27/2.36 # -------------------------------------------------
% 7.27/2.36 # User time : 0.026 s
% 7.27/2.36 # System time : 0.001 s
% 7.27/2.36 # Total time : 0.027 s
% 7.27/2.36 # Maximum resident set size: 7128 pages
% 7.27/2.36
%------------------------------------------------------------------------------