TSTP Solution File: SWV451+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV451+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:29 EDT 2022
% Result : Theorem 17.07s 3.59s
% Output : CNFRefutation 17.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 55 ( 27 unt; 7 nHn; 53 RR)
% Number of literals : 123 ( 51 equ; 68 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 79 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_122,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_122) ).
cnf(i_0_119,negated_conjecture,
epred1_3(esk5_0,esk8_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_119) ).
cnf(i_0_123,plain,
( setIn(X1,alive)
| host(X1) != host(X2)
| ~ leq(X2,X1)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_123) ).
cnf(i_0_118,negated_conjecture,
setIn(esk8_0,alive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_118) ).
cnf(i_0_120,plain,
( queue(host(X1)) = cons(m_NotNorm(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_120) ).
cnf(i_0_56,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_56) ).
cnf(i_0_97,negated_conjecture,
elem(m_Down(esk12_0),snoc(queue(host(esk9_0)),m_Halt(esk6_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_97) ).
cnf(i_0_114,negated_conjecture,
( leq(X1,esk6_0)
| host(esk8_0) != host(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_114) ).
cnf(i_0_112,negated_conjecture,
host(esk6_0) = host(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_112) ).
cnf(i_0_51,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_51) ).
cnf(i_0_121,plain,
( host(X1) = host(X2)
| host(X2) != host(X3)
| host(X1) != host(X4)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X5,X6,X7)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_121) ).
cnf(i_0_17,plain,
m_Down(X1) != m_Halt(X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_17) ).
cnf(i_0_99,negated_conjecture,
host(esk12_0) = host(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_99) ).
cnf(i_0_106,negated_conjecture,
host(esk11_0) = host(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_106) ).
cnf(i_0_108,negated_conjecture,
host(esk9_0) != host(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_108) ).
cnf(i_0_98,negated_conjecture,
elem(m_Down(esk10_0),esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_98) ).
cnf(i_0_100,negated_conjecture,
host(esk9_0) = host(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_100) ).
cnf(i_0_104,negated_conjecture,
( esk9_0 = esk6_0
| setIn(esk9_0,alive) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mu4um80f/input.p',i_0_104) ).
cnf(c_0_142,plain,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X3,X4,X5) ),
i_0_122 ).
cnf(c_0_143,negated_conjecture,
epred1_3(esk5_0,esk8_0,esk7_0),
i_0_119 ).
cnf(c_0_144,plain,
( setIn(X1,alive)
| host(X1) != host(X2)
| ~ leq(X2,X1)
| ~ setIn(X2,alive)
| ~ epred1_3(X3,X4,X5) ),
i_0_123 ).
cnf(c_0_145,negated_conjecture,
( X1 = X2
| host(X1) != host(X2)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_146,negated_conjecture,
setIn(esk8_0,alive),
i_0_118 ).
cnf(c_0_147,negated_conjecture,
( setIn(X1,alive)
| host(X1) != host(X2)
| ~ leq(X2,X1)
| ~ setIn(X2,alive) ),
inference(spm,[status(thm)],[c_0_144,c_0_143]) ).
cnf(c_0_148,negated_conjecture,
( X1 = esk8_0
| host(X1) != host(esk8_0)
| ~ setIn(X1,alive) ),
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_149,negated_conjecture,
( setIn(X1,alive)
| host(X1) != host(esk8_0)
| ~ leq(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_147,c_0_146]) ).
cnf(c_0_150,plain,
( queue(host(X1)) = cons(m_NotNorm(X2),X3)
| ~ epred1_3(X3,X1,X2) ),
i_0_120 ).
cnf(c_0_151,plain,
( X1 = X2
| elem(X1,X3)
| ~ elem(X1,snoc(X3,X2)) ),
i_0_56 ).
cnf(c_0_152,negated_conjecture,
elem(m_Down(esk12_0),snoc(queue(host(esk9_0)),m_Halt(esk6_0))),
i_0_97 ).
cnf(c_0_153,negated_conjecture,
( X1 = esk8_0
| host(X1) != host(esk8_0)
| ~ leq(esk8_0,X1) ),
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_154,negated_conjecture,
( leq(X1,esk6_0)
| host(esk8_0) != host(X1) ),
i_0_114 ).
cnf(c_0_155,negated_conjecture,
host(esk6_0) = host(esk8_0),
i_0_112 ).
cnf(c_0_156,plain,
( elem(X1,cons(X2,X3))
| ~ elem(X1,X3) ),
i_0_51 ).
cnf(c_0_157,negated_conjecture,
cons(m_NotNorm(esk7_0),esk5_0) = queue(host(esk8_0)),
inference(spm,[status(thm)],[c_0_150,c_0_143]) ).
cnf(c_0_158,negated_conjecture,
( m_Halt(esk6_0) = m_Down(esk12_0)
| elem(m_Down(esk12_0),queue(host(esk9_0))) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_159,negated_conjecture,
esk6_0 = esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155])]) ).
cnf(c_0_160,plain,
( host(X1) = host(X2)
| host(X2) != host(X3)
| host(X1) != host(X4)
| ~ setIn(X2,alive)
| ~ setIn(X1,alive)
| ~ epred1_3(X5,X6,X7)
| ~ elem(m_Down(X4),queue(host(X2)))
| ~ elem(m_Down(X3),queue(host(X1))) ),
i_0_121 ).
cnf(c_0_161,plain,
( elem(X1,queue(host(esk8_0)))
| ~ elem(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_162,negated_conjecture,
( m_Halt(esk8_0) = m_Down(esk12_0)
| elem(m_Down(esk12_0),queue(host(esk9_0))) ),
inference(rw,[status(thm)],[c_0_158,c_0_159]) ).
cnf(c_0_163,plain,
m_Down(X1) != m_Halt(X2),
i_0_17 ).
cnf(c_0_164,negated_conjecture,
host(esk12_0) = host(esk11_0),
i_0_99 ).
cnf(c_0_165,negated_conjecture,
host(esk11_0) = host(esk8_0),
i_0_106 ).
cnf(c_0_166,plain,
( host(X1) = host(esk8_0)
| host(esk8_0) != host(X2)
| host(X1) != host(X3)
| ~ epred1_3(X4,X5,X6)
| ~ elem(m_Down(X2),queue(host(X1)))
| ~ elem(m_Down(X3),esk5_0)
| ~ setIn(X1,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_146])]) ).
cnf(c_0_167,negated_conjecture,
elem(m_Down(esk12_0),queue(host(esk9_0))),
inference(sr,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_168,negated_conjecture,
host(esk12_0) = host(esk8_0),
inference(rw,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_169,negated_conjecture,
host(esk9_0) != host(esk8_0),
i_0_108 ).
cnf(c_0_170,plain,
( host(esk9_0) != host(X1)
| ~ epred1_3(X2,X3,X4)
| ~ elem(m_Down(X1),esk5_0)
| ~ setIn(esk9_0,alive) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_168])]),c_0_169]) ).
cnf(c_0_171,negated_conjecture,
elem(m_Down(esk10_0),esk5_0),
i_0_98 ).
cnf(c_0_172,negated_conjecture,
host(esk9_0) = host(esk10_0),
i_0_100 ).
cnf(c_0_173,negated_conjecture,
( esk9_0 = esk6_0
| setIn(esk9_0,alive) ),
i_0_104 ).
cnf(c_0_174,negated_conjecture,
( ~ epred1_3(X1,X2,X3)
| ~ setIn(esk9_0,alive) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_172])]) ).
cnf(c_0_175,negated_conjecture,
( esk9_0 = esk8_0
| setIn(esk9_0,alive) ),
inference(rw,[status(thm)],[c_0_173,c_0_159]) ).
cnf(c_0_176,negated_conjecture,
~ setIn(esk9_0,alive),
inference(spm,[status(thm)],[c_0_174,c_0_143]) ).
cnf(c_0_177,negated_conjecture,
esk9_0 = esk8_0,
inference(sr,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_178,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_177]),c_0_146])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV451+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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 18:45:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.07/3.59 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.07/3.59 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 81; version: 991; iters: 150)
% 17.07/3.59 # Preprocessing time : 1.094 s
% 17.07/3.59
% 17.07/3.59 # Proof found!
% 17.07/3.59 # SZS status Theorem
% 17.07/3.59 # SZS output start CNFRefutation
% See solution above
% 17.07/3.59 # Training examples: 0 positive, 0 negative
% 17.07/3.59
% 17.07/3.59 # -------------------------------------------------
% 17.07/3.59 # User time : 1.007 s
% 17.07/3.59 # System time : 0.128 s
% 17.07/3.59 # Total time : 1.135 s
% 17.07/3.59 # ...preprocessing : 1.094 s
% 17.07/3.59 # ...main loop : 0.040 s
% 17.07/3.59 # Maximum resident set size: 176948 pages
% 17.07/3.59
%------------------------------------------------------------------------------