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

View Problem - Process Solution

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

% Computer : n009.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:19 EDT 2022

% Result   : Theorem 0.31s 51.53s
% Output   : CNFRefutation 0.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   78 (  17 unt;   0 def)
%            Number of atoms       :  351 (  93 equ)
%            Maximal formula atoms :   29 (   4 avg)
%            Number of connectives :  463 ( 190   ~; 196   |;  37   &)
%                                         (   4 <=>;  36  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-2 aty)
%            Number of variables   :  137 (   0 sgn  63   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | segmentP(X2,X1)
                    | ( ! [X5] :
                          ( ssItem(X5)
                         => ( cons(X5,nil) != X3
                            | ~ memberP(X4,X5)
                            | ? [X6] :
                                ( ssItem(X6)
                                & X5 != X6
                                & memberP(X4,X6)
                                & leq(X6,X5) ) ) )
                      & ( nil != X4
                        | nil != X3 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).

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

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

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

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

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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).

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

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

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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).

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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).

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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).

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

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

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

fof(c_0_15,negated_conjecture,
    ! [X12] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ~ segmentP(esk2_0,esk1_0)
      & ( 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(X12)
        | esk5_0 = X12
        | ~ memberP(esk4_0,X12)
        | ~ leq(X12,esk5_0) )
      & ( nil = esk3_0
        | ~ ssItem(X12)
        | esk5_0 = X12
        | ~ memberP(esk4_0,X12)
        | ~ leq(X12,esk5_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_14])])])])])])])]) ).

fof(c_0_16,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_17,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_18,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | segmentP(X2,nil) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).

cnf(c_0_19,negated_conjecture,
    ~ segmentP(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

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

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

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

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

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

cnf(c_0_26,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_27,negated_conjecture,
    ssList(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_28,negated_conjecture,
    ~ segmentP(esk4_0,esk3_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_29,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_22,c_0_23]),c_0_24])]),c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    ssList(esk3_0),
    inference(rw,[status(thm)],[c_0_26,c_0_20]) ).

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

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

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

cnf(c_0_34,negated_conjecture,
    esk3_0 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).

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

fof(c_0_36,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_37,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(X2,nil) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

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

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

fof(c_0_41,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_42,plain,
    ( cons(X1,X2) = app(cons(X1,nil),X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_43,negated_conjecture,
    cons(esk5_0,nil) = esk3_0,
    inference(sr,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_44,negated_conjecture,
    ssItem(esk5_0),
    inference(sr,[status(thm)],[c_0_35,c_0_34]) ).

cnf(c_0_45,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_36]) ).

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

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

fof(c_0_48,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_49,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_39]) ).

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

cnf(c_0_51,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_41]) ).

cnf(c_0_52,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_42,c_0_43]),c_0_44])]) ).

cnf(c_0_53,plain,
    ( segmentP(X1,X2)
    | app(X3,X2) != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_46]),c_0_24])]),c_0_47]) ).

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

cnf(c_0_55,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_49,c_0_50]) ).

cnf(c_0_56,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_51,c_0_52]),c_0_44])]) ).

cnf(c_0_57,plain,
    ( segmentP(X1,X2)
    | app(X3,app(X4,X2)) != X1
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_53,c_0_50]),c_0_47]) ).

cnf(c_0_58,plain,
    ( app(X1,app(X2,X3)) = app(nil,X3)
    | nil != X2
    | nil != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(pm,[status(thm)],[c_0_50,c_0_54]) ).

cnf(c_0_59,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_55,c_0_56]),c_0_30])]) ).

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

cnf(c_0_61,plain,
    ( segmentP(X1,X2)
    | app(nil,X2) != X1
    | nil != X3
    | nil != X4
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X4) ),
    inference(pm,[status(thm)],[c_0_57,c_0_58]) ).

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

cnf(c_0_63,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_42,c_0_33]),c_0_35]) ).

cnf(c_0_64,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_59,c_0_60]),c_0_44])]) ).

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

cnf(c_0_66,plain,
    ( segmentP(X1,X2)
    | app(nil,X2) != X1
    | nil != X3
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssList(X3) ),
    inference(pm,[status(thm)],[c_0_61,c_0_24]) ).

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

cnf(c_0_68,negated_conjecture,
    ( app(esk3_0,nil) = esk3_0
    | esk3_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_63]),c_0_24])]) ).

cnf(c_0_69,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_64,c_0_65]),c_0_44])]) ).

cnf(c_0_70,plain,
    ( segmentP(X1,X2)
    | app(nil,X2) != X1
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(pm,[status(thm)],[c_0_66,c_0_24]) ).

cnf(c_0_71,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_50,c_0_67]),c_0_24])]) ).

cnf(c_0_72,negated_conjecture,
    app(esk3_0,nil) = esk3_0,
    inference(sr,[status(thm)],[c_0_68,c_0_34]) ).

cnf(c_0_73,negated_conjecture,
    ( memberP(esk4_0,esk5_0)
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_74,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_69,c_0_70]),c_0_30])]) ).

cnf(c_0_75,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_71,c_0_72]),c_0_72]),c_0_24]),c_0_30])]) ).

cnf(c_0_76,negated_conjecture,
    memberP(esk4_0,esk5_0),
    inference(sr,[status(thm)],[c_0_73,c_0_34]) ).

cnf(c_0_77,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_28,c_0_74]),c_0_75]),c_0_76]),c_0_30]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : SWC368+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.06  % Command  : run_ET %s %d
% 0.06/0.25  % Computer : n009.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Sat Jun 11 19:47:38 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.20/23.29  eprover: CPU time limit exceeded, terminating
% 0.20/23.30  eprover: CPU time limit exceeded, terminating
% 0.20/23.30  eprover: CPU time limit exceeded, terminating
% 0.20/23.31  eprover: CPU time limit exceeded, terminating
% 0.29/46.30  eprover: CPU time limit exceeded, terminating
% 0.29/46.31  eprover: CPU time limit exceeded, terminating
% 0.29/46.33  eprover: CPU time limit exceeded, terminating
% 0.29/46.33  eprover: CPU time limit exceeded, terminating
% 0.31/51.53  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.31/51.53  
% 0.31/51.53  # Failure: Resource limit exceeded (time)
% 0.31/51.53  # OLD status Res
% 0.31/51.53  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.31/51.53  # Preprocessing time       : 0.010 s
% 0.31/51.53  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.31/51.53  
% 0.31/51.53  # Failure: Resource limit exceeded (time)
% 0.31/51.53  # OLD status Res
% 0.31/51.53  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.31/51.53  # Preprocessing time       : 0.009 s
% 0.31/51.53  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.31/51.53  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.31/51.53  # Preprocessing time       : 0.021 s
% 0.31/51.53  
% 0.31/51.53  # Proof found!
% 0.31/51.53  # SZS status Theorem
% 0.31/51.53  # SZS output start CNFRefutation
% See solution above
% 0.31/51.54  # Proof object total steps             : 78
% 0.31/51.54  # Proof object clause steps            : 50
% 0.31/51.54  # Proof object formula steps           : 28
% 0.31/51.54  # Proof object conjectures             : 29
% 0.31/51.54  # Proof object clause conjectures      : 26
% 0.31/51.54  # Proof object formula conjectures     : 3
% 0.31/51.54  # Proof object initial clauses used    : 23
% 0.31/51.54  # Proof object initial formulas used   : 14
% 0.31/51.54  # Proof object generating inferences   : 20
% 0.31/51.54  # Proof object simplifying inferences  : 44
% 0.31/51.54  # Training examples: 0 positive, 0 negative
% 0.31/51.54  # Parsed axioms                        : 96
% 0.31/51.54  # Removed by relevancy pruning/SinE    : 65
% 0.31/51.54  # Initial clauses                      : 63
% 0.31/51.54  # Removed in clause preprocessing      : 0
% 0.31/51.54  # Initial clauses in saturation        : 63
% 0.31/51.54  # Processed clauses                    : 31842
% 0.31/51.54  # ...of these trivial                  : 182
% 0.31/51.54  # ...subsumed                          : 28904
% 0.31/51.54  # ...remaining for further processing  : 2756
% 0.31/51.54  # Other redundant clauses eliminated   : 194
% 0.31/51.54  # Clauses deleted for lack of memory   : 71116
% 0.31/51.54  # Backward-subsumed                    : 113
% 0.31/51.54  # Backward-rewritten                   : 67
% 0.31/51.54  # Generated clauses                    : 231728
% 0.31/51.54  # ...of the previous two non-trivial   : 222131
% 0.31/51.54  # Contextual simplify-reflections      : 6376
% 0.31/51.54  # Paramodulations                      : 231219
% 0.31/51.54  # Factorizations                       : 0
% 0.31/51.54  # Equation resolutions                 : 504
% 0.31/51.54  # Current number of processed clauses  : 2570
% 0.31/51.54  #    Positive orientable unit clauses  : 120
% 0.31/51.54  #    Positive unorientable unit clauses: 0
% 0.31/51.54  #    Negative unit clauses             : 499
% 0.31/51.54  #    Non-unit-clauses                  : 1951
% 0.31/51.54  # Current number of unprocessed clauses: 115165
% 0.31/51.54  # ...number of literals in the above   : 648453
% 0.31/51.54  # Current number of archived formulas  : 0
% 0.31/51.54  # Current number of archived clauses   : 185
% 0.31/51.54  # Clause-clause subsumption calls (NU) : 940532
% 0.31/51.54  # Rec. Clause-clause subsumption calls : 305636
% 0.31/51.54  # Non-unit clause-clause subsumptions  : 11787
% 0.31/51.54  # Unit Clause-clause subsumption calls : 44074
% 0.31/51.54  # Rewrite failures with RHS unbound    : 0
% 0.31/51.54  # BW rewrite match attempts            : 718
% 0.31/51.54  # BW rewrite match successes           : 33
% 0.31/51.54  # Condensation attempts                : 0
% 0.31/51.54  # Condensation successes               : 0
% 0.31/51.54  # Termbank termtop insertions          : 3729134
% 0.31/51.54  
% 0.31/51.54  # -------------------------------------------------
% 0.31/51.54  # User time                : 4.161 s
% 0.31/51.54  # System time              : 0.092 s
% 0.31/51.54  # Total time               : 4.253 s
% 0.31/51.54  # Maximum resident set size: 135892 pages
% 0.31/69.31  eprover: CPU time limit exceeded, terminating
% 0.31/69.33  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.33  eprover: No such file or directory
% 0.31/69.33  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.33  eprover: No such file or directory
% 0.31/69.34  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.34  eprover: No such file or directory
% 0.31/69.34  eprover: CPU time limit exceeded, terminating
% 0.31/69.34  eprover: CPU time limit exceeded, terminating
% 0.31/69.35  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.35  eprover: No such file or directory
% 0.31/69.35  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.35  eprover: No such file or directory
% 0.31/69.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.36  eprover: No such file or directory
% 0.31/69.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.36  eprover: No such file or directory
% 0.31/69.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.36  eprover: No such file or directory
% 0.31/69.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.36  eprover: No such file or directory
% 0.31/69.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.36  eprover: No such file or directory
% 0.31/69.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.36  eprover: No such file or directory
% 0.31/69.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.37  eprover: No such file or directory
% 0.31/69.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.37  eprover: No such file or directory
% 0.31/69.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.37  eprover: No such file or directory
% 0.31/69.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.37  eprover: No such file or directory
% 0.31/69.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.37  eprover: No such file or directory
% 0.31/69.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.31/69.37  eprover: No such file or directory
% 0.31/69.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.38  eprover: No such file or directory
% 0.31/69.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.38  eprover: No such file or directory
% 0.31/69.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.38  eprover: No such file or directory
% 0.31/69.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.38  eprover: No such file or directory
% 0.31/69.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.38  eprover: No such file or directory
% 0.31/69.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.39  eprover: No such file or directory
% 0.31/69.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.39  eprover: No such file or directory
% 0.31/69.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.39  eprover: No such file or directory
% 0.31/69.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.39  eprover: No such file or directory
% 0.31/69.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.31/69.39  eprover: No such file or directory
%------------------------------------------------------------------------------