TSTP Solution File: SWV471+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV471+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:33 EDT 2022
% Result : Theorem 16.74s 3.52s
% Output : CNFRefutation 16.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 58 ( 28 unt; 8 nHn; 55 RR)
% Number of literals : 176 ( 66 equ; 120 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 13 con; 0-7 aty)
% Number of variables : 112 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_113,plain,
( leq(s(zero),esk12_7(X1,X2,X3,X4,X5,X6,X7))
| host(X7) != nbr_proc
| host(X5) != host(X7)
| index(status,host(X7)) != elec_1
| ~ setIn(X4,alive)
| ~ epred1_3(X3,X2,X1)
| ~ elem(m_Down(X6),queue(host(X7)))
| ~ elem(m_Down(X5),queue(host(X4))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_113) ).
cnf(i_0_109,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_109) ).
cnf(i_0_101,negated_conjecture,
host(esk9_0) = host(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_101) ).
cnf(i_0_100,negated_conjecture,
host(esk11_0) = nbr_proc,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_100) ).
cnf(i_0_99,negated_conjecture,
index(status,host(esk11_0)) = elec_1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_99) ).
cnf(i_0_102,negated_conjecture,
elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_102) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_56) ).
cnf(i_0_98,negated_conjecture,
setIn(esk8_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_98) ).
cnf(i_0_106,negated_conjecture,
host(esk6_0) = host(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_106) ).
cnf(i_0_12,plain,
m_Ack(X1,X2) != m_Down(X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_12) ).
cnf(i_0_51,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_51) ).
cnf(i_0_97,negated_conjecture,
elem(m_Down(esk9_0),esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_97) ).
cnf(i_0_110,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_110) ).
cnf(i_0_112,plain,
( host(X1) != nbr_proc
| host(X2) != host(X1)
| index(status,host(X1)) != elec_1
| ~ setIn(X3,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X3)))
| ~ setIn(esk12_7(X6,X5,X4,X3,X2,X7,X1),index(down,host(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_112) ).
cnf(i_0_114,plain,
( host(X1) != nbr_proc
| host(X1) != host(X2)
| index(status,host(X1)) != elec_1
| ~ setIn(X3,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X3)))
| ~ leq(host(X1),esk12_7(X6,X5,X4,X3,X2,X7,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_114) ).
cnf(i_0_103,negated_conjecture,
( X1 = host(esk10_0)
| leq(host(esk11_0),X1)
| setIn(X1,index(down,host(esk11_0)))
| ~ leq(s(zero),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_103) ).
cnf(i_0_111,plain,
( host(X1) != nbr_proc
| host(X2) != host(X1)
| index(status,host(X1)) != elec_1
| esk12_7(X3,X4,X5,X6,X2,X7,X1) != host(X7)
| ~ setIn(X6,alive)
| ~ epred1_3(X5,X4,X3)
| ~ elem(m_Down(X7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X6))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpkzq07/input.p',i_0_111) ).
cnf(c_0_132,plain,
( leq(s(zero),esk12_7(X1,X2,X3,X4,X5,X6,X7))
| host(X7) != nbr_proc
| host(X5) != host(X7)
| index(status,host(X7)) != elec_1
| ~ setIn(X4,alive)
| ~ epred1_3(X3,X2,X1)
| ~ elem(m_Down(X6),queue(host(X7)))
| ~ elem(m_Down(X5),queue(host(X4))) ),
i_0_113 ).
cnf(c_0_133,negated_conjecture,
epred1_3(esk5_0,esk6_0,esk7_0),
i_0_109 ).
cnf(c_0_134,negated_conjecture,
host(esk9_0) = host(esk11_0),
i_0_101 ).
cnf(c_0_135,negated_conjecture,
host(esk11_0) = nbr_proc,
i_0_100 ).
cnf(c_0_136,negated_conjecture,
index(status,host(esk11_0)) = elec_1,
i_0_99 ).
cnf(c_0_137,negated_conjecture,
elem(m_Down(esk10_0),snoc(queue(host(esk11_0)),m_Ack(esk7_0,esk6_0))),
i_0_102 ).
cnf(c_0_138,negated_conjecture,
( leq(s(zero),esk12_7(esk7_0,esk6_0,esk5_0,X1,X2,X3,X4))
| index(status,host(X4)) != elec_1
| host(X2) != host(X4)
| host(X4) != nbr_proc
| ~ elem(m_Down(X3),queue(host(X4)))
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_139,negated_conjecture,
host(esk9_0) = nbr_proc,
inference(rw,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_140,negated_conjecture,
index(status,nbr_proc) = elec_1,
inference(rw,[status(thm)],[c_0_136,c_0_135]) ).
cnf(c_0_141,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_142,negated_conjecture,
elem(m_Down(esk10_0),snoc(queue(nbr_proc),m_Ack(esk7_0,esk6_0))),
inference(rw,[status(thm)],[c_0_137,c_0_135]) ).
cnf(c_0_143,negated_conjecture,
( leq(s(zero),esk12_7(esk7_0,esk6_0,esk5_0,X1,X2,X3,esk9_0))
| host(X2) != nbr_proc
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X3),queue(nbr_proc))
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]) ).
cnf(c_0_144,negated_conjecture,
setIn(esk8_0,alive),
i_0_98 ).
cnf(c_0_145,negated_conjecture,
host(esk6_0) = host(esk8_0),
i_0_106 ).
cnf(c_0_146,negated_conjecture,
( m_Ack(esk7_0,esk6_0) = m_Down(esk10_0)
| elem(m_Down(esk10_0),queue(nbr_proc)) ),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_147,plain,
m_Ack(X1,X2) != m_Down(X3),
i_0_12 ).
cnf(c_0_148,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
i_0_51 ).
cnf(c_0_149,negated_conjecture,
elem(m_Down(esk9_0),esk5_0),
i_0_97 ).
cnf(c_0_150,plain,
( queue(host(X1)) = cons(m_Halt(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
i_0_110 ).
cnf(c_0_151,plain,
( host(X1) != nbr_proc
| host(X2) != host(X1)
| index(status,host(X1)) != elec_1
| ~ setIn(X3,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X3)))
| ~ setIn(esk12_7(X6,X5,X4,X3,X2,X7,X1),index(down,host(X1))) ),
i_0_112 ).
cnf(c_0_152,negated_conjecture,
( leq(s(zero),esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,X1,X2,esk9_0))
| host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(esk6_0)))
| ~ elem(m_Down(X2),queue(nbr_proc)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145]) ).
cnf(c_0_153,negated_conjecture,
elem(m_Down(esk10_0),queue(nbr_proc)),
inference(sr,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_154,negated_conjecture,
elem(m_Down(esk9_0),cons(X1,esk5_0)),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_155,negated_conjecture,
cons(m_Halt(esk7_0),esk5_0) = queue(host(esk6_0)),
inference(spm,[status(thm)],[c_0_150,c_0_133]) ).
cnf(c_0_156,plain,
( host(X1) != nbr_proc
| host(X1) != host(X2)
| index(status,host(X1)) != elec_1
| ~ setIn(X3,alive)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X3)))
| ~ leq(host(X1),esk12_7(X6,X5,X4,X3,X2,X7,X1)) ),
i_0_114 ).
cnf(c_0_157,negated_conjecture,
( index(status,host(X1)) != elec_1
| host(X1) != host(X2)
| host(X1) != nbr_proc
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X4)))
| ~ setIn(esk12_7(esk7_0,esk6_0,esk5_0,X4,X2,X3,X1),index(down,host(X1)))
| ~ setIn(X4,alive) ),
inference(spm,[status(thm)],[c_0_151,c_0_133]) ).
cnf(c_0_158,negated_conjecture,
( X1 = host(esk10_0)
| leq(host(esk11_0),X1)
| setIn(X1,index(down,host(esk11_0)))
| ~ leq(s(zero),X1) ),
i_0_103 ).
cnf(c_0_159,negated_conjecture,
( leq(s(zero),esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,X1,esk10_0,esk9_0))
| host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(esk6_0))) ),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_160,negated_conjecture,
elem(m_Down(esk9_0),queue(host(esk6_0))),
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_161,negated_conjecture,
( index(status,host(X1)) != elec_1
| host(X1) != host(X2)
| host(X1) != nbr_proc
| ~ elem(m_Down(X3),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X4)))
| ~ leq(host(X1),esk12_7(esk7_0,esk6_0,esk5_0,X4,X2,X3,X1))
| ~ setIn(X4,alive) ),
inference(spm,[status(thm)],[c_0_156,c_0_133]) ).
cnf(c_0_162,negated_conjecture,
( host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Down(X3),queue(nbr_proc))
| ~ setIn(esk12_7(esk7_0,esk6_0,esk5_0,X2,X1,X3,esk9_0),index(down,nbr_proc))
| ~ setIn(X2,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_139]),c_0_140])]) ).
cnf(c_0_163,negated_conjecture,
( X1 = host(esk10_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_158,c_0_135]),c_0_135]) ).
cnf(c_0_164,negated_conjecture,
leq(s(zero),esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_139])]) ).
cnf(c_0_165,negated_conjecture,
( host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(X2)))
| ~ elem(m_Down(X3),queue(nbr_proc))
| ~ leq(nbr_proc,esk12_7(esk7_0,esk6_0,esk5_0,X2,X1,X3,esk9_0))
| ~ setIn(X2,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_139]),c_0_140])]) ).
cnf(c_0_166,negated_conjecture,
( host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(esk6_0)))
| ~ elem(m_Down(X2),queue(nbr_proc))
| ~ setIn(esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,X1,X2,esk9_0),index(down,nbr_proc)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_144]),c_0_145]) ).
cnf(c_0_167,negated_conjecture,
( esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0) = host(esk10_0)
| leq(nbr_proc,esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0))
| setIn(esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0),index(down,nbr_proc)) ),
inference(spm,[status(thm)],[c_0_163,c_0_164]) ).
cnf(c_0_168,negated_conjecture,
( host(X1) != nbr_proc
| ~ elem(m_Down(X1),queue(host(esk6_0)))
| ~ elem(m_Down(X2),queue(nbr_proc))
| ~ leq(nbr_proc,esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,X1,X2,esk9_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_144]),c_0_145]) ).
cnf(c_0_169,negated_conjecture,
( esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0) = host(esk10_0)
| leq(nbr_proc,esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_139]),c_0_160]),c_0_153])]) ).
cnf(c_0_170,plain,
( host(X1) != nbr_proc
| host(X2) != host(X1)
| index(status,host(X1)) != elec_1
| esk12_7(X3,X4,X5,X6,X2,X7,X1) != host(X7)
| ~ setIn(X6,alive)
| ~ epred1_3(X5,X4,X3)
| ~ elem(m_Down(X7),queue(host(X1)))
| ~ elem(m_Down(X2),queue(host(X6))) ),
i_0_111 ).
cnf(c_0_171,negated_conjecture,
esk12_7(esk7_0,esk6_0,esk5_0,esk8_0,esk9_0,esk10_0,esk9_0) = host(esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_139]),c_0_160]),c_0_153])]) ).
cnf(c_0_172,plain,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_139]),c_0_140]),c_0_139]),c_0_133]),c_0_139]),c_0_153]),c_0_145]),c_0_160]),c_0_144])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV471+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/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 19:28:25 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/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
% 16.74/3.52 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.74/3.52 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 79; version: 991; iters: 150)
% 16.74/3.52 # Preprocessing time : 0.871 s
% 16.74/3.52 # Presaturation interreduction done
% 16.74/3.52
% 16.74/3.52 # Proof found!
% 16.74/3.52 # SZS status Theorem
% 16.74/3.52 # SZS output start CNFRefutation
% See solution above
% 16.74/3.52 # Training examples: 0 positive, 0 negative
% 16.74/3.52
% 16.74/3.52 # -------------------------------------------------
% 16.74/3.52 # User time : 0.911 s
% 16.74/3.52 # System time : 0.118 s
% 16.74/3.52 # Total time : 1.029 s
% 16.74/3.52 # ...preprocessing : 0.871 s
% 16.74/3.52 # ...main loop : 0.158 s
% 16.74/3.52 # Maximum resident set size: 168132 pages
% 16.74/3.52
%------------------------------------------------------------------------------