TSTP Solution File: SWV468+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV468+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 : Wed Jul 20 17:47:32 EDT 2022
% Result : Theorem 13.73s 3.15s
% Output : CNFRefutation 13.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 52 ( 32 unt; 5 nHn; 44 RR)
% Number of literals : 113 ( 36 equ; 61 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 12 con; 0-2 aty)
% Number of variables : 57 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_87,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_87) ).
cnf(i_0_105,negated_conjecture,
leq(nbr_proc,host(esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_105) ).
cnf(i_0_4,plain,
leq(host(X1),nbr_proc),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_4) ).
cnf(i_0_128,plain,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(host(X1),index(down,host(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_128) ).
cnf(i_0_112,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_112) ).
cnf(i_0_101,negated_conjecture,
~ leq(index(pendack,host(esk10_0)),host(esk9_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_101) ).
cnf(i_0_97,negated_conjecture,
host(esk6_0) = host(esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_97) ).
cnf(i_0_122,plain,
( leq(index(pendack,host(X1)),host(X2))
| host(X1) != host(X3)
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X3),queue(host(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_122) ).
cnf(i_0_52,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_52) ).
cnf(i_0_113,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_113) ).
cnf(i_0_98,negated_conjecture,
setIn(esk9_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_98) ).
cnf(i_0_107,negated_conjecture,
( X1 = host(esk7_0)
| leq(host(esk6_0),X1)
| setIn(X1,index(down,host(esk6_0)))
| ~ leq(s(zero),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_107) ).
cnf(i_0_100,negated_conjecture,
setIn(esk10_0,alive),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_100) ).
cnf(i_0_99,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_99) ).
cnf(i_0_2,plain,
leq(s(zero),host(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_2) ).
cnf(i_0_102,negated_conjecture,
host(esk10_0) != host(esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8m6uqb6q/input.p',i_0_102) ).
cnf(c_0_145,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_87 ).
cnf(c_0_146,negated_conjecture,
leq(nbr_proc,host(esk6_0)),
i_0_105 ).
cnf(c_0_147,plain,
leq(host(X1),nbr_proc),
i_0_4 ).
cnf(c_0_148,plain,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5)
| ~ setIn(host(X1),index(down,host(X2))) ),
i_0_128 ).
cnf(c_0_149,negated_conjecture,
epred1_3(esk5_0,esk7_0,esk6_0),
i_0_112 ).
cnf(c_0_150,negated_conjecture,
~ leq(index(pendack,host(esk10_0)),host(esk9_0)),
i_0_101 ).
cnf(c_0_151,negated_conjecture,
host(esk6_0) = host(esk9_0),
i_0_97 ).
cnf(c_0_152,plain,
( leq(index(pendack,host(X1)),host(X2))
| host(X1) != host(X3)
| index(status,host(X1)) != elec_2
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X3),queue(host(X2))) ),
i_0_122 ).
cnf(c_0_153,negated_conjecture,
host(esk6_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147])]) ).
cnf(c_0_154,plain,
( elem(X1,cons(X2,X3))
| X1 != X2 ),
i_0_52 ).
cnf(c_0_155,plain,
( queue(host(X1)) = cons(m_Down(X2),X3)
| ~ epred1_3(X3,X2,X1) ),
i_0_113 ).
cnf(c_0_156,negated_conjecture,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X1)) != elec_2
| ~ setIn(host(X1),index(down,host(X2)))
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_157,negated_conjecture,
setIn(esk9_0,alive),
i_0_98 ).
cnf(c_0_158,negated_conjecture,
~ leq(index(pendack,host(esk10_0)),host(esk6_0)),
inference(rw,[status(thm)],[c_0_150,c_0_151]) ).
cnf(c_0_159,negated_conjecture,
( X1 = host(esk7_0)
| leq(host(esk6_0),X1)
| setIn(X1,index(down,host(esk6_0)))
| ~ leq(s(zero),X1) ),
i_0_107 ).
cnf(c_0_160,negated_conjecture,
( leq(index(pendack,host(X1)),host(X2))
| index(status,host(X1)) != elec_2
| host(X1) != host(X3)
| ~ elem(m_Down(X3),queue(host(X2)))
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_152,c_0_149]) ).
cnf(c_0_161,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_151,c_0_153]) ).
cnf(c_0_162,plain,
elem(X1,cons(X1,X2)),
inference(er,[status(thm)],[c_0_154]) ).
cnf(c_0_163,negated_conjecture,
cons(m_Down(esk7_0),esk5_0) = queue(nbr_proc),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_149]),c_0_153]) ).
cnf(c_0_164,negated_conjecture,
( leq(index(pendack,host(X1)),nbr_proc)
| index(status,host(X1)) != elec_2
| ~ setIn(host(X1),index(down,nbr_proc))
| ~ setIn(X1,alive) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_156,c_0_157]),c_0_151]),c_0_153]),c_0_151]),c_0_153]) ).
cnf(c_0_165,negated_conjecture,
setIn(esk10_0,alive),
i_0_100 ).
cnf(c_0_166,negated_conjecture,
index(status,host(esk10_0)) = elec_2,
i_0_99 ).
cnf(c_0_167,negated_conjecture,
~ leq(index(pendack,host(esk10_0)),nbr_proc),
inference(rw,[status(thm)],[c_0_158,c_0_153]) ).
cnf(c_0_168,negated_conjecture,
( X1 = host(esk7_0)
| leq(nbr_proc,X1)
| setIn(X1,index(down,nbr_proc))
| ~ leq(s(zero),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_159,c_0_153]),c_0_153]) ).
cnf(c_0_169,plain,
leq(s(zero),host(X1)),
i_0_2 ).
cnf(c_0_170,negated_conjecture,
( leq(index(pendack,host(X1)),nbr_proc)
| index(status,host(X1)) != elec_2
| host(X1) != host(X2)
| ~ elem(m_Down(X2),queue(nbr_proc))
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_157])]) ).
cnf(c_0_171,plain,
elem(m_Down(esk7_0),queue(nbr_proc)),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_172,negated_conjecture,
~ setIn(host(esk10_0),index(down,nbr_proc)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_166])]),c_0_167]) ).
cnf(c_0_173,plain,
( host(X1) = host(esk7_0)
| leq(nbr_proc,host(X1))
| setIn(host(X1),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_174,plain,
( leq(index(pendack,host(X1)),nbr_proc)
| index(status,host(X1)) != elec_2
| host(X1) != host(esk7_0)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_175,negated_conjecture,
( host(esk10_0) = host(esk7_0)
| leq(nbr_proc,host(esk10_0)) ),
inference(spm,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_176,negated_conjecture,
host(esk10_0) != host(esk7_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_165]),c_0_166])]),c_0_167]) ).
cnf(c_0_177,negated_conjecture,
host(esk10_0) != host(esk6_0),
i_0_102 ).
cnf(c_0_178,negated_conjecture,
leq(nbr_proc,host(esk10_0)),
inference(sr,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_179,negated_conjecture,
host(esk10_0) != nbr_proc,
inference(rw,[status(thm)],[c_0_177,c_0_153]) ).
cnf(c_0_180,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_178]),c_0_147])]),c_0_179]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWV468+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jun 15 16:20:25 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.73/3.15 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 13.73/3.15 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 84; version: 991; iters: 150)
% 13.73/3.15 # Preprocessing time : 0.848 s
% 13.73/3.15 # Presaturation interreduction done
% 13.73/3.15
% 13.73/3.15 # Proof found!
% 13.73/3.15 # SZS status Theorem
% 13.73/3.15 # SZS output start CNFRefutation
% See solution above
% 13.73/3.15 # Training examples: 0 positive, 0 negative
% 13.73/3.15
% 13.73/3.15 # -------------------------------------------------
% 13.73/3.15 # User time : 0.754 s
% 13.73/3.15 # System time : 0.115 s
% 13.73/3.15 # Total time : 0.869 s
% 13.73/3.15 # ...preprocessing : 0.848 s
% 13.73/3.15 # ...main loop : 0.021 s
% 13.73/3.15 # Maximum resident set size: 168288 pages
% 13.73/3.15
%------------------------------------------------------------------------------