TSTP Solution File: SWV451+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWV451+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% 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  : 300s
% DateTime : Thu Aug 31 21:41:19 EDT 2023

% Result   : Theorem 165.95s 165.92s
% Output   : CNFRefutation 166.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   55
% Syntax   : Number of formulae    :  102 (  20 unt;  49 typ;   0 def)
%            Number of atoms       :  310 ( 140 equ)
%            Maximal formula atoms :   51 (   5 avg)
%            Number of connectives :  413 ( 156   ~; 100   |; 104   &)
%                                         (   3 <=>;  50  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   39 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   38 (  27   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   43 (  43 usr;  22 con; 0-2 aty)
%            Number of variables   :  181 (  24 sgn; 124   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    m_Ack: ( $i * $i ) > $i ).

tff(decl_23,type,
    host: $i > $i ).

tff(decl_24,type,
    queue: $i > $i ).

tff(decl_25,type,
    elem: ( $i * $i ) > $o ).

tff(decl_26,type,
    pids: $i ).

tff(decl_27,type,
    setIn: ( $i * $i ) > $o ).

tff(decl_28,type,
    s: $i > $i ).

tff(decl_29,type,
    zero: $i ).

tff(decl_30,type,
    leq: ( $i * $i ) > $o ).

tff(decl_31,type,
    nbr_proc: $i ).

tff(decl_32,type,
    elec_1: $i ).

tff(decl_33,type,
    elec_2: $i ).

tff(decl_34,type,
    wait: $i ).

tff(decl_35,type,
    norm: $i ).

tff(decl_36,type,
    m_Halt: $i > $i ).

tff(decl_37,type,
    m_Down: $i > $i ).

tff(decl_38,type,
    m_NotNorm: $i > $i ).

tff(decl_39,type,
    m_Ldr: $i > $i ).

tff(decl_40,type,
    m_NormQ: $i > $i ).

tff(decl_41,type,
    nil: $i ).

tff(decl_42,type,
    alive: $i ).

tff(decl_43,type,
    cons: ( $i * $i ) > $i ).

tff(decl_44,type,
    head: $i > $i ).

tff(decl_45,type,
    tail: $i > $i ).

tff(decl_46,type,
    snoc: ( $i * $i ) > $i ).

tff(decl_47,type,
    last: $i > $i ).

tff(decl_48,type,
    init: $i > $i ).

tff(decl_49,type,
    q_nil: $i ).

tff(decl_50,type,
    pidElem: $i > $o ).

tff(decl_51,type,
    pidMsg: $i > $i ).

tff(decl_52,type,
    ordered: $i > $o ).

tff(decl_53,type,
    setEmpty: $i ).

tff(decl_54,type,
    ldr: $i ).

tff(decl_55,type,
    index: ( $i * $i ) > $i ).

tff(decl_56,type,
    status: $i ).

tff(decl_57,type,
    elid: $i ).

tff(decl_58,type,
    epred1_3: ( $i * $i * $i ) > $o ).

tff(decl_59,type,
    esk1_1: $i > $i ).

tff(decl_60,type,
    esk2_1: $i > $i ).

tff(decl_61,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_62,type,
    esk4_2: ( $i * $i ) > $i ).

tff(decl_63,type,
    esk5_0: $i ).

tff(decl_64,type,
    esk6_0: $i ).

tff(decl_65,type,
    esk7_0: $i ).

tff(decl_66,type,
    esk8_0: $i ).

tff(decl_67,type,
    esk9_0: $i ).

tff(decl_68,type,
    esk10_0: $i ).

tff(decl_69,type,
    esk11_0: $i ).

tff(decl_70,type,
    esk12_0: $i ).

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/sandbox/benchmark/theBenchmark.p',conj) ).

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

fof(axiom_17,axiom,
    ! [X5,X6] : m_Down(X5) != m_Halt(X6),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).

fof(c_0_5,plain,
    ! [X5,X6,X12] :
      ( epred1_3(X12,X6,X5)
    <=> ( ! [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) ).

fof(c_0_6,plain,
    ! [X5,X6,X12] :
      ( epred1_3(X12,X6,X5)
     => ( ! [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_5]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X12,X13,X5,X6] :
        ( epred1_3(X12,X6,X5)
       => ( 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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_5]) ).

fof(c_0_8,plain,
    ! [X158,X159,X160,X161,X162,X163,X164,X165,X166,X167,X168,X169,X170,X171,X172,X173,X174,X175,X176,X177,X178,X179] :
      ( ( ~ setIn(X162,alive)
        | ~ elem(m_Down(X162),queue(host(X161)))
        | ~ epred1_3(X160,X159,X158) )
      & ( ~ elem(m_Down(X164),queue(host(X163)))
        | ~ setIn(X164,alive)
        | ~ epred1_3(X160,X159,X158) )
      & ( ~ elem(m_Down(X166),queue(host(X165)))
        | host(X166) != host(X165)
        | ~ epred1_3(X160,X159,X158) )
      & ( ~ elem(m_Halt(X168),queue(host(X167)))
        | ~ leq(host(X167),host(X168))
        | ~ epred1_3(X160,X159,X158) )
      & ( ~ elem(m_Ack(X171,X169),queue(host(X170)))
        | ~ leq(host(X169),host(X171))
        | ~ epred1_3(X160,X159,X158) )
      & ( setIn(X172,alive)
        | ~ leq(X173,X172)
        | host(X173) != host(X172)
        | ~ setIn(X173,alive)
        | ~ epred1_3(X160,X159,X158) )
      & ( X175 = X174
        | host(X175) != host(X174)
        | ~ setIn(X174,alive)
        | ~ setIn(X175,alive)
        | ~ epred1_3(X160,X159,X158) )
      & ( host(X178) = host(X176)
        | ~ setIn(X176,alive)
        | ~ setIn(X178,alive)
        | host(X177) != host(X176)
        | host(X179) != host(X178)
        | ~ elem(m_Down(X179),queue(host(X176)))
        | ~ elem(m_Down(X177),queue(host(X178)))
        | ~ epred1_3(X160,X159,X158) )
      & ( queue(host(X159)) = cons(m_NotNorm(X158),X160)
        | ~ epred1_3(X160,X159,X158) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_9,negated_conjecture,
    ! [X153] :
      ( epred1_3(esk5_0,esk8_0,esk7_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(X153)
        | leq(X153,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).

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

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

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

cnf(c_0_13,negated_conjecture,
    ( X1 = X2
    | host(X1) != host(X2)
    | ~ setIn(X2,alive)
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    setIn(esk8_0,alive),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    ( setIn(X1,alive)
    | host(X1) != host(X2)
    | ~ leq(X2,X1)
    | ~ setIn(X2,alive) ),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

fof(c_0_16,plain,
    ! [X103,X104,X105] :
      ( ( ~ elem(X103,snoc(X105,X104))
        | X103 = X104
        | elem(X103,X105) )
      & ( X103 != X104
        | elem(X103,snoc(X105,X104)) )
      & ( ~ elem(X103,X105)
        | elem(X103,snoc(X105,X104)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_47])])]) ).

fof(c_0_17,plain,
    ! [X43,X44] : m_Down(X43) != m_Halt(X44),
    inference(variable_rename,[status(thm)],[axiom_17]) ).

fof(c_0_18,plain,
    ! [X22,X23] :
      ( s(host(X22)) != host(X23)
      | host(X22) != host(X23) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_01])]) ).

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

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

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

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

cnf(c_0_23,negated_conjecture,
    ( X1 = esk8_0
    | host(X1) != host(esk8_0)
    | ~ setIn(X1,alive) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_24,negated_conjecture,
    ( setIn(X1,alive)
    | host(X1) != host(esk8_0)
    | ~ leq(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_14]) ).

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

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

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

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

cnf(c_0_29,negated_conjecture,
    host(esk12_0) = host(esk8_0),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_30,negated_conjecture,
    s(host(esk8_0)) = host(esk9_0),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_31,negated_conjecture,
    ( X1 = esk8_0
    | host(X1) != host(esk8_0)
    | ~ leq(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

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

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

cnf(c_0_34,negated_conjecture,
    elem(m_Down(esk12_0),queue(host(esk9_0))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_35,negated_conjecture,
    ( host(esk9_0) != host(X1)
    | host(esk8_0) != host(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).

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

cnf(c_0_37,negated_conjecture,
    esk6_0 = esk8_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_22])]) ).

fof(c_0_38,plain,
    ! [X100,X101,X102] :
      ( ( ~ elem(X100,cons(X101,X102))
        | X100 = X101
        | elem(X100,X102) )
      & ( X100 != X101
        | elem(X100,cons(X101,X102)) )
      & ( ~ elem(X100,X102)
        | elem(X100,cons(X101,X102)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])]) ).

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

cnf(c_0_40,negated_conjecture,
    ( host(esk9_0) != host(X1)
    | host(X2) != host(esk8_0)
    | ~ epred1_3(X3,X4,X5)
    | ~ setIn(esk9_0,alive)
    | ~ setIn(X2,alive)
    | ~ elem(m_Down(X1),queue(host(X2))) ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ( esk9_0 = esk8_0
    | setIn(esk9_0,alive) ),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

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

cnf(c_0_43,negated_conjecture,
    cons(m_NotNorm(esk7_0),esk5_0) = queue(host(esk8_0)),
    inference(spm,[status(thm)],[c_0_39,c_0_11]) ).

cnf(c_0_44,negated_conjecture,
    ( esk9_0 = esk8_0
    | host(esk9_0) != host(X1)
    | host(X2) != host(esk8_0)
    | ~ epred1_3(X3,X4,X5)
    | ~ setIn(X2,alive)
    | ~ elem(m_Down(X1),queue(host(X2))) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

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

cnf(c_0_46,negated_conjecture,
    ( esk9_0 = esk8_0
    | host(esk9_0) != host(X1)
    | ~ epred1_3(X2,X3,X4)
    | ~ elem(m_Down(X1),esk5_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_14])]) ).

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

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

cnf(c_0_49,negated_conjecture,
    ( esk9_0 = esk8_0
    | ~ epred1_3(X1,X2,X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).

cnf(c_0_50,negated_conjecture,
    host(esk8_0) != host(esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_51,negated_conjecture,
    esk9_0 = esk8_0,
    inference(spm,[status(thm)],[c_0_49,c_0_11]) ).

cnf(c_0_52,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWV451+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 29 08:20:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.20/0.56  start to proof: theBenchmark
% 165.95/165.92  % Version  : CSE_E---1.5
% 165.95/165.92  % Problem  : theBenchmark.p
% 165.95/165.92  % Proof found
% 165.95/165.92  % SZS status Theorem for theBenchmark.p
% 165.95/165.92  % SZS output start Proof
% See solution above
% 166.03/165.92  % Total time : 165.362000 s
% 166.03/165.92  % SZS output end Proof
% 166.03/165.92  % Total time : 165.374000 s
%------------------------------------------------------------------------------