TSTP Solution File: NUM514+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM514+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:50 EDT 2022
% Result : Theorem 7.44s 2.18s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 43 ( 29 unt; 6 nHn; 43 RR)
% Number of literals : 80 ( 19 equ; 38 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_102,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_102) ).
cnf(i_0_101,hypothesis,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_101) ).
cnf(i_0_50,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_50) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_6) ).
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-ukijwngt/lgb.p',i_0_55) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_71) ).
cnf(i_0_83,hypothesis,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_83) ).
cnf(i_0_75,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_75) ).
cnf(i_0_90,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_90) ).
cnf(i_0_89,hypothesis,
doDivides0(xr,xk),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_89) ).
cnf(i_0_72,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_72) ).
cnf(i_0_73,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_73) ).
cnf(i_0_67,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_67) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_2) ).
cnf(i_0_76,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_76) ).
cnf(i_0_88,hypothesis,
isPrime0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ukijwngt/lgb.p',i_0_88) ).
cnf(c_0_119,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
i_0_102 ).
cnf(c_0_120,hypothesis,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
i_0_101 ).
cnf(c_0_121,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_122,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_123,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_124,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,sdtsldt0(xk,xr))),
inference(rw,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_125,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_121]),c_0_122]) ).
cnf(c_0_126,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_127,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2) ),
inference(er,[status(thm)],[c_0_123]) ).
cnf(c_0_128,hypothesis,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
i_0_83 ).
cnf(c_0_129,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
i_0_75 ).
cnf(c_0_130,negated_conjecture,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]) ).
cnf(c_0_131,hypothesis,
aNaturalNumber0(xr),
i_0_90 ).
cnf(c_0_132,hypothesis,
doDivides0(xr,xk),
i_0_89 ).
cnf(c_0_133,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_127,c_0_128]),c_0_126]),c_0_129])]) ).
cnf(c_0_134,hypothesis,
aNaturalNumber0(xm),
i_0_72 ).
cnf(c_0_135,hypothesis,
aNaturalNumber0(xn),
i_0_73 ).
cnf(c_0_136,negated_conjecture,
( sz00 = xr
| ~ aNaturalNumber0(xk) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_127]),c_0_131]),c_0_132])]) ).
cnf(c_0_137,plain,
( xp = sz00
| aNaturalNumber0(xk) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_122]),c_0_134]),c_0_135])]) ).
cnf(c_0_138,plain,
( X1 != sz00
| ~ aNaturalNumber0(X1)
| ~ isPrime0(X1) ),
i_0_67 ).
cnf(c_0_139,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_140,hypothesis,
isPrime0(xp),
i_0_76 ).
cnf(c_0_141,negated_conjecture,
( xp = sz00
| sz00 = xr ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_138]),c_0_139])]) ).
cnf(c_0_143,hypothesis,
sz00 = xr,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_142]) ).
cnf(c_0_144,hypothesis,
isPrime0(xr),
i_0_88 ).
cnf(c_0_145,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_142,c_0_143]),c_0_144])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM514+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 18:44:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.44/2.18 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.44/2.18 # No SInE strategy applied
% 7.44/2.18 # Trying AutoSched0 for 150 seconds
% 7.44/2.18 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.44/2.18 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.44/2.18 #
% 7.44/2.18 # Preprocessing time : 0.025 s
% 7.44/2.18
% 7.44/2.18 # Proof found!
% 7.44/2.18 # SZS status Theorem
% 7.44/2.18 # SZS output start CNFRefutation
% See solution above
% 7.44/2.18 # Training examples: 0 positive, 0 negative
% 7.44/2.18
% 7.44/2.18 # -------------------------------------------------
% 7.44/2.18 # User time : 0.051 s
% 7.44/2.18 # System time : 0.006 s
% 7.44/2.18 # Total time : 0.057 s
% 7.44/2.18 # Maximum resident set size: 7124 pages
% 7.44/2.18
%------------------------------------------------------------------------------