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

View Problem - Process Solution

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

% Computer : n020.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:35 EDT 2022

% Result   : Theorem 0.52s 54.70s
% Output   : CNFRefutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   17
% Syntax   : Number of formulae    :  101 (  20 unt;   0 def)
%            Number of atoms       :  405 ( 100 equ)
%            Maximal formula atoms :   33 (   4 avg)
%            Number of connectives :  518 ( 214   ~; 215   |;  42   &)
%                                         (   4 <=>;  43  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-2 aty)
%            Number of variables   :  157 (   0 sgn  76   !;   8   ?)

% 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)
                        & neq(X5,nil)
                        & segmentP(X2,X5)
                        & segmentP(X1,X5) )
                    | ( ! [X6] :
                          ( ssItem(X6)
                         => ( cons(X6,nil) != X3
                            | ~ memberP(X4,X6)
                            | ? [X7] :
                                ( ssItem(X7)
                                & X6 != X7
                                & memberP(X4,X7)
                                & leq(X6,X7) ) ) )
                      & ( nil != X4
                        | nil != X3 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).

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

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

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

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

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

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

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

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

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

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

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

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

fof(c_0_17,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X5,nil)
                          & segmentP(X2,X5)
                          & segmentP(X1,X5) )
                      | ( ! [X6] :
                            ( ssItem(X6)
                           => ( cons(X6,nil) != X3
                              | ~ memberP(X4,X6)
                              | ? [X7] :
                                  ( ssItem(X7)
                                  & X6 != X7
                                  & memberP(X4,X7)
                                  & leq(X6,X7) ) ) )
                        & ( nil != X4
                          | nil != X3 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_18,negated_conjecture,
    ! [X12,X14] :
      ( 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(X12)
        | ~ neq(X12,nil)
        | ~ segmentP(esk2_0,X12)
        | ~ segmentP(esk1_0,X12) )
      & ( nil = esk4_0
        | ssItem(esk5_0) )
      & ( nil = esk3_0
        | ssItem(esk5_0) )
      & ( nil = esk4_0
        | cons(esk5_0,nil) = esk3_0 )
      & ( nil = esk3_0
        | cons(esk5_0,nil) = esk3_0 )
      & ( nil = esk4_0
        | memberP(esk4_0,esk5_0) )
      & ( nil = esk3_0
        | memberP(esk4_0,esk5_0) )
      & ( nil = esk4_0
        | ~ ssItem(X14)
        | esk5_0 = X14
        | ~ memberP(esk4_0,X14)
        | ~ leq(esk5_0,X14) )
      & ( nil = esk3_0
        | ~ ssItem(X14)
        | esk5_0 = X14
        | ~ memberP(esk4_0,X14)
        | ~ leq(esk5_0,X14) ) ),
    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_17])])])])])])])]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ segmentP(esk1_0,X1)
    | ~ segmentP(esk2_0,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    neq(esk2_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    ssList(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_24,plain,
    ! [X4,X5,X6] :
      ( ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ segmentP(X4,X5)
      | ~ segmentP(X5,X6)
      | segmentP(X4,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)],[ax53])])])])]) ).

fof(c_0_25,plain,
    ! [X2] :
      ( ( ~ segmentP(nil,X2)
        | nil = X2
        | ~ ssList(X2) )
      & ( nil != X2
        | segmentP(nil,X2)
        | ~ ssList(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).

fof(c_0_26,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | segmentP(X2,nil) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).

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

fof(c_0_28,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])])])])]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ segmentP(esk3_0,X1)
    | ~ segmentP(esk4_0,X1)
    | ~ ssList(X1)
    | ~ neq(X1,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

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

cnf(c_0_31,negated_conjecture,
    ssList(esk4_0),
    inference(rw,[status(thm)],[c_0_23,c_0_21]) ).

cnf(c_0_32,plain,
    ( segmentP(X1,X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_33,plain,
    ( segmentP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

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

cnf(c_0_35,plain,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_36,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_37,plain,
    ( cons(X1,X2) = app(cons(X1,nil),X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_38,negated_conjecture,
    ( cons(esk5_0,nil) = esk3_0
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_39,negated_conjecture,
    ( ssItem(esk5_0)
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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

cnf(c_0_41,negated_conjecture,
    ( cons(esk5_0,nil) = esk3_0
    | nil = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_42,negated_conjecture,
    ( ssItem(esk5_0)
    | nil = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ segmentP(esk3_0,esk4_0)
    | ~ segmentP(esk4_0,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).

cnf(c_0_44,plain,
    ( segmentP(X1,X2)
    | nil != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]) ).

cnf(c_0_45,negated_conjecture,
    ssList(esk3_0),
    inference(rw,[status(thm)],[c_0_36,c_0_20]) ).

cnf(c_0_46,negated_conjecture,
    ( cons(esk5_0,X1) = app(esk3_0,X1)
    | esk3_0 = nil
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).

cnf(c_0_47,negated_conjecture,
    ( esk4_0 = nil
    | esk3_0 != nil ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_40,c_0_41]),c_0_34])]),c_0_42]) ).

cnf(c_0_48,negated_conjecture,
    ( esk4_0 != nil
    | ~ segmentP(esk4_0,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_44]),c_0_31]),c_0_45])]) ).

fof(c_0_49,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_50,negated_conjecture,
    ( app(esk3_0,nil) = esk3_0
    | esk4_0 = nil ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_46]),c_0_34])]),c_0_47]) ).

cnf(c_0_51,negated_conjecture,
    esk4_0 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_48,c_0_44]),c_0_31])]) ).

fof(c_0_52,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_53,plain,
    ( X1 = X2
    | app(X3,X1) != app(X3,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_54,negated_conjecture,
    app(esk3_0,nil) = esk3_0,
    inference(sr,[status(thm)],[c_0_50,c_0_51]) ).

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

fof(c_0_56,plain,
    ! [X5,X6,X7,X8] :
      ( ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ segmentP(X5,X6)
      | segmentP(app(app(X7,X5),X8),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)],[ax56])])])])]) ).

fof(c_0_57,plain,
    ! [X5,X6,X9,X10] :
      ( ( ssList(esk6_2(X5,X6))
        | ~ memberP(X5,X6)
        | ~ ssItem(X6)
        | ~ ssList(X5) )
      & ( ssList(esk7_2(X5,X6))
        | ~ memberP(X5,X6)
        | ~ ssItem(X6)
        | ~ ssList(X5) )
      & ( app(esk6_2(X5,X6),cons(X6,esk7_2(X5,X6))) = X5
        | ~ memberP(X5,X6)
        | ~ ssItem(X6)
        | ~ ssList(X5) )
      & ( ~ ssList(X9)
        | ~ ssList(X10)
        | app(X9,cons(X6,X10)) != X5
        | memberP(X5,X6)
        | ~ ssItem(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)],[ax3])])])])])])]) ).

cnf(c_0_58,negated_conjecture,
    cons(esk5_0,nil) = esk3_0,
    inference(sr,[status(thm)],[c_0_41,c_0_51]) ).

cnf(c_0_59,negated_conjecture,
    ssItem(esk5_0),
    inference(sr,[status(thm)],[c_0_42,c_0_51]) ).

fof(c_0_60,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_61,negated_conjecture,
    ( X1 = nil
    | app(esk3_0,X1) != esk3_0
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_53,c_0_54]),c_0_45]),c_0_34])]) ).

cnf(c_0_62,negated_conjecture,
    ( app(esk3_0,app(nil,X1)) = app(esk3_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_54]),c_0_34]),c_0_45])]) ).

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

cnf(c_0_64,plain,
    ( segmentP(app(app(X1,X2),X3),X4)
    | ~ segmentP(X2,X4)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_56]) ).

cnf(c_0_65,plain,
    ( app(esk6_2(X1,X2),cons(X2,esk7_2(X1,X2))) = X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_66,negated_conjecture,
    ( cons(esk5_0,X1) = app(esk3_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_37,c_0_58]),c_0_59])]) ).

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

cnf(c_0_68,negated_conjecture,
    ( app(nil,X1) = nil
    | app(esk3_0,X1) != esk3_0
    | ~ ssList(app(nil,X1))
    | ~ ssList(X1) ),
    inference(pm,[status(thm)],[c_0_61,c_0_62]) ).

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

cnf(c_0_70,plain,
    ( segmentP(app(X1,app(X2,X3)),X4)
    | ~ segmentP(X2,X4)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(pm,[status(thm)],[c_0_64,c_0_55]) ).

cnf(c_0_71,negated_conjecture,
    ( app(esk6_2(X1,esk5_0),app(esk3_0,esk7_2(X1,esk5_0))) = X1
    | ~ memberP(X1,esk5_0)
    | ~ ssList(esk7_2(X1,esk5_0))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_65,c_0_66]),c_0_59])]) ).

fof(c_0_72,plain,
    ! [X5,X6,X9,X10] :
      ( ( ssList(esk12_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk13_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( app(app(esk12_2(X5,X6),X6),esk13_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])])])])])])]) ).

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

cnf(c_0_74,plain,
    ( ssList(app(X1,app(X2,X3)))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_67,c_0_55]),c_0_67]) ).

cnf(c_0_75,negated_conjecture,
    app(nil,nil) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_68,c_0_69]),c_0_34]),c_0_54])]) ).

fof(c_0_76,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_77,negated_conjecture,
    ( segmentP(X1,X2)
    | ~ segmentP(esk3_0,X2)
    | ~ memberP(X1,esk5_0)
    | ~ ssList(esk7_2(X1,esk5_0))
    | ~ ssList(esk6_2(X1,esk5_0))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_70,c_0_71]),c_0_45])]) ).

cnf(c_0_78,plain,
    ( ssList(esk7_2(X1,X2))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_79,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_72]) ).

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

cnf(c_0_81,plain,
    ( app(X1,app(X2,nil)) = app(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_69,c_0_55]),c_0_34])]),c_0_67]) ).

cnf(c_0_82,negated_conjecture,
    ( ssList(app(X1,nil))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_74,c_0_75]),c_0_34])]) ).

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

fof(c_0_84,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | segmentP(X2,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).

cnf(c_0_85,negated_conjecture,
    ( segmentP(X1,X2)
    | ~ segmentP(esk3_0,X2)
    | ~ memberP(X1,esk5_0)
    | ~ ssList(esk6_2(X1,esk5_0))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_77,c_0_78]),c_0_59])]) ).

cnf(c_0_86,plain,
    ( ssList(esk6_2(X1,X2))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_87,plain,
    ( segmentP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_79,c_0_80]),c_0_34])]) ).

cnf(c_0_88,plain,
    ( app(nil,X1) = app(X1,nil)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_80,c_0_81]),c_0_34])]),c_0_82]) ).

cnf(c_0_89,negated_conjecture,
    ( X1 = nil
    | ~ segmentP(esk3_0,X1)
    | ~ segmentP(esk4_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_29,c_0_83]),c_0_34])]) ).

cnf(c_0_90,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_84]) ).

cnf(c_0_91,negated_conjecture,
    esk3_0 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_40,c_0_58]),c_0_34]),c_0_59])]) ).

cnf(c_0_92,negated_conjecture,
    ( segmentP(X1,X2)
    | ~ segmentP(esk3_0,X2)
    | ~ memberP(X1,esk5_0)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_85,c_0_86]),c_0_59])]) ).

cnf(c_0_93,plain,
    ( segmentP(X1,X2)
    | app(nil,X2) != X1
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_87,c_0_88]),c_0_34])]) ).

cnf(c_0_94,plain,
    ( app(nil,app(X1,X2)) = app(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_80]),c_0_34])]) ).

cnf(c_0_95,negated_conjecture,
    ( memberP(esk4_0,esk5_0)
    | nil = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_96,negated_conjecture,
    ~ segmentP(esk4_0,esk3_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_89,c_0_90]),c_0_45])]),c_0_91]) ).

cnf(c_0_97,negated_conjecture,
    ( segmentP(X1,X2)
    | app(nil,X2) != esk3_0
    | ~ memberP(X1,esk5_0)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_92,c_0_93]),c_0_45])]) ).

cnf(c_0_98,negated_conjecture,
    app(nil,esk3_0) = esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_94,c_0_54]),c_0_54]),c_0_34]),c_0_45])]) ).

cnf(c_0_99,negated_conjecture,
    memberP(esk4_0,esk5_0),
    inference(sr,[status(thm)],[c_0_95,c_0_51]) ).

cnf(c_0_100,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_96,c_0_97]),c_0_98]),c_0_99]),c_0_45]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : SWC084+1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/0.12  % Command  : run_ET %s %d
% 0.11/0.32  % Computer : n020.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jun 12 18:55:20 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.34/23.39  eprover: CPU time limit exceeded, terminating
% 0.34/23.40  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.34/23.40  
% 0.34/23.42  eprover: CPU time limit exceeded, terminating
% 0.47/46.42  eprover: CPU time limit exceeded, terminating
% 0.47/46.42  eprover: CPU time limit exceeded, terminating
% 0.47/46.43  eprover: CPU time limit exceeded, terminating
% 0.47/46.43  eprover: CPU time limit exceeded, terminating
% 0.52/54.70  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.52/54.70  
% 0.52/54.70  # Failure: Resource limit exceeded (time)
% 0.52/54.70  # OLD status Res
% 0.52/54.70  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.52/54.70  # Preprocessing time       : 0.020 s
% 0.52/54.70  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.52/54.70  
% 0.52/54.70  # Failure: Resource limit exceeded (time)
% 0.52/54.70  # OLD status Res
% 0.52/54.70  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.52/54.70  # Preprocessing time       : 0.010 s
% 0.52/54.70  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.52/54.70  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.52/54.70  # Preprocessing time       : 0.011 s
% 0.52/54.70  
% 0.52/54.70  # Proof found!
% 0.52/54.70  # SZS status Theorem
% 0.52/54.70  # SZS output start CNFRefutation
% See solution above
% 0.52/54.70  # Proof object total steps             : 101
% 0.52/54.70  # Proof object clause steps            : 67
% 0.52/54.70  # Proof object formula steps           : 34
% 0.52/54.70  # Proof object conjectures             : 44
% 0.52/54.70  # Proof object clause conjectures      : 41
% 0.52/54.70  # Proof object formula conjectures     : 3
% 0.52/54.70  # Proof object initial clauses used    : 29
% 0.52/54.70  # Proof object initial formulas used   : 17
% 0.52/54.70  # Proof object generating inferences   : 30
% 0.52/54.70  # Proof object simplifying inferences  : 79
% 0.52/54.70  # Training examples: 0 positive, 0 negative
% 0.52/54.70  # Parsed axioms                        : 96
% 0.52/54.70  # Removed by relevancy pruning/SinE    : 63
% 0.52/54.70  # Initial clauses                      : 68
% 0.52/54.70  # Removed in clause preprocessing      : 0
% 0.52/54.70  # Initial clauses in saturation        : 68
% 0.52/54.70  # Processed clauses                    : 38021
% 0.52/54.70  # ...of these trivial                  : 207
% 0.52/54.70  # ...subsumed                          : 35156
% 0.52/54.70  # ...remaining for further processing  : 2658
% 0.52/54.70  # Other redundant clauses eliminated   : 267
% 0.52/54.70  # Clauses deleted for lack of memory   : 281893
% 0.52/54.70  # Backward-subsumed                    : 108
% 0.52/54.70  # Backward-rewritten                   : 53
% 0.52/54.70  # Generated clauses                    : 409641
% 0.52/54.70  # ...of the previous two non-trivial   : 398163
% 0.52/54.70  # Contextual simplify-reflections      : 7192
% 0.52/54.70  # Paramodulations                      : 409129
% 0.52/54.70  # Factorizations                       : 0
% 0.52/54.70  # Equation resolutions                 : 507
% 0.52/54.70  # Current number of processed clauses  : 2489
% 0.52/54.70  #    Positive orientable unit clauses  : 121
% 0.52/54.70  #    Positive unorientable unit clauses: 0
% 0.52/54.70  #    Negative unit clauses             : 421
% 0.52/54.70  #    Non-unit-clauses                  : 1947
% 0.52/54.70  # Current number of unprocessed clauses: 73836
% 0.52/54.70  # ...number of literals in the above   : 306948
% 0.52/54.70  # Current number of archived formulas  : 0
% 0.52/54.70  # Current number of archived clauses   : 166
% 0.52/54.70  # Clause-clause subsumption calls (NU) : 1080464
% 0.52/54.70  # Rec. Clause-clause subsumption calls : 273895
% 0.52/54.70  # Non-unit clause-clause subsumptions  : 13101
% 0.52/54.70  # Unit Clause-clause subsumption calls : 32949
% 0.52/54.70  # Rewrite failures with RHS unbound    : 0
% 0.52/54.70  # BW rewrite match attempts            : 572
% 0.52/54.70  # BW rewrite match successes           : 24
% 0.52/54.70  # Condensation attempts                : 0
% 0.52/54.70  # Condensation successes               : 0
% 0.52/54.70  # Termbank termtop insertions          : 7361543
% 0.52/54.70  
% 0.52/54.70  # -------------------------------------------------
% 0.52/54.70  # User time                : 8.118 s
% 0.52/54.70  # System time              : 0.104 s
% 0.52/54.70  # Total time               : 8.222 s
% 0.52/54.70  # Maximum resident set size: 139912 pages
% 0.52/69.43  eprover: CPU time limit exceeded, terminating
% 0.52/69.44  eprover: CPU time limit exceeded, terminating
% 0.52/69.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.45  eprover: No such file or directory
% 0.52/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.46  eprover: No such file or directory
% 0.52/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.46  eprover: No such file or directory
% 0.52/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.46  eprover: No such file or directory
% 0.52/69.46  eprover: CPU time limit exceeded, terminating
% 0.52/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.46  eprover: No such file or directory
% 0.52/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.46  eprover: No such file or directory
% 0.52/69.47  eprover: eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.inCannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.47  
% 0.52/69.47  eprover: No such file or directory
% 0.52/69.47  eprover: No such file or directory
% 0.52/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.47  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48  eprover: No such file or directory
% 0.52/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.49  eprover: No such file or directory
% 0.52/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.49  eprover: No such file or directory
% 0.52/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.49  eprover: No such file or directory
% 0.52/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.49  eprover: No such file or directory
% 0.52/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.49  eprover: No such file or directory
% 0.52/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.49  eprover: No such file or directory
% 0.52/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.50  eprover: No such file or directory
% 0.52/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.50  eprover: No such file or directory
% 0.52/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.50  eprover: No such file or directory
% 0.52/69.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.51  eprover: No such file or directory
% 0.52/69.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.52/69.51  eprover: No such file or directory
%------------------------------------------------------------------------------