TSTP Solution File: SWV451+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV451+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n026.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 18:16:51 EDT 2022

% Result   : Theorem 0.25s 1.42s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   69 (  32 unt;   0 def)
%            Number of atoms       :  332 ( 140 equ)
%            Maximal formula atoms :   51 (   4 avg)
%            Number of connectives :  434 ( 171   ~; 103   |; 106   &)
%                                         (   4 <=>;  50  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   39 (   5 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   26 (  26 usr;  16 con; 0-2 aty)
%            Number of variables   :  204 (  29 sgn 138   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_58,axiom,
    ! [X5] : ~ leq(s(X5),X5),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_58) ).

fof(axiom_64,axiom,
    ! [X5,X6] :
      ( leq(X5,s(X6))
    <=> ( X5 = s(X6)
        | leq(X5,X6) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_64) ).

fof(conj,conjecture,
    ! [X12,X13,X5,X6] :
      ( ( ! [X7,X14] :
            ( setIn(X14,alive)
           => ~ elem(m_Down(X14),queue(host(X7))) )
        & ! [X7,X14] :
            ( elem(m_Down(X14),queue(host(X7)))
           => ~ setIn(X14,alive) )
        & ! [X7,X14] :
            ( elem(m_Down(X14),queue(host(X7)))
           => host(X14) != host(X7) )
        & ! [X7,X14] :
            ( elem(m_Halt(X14),queue(host(X7)))
           => ~ leq(host(X7),host(X14)) )
        & ! [X7,X15,X14] :
            ( elem(m_Ack(X14,X7),queue(host(X15)))
           => ~ leq(host(X7),host(X14)) )
        & ! [X7,X14] :
            ( ( ~ setIn(X7,alive)
              & leq(X14,X7)
              & host(X14) = host(X7) )
           => ~ setIn(X14,alive) )
        & ! [X7,X14] :
            ( ( X14 != X7
              & host(X14) = host(X7) )
           => ( ~ setIn(X7,alive)
              | ~ setIn(X14,alive) ) )
        & ! [X7,X16,X15,X14] :
            ( ( host(X15) != host(X7)
              & setIn(X7,alive)
              & setIn(X15,alive)
              & host(X16) = host(X7)
              & host(X14) = host(X15) )
           => ~ ( elem(m_Down(X14),queue(host(X7)))
                & elem(m_Down(X16),queue(host(X15))) ) )
        & queue(host(X6)) = cons(m_NotNorm(X5),X12) )
     => ( setIn(X6,alive)
       => ( ( index(ldr,host(X6)) = host(X6)
            & index(status,host(X6)) = norm
            & index(elid,host(X6)) = X5 )
         => ( ( ! [X7] :
                  ( host(X6) = host(X7)
                 => leq(X7,X13) )
              & ~ setIn(X13,pids)
              & host(X6) = host(X13) )
           => ( host(X13) = s(zero)
             => ( ~ leq(nbr_proc,host(X13))
               => ! [X7] :
                    ( s(host(X13)) = host(X7)
                   => ( host(X6) != host(X7)
                     => ! [X17,X18] :
                          ( s(host(X13)) != host(X18)
                         => ( host(X6) = host(X18)
                           => ! [X19] :
                                ( ( ( ( X7 != X6
                                      & setIn(X7,alive) )
                                    | X7 = X13 )
                                  & ( ( X18 != X6
                                      & setIn(X18,alive) )
                                    | X18 = X13 )
                                  & host(X18) != host(X7)
                                  & host(X17) = host(X7)
                                  & host(X19) = host(X18) )
                               => ~ ( elem(m_Down(X17),X12)
                                    & elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))) ) ) ) ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',conj) ).

fof(axiom_47,axiom,
    ! [X5,X6,X4] :
      ( elem(X5,snoc(X4,X6))
    <=> ( X5 = X6
        | elem(X5,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).

fof(axiom_17,axiom,
    ! [X5,X6] : m_Down(X5) != m_Halt(X6),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).

fof(axiom_01,axiom,
    ! [X3,X4] :
      ( s(host(X3)) = host(X4)
     => host(X3) != host(X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_01) ).

fof(axiom_46,axiom,
    ! [X5,X6,X4] :
      ( elem(X5,cons(X6,X4))
    <=> ( X5 = X6
        | elem(X5,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).

fof(c_0_7,plain,
    ! [X6] : ~ leq(s(X6),X6),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_58])]) ).

fof(c_0_8,plain,
    ! [X7,X8,X7,X8] :
      ( ( ~ leq(X7,s(X8))
        | X7 = s(X8)
        | leq(X7,X8) )
      & ( X7 != s(X8)
        | leq(X7,s(X8)) )
      & ( ~ leq(X7,X8)
        | leq(X7,s(X8)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_64])])])])]) ).

fof(c_0_9,plain,
    ! [X12,X5,X6] :
      ( epred1_3(X6,X5,X12)
    <=> ( ! [X7,X14] :
            ( setIn(X14,alive)
           => ~ elem(m_Down(X14),queue(host(X7))) )
        & ! [X7,X14] :
            ( elem(m_Down(X14),queue(host(X7)))
           => ~ setIn(X14,alive) )
        & ! [X7,X14] :
            ( elem(m_Down(X14),queue(host(X7)))
           => host(X14) != host(X7) )
        & ! [X7,X14] :
            ( elem(m_Halt(X14),queue(host(X7)))
           => ~ leq(host(X7),host(X14)) )
        & ! [X7,X15,X14] :
            ( elem(m_Ack(X14,X7),queue(host(X15)))
           => ~ leq(host(X7),host(X14)) )
        & ! [X7,X14] :
            ( ( ~ setIn(X7,alive)
              & leq(X14,X7)
              & host(X14) = host(X7) )
           => ~ setIn(X14,alive) )
        & ! [X7,X14] :
            ( ( X14 != X7
              & host(X14) = host(X7) )
           => ( ~ setIn(X7,alive)
              | ~ setIn(X14,alive) ) )
        & ! [X7,X16,X15,X14] :
            ( ( host(X15) != host(X7)
              & setIn(X7,alive)
              & setIn(X15,alive)
              & host(X16) = host(X7)
              & host(X14) = host(X15) )
           => ~ ( elem(m_Down(X14),queue(host(X7)))
                & elem(m_Down(X16),queue(host(X15))) ) )
        & queue(host(X6)) = cons(m_NotNorm(X5),X12) ) ),
    introduced(definition) ).

cnf(c_0_10,plain,
    ~ leq(s(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( leq(X1,s(X2))
    | ~ leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X12,X13,X5,X6] :
        ( epred1_3(X6,X5,X12)
       => ( setIn(X6,alive)
         => ( ( index(ldr,host(X6)) = host(X6)
              & index(status,host(X6)) = norm
              & index(elid,host(X6)) = X5 )
           => ( ( ! [X7] :
                    ( host(X6) = host(X7)
                   => leq(X7,X13) )
                & ~ setIn(X13,pids)
                & host(X6) = host(X13) )
             => ( host(X13) = s(zero)
               => ( ~ leq(nbr_proc,host(X13))
                 => ! [X7] :
                      ( s(host(X13)) = host(X7)
                     => ( host(X6) != host(X7)
                       => ! [X17,X18] :
                            ( s(host(X13)) != host(X18)
                           => ( host(X6) = host(X18)
                             => ! [X19] :
                                  ( ( ( ( X7 != X6
                                        & setIn(X7,alive) )
                                      | X7 = X13 )
                                    & ( ( X18 != X6
                                        & setIn(X18,alive) )
                                      | X18 = X13 )
                                    & host(X18) != host(X7)
                                    & host(X17) = host(X7)
                                    & host(X19) = host(X18) )
                                 => ~ ( elem(m_Down(X17),X12)
                                      & elem(m_Down(X19),snoc(queue(host(X7)),m_Halt(X13))) ) ) ) ) ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_9]) ).

cnf(c_0_13,plain,
    ~ leq(s(s(X1)),X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

fof(c_0_14,plain,
    ! [X12,X5,X6] :
      ( epred1_3(X6,X5,X12)
     => ( ! [X7,X14] :
            ( setIn(X14,alive)
           => ~ elem(m_Down(X14),queue(host(X7))) )
        & ! [X7,X14] :
            ( elem(m_Down(X14),queue(host(X7)))
           => ~ setIn(X14,alive) )
        & ! [X7,X14] :
            ( elem(m_Down(X14),queue(host(X7)))
           => host(X14) != host(X7) )
        & ! [X7,X14] :
            ( elem(m_Halt(X14),queue(host(X7)))
           => ~ leq(host(X7),host(X14)) )
        & ! [X7,X15,X14] :
            ( elem(m_Ack(X14,X7),queue(host(X15)))
           => ~ leq(host(X7),host(X14)) )
        & ! [X7,X14] :
            ( ( ~ setIn(X7,alive)
              & leq(X14,X7)
              & host(X14) = host(X7) )
           => ~ setIn(X14,alive) )
        & ! [X7,X14] :
            ( ( X14 != X7
              & host(X14) = host(X7) )
           => ( ~ setIn(X7,alive)
              | ~ setIn(X14,alive) ) )
        & ! [X7,X16,X15,X14] :
            ( ( host(X15) != host(X7)
              & setIn(X7,alive)
              & setIn(X15,alive)
              & host(X16) = host(X7)
              & host(X14) = host(X15) )
           => ~ ( elem(m_Down(X14),queue(host(X7)))
                & elem(m_Down(X16),queue(host(X15))) ) )
        & queue(host(X6)) = cons(m_NotNorm(X5),X12) ) ),
    inference(split_equiv,[status(thm)],[c_0_9]) ).

fof(c_0_15,negated_conjecture,
    ! [X24] :
      ( epred1_3(esk8_0,esk7_0,esk5_0)
      & setIn(esk8_0,alive)
      & index(ldr,host(esk8_0)) = host(esk8_0)
      & index(status,host(esk8_0)) = norm
      & index(elid,host(esk8_0)) = esk7_0
      & ( host(esk8_0) != host(X24)
        | leq(X24,esk6_0) )
      & ~ setIn(esk6_0,pids)
      & host(esk8_0) = host(esk6_0)
      & host(esk6_0) = s(zero)
      & ~ leq(nbr_proc,host(esk6_0))
      & s(host(esk6_0)) = host(esk9_0)
      & host(esk8_0) != host(esk9_0)
      & s(host(esk6_0)) != host(esk11_0)
      & host(esk8_0) = host(esk11_0)
      & ( esk9_0 != esk8_0
        | esk9_0 = esk6_0 )
      & ( setIn(esk9_0,alive)
        | esk9_0 = esk6_0 )
      & ( esk11_0 != esk8_0
        | esk11_0 = esk6_0 )
      & ( setIn(esk11_0,alive)
        | esk11_0 = esk6_0 )
      & host(esk11_0) != host(esk9_0)
      & host(esk10_0) = host(esk9_0)
      & host(esk12_0) = host(esk11_0)
      & elem(m_Down(esk10_0),esk5_0)
      & elem(m_Down(esk12_0),snoc(queue(host(esk9_0)),m_Halt(esk6_0))) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])])])])])])]) ).

cnf(c_0_16,plain,
    ~ leq(s(s(s(X1))),X1),
    inference(spm,[status(thm)],[c_0_13,c_0_11]) ).

fof(c_0_17,plain,
    ! [X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38] :
      ( ( ~ setIn(X21,alive)
        | ~ elem(m_Down(X21),queue(host(X20)))
        | ~ epred1_3(X19,X18,X17) )
      & ( ~ elem(m_Down(X23),queue(host(X22)))
        | ~ setIn(X23,alive)
        | ~ epred1_3(X19,X18,X17) )
      & ( ~ elem(m_Down(X25),queue(host(X24)))
        | host(X25) != host(X24)
        | ~ epred1_3(X19,X18,X17) )
      & ( ~ elem(m_Halt(X27),queue(host(X26)))
        | ~ leq(host(X26),host(X27))
        | ~ epred1_3(X19,X18,X17) )
      & ( ~ elem(m_Ack(X30,X28),queue(host(X29)))
        | ~ leq(host(X28),host(X30))
        | ~ epred1_3(X19,X18,X17) )
      & ( setIn(X31,alive)
        | ~ leq(X32,X31)
        | host(X32) != host(X31)
        | ~ setIn(X32,alive)
        | ~ epred1_3(X19,X18,X17) )
      & ( X34 = X33
        | host(X34) != host(X33)
        | ~ setIn(X33,alive)
        | ~ setIn(X34,alive)
        | ~ epred1_3(X19,X18,X17) )
      & ( host(X37) = host(X35)
        | ~ setIn(X35,alive)
        | ~ setIn(X37,alive)
        | host(X36) != host(X35)
        | host(X38) != host(X37)
        | ~ elem(m_Down(X38),queue(host(X35)))
        | ~ elem(m_Down(X36),queue(host(X37)))
        | ~ epred1_3(X19,X18,X17) )
      & ( queue(host(X19)) = cons(m_NotNorm(X18),X17)
        | ~ epred1_3(X19,X18,X17) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_14])])])])])])]) ).

fof(c_0_18,plain,
    ! [X7,X8,X9,X7,X8,X9] :
      ( ( ~ elem(X7,snoc(X9,X8))
        | X7 = X8
        | elem(X7,X9) )
      & ( X7 != X8
        | elem(X7,snoc(X9,X8)) )
      & ( ~ elem(X7,X9)
        | elem(X7,snoc(X9,X8)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])])])]) ).

fof(c_0_19,plain,
    ! [X7,X8] : m_Down(X7) != m_Halt(X8),
    inference(variable_rename,[status(thm)],[axiom_17]) ).

fof(c_0_20,plain,
    ! [X5,X6] :
      ( s(host(X5)) != host(X6)
      | host(X5) != host(X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_01])]) ).

cnf(c_0_21,negated_conjecture,
    host(esk12_0) = host(esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    host(esk8_0) = host(esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,negated_conjecture,
    s(host(esk6_0)) = host(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    host(esk8_0) = host(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_25,plain,
    ~ leq(s(s(s(s(X1)))),X1),
    inference(spm,[status(thm)],[c_0_16,c_0_11]) ).

cnf(c_0_26,plain,
    ( X4 = X5
    | ~ epred1_3(X1,X2,X3)
    | ~ setIn(X4,alive)
    | ~ setIn(X5,alive)
    | host(X4) != host(X5) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_27,negated_conjecture,
    epred1_3(esk8_0,esk7_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_28,plain,
    ( setIn(X5,alive)
    | ~ epred1_3(X1,X2,X3)
    | ~ setIn(X4,alive)
    | host(X4) != host(X5)
    | ~ leq(X4,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_29,plain,
    ( elem(X1,X2)
    | X1 = X3
    | ~ elem(X1,snoc(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_30,negated_conjecture,
    elem(m_Down(esk12_0),snoc(queue(host(esk9_0)),m_Halt(esk6_0))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_31,plain,
    m_Down(X1) != m_Halt(X2),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_32,plain,
    ( host(X1) != host(X2)
    | s(host(X1)) != host(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_33,negated_conjecture,
    host(esk12_0) = host(esk8_0),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_34,negated_conjecture,
    s(host(esk8_0)) = host(esk9_0),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

fof(c_0_35,plain,
    ! [X7,X8,X9,X7,X8,X9] :
      ( ( ~ elem(X7,cons(X8,X9))
        | X7 = X8
        | elem(X7,X9) )
      & ( X7 != X8
        | elem(X7,cons(X8,X9)) )
      & ( ~ elem(X7,X9)
        | elem(X7,cons(X8,X9)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])])]) ).

cnf(c_0_36,plain,
    ( queue(host(X1)) = cons(m_NotNorm(X2),X3)
    | ~ epred1_3(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_37,plain,
    ~ leq(s(s(s(s(s(X1))))),X1),
    inference(spm,[status(thm)],[c_0_25,c_0_11]) ).

cnf(c_0_38,negated_conjecture,
    ( X1 = X2
    | host(X1) != host(X2)
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_39,negated_conjecture,
    setIn(esk8_0,alive),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_40,negated_conjecture,
    ( setIn(X1,alive)
    | host(X2) != host(X1)
    | ~ leq(X2,X1)
    | ~ setIn(X2,alive) ),
    inference(spm,[status(thm)],[c_0_28,c_0_27]) ).

cnf(c_0_41,plain,
    ( host(X5) = host(X7)
    | ~ epred1_3(X1,X2,X3)
    | ~ elem(m_Down(X4),queue(host(X5)))
    | ~ elem(m_Down(X6),queue(host(X7)))
    | host(X6) != host(X5)
    | host(X4) != host(X7)
    | ~ setIn(X5,alive)
    | ~ setIn(X7,alive) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_42,negated_conjecture,
    elem(m_Down(esk12_0),queue(host(esk9_0))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_43,negated_conjecture,
    ( host(esk9_0) != host(X1)
    | host(esk8_0) != host(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).

cnf(c_0_44,plain,
    ( elem(X1,cons(X2,X3))
    | ~ elem(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_45,negated_conjecture,
    cons(m_NotNorm(esk7_0),esk5_0) = queue(host(esk8_0)),
    inference(spm,[status(thm)],[c_0_36,c_0_27]) ).

cnf(c_0_46,plain,
    ~ leq(s(s(s(s(s(s(X1)))))),X1),
    inference(spm,[status(thm)],[c_0_37,c_0_11]) ).

cnf(c_0_47,negated_conjecture,
    ( X1 = esk8_0
    | host(X1) != host(esk8_0)
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_48,negated_conjecture,
    ( setIn(X1,alive)
    | host(esk8_0) != host(X1)
    | ~ leq(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_39]) ).

cnf(c_0_49,plain,
    ( host(X1) != host(esk8_0)
    | host(X2) != host(esk9_0)
    | ~ epred1_3(X3,X4,X5)
    | ~ setIn(esk9_0,alive)
    | ~ setIn(X1,alive)
    | ~ elem(m_Down(X2),queue(host(X1))) ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33]),c_0_43]) ).

cnf(c_0_50,negated_conjecture,
    ( elem(X1,queue(host(esk8_0)))
    | ~ elem(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_51,plain,
    ~ leq(s(s(s(s(s(s(s(X1))))))),X1),
    inference(spm,[status(thm)],[c_0_46,c_0_11]) ).

cnf(c_0_52,negated_conjecture,
    ( X1 = esk8_0
    | host(X1) != host(esk8_0)
    | ~ leq(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    ( leq(X1,esk6_0)
    | host(esk8_0) != host(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_54,plain,
    ( host(X1) != host(esk9_0)
    | ~ epred1_3(X2,X3,X4)
    | ~ setIn(esk9_0,alive)
    | ~ elem(m_Down(X1),esk5_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_39])]) ).

cnf(c_0_55,negated_conjecture,
    elem(m_Down(esk10_0),esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_56,negated_conjecture,
    host(esk10_0) = host(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_57,plain,
    ~ leq(s(s(s(s(s(s(s(s(X1)))))))),X1),
    inference(spm,[status(thm)],[c_0_51,c_0_11]) ).

cnf(c_0_58,plain,
    ( leq(X1,s(X2))
    | X1 != s(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_59,negated_conjecture,
    ( esk9_0 = esk6_0
    | setIn(esk9_0,alive) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_60,negated_conjecture,
    esk6_0 = esk8_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_24])]) ).

cnf(c_0_61,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_54,c_0_55]),c_0_56])]) ).

cnf(c_0_62,plain,
    ~ leq(s(s(s(s(s(s(s(s(s(X1))))))))),X1),
    inference(spm,[status(thm)],[c_0_57,c_0_11]) ).

cnf(c_0_63,negated_conjecture,
    ( leq(X1,host(esk9_0))
    | X1 != host(esk9_0) ),
    inference(spm,[status(thm)],[c_0_58,c_0_34]) ).

cnf(c_0_64,negated_conjecture,
    ( esk9_0 = esk8_0
    | setIn(esk9_0,alive) ),
    inference(rw,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_65,negated_conjecture,
    ~ setIn(esk9_0,alive),
    inference(spm,[status(thm)],[c_0_61,c_0_27]) ).

cnf(c_0_66,negated_conjecture,
    s(s(s(s(s(s(s(s(s(host(esk9_0)))))))))) != host(esk9_0),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_67,negated_conjecture,
    esk9_0 = esk8_0,
    inference(sr,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,negated_conjecture,
    $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(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(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_34]),c_0_67]),c_0_67])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV451+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n026.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 : Wed Jun 15 18:37:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.25/1.42  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.25/1.42  # Preprocessing time       : 0.020 s
% 0.25/1.42  
% 0.25/1.42  # Proof found!
% 0.25/1.42  # SZS status Theorem
% 0.25/1.42  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 69
% 0.25/1.43  # Proof object clause steps            : 51
% 0.25/1.43  # Proof object formula steps           : 18
% 0.25/1.43  # Proof object conjectures             : 33
% 0.25/1.43  # Proof object clause conjectures      : 30
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 22
% 0.25/1.43  # Proof object initial formulas used   : 7
% 0.25/1.43  # Proof object generating inferences   : 24
% 0.25/1.43  # Proof object simplifying inferences  : 35
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 67
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 128
% 0.25/1.43  # Removed in clause preprocessing      : 6
% 0.25/1.43  # Initial clauses in saturation        : 122
% 0.25/1.43  # Processed clauses                    : 4483
% 0.25/1.43  # ...of these trivial                  : 77
% 0.25/1.43  # ...subsumed                          : 3063
% 0.25/1.43  # ...remaining for further processing  : 1343
% 0.25/1.43  # Other redundant clauses eliminated   : 10
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 82
% 0.25/1.43  # Backward-rewritten                   : 488
% 0.25/1.43  # Generated clauses                    : 38709
% 0.25/1.43  # ...of the previous two non-trivial   : 30293
% 0.25/1.43  # Contextual simplify-reflections      : 674
% 0.25/1.43  # Paramodulations                      : 38645
% 0.25/1.43  # Factorizations                       : 14
% 0.25/1.43  # Equation resolutions                 : 49
% 0.25/1.43  # Current number of processed clauses  : 768
% 0.25/1.43  #    Positive orientable unit clauses  : 69
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 112
% 0.25/1.43  #    Non-unit-clauses                  : 587
% 0.25/1.43  # Current number of unprocessed clauses: 8975
% 0.25/1.43  # ...number of literals in the above   : 33603
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 571
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 323774
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 209076
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 1847
% 0.25/1.43  # Unit Clause-clause subsumption calls : 25710
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 322
% 0.25/1.43  # BW rewrite match successes           : 11
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 521043
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.539 s
% 0.25/1.43  # System time              : 0.017 s
% 0.25/1.43  # Total time               : 0.556 s
% 0.25/1.43  # Maximum resident set size: 20116 pages
% 0.25/23.41  eprover: CPU time limit exceeded, terminating
% 0.25/23.42  eprover: CPU time limit exceeded, terminating
% 0.25/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43  eprover: No such file or directory
% 0.25/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43  eprover: No such file or directory
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------