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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC327+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n018.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 : Tue Jul 19 20:28:04 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   55 (  13 unt;   0 def)
%            Number of atoms       :  284 ( 143 equ)
%            Maximal formula atoms :   66 (   5 avg)
%            Number of connectives :  390 ( 161   ~; 170   |;  38   &)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   76 (   0 sgn  28   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ! [X5] :
                        ( ssList(X5)
                       => ( app(X3,X5) != X4
                          | ~ equalelemsP(X3)
                          | ? [X6] :
                              ( ssItem(X6)
                              & ? [X7] :
                                  ( ssList(X7)
                                  & app(cons(X6,nil),X7) = X5
                                  & ? [X8] :
                                      ( ssList(X8)
                                      & app(X8,cons(X6,nil)) = X3 ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 )
                    | ( ? [X9] :
                          ( ssList(X9)
                          & app(X1,X9) = X2
                          & ! [X10] :
                              ( ssItem(X10)
                             => ! [X11] :
                                  ( ssList(X11)
                                 => ( app(cons(X10,nil),X11) != X9
                                    | ! [X12] :
                                        ( ssList(X12)
                                       => app(X12,cons(X10,nil)) != X1 ) ) ) )
                          & equalelemsP(X1) )
                      & ( nil != X1
                        | nil = X2 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

fof(ax80,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( app(X2,X3) = app(X2,X1)
               => X3 = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).

fof(ax84,axiom,
    ! [X1] :
      ( ssList(X1)
     => app(X1,nil) = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ! [X5] :
                          ( ssList(X5)
                         => ( app(X3,X5) != X4
                            | ~ equalelemsP(X3)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ssList(X7)
                                    & app(cons(X6,nil),X7) = X5
                                    & ? [X8] :
                                        ( ssList(X8)
                                        & app(X8,cons(X6,nil)) = X3 ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 )
                      | ( ? [X9] :
                            ( ssList(X9)
                            & app(X1,X9) = X2
                            & ! [X10] :
                                ( ssItem(X10)
                               => ! [X11] :
                                    ( ssList(X11)
                                   => ( app(cons(X10,nil),X11) != X9
                                      | ! [X12] :
                                          ( ssList(X12)
                                         => app(X12,cons(X10,nil)) != X1 ) ) ) )
                            & equalelemsP(X1) )
                        & ( nil != X1
                          | nil = X2 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_5,negated_conjecture,
    ! [X18,X19,X20,X21] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ssList(esk5_0)
      & app(esk3_0,esk5_0) = esk4_0
      & equalelemsP(esk3_0)
      & ( ~ ssItem(X18)
        | ~ ssList(X19)
        | app(cons(X18,nil),X19) != esk5_0
        | ~ ssList(X20)
        | app(X20,cons(X18,nil)) != esk3_0 )
      & ( nil = esk4_0
        | nil != esk3_0 )
      & ( nil = esk1_0
        | ssItem(esk6_1(X21))
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil != esk2_0
        | ssItem(esk6_1(X21))
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil = esk1_0
        | ssList(esk7_1(X21))
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil != esk2_0
        | ssList(esk7_1(X21))
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil = esk1_0
        | app(cons(esk6_1(X21),nil),esk7_1(X21)) = X21
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil != esk2_0
        | app(cons(esk6_1(X21),nil),esk7_1(X21)) = X21
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil = esk1_0
        | ssList(esk8_1(X21))
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil != esk2_0
        | ssList(esk8_1(X21))
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil = esk1_0
        | app(esk8_1(X21),cons(esk6_1(X21),nil)) = esk1_0
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_0) )
      & ( nil != esk2_0
        | app(esk8_1(X21),cons(esk6_1(X21),nil)) = esk1_0
        | ~ ssList(X21)
        | app(esk1_0,X21) != esk2_0
        | ~ equalelemsP(esk1_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_4])])])])])])])]) ).

cnf(c_0_6,negated_conjecture,
    ( app(esk8_1(X1),cons(esk6_1(X1),nil)) = esk1_0
    | nil = esk1_0
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_7,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    equalelemsP(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    ( ssItem(esk6_1(X1))
    | nil = esk1_0
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ( ssList(esk8_1(X1))
    | nil = esk1_0
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_12,plain,
    ! [X4,X5,X6] :
      ( ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(X5,X6) != app(X5,X4)
      | X6 = X4 ),
    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)],[ax80])])])])]) ).

cnf(c_0_13,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    ( app(X1,cons(X2,nil)) != esk3_0
    | ~ ssList(X1)
    | app(cons(X2,nil),X3) != esk5_0
    | ~ ssList(X3)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    ( app(esk8_1(X1),cons(esk6_1(X1),nil)) = esk3_0
    | nil = esk3_0
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    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)],[c_0_6,c_0_7]),c_0_7]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_16,negated_conjecture,
    ( nil = esk3_0
    | ssItem(esk6_1(X1))
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_17,negated_conjecture,
    ( nil = esk3_0
    | ssList(esk8_1(X1))
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_18,negated_conjecture,
    ( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
    | nil = esk1_0
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_19,negated_conjecture,
    ( ssList(esk7_1(X1))
    | nil = esk1_0
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | app(X3,X1) != app(X3,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,negated_conjecture,
    app(esk3_0,esk5_0) = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_22,negated_conjecture,
    ssList(esk3_0),
    inference(rw,[status(thm)],[c_0_13,c_0_7]) ).

cnf(c_0_23,negated_conjecture,
    ssList(esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_24,negated_conjecture,
    ( nil = esk3_0
    | app(cons(esk6_1(X1),nil),X2) != esk5_0
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).

cnf(c_0_25,negated_conjecture,
    ( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
    | nil = esk3_0
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_7]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_26,negated_conjecture,
    ( nil = esk3_0
    | ssList(esk7_1(X1))
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_7]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_27,negated_conjecture,
    ( X1 = esk5_0
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).

fof(c_0_28,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(X2,nil) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

cnf(c_0_29,negated_conjecture,
    ( nil = esk3_0
    | app(esk3_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( app(esk8_1(X1),cons(esk6_1(X1),nil)) = esk1_0
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1)
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_31,negated_conjecture,
    ( ssItem(esk6_1(X1))
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1)
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_32,negated_conjecture,
    ( ssList(esk8_1(X1))
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1)
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_33,plain,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[ax17]) ).

cnf(c_0_35,negated_conjecture,
    ( nil = esk4_0
    | nil != esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_36,negated_conjecture,
    nil = esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_23])]) ).

cnf(c_0_37,negated_conjecture,
    ( app(esk8_1(X1),cons(esk6_1(X1),nil)) = esk3_0
    | app(esk3_0,X1) != esk4_0
    | nil != esk4_0
    | ~ ssList(X1) ),
    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)],[c_0_30,c_0_7]),c_0_8]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_38,negated_conjecture,
    ( ssItem(esk6_1(X1))
    | app(esk3_0,X1) != esk4_0
    | nil != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_8]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_39,negated_conjecture,
    ( ssList(esk8_1(X1))
    | app(esk3_0,X1) != esk4_0
    | nil != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_8]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_40,negated_conjecture,
    ( nil = esk5_0
    | esk3_0 != esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_33]),c_0_34]),c_0_22])]) ).

cnf(c_0_41,negated_conjecture,
    esk3_0 = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36])]) ).

cnf(c_0_42,negated_conjecture,
    ( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1)
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_43,negated_conjecture,
    ( ssList(esk7_1(X1))
    | ~ equalelemsP(esk1_0)
    | app(esk1_0,X1) != esk2_0
    | ~ ssList(X1)
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_44,negated_conjecture,
    ( app(cons(esk6_1(X1),nil),X2) != esk5_0
    | app(esk3_0,X1) != esk4_0
    | nil != esk4_0
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_37]),c_0_38]),c_0_39]) ).

cnf(c_0_45,negated_conjecture,
    esk4_0 = esk5_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),c_0_36]),c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    ( app(cons(esk6_1(X1),nil),esk7_1(X1)) = X1
    | app(esk3_0,X1) != esk4_0
    | nil != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_8]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_47,negated_conjecture,
    ( ssList(esk7_1(X1))
    | app(esk3_0,X1) != esk4_0
    | nil != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_8]),c_0_7]),c_0_8]),c_0_7]),c_0_9])]) ).

cnf(c_0_48,negated_conjecture,
    ( app(cons(esk6_1(X1),esk5_0),X2) != esk5_0
    | app(esk5_0,X1) != esk5_0
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    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)],[c_0_44,c_0_36]),c_0_36]),c_0_41]),c_0_45]),c_0_41]),c_0_45]),c_0_45]),c_0_41]),c_0_45]),c_0_45])]) ).

cnf(c_0_49,negated_conjecture,
    ( app(cons(esk6_1(X1),esk5_0),esk7_1(X1)) = X1
    | app(esk5_0,X1) != esk5_0
    | ~ ssList(X1) ),
    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)],[c_0_46,c_0_36]),c_0_36]),c_0_41]),c_0_45]),c_0_41]),c_0_45]),c_0_45]),c_0_41]),c_0_45]),c_0_45])]) ).

cnf(c_0_50,negated_conjecture,
    ( ssList(esk7_1(X1))
    | app(esk5_0,X1) != esk5_0
    | ~ ssList(X1) ),
    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)],[c_0_47,c_0_36]),c_0_41]),c_0_45]),c_0_45]),c_0_41]),c_0_45]),c_0_45])]) ).

cnf(c_0_51,negated_conjecture,
    ( X1 = esk5_0
    | app(esk5_0,X1) != esk5_0
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_41]),c_0_45]),c_0_45]) ).

cnf(c_0_52,negated_conjecture,
    ( app(esk5_0,X1) != esk5_0
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]) ).

cnf(c_0_53,plain,
    ( app(X1,esk5_0) = X1
    | ~ ssList(X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_36]),c_0_41]),c_0_45]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC327+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n018.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 : Sun Jun 12 00:34:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.021 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 55
% 0.24/1.42  # Proof object clause steps            : 47
% 0.24/1.42  # Proof object formula steps           : 8
% 0.24/1.42  # Proof object conjectures             : 46
% 0.24/1.42  # Proof object clause conjectures      : 43
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 21
% 0.24/1.42  # Proof object initial formulas used   : 4
% 0.24/1.42  # Proof object generating inferences   : 8
% 0.24/1.42  # Proof object simplifying inferences  : 124
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 96
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 76
% 0.24/1.42  # Initial clauses                      : 53
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 53
% 0.24/1.42  # Processed clauses                    : 343
% 0.24/1.42  # ...of these trivial                  : 27
% 0.24/1.42  # ...subsumed                          : 80
% 0.24/1.42  # ...remaining for further processing  : 236
% 0.24/1.42  # Other redundant clauses eliminated   : 1
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 42
% 0.24/1.42  # Backward-rewritten                   : 73
% 0.24/1.42  # Generated clauses                    : 2396
% 0.24/1.42  # ...of the previous two non-trivial   : 1977
% 0.24/1.42  # Contextual simplify-reflections      : 74
% 0.24/1.42  # Paramodulations                      : 2377
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 19
% 0.24/1.42  # Current number of processed clauses  : 121
% 0.24/1.42  #    Positive orientable unit clauses  : 12
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 3
% 0.24/1.42  #    Non-unit-clauses                  : 106
% 0.24/1.42  # Current number of unprocessed clauses: 967
% 0.24/1.42  # ...number of literals in the above   : 5268
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 115
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 5944
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 2981
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 191
% 0.24/1.42  # Unit Clause-clause subsumption calls : 125
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 3
% 0.24/1.42  # BW rewrite match successes           : 3
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 69642
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.194 s
% 0.24/1.42  # System time              : 0.006 s
% 0.24/1.42  # Total time               : 0.200 s
% 0.24/1.42  # Maximum resident set size: 4524 pages
%------------------------------------------------------------------------------