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

View Problem - Process Solution

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

% Computer : n016.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:27:57 EDT 2022

% Result   : Theorem 0.22s 2.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   98 (  22 unt;   0 def)
%            Number of atoms       :  386 (  64 equ)
%            Maximal formula atoms :   30 (   3 avg)
%            Number of connectives :  492 ( 204   ~; 194   |;  35   &)
%                                         (   5 <=>;  54  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   5 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  10 con; 0-2 aty)
%            Number of variables   :  136 (   0 sgn  85   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ segmentP(X4,X3)
                    | ! [X5] :
                        ( ssItem(X5)
                       => ! [X6] :
                            ( ssItem(X6)
                           => ! [X7] :
                                ( ssList(X7)
                               => ! [X8] :
                                    ( ssList(X8)
                                   => ! [X9] :
                                        ( ssList(X9)
                                       => ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
                                          | ~ lt(X6,X5) ) ) ) ) ) )
                    | ( ~ singletonP(X3)
                      & neq(X4,nil) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).

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

fof(ax12,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( strictorderedP(X1)
      <=> ! [X2] :
            ( ssItem(X2)
           => ! [X3] :
                ( ssItem(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ! [X5] :
                        ( ssList(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
                             => lt(X2,X3) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).

fof(ax33,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ( lt(X1,X2)
           => ~ lt(X2,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).

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

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

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

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

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

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

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

fof(c_0_18,negated_conjecture,
    ( ssList(esk48_0)
    & ssList(esk49_0)
    & ssList(esk50_0)
    & ssList(esk51_0)
    & esk49_0 = esk51_0
    & esk48_0 = esk50_0
    & segmentP(esk51_0,esk50_0)
    & ssItem(esk52_0)
    & ssItem(esk53_0)
    & ssList(esk54_0)
    & ssList(esk55_0)
    & ssList(esk56_0)
    & app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
    & lt(esk53_0,esk52_0)
    & ( singletonP(esk50_0)
      | ~ neq(esk51_0,nil) ) ),
    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])])])])])]) ).

fof(c_0_19,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_20,plain,
    ! [X5,X6,X9,X10] :
      ( ( ssList(esk8_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk9_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( app(app(esk8_2(X5,X6),X6),esk9_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_21,negated_conjecture,
    app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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

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

cnf(c_0_24,negated_conjecture,
    ssList(esk54_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_25,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_26,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_20]) ).

cnf(c_0_27,negated_conjecture,
    ( app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).

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

cnf(c_0_29,negated_conjecture,
    ssItem(esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_30,plain,
    ( segmentP(app(app(X1,X2),X3),X2)
    | ~ ssList(app(app(X1,X2),X3))
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(er,[status(thm)],[c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_32,negated_conjecture,
    ssList(esk56_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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])])])])]) ).

fof(c_0_34,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( ( ~ strictorderedP(X7)
        | ~ ssItem(X8)
        | ~ ssItem(X9)
        | ~ ssList(X10)
        | ~ ssList(X11)
        | ~ ssList(X12)
        | app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
        | lt(X8,X9)
        | ~ ssList(X7) )
      & ( ssItem(esk30_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssItem(esk31_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk32_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk33_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk34_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( app(app(esk32_1(X7),cons(esk30_1(X7),esk33_1(X7))),cons(esk31_1(X7),esk34_1(X7))) = X7
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ~ lt(esk30_1(X7),esk31_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) ) ),
    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)],[ax12])])])])])])]) ).

cnf(c_0_35,negated_conjecture,
    ( app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]),c_0_29])]) ).

fof(c_0_36,plain,
    ! [X3,X4] :
      ( ~ ssItem(X3)
      | ~ ssItem(X4)
      | ~ lt(X3,X4)
      | ~ lt(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)],[inference(fof_simplification,[status(thm)],[ax33])])])])])]) ).

cnf(c_0_37,negated_conjecture,
    ( segmentP(esk48_0,cons(esk53_0,nil))
    | ~ ssList(app(app(esk54_0,cons(esk52_0,nil)),esk55_0))
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_31]),c_0_32])]) ).

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

cnf(c_0_39,plain,
    ( lt(X2,X3)
    | ~ ssList(X1)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ strictorderedP(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk48_0
    | ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_32])]) ).

cnf(c_0_41,negated_conjecture,
    ssItem(esk53_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_42,plain,
    ( ~ lt(X1,X2)
    | ~ lt(X2,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_43,negated_conjecture,
    lt(esk53_0,esk52_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_44,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssList(X4)
      | ~ segmentP(X3,X4)
      | ~ segmentP(X4,X3)
      | 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)],[ax54])])])])]) ).

cnf(c_0_45,negated_conjecture,
    ( segmentP(esk48_0,cons(esk53_0,nil))
    | ~ ssList(app(esk54_0,cons(esk52_0,nil)))
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23])]) ).

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

cnf(c_0_49,plain,
    ( lt(X1,X2)
    | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(er,[status(thm)],[c_0_39]) ).

cnf(c_0_50,negated_conjecture,
    ( app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk48_0
    | ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_32]),c_0_41])]) ).

cnf(c_0_51,negated_conjecture,
    ~ lt(esk52_0,esk53_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_41]),c_0_29])]) ).

cnf(c_0_52,plain,
    ( X1 = X2
    | ~ segmentP(X2,X1)
    | ~ segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_53,negated_conjecture,
    ( segmentP(esk48_0,cons(esk53_0,nil))
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_38]),c_0_24])]) ).

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

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

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

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

cnf(c_0_58,negated_conjecture,
    ( ~ strictorderedP(esk48_0)
    | ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_31]),c_0_32]),c_0_23]),c_0_24]),c_0_41]),c_0_29])]),c_0_51]) ).

fof(c_0_59,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | ssList(cons(X4,X3)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).

cnf(c_0_60,negated_conjecture,
    ( cons(esk53_0,nil) = esk48_0
    | ~ segmentP(cons(esk53_0,nil),esk48_0)
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_31])]) ).

cnf(c_0_61,plain,
    ( segmentP(X1,X2)
    | nil != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_57]) ).

fof(c_0_62,plain,
    ! [X2] :
      ( ~ ssItem(X2)
      | strictorderedP(cons(X2,nil)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax68])]) ).

fof(c_0_63,plain,
    ! [X3,X5] :
      ( ( ssItem(esk5_1(X3))
        | ~ singletonP(X3)
        | ~ ssList(X3) )
      & ( cons(esk5_1(X3),nil) = X3
        | ~ singletonP(X3)
        | ~ ssList(X3) )
      & ( ~ ssItem(X5)
        | cons(X5,nil) != X3
        | singletonP(X3)
        | ~ ssList(X3) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])])])]) ).

cnf(c_0_64,negated_conjecture,
    ( singletonP(esk50_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_65,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_66,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_67,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_68,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_69,negated_conjecture,
    ( ~ strictorderedP(esk48_0)
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil))
    | ~ ssList(cons(esk52_0,esk55_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_38]),c_0_24])]) ).

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

cnf(c_0_71,negated_conjecture,
    segmentP(esk51_0,esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_72,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_73,negated_conjecture,
    ( cons(esk53_0,nil) = esk48_0
    | nil != esk48_0
    | ~ ssList(cons(esk53_0,nil))
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_31])]) ).

cnf(c_0_74,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_62]) ).

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

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

cnf(c_0_77,negated_conjecture,
    ( singletonP(esk48_0)
    | ~ neq(esk51_0,nil) ),
    inference(rw,[status(thm)],[c_0_64,c_0_65]) ).

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

cnf(c_0_79,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_80,negated_conjecture,
    ( ~ strictorderedP(esk48_0)
    | ~ ssList(cons(esk52_0,nil))
    | ~ ssList(cons(esk52_0,esk55_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_56]),c_0_41])]) ).

cnf(c_0_81,negated_conjecture,
    segmentP(esk51_0,esk48_0),
    inference(rw,[status(thm)],[c_0_71,c_0_65]) ).

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

cnf(c_0_83,negated_conjecture,
    ( cons(esk53_0,nil) = esk48_0
    | nil != esk48_0
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_70]),c_0_56]),c_0_41])]) ).

cnf(c_0_84,plain,
    ( strictorderedP(X1)
    | ~ singletonP(X1)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).

cnf(c_0_85,negated_conjecture,
    ( nil = esk51_0
    | singletonP(esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_56]),c_0_79])]) ).

cnf(c_0_86,negated_conjecture,
    ( ~ strictorderedP(esk48_0)
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_70]),c_0_23]),c_0_29])]) ).

cnf(c_0_87,negated_conjecture,
    ( segmentP(X1,esk48_0)
    | ~ segmentP(X1,esk51_0)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_81]),c_0_79]),c_0_31])]) ).

cnf(c_0_88,negated_conjecture,
    ( nil != esk48_0
    | ~ ssList(cons(esk52_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_56]),c_0_41])]) ).

cnf(c_0_89,negated_conjecture,
    ( nil = esk51_0
    | strictorderedP(esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_31])]) ).

cnf(c_0_90,negated_conjecture,
    ~ strictorderedP(esk48_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_70]),c_0_56]),c_0_29])]) ).

cnf(c_0_91,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ segmentP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_92,negated_conjecture,
    ( segmentP(nil,esk48_0)
    | nil != esk51_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_55]),c_0_56]),c_0_79])]) ).

cnf(c_0_93,negated_conjecture,
    nil != esk48_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_70]),c_0_56]),c_0_29])]) ).

cnf(c_0_94,negated_conjecture,
    nil = esk51_0,
    inference(sr,[status(thm)],[c_0_89,c_0_90]) ).

cnf(c_0_95,negated_conjecture,
    ( nil = esk48_0
    | nil != esk51_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_31])]) ).

cnf(c_0_96,negated_conjecture,
    esk51_0 != esk48_0,
    inference(rw,[status(thm)],[c_0_93,c_0_94]) ).

cnf(c_0_97,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_94]),c_0_94])]),c_0_96]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SWC307+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.11/0.33  % Computer : n016.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jun 12 08:11:12 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.22/2.41  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/2.41  # Preprocessing time       : 0.025 s
% 0.22/2.41  
% 0.22/2.41  # Proof found!
% 0.22/2.41  # SZS status Theorem
% 0.22/2.41  # SZS output start CNFRefutation
% See solution above
% 0.22/2.41  # Proof object total steps             : 98
% 0.22/2.41  # Proof object clause steps            : 64
% 0.22/2.41  # Proof object formula steps           : 34
% 0.22/2.41  # Proof object conjectures             : 45
% 0.22/2.41  # Proof object clause conjectures      : 42
% 0.22/2.41  # Proof object formula conjectures     : 3
% 0.22/2.41  # Proof object initial clauses used    : 31
% 0.22/2.41  # Proof object initial formulas used   : 17
% 0.22/2.41  # Proof object generating inferences   : 27
% 0.22/2.41  # Proof object simplifying inferences  : 79
% 0.22/2.41  # Training examples: 0 positive, 0 negative
% 0.22/2.41  # Parsed axioms                        : 96
% 0.22/2.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/2.41  # Initial clauses                      : 205
% 0.22/2.41  # Removed in clause preprocessing      : 2
% 0.22/2.41  # Initial clauses in saturation        : 203
% 0.22/2.41  # Processed clauses                    : 3987
% 0.22/2.41  # ...of these trivial                  : 13
% 0.22/2.41  # ...subsumed                          : 2279
% 0.22/2.41  # ...remaining for further processing  : 1694
% 0.22/2.41  # Other redundant clauses eliminated   : 1136
% 0.22/2.41  # Clauses deleted for lack of memory   : 0
% 0.22/2.41  # Backward-subsumed                    : 217
% 0.22/2.41  # Backward-rewritten                   : 954
% 0.22/2.41  # Generated clauses                    : 58069
% 0.22/2.41  # ...of the previous two non-trivial   : 54883
% 0.22/2.41  # Contextual simplify-reflections      : 5138
% 0.22/2.41  # Paramodulations                      : 56784
% 0.22/2.41  # Factorizations                       : 0
% 0.22/2.41  # Equation resolutions                 : 1263
% 0.22/2.41  # Current number of processed clauses  : 506
% 0.22/2.41  #    Positive orientable unit clauses  : 18
% 0.22/2.41  #    Positive unorientable unit clauses: 0
% 0.22/2.41  #    Negative unit clauses             : 13
% 0.22/2.41  #    Non-unit-clauses                  : 475
% 0.22/2.41  # Current number of unprocessed clauses: 7243
% 0.22/2.41  # ...number of literals in the above   : 64987
% 0.22/2.41  # Current number of archived formulas  : 0
% 0.22/2.41  # Current number of archived clauses   : 1172
% 0.22/2.41  # Clause-clause subsumption calls (NU) : 880016
% 0.22/2.41  # Rec. Clause-clause subsumption calls : 52675
% 0.22/2.41  # Non-unit clause-clause subsumptions  : 6996
% 0.22/2.41  # Unit Clause-clause subsumption calls : 6661
% 0.22/2.41  # Rewrite failures with RHS unbound    : 0
% 0.22/2.41  # BW rewrite match attempts            : 5
% 0.22/2.41  # BW rewrite match successes           : 5
% 0.22/2.41  # Condensation attempts                : 0
% 0.22/2.41  # Condensation successes               : 0
% 0.22/2.41  # Termbank termtop insertions          : 1569892
% 0.22/2.41  
% 0.22/2.41  # -------------------------------------------------
% 0.22/2.41  # User time                : 1.433 s
% 0.22/2.41  # System time              : 0.030 s
% 0.22/2.41  # Total time               : 1.463 s
% 0.22/2.41  # Maximum resident set size: 56496 pages
% 0.22/23.39  eprover: CPU time limit exceeded, terminating
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41  eprover: No such file or directory
% 0.22/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------