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

View Problem - Process Solution

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

% Computer : n021.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:09 EDT 2022

% Result   : Theorem 0.23s 2.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   78 (  13 unt;   0 def)
%            Number of atoms       :  434 ( 179 equ)
%            Maximal formula atoms :   88 (   5 avg)
%            Number of connectives :  616 ( 260   ~; 264   |;  56   &)
%                                         (   4 <=>;  32  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   35 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-2 aty)
%            Number of variables   :  122 (   0 sgn  51   !;  12   ?)

% 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
                          | ~ strictorderedP(X3)
                          | ? [X6] :
                              ( ssItem(X6)
                              & ? [X7] :
                                  ( ssList(X7)
                                  & app(cons(X6,nil),X7) = X5
                                  & ? [X8] :
                                      ( ssItem(X8)
                                      & ? [X9] :
                                          ( ssList(X9)
                                          & app(X9,cons(X8,nil)) = X3
                                          & lt(X8,X6) ) ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 )
                    | ( ? [X10] :
                          ( ssList(X10)
                          & app(X1,X10) = X2
                          & ! [X11] :
                              ( ssItem(X11)
                             => ! [X12] :
                                  ( ssList(X12)
                                 => ( app(cons(X11,nil),X12) != X10
                                    | ! [X13] :
                                        ( ssItem(X13)
                                       => ! [X14] :
                                            ( ssList(X14)
                                           => ( app(X14,cons(X13,nil)) != X1
                                              | ~ lt(X13,X11) ) ) ) ) ) )
                          & strictorderedP(X1) )
                      & ( nil != X1
                        | nil = X2 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).

fof(ax83,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil = app(X1,X2)
          <=> ( nil = X2
              & nil = X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).

fof(ax21,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => nil != cons(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).

fof(ax4,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( singletonP(X1)
      <=> ? [X2] :
            ( ssItem(X2)
            & cons(X2,nil) = X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).

fof(ax5,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( frontsegP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & app(X2,X3) = X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).

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

fof(ax46,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( frontsegP(nil,X1)
      <=> nil = X1 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).

fof(ax16,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ssList(cons(X2,X1)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).

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

fof(c_0_9,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
                            | ~ strictorderedP(X3)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ssList(X7)
                                    & app(cons(X6,nil),X7) = X5
                                    & ? [X8] :
                                        ( ssItem(X8)
                                        & ? [X9] :
                                            ( ssList(X9)
                                            & app(X9,cons(X8,nil)) = X3
                                            & lt(X8,X6) ) ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 )
                      | ( ? [X10] :
                            ( ssList(X10)
                            & app(X1,X10) = X2
                            & ! [X11] :
                                ( ssItem(X11)
                               => ! [X12] :
                                    ( ssList(X12)
                                   => ( app(cons(X11,nil),X12) != X10
                                      | ! [X13] :
                                          ( ssItem(X13)
                                         => ! [X14] :
                                              ( ssList(X14)
                                             => ( app(X14,cons(X13,nil)) != X1
                                                | ~ lt(X13,X11) ) ) ) ) ) )
                            & strictorderedP(X1) )
                        & ( nil != X1
                          | nil = X2 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_10,negated_conjecture,
    ! [X20,X21,X22,X23,X24] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ssList(esk52_0)
      & app(esk50_0,esk52_0) = esk51_0
      & strictorderedP(esk50_0)
      & ( ~ ssItem(X20)
        | ~ ssList(X21)
        | app(cons(X20,nil),X21) != esk52_0
        | ~ ssItem(X22)
        | ~ ssList(X23)
        | app(X23,cons(X22,nil)) != esk50_0
        | ~ lt(X22,X20) )
      & ( nil = esk51_0
        | nil != esk50_0 )
      & ( nil = esk48_0
        | ssItem(esk53_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | ssItem(esk53_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil = esk48_0
        | ssList(esk54_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | ssList(esk54_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil = esk48_0
        | app(cons(esk53_1(X24),nil),esk54_1(X24)) = X24
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | app(cons(esk53_1(X24),nil),esk54_1(X24)) = X24
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil = esk48_0
        | ssItem(esk55_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | ssItem(esk55_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil = esk48_0
        | ssList(esk56_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | ssList(esk56_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil = esk48_0
        | app(esk56_1(X24),cons(esk55_1(X24),nil)) = esk48_0
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | app(esk56_1(X24),cons(esk55_1(X24),nil)) = esk48_0
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil = esk48_0
        | lt(esk55_1(X24),esk53_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_0) )
      & ( nil != esk49_0
        | lt(esk55_1(X24),esk53_1(X24))
        | ~ ssList(X24)
        | app(esk48_0,X24) != esk49_0
        | ~ strictorderedP(esk48_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_9])])])])])])])]) ).

cnf(c_0_11,negated_conjecture,
    strictorderedP(esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X3,X4] :
      ( ( nil = X4
        | nil != app(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( nil = X3
        | nil != app(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( nil != X4
        | nil != X3
        | nil = app(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) ) ),
    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)],[ax83])])])])])]) ).

cnf(c_0_14,negated_conjecture,
    app(esk50_0,esk52_0) = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_16,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | nil != cons(X4,X3) ),
    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)],[ax21])])])])]) ).

fof(c_0_17,plain,
    ! [X3,X5] :
      ( ( ssItem(esk5_1(X3))
        | ~ singletonP(X3)
        | ~ ssList(X3) )
      & ( cons(esk5_1(X3),nil) = X3
        | ~ singletonP(X3)
        | ~ ssList(X3) )
      & ( ~ ssItem(X5)
        | cons(X5,nil) != X3
        | singletonP(X3)
        | ~ ssList(X3) ) ),
    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)],[ax4])])])])])])]) ).

fof(c_0_18,plain,
    ! [X4,X5,X7] :
      ( ( ssList(esk6_2(X4,X5))
        | ~ frontsegP(X4,X5)
        | ~ ssList(X5)
        | ~ ssList(X4) )
      & ( app(X5,esk6_2(X4,X5)) = X4
        | ~ frontsegP(X4,X5)
        | ~ ssList(X5)
        | ~ ssList(X4) )
      & ( ~ ssList(X7)
        | app(X5,X7) != X4
        | frontsegP(X4,X5)
        | ~ ssList(X5)
        | ~ ssList(X4) ) ),
    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)],[ax5])])])])])])]) ).

cnf(c_0_19,negated_conjecture,
    ( app(cons(esk53_1(X1),nil),esk54_1(X1)) = X1
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1)
    | nil != esk49_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    strictorderedP(esk48_0),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_21,negated_conjecture,
    ( ssList(esk54_1(X1))
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1)
    | nil != esk49_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_22,plain,
    ( nil = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil != app(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_23,negated_conjecture,
    app(esk48_0,esk52_0) = esk49_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ssList(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_25,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,plain,
    ( nil != cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_27,plain,
    ( cons(esk5_1(X1),nil) = X1
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

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

cnf(c_0_29,plain,
    ( ssItem(esk5_1(X1))
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_30,plain,
    ( singletonP(X1)
    | ~ ssList(X1)
    | cons(X2,nil) != X1
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_31,plain,
    ! [X2] :
      ( ( ~ frontsegP(nil,X2)
        | nil = X2
        | ~ ssList(X2) )
      & ( nil != X2
        | frontsegP(nil,X2)
        | ~ ssList(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])]) ).

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

cnf(c_0_33,negated_conjecture,
    ( app(cons(esk53_1(X1),nil),esk54_1(X1)) = X1
    | app(esk48_0,X1) != esk49_0
    | esk49_0 != nil
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

cnf(c_0_34,negated_conjecture,
    ( ssList(esk54_1(X1))
    | app(esk48_0,X1) != esk49_0
    | esk49_0 != nil
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_20])]) ).

cnf(c_0_35,negated_conjecture,
    ( esk52_0 = nil
    | esk49_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).

cnf(c_0_36,plain,
    ( X1 != nil
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).

cnf(c_0_37,plain,
    ( singletonP(cons(X1,nil))
    | ~ ssList(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(er,[status(thm)],[c_0_30]) ).

fof(c_0_38,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | ssList(cons(X4,X3)) ),
    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)],[ax16])])])])]) ).

cnf(c_0_39,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ frontsegP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_40,negated_conjecture,
    ( frontsegP(X1,cons(esk53_1(X1),nil))
    | app(esk48_0,X1) != esk49_0
    | esk49_0 != nil
    | ~ ssList(cons(esk53_1(X1),nil))
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33])]),c_0_34]) ).

cnf(c_0_41,negated_conjecture,
    ( app(esk48_0,nil) = esk49_0
    | esk49_0 != nil ),
    inference(spm,[status(thm)],[c_0_23,c_0_35]) ).

cnf(c_0_42,plain,
    ( cons(X1,nil) != nil
    | ~ ssList(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_43,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_44,negated_conjecture,
    ( cons(esk53_1(nil),nil) = nil
    | esk49_0 != nil
    | ~ ssList(cons(esk53_1(nil),nil)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_28])]),c_0_41]) ).

cnf(c_0_45,plain,
    ( cons(X1,nil) != nil
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_28])]) ).

cnf(c_0_46,negated_conjecture,
    ( ssItem(esk53_1(X1))
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1)
    | nil != esk49_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ lt(X1,X2)
    | app(X3,cons(X1,nil)) != esk50_0
    | ~ ssList(X3)
    | ~ ssItem(X1)
    | app(cons(X2,nil),X4) != esk52_0
    | ~ ssList(X4)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_48,negated_conjecture,
    ( app(esk56_1(X1),cons(esk55_1(X1),nil)) = esk48_0
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_49,negated_conjecture,
    ( ssItem(esk55_1(X1))
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_50,negated_conjecture,
    ( ssList(esk56_1(X1))
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_51,negated_conjecture,
    ( esk49_0 != nil
    | ~ ssItem(esk53_1(nil)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_43]),c_0_28])]),c_0_45]) ).

cnf(c_0_52,negated_conjecture,
    ( ssItem(esk53_1(X1))
    | app(esk48_0,X1) != esk49_0
    | esk49_0 != nil
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_20])]) ).

cnf(c_0_53,negated_conjecture,
    ( nil = esk51_0
    | nil != esk50_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_54,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_55,negated_conjecture,
    ( app(X1,cons(X2,nil)) != esk48_0
    | app(cons(X3,nil),X4) != esk52_0
    | ~ lt(X2,X3)
    | ~ ssList(X4)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2) ),
    inference(rw,[status(thm)],[c_0_47,c_0_12]) ).

cnf(c_0_56,negated_conjecture,
    ( app(esk56_1(X1),cons(esk55_1(X1),nil)) = esk48_0
    | esk48_0 = nil
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_20])]) ).

cnf(c_0_57,negated_conjecture,
    ( esk48_0 = nil
    | ssItem(esk55_1(X1))
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_20])]) ).

cnf(c_0_58,negated_conjecture,
    ( esk48_0 = nil
    | ssList(esk56_1(X1))
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_20])]) ).

cnf(c_0_59,negated_conjecture,
    ( app(cons(esk53_1(X1),nil),esk54_1(X1)) = X1
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_60,negated_conjecture,
    esk49_0 != nil,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_28])]),c_0_41]) ).

cnf(c_0_61,negated_conjecture,
    ( esk49_0 = nil
    | esk48_0 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_15]),c_0_12]) ).

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

cnf(c_0_63,negated_conjecture,
    ( esk48_0 = nil
    | app(cons(X1,nil),X2) != esk52_0
    | app(esk48_0,X3) != esk49_0
    | ~ lt(esk55_1(X3),X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58]) ).

cnf(c_0_64,negated_conjecture,
    ( app(cons(esk53_1(X1),nil),esk54_1(X1)) = X1
    | esk48_0 = nil
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_20])]) ).

cnf(c_0_65,negated_conjecture,
    esk48_0 != nil,
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_66,negated_conjecture,
    ( X1 = esk52_0
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_23]),c_0_25]),c_0_24])]) ).

cnf(c_0_67,negated_conjecture,
    ( lt(esk55_1(X1),esk53_1(X1))
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_68,negated_conjecture,
    ( app(esk48_0,X1) != esk49_0
    | app(esk48_0,X2) != esk49_0
    | ~ lt(esk55_1(X1),esk53_1(X2))
    | ~ ssList(esk54_1(X2))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssItem(esk53_1(X2)) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66]) ).

cnf(c_0_69,negated_conjecture,
    ( esk48_0 = nil
    | lt(esk55_1(X1),esk53_1(X1))
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_20])]) ).

cnf(c_0_70,negated_conjecture,
    ( ssItem(esk53_1(X1))
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_71,negated_conjecture,
    ( app(esk48_0,X1) != esk49_0
    | ~ ssList(esk54_1(X1))
    | ~ ssList(X1)
    | ~ ssItem(esk53_1(X1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_65]) ).

cnf(c_0_72,negated_conjecture,
    ( esk48_0 = nil
    | ssItem(esk53_1(X1))
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_20])]) ).

cnf(c_0_73,negated_conjecture,
    ( ssList(esk54_1(X1))
    | nil = esk48_0
    | ~ strictorderedP(esk48_0)
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_74,negated_conjecture,
    ( app(esk48_0,X1) != esk49_0
    | ~ ssList(esk54_1(X1))
    | ~ ssList(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_65]) ).

cnf(c_0_75,negated_conjecture,
    ( esk48_0 = nil
    | ssList(esk54_1(X1))
    | app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_20])]) ).

cnf(c_0_76,negated_conjecture,
    ( app(esk48_0,X1) != esk49_0
    | ~ ssList(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_65]) ).

cnf(c_0_77,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWC343+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n021.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 : Sun Jun 12 21:05:56 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/2.42  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.23/2.42  # Preprocessing time       : 0.026 s
% 0.23/2.42  
% 0.23/2.42  # Proof found!
% 0.23/2.42  # SZS status Theorem
% 0.23/2.42  # SZS output start CNFRefutation
% See solution above
% 0.23/2.42  # Proof object total steps             : 78
% 0.23/2.42  # Proof object clause steps            : 60
% 0.23/2.42  # Proof object formula steps           : 18
% 0.23/2.42  # Proof object conjectures             : 49
% 0.23/2.42  # Proof object clause conjectures      : 46
% 0.23/2.42  # Proof object formula conjectures     : 3
% 0.23/2.42  # Proof object initial clauses used    : 28
% 0.23/2.42  # Proof object initial formulas used   : 9
% 0.23/2.42  # Proof object generating inferences   : 18
% 0.23/2.42  # Proof object simplifying inferences  : 57
% 0.23/2.42  # Training examples: 0 positive, 0 negative
% 0.23/2.42  # Parsed axioms                        : 96
% 0.23/2.42  # Removed by relevancy pruning/SinE    : 0
% 0.23/2.42  # Initial clauses                      : 215
% 0.23/2.42  # Removed in clause preprocessing      : 2
% 0.23/2.42  # Initial clauses in saturation        : 213
% 0.23/2.42  # Processed clauses                    : 7404
% 0.23/2.42  # ...of these trivial                  : 204
% 0.23/2.42  # ...subsumed                          : 5112
% 0.23/2.42  # ...remaining for further processing  : 2088
% 0.23/2.42  # Other redundant clauses eliminated   : 1328
% 0.23/2.42  # Clauses deleted for lack of memory   : 0
% 0.23/2.42  # Backward-subsumed                    : 294
% 0.23/2.42  # Backward-rewritten                   : 176
% 0.23/2.42  # Generated clauses                    : 60741
% 0.23/2.42  # ...of the previous two non-trivial   : 56953
% 0.23/2.42  # Contextual simplify-reflections      : 4245
% 0.23/2.42  # Paramodulations                      : 59222
% 0.23/2.42  # Factorizations                       : 0
% 0.23/2.42  # Equation resolutions                 : 1511
% 0.23/2.42  # Current number of processed clauses  : 1604
% 0.23/2.42  #    Positive orientable unit clauses  : 70
% 0.23/2.42  #    Positive unorientable unit clauses: 0
% 0.23/2.42  #    Negative unit clauses             : 29
% 0.23/2.42  #    Non-unit-clauses                  : 1505
% 0.23/2.42  # Current number of unprocessed clauses: 39469
% 0.23/2.42  # ...number of literals in the above   : 356827
% 0.23/2.42  # Current number of archived formulas  : 0
% 0.23/2.42  # Current number of archived clauses   : 478
% 0.23/2.42  # Clause-clause subsumption calls (NU) : 1059611
% 0.23/2.42  # Rec. Clause-clause subsumption calls : 100295
% 0.23/2.42  # Non-unit clause-clause subsumptions  : 6473
% 0.23/2.42  # Unit Clause-clause subsumption calls : 6818
% 0.23/2.42  # Rewrite failures with RHS unbound    : 0
% 0.23/2.42  # BW rewrite match attempts            : 25
% 0.23/2.42  # BW rewrite match successes           : 24
% 0.23/2.42  # Condensation attempts                : 0
% 0.23/2.42  # Condensation successes               : 0
% 0.23/2.42  # Termbank termtop insertions          : 1616216
% 0.23/2.42  
% 0.23/2.42  # -------------------------------------------------
% 0.23/2.42  # User time                : 1.622 s
% 0.23/2.42  # System time              : 0.037 s
% 0.23/2.42  # Total time               : 1.659 s
% 0.23/2.42  # Maximum resident set size: 55832 pages
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------