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

View Problem - Process Solution

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

% Computer : n012.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:26:50 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   11
% Syntax   : Number of formulae    :  101 (  21 unt;   0 def)
%            Number of atoms       :  352 ( 164 equ)
%            Maximal formula atoms :   21 (   3 avg)
%            Number of connectives :  443 ( 192   ~; 180   |;  37   &)
%                                         (   3 <=>;  31  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   28 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :  116 (   0 sgn  54   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ neq(X2,nil)
                    | ! [X5] :
                        ( ssList(X5)
                       => ( app(X3,X5) != X4
                          | ~ totalorderedP(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
                                          & leq(X8,X6) ) ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 )
                    | ( neq(X1,nil)
                      & segmentP(X2,X1) ) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

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

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

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

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(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).

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

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

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(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).

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

fof(c_0_11,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | ! [X5] :
                          ( ssList(X5)
                         => ( app(X3,X5) != X4
                            | ~ totalorderedP(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
                                            & leq(X8,X6) ) ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 )
                      | ( neq(X1,nil)
                        & segmentP(X2,X1) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_12,negated_conjecture,
    ! [X15,X16,X17,X18] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & neq(esk2_0,nil)
      & ssList(esk5_0)
      & app(esk3_0,esk5_0) = esk4_0
      & totalorderedP(esk3_0)
      & ( ~ ssItem(X15)
        | ~ ssList(X16)
        | app(cons(X15,nil),X16) != esk5_0
        | ~ ssItem(X17)
        | ~ ssList(X18)
        | app(X18,cons(X17,nil)) != esk3_0
        | ~ leq(X17,X15) )
      & ( nil = esk4_0
        | nil != esk3_0 )
      & ( ~ neq(esk1_0,nil)
        | ~ segmentP(esk2_0,esk1_0) ) ),
    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_11])])])])])])]) ).

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

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

cnf(c_0_15,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

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

cnf(c_0_18,negated_conjecture,
    app(esk1_0,esk5_0) = esk4_0,
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ssList(esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,negated_conjecture,
    ssList(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_22,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

fof(c_0_24,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_25,plain,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,negated_conjecture,
    ( app(esk4_0,X1) = app(esk1_0,app(esk5_0,X1))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_27,negated_conjecture,
    ssList(esk4_0),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

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

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

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

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

cnf(c_0_32,negated_conjecture,
    app(esk1_0,app(esk5_0,nil)) = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).

fof(c_0_33,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssList(X4)
      | ssList(app(X3,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)],[ax26])])])])]) ).

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

cnf(c_0_35,negated_conjecture,
    ( X1 = esk1_0
    | app(X1,esk5_0) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_19]),c_0_20])]) ).

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

fof(c_0_37,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_38,negated_conjecture,
    ( app(esk5_0,nil) = nil
    | nil != esk4_0
    | ~ ssList(app(esk5_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20])]) ).

cnf(c_0_39,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_40,negated_conjecture,
    ( nil = esk4_0
    | nil != esk1_0 ),
    inference(rw,[status(thm)],[c_0_34,c_0_15]) ).

cnf(c_0_41,negated_conjecture,
    ( nil = esk1_0
    | esk4_0 != esk5_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28]),c_0_19])]) ).

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

cnf(c_0_43,negated_conjecture,
    ( app(esk5_0,nil) = nil
    | nil != esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_28]),c_0_19])]) ).

cnf(c_0_44,negated_conjecture,
    ( esk4_0 = esk1_0
    | esk4_0 != esk5_0 ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,negated_conjecture,
    ( X1 = esk5_0
    | app(esk1_0,X1) != esk4_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_18]),c_0_20]),c_0_19])]) ).

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

cnf(c_0_47,negated_conjecture,
    ( app(esk5_0,esk1_0) = esk1_0
    | esk4_0 != esk5_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_41]),c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    ( nil = esk5_0
    | esk4_0 != esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_25]),c_0_28]),c_0_20])]) ).

cnf(c_0_49,negated_conjecture,
    ( app(esk1_0,app(esk5_0,esk1_0)) = esk4_0
    | esk4_0 != esk5_0 ),
    inference(spm,[status(thm)],[c_0_32,c_0_41]) ).

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

cnf(c_0_51,negated_conjecture,
    ( nil = esk5_0
    | esk4_0 != esk5_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_20]),c_0_19])]),c_0_41]) ).

cnf(c_0_52,plain,
    ( X1 = nil
    | app(X2,X1) != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_28])]) ).

cnf(c_0_53,negated_conjecture,
    ( app(esk1_0,app(esk5_0,esk5_0)) = esk4_0
    | esk4_0 != esk1_0 ),
    inference(spm,[status(thm)],[c_0_32,c_0_48]) ).

fof(c_0_54,plain,
    ! [X3,X4] :
      ( ( ~ neq(X3,X4)
        | X3 != X4
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( X3 = X4
        | neq(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)],[ax15])])])])])]) ).

cnf(c_0_55,negated_conjecture,
    neq(esk2_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_56,negated_conjecture,
    ( app(esk1_0,nil) = esk4_0
    | esk4_0 != esk5_0 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_20]),c_0_19])]),c_0_51]),c_0_41]) ).

cnf(c_0_57,negated_conjecture,
    ( app(esk1_0,X1) = X1
    | esk4_0 != esk5_0
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_41]) ).

cnf(c_0_58,negated_conjecture,
    ( app(esk5_0,esk5_0) = nil
    | esk4_0 != esk1_0
    | ~ ssList(app(esk5_0,esk5_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_20])]) ).

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

cnf(c_0_60,negated_conjecture,
    neq(esk4_0,nil),
    inference(rw,[status(thm)],[c_0_55,c_0_22]) ).

cnf(c_0_61,negated_conjecture,
    ( nil = esk4_0
    | esk4_0 != esk5_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_28])]) ).

cnf(c_0_62,plain,
    ( X1 = X2
    | app(X3,X1) != nil
    | nil != X2
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_50]),c_0_46]) ).

cnf(c_0_63,negated_conjecture,
    ( app(esk5_0,esk5_0) = nil
    | esk4_0 != esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_39]),c_0_19])]) ).

cnf(c_0_64,plain,
    ( ~ ssList(X1)
    | ~ neq(X1,X1) ),
    inference(er,[status(thm)],[c_0_59]) ).

cnf(c_0_65,negated_conjecture,
    ( neq(esk4_0,esk4_0)
    | esk4_0 != esk5_0 ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_66,negated_conjecture,
    ( app(esk1_0,nil) = esk4_0
    | nil != esk4_0 ),
    inference(spm,[status(thm)],[c_0_32,c_0_43]) ).

cnf(c_0_67,negated_conjecture,
    ( app(esk5_0,nil) = esk5_0
    | ~ ssList(app(esk5_0,nil)) ),
    inference(spm,[status(thm)],[c_0_45,c_0_32]) ).

cnf(c_0_68,plain,
    ( app(nil,app(X1,X2)) = app(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_36]),c_0_28])]) ).

cnf(c_0_69,negated_conjecture,
    ( esk5_0 = X1
    | esk4_0 != esk1_0
    | nil != X1
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_19])]) ).

cnf(c_0_70,negated_conjecture,
    esk4_0 != esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_27])]) ).

cnf(c_0_71,negated_conjecture,
    ( esk4_0 = esk1_0
    | nil != esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_66]),c_0_20])]) ).

cnf(c_0_72,negated_conjecture,
    app(esk5_0,nil) = esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_39]),c_0_28]),c_0_19])]) ).

cnf(c_0_73,plain,
    ( X1 = X2
    | app(X1,nil) != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_28])]) ).

cnf(c_0_74,plain,
    ( nil = X1
    | app(X2,app(X3,X1)) != nil
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_17]),c_0_39]) ).

cnf(c_0_75,negated_conjecture,
    app(nil,esk4_0) = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_76,negated_conjecture,
    nil != esk4_0,
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_27]),c_0_70]),c_0_71]) ).

cnf(c_0_77,negated_conjecture,
    app(nil,esk5_0) = esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_72]),c_0_28]),c_0_19])]) ).

cnf(c_0_78,negated_conjecture,
    ( esk5_0 = X1
    | nil != esk4_0
    | nil != X1
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_43]),c_0_19])]) ).

cnf(c_0_79,negated_conjecture,
    ( app(X1,esk4_0) != nil
    | ~ ssList(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_27]),c_0_28])]),c_0_76]) ).

cnf(c_0_80,negated_conjecture,
    ( nil = esk5_0
    | app(X1,esk5_0) != nil
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_77]),c_0_19]),c_0_28])]) ).

cnf(c_0_81,negated_conjecture,
    ( app(esk1_0,app(esk5_0,esk5_0)) = esk4_0
    | esk4_0 != esk5_0 ),
    inference(spm,[status(thm)],[c_0_32,c_0_51]) ).

cnf(c_0_82,negated_conjecture,
    ( esk4_0 = esk5_0
    | nil != esk4_0 ),
    inference(spm,[status(thm)],[c_0_78,c_0_27]) ).

fof(c_0_83,plain,
    ! [X5,X6,X9,X10] :
      ( ( ssList(esk6_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk7_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( app(app(esk6_2(X5,X6),X6),esk7_2(X5,X6)) = X5
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ~ ssList(X9)
        | ~ ssList(X10)
        | app(app(X9,X6),X10) != X5
        | segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) ) ),
    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)],[ax7])])])])])])]) ).

cnf(c_0_84,negated_conjecture,
    app(esk1_0,app(esk5_0,esk4_0)) != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_26]),c_0_27])]) ).

cnf(c_0_85,negated_conjecture,
    ( nil = esk5_0
    | app(esk1_0,app(esk5_0,esk5_0)) != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_26]),c_0_27]),c_0_19])]) ).

cnf(c_0_86,negated_conjecture,
    ( app(esk5_0,esk5_0) = nil
    | nil != esk4_0
    | ~ ssList(app(esk5_0,esk5_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_81]),c_0_20])]),c_0_82]) ).

cnf(c_0_87,negated_conjecture,
    ( ~ segmentP(esk2_0,esk1_0)
    | ~ neq(esk1_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_88,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(app(X3,X2),X4) != X1
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_83]) ).

cnf(c_0_89,negated_conjecture,
    ( app(esk5_0,esk4_0) != nil
    | nil != esk1_0
    | ~ ssList(app(esk5_0,esk4_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_50]),c_0_20])]) ).

cnf(c_0_90,negated_conjecture,
    ( nil = esk5_0
    | app(esk5_0,esk5_0) != nil
    | nil != esk1_0
    | ~ ssList(app(esk5_0,esk5_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_50]),c_0_20])]) ).

cnf(c_0_91,negated_conjecture,
    ( app(esk5_0,esk5_0) = nil
    | nil != esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_39]),c_0_19])]) ).

cnf(c_0_92,negated_conjecture,
    ( ~ segmentP(esk4_0,esk1_0)
    | ~ neq(esk1_0,nil) ),
    inference(rw,[status(thm)],[c_0_87,c_0_22]) ).

cnf(c_0_93,plain,
    ( neq(X1,X2)
    | X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_94,plain,
    ( segmentP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_36]),c_0_28])]) ).

cnf(c_0_95,negated_conjecture,
    ( app(esk5_0,esk4_0) != nil
    | nil != esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_39]),c_0_27]),c_0_19])]) ).

cnf(c_0_96,negated_conjecture,
    ( nil = esk5_0
    | nil != esk1_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_28])]),c_0_40]) ).

cnf(c_0_97,negated_conjecture,
    ( nil = esk1_0
    | ~ segmentP(esk4_0,esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_28]),c_0_20])]) ).

cnf(c_0_98,negated_conjecture,
    ( segmentP(X1,esk1_0)
    | esk4_0 != X1
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_99,negated_conjecture,
    nil != esk1_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_50]),c_0_27]),c_0_19])]),c_0_96]),c_0_40]) ).

cnf(c_0_100,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_27])]),c_0_99]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC124+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n012.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 11:48:26 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.022 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             : 101
% 0.24/1.42  # Proof object clause steps            : 79
% 0.24/1.42  # Proof object formula steps           : 22
% 0.24/1.42  # Proof object conjectures             : 62
% 0.24/1.42  # Proof object clause conjectures      : 59
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 22
% 0.24/1.42  # Proof object initial formulas used   : 11
% 0.24/1.42  # Proof object generating inferences   : 51
% 0.24/1.42  # Proof object simplifying inferences  : 115
% 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    : 47
% 0.24/1.42  # Initial clauses                      : 89
% 0.24/1.42  # Removed in clause preprocessing      : 1
% 0.24/1.42  # Initial clauses in saturation        : 88
% 0.24/1.42  # Processed clauses                    : 4192
% 0.24/1.42  # ...of these trivial                  : 81
% 0.24/1.42  # ...subsumed                          : 3334
% 0.24/1.42  # ...remaining for further processing  : 777
% 0.24/1.42  # Other redundant clauses eliminated   : 104
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 60
% 0.24/1.42  # Backward-rewritten                   : 13
% 0.24/1.42  # Generated clauses                    : 19136
% 0.24/1.42  # ...of the previous two non-trivial   : 17381
% 0.24/1.42  # Contextual simplify-reflections      : 3325
% 0.24/1.42  # Paramodulations                      : 18991
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 141
% 0.24/1.42  # Current number of processed clauses  : 697
% 0.24/1.42  #    Positive orientable unit clauses  : 23
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 8
% 0.24/1.42  #    Non-unit-clauses                  : 666
% 0.24/1.42  # Current number of unprocessed clauses: 12858
% 0.24/1.42  # ...number of literals in the above   : 80354
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 77
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 189318
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 149460
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 5448
% 0.24/1.42  # Unit Clause-clause subsumption calls : 623
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 5
% 0.24/1.42  # BW rewrite match successes           : 4
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 346492
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.580 s
% 0.24/1.42  # System time              : 0.009 s
% 0.24/1.42  # Total time               : 0.589 s
% 0.24/1.42  # Maximum resident set size: 15908 pages
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------