TSTP Solution File: SWV464+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV464+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:31 EDT 2022
% Result : Theorem 16.66s 3.45s
% Output : CNFRefutation 16.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 47 ( 36 unt; 3 nHn; 43 RR)
% Number of literals : 95 ( 43 equ; 55 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 23 ( 23 usr; 15 con; 0-2 aty)
% Number of variables : 50 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_100,negated_conjecture,
s(index(pendack,host(esk12_0))) = host(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_100) ).
cnf(i_0_101,negated_conjecture,
index(pendack,host(esk12_0)) = host(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_101) ).
cnf(i_0_105,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk12_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_105) ).
cnf(i_0_116,plain,
( index(status,host(X1)) != norm
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| index(ldr,host(X1)) != host(X1)
| host(X4) != s(index(pendack,host(X2)))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_4(X5,X6,X7,X8)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ leq(nbr_proc,s(index(pendack,host(X2)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_116) ).
cnf(i_0_114,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_114) ).
cnf(i_0_87,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_87) ).
cnf(i_0_4,plain,
leq(host(X1),nbr_proc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_4) ).
cnf(i_0_106,negated_conjecture,
setIn(esk12_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_106) ).
cnf(i_0_102,negated_conjecture,
index(status,host(esk12_0)) = elec_2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_102) ).
cnf(i_0_83,plain,
leq(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_83) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_56) ).
cnf(i_0_104,negated_conjecture,
elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Halt(esk7_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_104) ).
cnf(i_0_99,negated_conjecture,
setIn(esk9_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_99) ).
cnf(i_0_98,negated_conjecture,
index(ldr,host(esk9_0)) = host(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_98) ).
cnf(i_0_97,negated_conjecture,
index(status,host(esk9_0)) = norm,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_97) ).
cnf(i_0_17,plain,
m_Down(X1) != m_Halt(X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_17) ).
cnf(i_0_103,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Halt(esk7_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_103) ).
cnf(i_0_11,plain,
m_Ack(X1,X2) != m_Halt(X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-trdi0cxx/input.p',i_0_11) ).
cnf(c_0_135,negated_conjecture,
s(index(pendack,host(esk12_0))) = host(esk11_0),
i_0_100 ).
cnf(c_0_136,negated_conjecture,
index(pendack,host(esk12_0)) = host(esk10_0),
i_0_101 ).
cnf(c_0_137,negated_conjecture,
leq(nbr_proc,s(index(pendack,host(esk12_0)))),
i_0_105 ).
cnf(c_0_138,negated_conjecture,
s(host(esk10_0)) = host(esk11_0),
inference(rw,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_139,plain,
( index(status,host(X1)) != norm
| index(status,host(X2)) != elec_2
| host(X3) != index(pendack,host(X2))
| index(ldr,host(X1)) != host(X1)
| host(X4) != s(index(pendack,host(X2)))
| ~ setIn(X1,alive)
| ~ setIn(X2,alive)
| ~ epred1_4(X5,X6,X7,X8)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ leq(nbr_proc,s(index(pendack,host(X2)))) ),
i_0_116 ).
cnf(c_0_140,negated_conjecture,
epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
i_0_114 ).
cnf(c_0_141,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_87 ).
cnf(c_0_142,negated_conjecture,
leq(nbr_proc,host(esk11_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_136]),c_0_138]) ).
cnf(c_0_143,plain,
leq(host(X1),nbr_proc),
i_0_4 ).
cnf(c_0_144,negated_conjecture,
( host(X1) != s(index(pendack,host(X2)))
| host(X3) != index(pendack,host(X2))
| index(ldr,host(X4)) != host(X4)
| index(status,host(X2)) != elec_2
| index(status,host(X4)) != norm
| ~ elem(m_Ack(X2,X3),queue(host(X2)))
| ~ elem(m_Down(X1),queue(host(X2)))
| ~ leq(nbr_proc,s(index(pendack,host(X2))))
| ~ setIn(X2,alive)
| ~ setIn(X4,alive) ),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_145,negated_conjecture,
setIn(esk12_0,alive),
i_0_106 ).
cnf(c_0_146,negated_conjecture,
host(esk11_0) = nbr_proc,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143])]) ).
cnf(c_0_147,negated_conjecture,
index(status,host(esk12_0)) = elec_2,
i_0_102 ).
cnf(c_0_148,plain,
leq(X1,X1),
i_0_83 ).
cnf(c_0_149,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_150,negated_conjecture,
elem(m_Down(esk11_0),snoc(queue(host(esk12_0)),m_Halt(esk7_0))),
i_0_104 ).
cnf(c_0_151,negated_conjecture,
( index(ldr,host(X1)) != host(X1)
| index(status,host(X1)) != norm
| host(X2) != host(esk10_0)
| host(X3) != nbr_proc
| ~ elem(m_Ack(esk12_0,X2),queue(host(esk12_0)))
| ~ elem(m_Down(X3),queue(host(esk12_0)))
| ~ setIn(X1,alive) ),
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_144,c_0_145]),c_0_136]),c_0_138]),c_0_146]),c_0_136]),c_0_147]),c_0_136]),c_0_138]),c_0_146]),c_0_148])]) ).
cnf(c_0_152,negated_conjecture,
setIn(esk9_0,alive),
i_0_99 ).
cnf(c_0_153,negated_conjecture,
index(ldr,host(esk9_0)) = host(esk9_0),
i_0_98 ).
cnf(c_0_154,negated_conjecture,
index(status,host(esk9_0)) = norm,
i_0_97 ).
cnf(c_0_155,negated_conjecture,
( m_Halt(esk7_0) = m_Down(esk11_0)
| elem(m_Down(esk11_0),queue(host(esk12_0))) ),
inference(spm,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_156,plain,
m_Down(X1) != m_Halt(X2),
i_0_17 ).
cnf(c_0_157,negated_conjecture,
( host(X1) != host(esk10_0)
| host(X2) != nbr_proc
| ~ elem(m_Ack(esk12_0,X1),queue(host(esk12_0)))
| ~ elem(m_Down(X2),queue(host(esk12_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153]),c_0_154])]) ).
cnf(c_0_158,negated_conjecture,
elem(m_Down(esk11_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[c_0_155,c_0_156]) ).
cnf(c_0_159,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),snoc(queue(host(esk12_0)),m_Halt(esk7_0))),
i_0_103 ).
cnf(c_0_160,plain,
m_Ack(X1,X2) != m_Halt(X3),
i_0_11 ).
cnf(c_0_161,negated_conjecture,
( host(X1) != host(esk10_0)
| ~ elem(m_Ack(esk12_0,X1),queue(host(esk12_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_146])]) ).
cnf(c_0_162,negated_conjecture,
elem(m_Ack(esk12_0,esk10_0),queue(host(esk12_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_159]),c_0_160]) ).
cnf(c_0_163,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_161,c_0_162]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV464+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 Jun 15 10:12:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.66/3.45 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.66/3.45 # 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: 77; version: 991; iters: 150)
% 16.66/3.45 # Preprocessing time : 1.082 s
% 16.66/3.45 # Presaturation interreduction done
% 16.66/3.45
% 16.66/3.45 # Proof found!
% 16.66/3.45 # SZS status Theorem
% 16.66/3.45 # SZS output start CNFRefutation
% See solution above
% 16.66/3.45 # Training examples: 0 positive, 0 negative
% 16.66/3.45
% 16.66/3.45 # -------------------------------------------------
% 16.66/3.45 # User time : 0.996 s
% 16.66/3.45 # System time : 0.113 s
% 16.66/3.45 # Total time : 1.109 s
% 16.66/3.45 # ...preprocessing : 1.082 s
% 16.66/3.45 # ...main loop : 0.028 s
% 16.66/3.45 # Maximum resident set size: 168036 pages
% 16.66/3.45
%------------------------------------------------------------------------------