TSTP Solution File: SWV473+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWV473+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:33 EDT 2022

% Result   : Theorem 16.07s 3.32s
% Output   : CNFRefutation 16.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   54 (  30 unt;   7 nHn;  46 RR)
%            Number of literals    :  137 (  56 equ;  78 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :   19 (  19 usr;  12 con; 0-2 aty)
%            Number of variables   :   81 (  23 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_114,plain,
    ( host(X1) = host(X2)
    | host(X2) != host(X3)
    | host(X1) != host(X4)
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive)
    | ~ epred1_4(X5,X6,X7,X8)
    | ~ elem(m_Down(X4),queue(host(X2)))
    | ~ setIn(host(X3),index(down,host(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_114) ).

cnf(i_0_108,negated_conjecture,
    epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_108) ).

cnf(i_0_104,negated_conjecture,
    host(esk7_0) = host(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_104) ).

cnf(i_0_100,negated_conjecture,
    host(esk12_0) = nbr_proc,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_100) ).

cnf(i_0_98,negated_conjecture,
    setIn(esk9_0,alive),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_98) ).

cnf(i_0_105,negated_conjecture,
    host(esk9_0) != host(esk7_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_105) ).

cnf(i_0_103,negated_conjecture,
    ( X1 = host(esk11_0)
    | leq(host(esk12_0),X1)
    | setIn(X1,index(down,host(esk12_0)))
    | ~ leq(s(zero),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_103) ).

cnf(i_0_107,negated_conjecture,
    setIn(esk7_0,alive),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_107) ).

cnf(i_0_2,plain,
    leq(s(zero),host(X1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_2) ).

cnf(i_0_101,negated_conjecture,
    host(esk10_0) = host(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_101) ).

cnf(i_0_115,plain,
    ( host(X1) = host(X2)
    | host(X2) != host(X3)
    | host(X1) != host(X4)
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive)
    | ~ epred1_4(X5,X6,X7,X8)
    | ~ elem(m_Down(X4),queue(host(X2)))
    | ~ elem(m_Down(X3),queue(host(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_115) ).

cnf(i_0_97,negated_conjecture,
    elem(m_Down(esk10_0),queue(host(esk9_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_97) ).

cnf(i_0_51,plain,
    ( elem(X1,cons(X2,X3))
    | ~ elem(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_51) ).

cnf(i_0_102,negated_conjecture,
    elem(m_Down(esk11_0),esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_102) ).

cnf(i_0_109,plain,
    ( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
    | ~ epred1_4(X4,X2,X3,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_109) ).

cnf(i_0_87,plain,
    ( X1 = X2
    | ~ leq(X2,X1)
    | ~ leq(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_87) ).

cnf(i_0_4,plain,
    leq(host(X1),nbr_proc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9v3e6h5a/input.p',i_0_4) ).

cnf(c_0_133,plain,
    ( host(X1) = host(X2)
    | host(X2) != host(X3)
    | host(X1) != host(X4)
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive)
    | ~ epred1_4(X5,X6,X7,X8)
    | ~ elem(m_Down(X4),queue(host(X2)))
    | ~ setIn(host(X3),index(down,host(X1))) ),
    i_0_114 ).

cnf(c_0_134,negated_conjecture,
    epred1_4(esk5_0,esk6_0,esk8_0,esk7_0),
    i_0_108 ).

cnf(c_0_135,negated_conjecture,
    host(esk7_0) = host(esk12_0),
    i_0_104 ).

cnf(c_0_136,negated_conjecture,
    host(esk12_0) = nbr_proc,
    i_0_100 ).

cnf(c_0_137,negated_conjecture,
    ( host(X1) = host(X2)
    | host(X2) != host(X3)
    | host(X1) != host(X4)
    | ~ elem(m_Down(X4),queue(host(X2)))
    | ~ setIn(host(X3),index(down,host(X1)))
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_133,c_0_134]) ).

cnf(c_0_138,negated_conjecture,
    setIn(esk9_0,alive),
    i_0_98 ).

cnf(c_0_139,negated_conjecture,
    host(esk9_0) != host(esk7_0),
    i_0_105 ).

cnf(c_0_140,negated_conjecture,
    host(esk7_0) = nbr_proc,
    inference(rw,[status(thm)],[c_0_135,c_0_136]) ).

cnf(c_0_141,negated_conjecture,
    ( X1 = host(esk11_0)
    | leq(host(esk12_0),X1)
    | setIn(X1,index(down,host(esk12_0)))
    | ~ leq(s(zero),X1) ),
    i_0_103 ).

cnf(c_0_142,negated_conjecture,
    ( host(X1) = host(esk9_0)
    | host(esk9_0) != host(X2)
    | host(X1) != host(X3)
    | ~ elem(m_Down(X3),queue(host(esk9_0)))
    | ~ setIn(host(X2),index(down,host(X1)))
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_137,c_0_138]) ).

cnf(c_0_143,negated_conjecture,
    setIn(esk7_0,alive),
    i_0_107 ).

cnf(c_0_144,negated_conjecture,
    host(esk9_0) != nbr_proc,
    inference(rw,[status(thm)],[c_0_139,c_0_140]) ).

cnf(c_0_145,negated_conjecture,
    ( X1 = host(esk11_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_141,c_0_136]),c_0_136]) ).

cnf(c_0_146,plain,
    leq(s(zero),host(X1)),
    i_0_2 ).

cnf(c_0_147,negated_conjecture,
    ( host(esk9_0) != host(X1)
    | host(X2) != nbr_proc
    | ~ elem(m_Down(X2),queue(host(esk9_0)))
    | ~ setIn(host(X1),index(down,nbr_proc)) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_140]),c_0_140]),c_0_140]),c_0_144]) ).

cnf(c_0_148,plain,
    ( host(X1) = host(esk11_0)
    | leq(nbr_proc,host(X1))
    | setIn(host(X1),index(down,nbr_proc)) ),
    inference(spm,[status(thm)],[c_0_145,c_0_146]) ).

cnf(c_0_149,negated_conjecture,
    host(esk10_0) = host(esk12_0),
    i_0_101 ).

cnf(c_0_150,plain,
    ( host(X1) = host(X2)
    | host(X2) != host(X3)
    | host(X1) != host(X4)
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive)
    | ~ epred1_4(X5,X6,X7,X8)
    | ~ elem(m_Down(X4),queue(host(X2)))
    | ~ elem(m_Down(X3),queue(host(X1))) ),
    i_0_115 ).

cnf(c_0_151,plain,
    ( host(X1) = host(esk11_0)
    | leq(nbr_proc,host(X1))
    | host(esk9_0) != host(X1)
    | host(X2) != nbr_proc
    | ~ elem(m_Down(X2),queue(host(esk9_0))) ),
    inference(spm,[status(thm)],[c_0_147,c_0_148]) ).

cnf(c_0_152,negated_conjecture,
    elem(m_Down(esk10_0),queue(host(esk9_0))),
    i_0_97 ).

cnf(c_0_153,negated_conjecture,
    host(esk10_0) = nbr_proc,
    inference(rw,[status(thm)],[c_0_149,c_0_136]) ).

cnf(c_0_154,negated_conjecture,
    ( host(X1) = host(X2)
    | host(X2) != host(X3)
    | host(X1) != host(X4)
    | ~ elem(m_Down(X4),queue(host(X2)))
    | ~ elem(m_Down(X3),queue(host(X1)))
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_150,c_0_134]) ).

cnf(c_0_155,plain,
    ( elem(X1,cons(X2,X3))
    | ~ elem(X1,X3) ),
    i_0_51 ).

cnf(c_0_156,negated_conjecture,
    elem(m_Down(esk11_0),esk5_0),
    i_0_102 ).

cnf(c_0_157,plain,
    ( queue(host(X1)) = cons(m_Ack(X2,X3),X4)
    | ~ epred1_4(X4,X2,X3,X1) ),
    i_0_109 ).

cnf(c_0_158,negated_conjecture,
    ( host(X1) = host(esk11_0)
    | leq(nbr_proc,host(X1))
    | host(esk9_0) != host(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153])]) ).

cnf(c_0_159,negated_conjecture,
    ( host(X1) = host(esk9_0)
    | host(esk9_0) != host(X2)
    | host(X1) != host(X3)
    | ~ elem(m_Down(X3),queue(host(esk9_0)))
    | ~ elem(m_Down(X2),queue(host(X1)))
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_154,c_0_138]) ).

cnf(c_0_160,negated_conjecture,
    elem(m_Down(esk11_0),cons(X1,esk5_0)),
    inference(spm,[status(thm)],[c_0_155,c_0_156]) ).

cnf(c_0_161,negated_conjecture,
    cons(m_Ack(esk6_0,esk8_0),esk5_0) = queue(nbr_proc),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_134]),c_0_140]) ).

cnf(c_0_162,plain,
    ( X1 = X2
    | ~ leq(X2,X1)
    | ~ leq(X1,X2) ),
    i_0_87 ).

cnf(c_0_163,negated_conjecture,
    ( host(esk11_0) = host(esk9_0)
    | leq(nbr_proc,host(esk9_0)) ),
    inference(er,[status(thm)],[c_0_158]) ).

cnf(c_0_164,plain,
    leq(host(X1),nbr_proc),
    i_0_4 ).

cnf(c_0_165,negated_conjecture,
    ( host(esk9_0) != host(X1)
    | host(X2) != nbr_proc
    | ~ elem(m_Down(X2),queue(host(esk9_0)))
    | ~ elem(m_Down(X1),queue(nbr_proc)) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_143]),c_0_140]),c_0_140]),c_0_140]),c_0_144]) ).

cnf(c_0_166,negated_conjecture,
    elem(m_Down(esk11_0),queue(nbr_proc)),
    inference(spm,[status(thm)],[c_0_160,c_0_161]) ).

cnf(c_0_167,plain,
    host(esk11_0) = host(esk9_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_164])]),c_0_144]) ).

cnf(c_0_168,negated_conjecture,
    ( host(X1) != nbr_proc
    | ~ elem(m_Down(X1),queue(host(esk9_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_167])]) ).

cnf(c_0_169,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_152]),c_0_153])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV473+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 23:09:33 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 0.19/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 16.07/3.32  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.07/3.32  # 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: 82; version: 991; iters: 150)
% 16.07/3.32  # Preprocessing time       : 0.847 s
% 16.07/3.32  # Presaturation interreduction done
% 16.07/3.32  
% 16.07/3.32  # Proof found!
% 16.07/3.32  # SZS status Theorem
% 16.07/3.32  # SZS output start CNFRefutation
% See solution above
% 16.07/3.32  # Training examples: 0 positive, 0 negative
% 16.07/3.32  
% 16.07/3.32  # -------------------------------------------------
% 16.07/3.32  # User time                : 0.871 s
% 16.07/3.32  # System time              : 0.116 s
% 16.07/3.32  # Total time               : 0.987 s
% 16.07/3.32  # ...preprocessing         : 0.847 s
% 16.07/3.32  # ...main loop             : 0.140 s
% 16.07/3.32  # Maximum resident set size: 167764 pages
% 16.07/3.32  
%------------------------------------------------------------------------------