TSTP Solution File: SWC160+1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWC160+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n001.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  : 300s
% DateTime : Thu Aug 31 20:20:18 EDT 2023

% Result   : Theorem 0.19s 0.66s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   91
% Syntax   : Number of formulae    :  137 (  23 unt;  82 typ;   0 def)
%            Number of atoms       :  254 (  51 equ)
%            Maximal formula atoms :   32 (   4 avg)
%            Number of connectives :  302 ( 103   ~; 106   |;  45   &)
%                                         (   1 <=>;  47  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   31 (   5 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   85 (  68   >;  17   *;   0   +;   0  <<)
%            Number of predicates  :   21 (  19 usr;   1 prp; 0-2 aty)
%            Number of functors    :   63 (  63 usr;  14 con; 0-2 aty)
%            Number of variables   :   98 (   0 sgn;  66   !;   8   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    ssItem: $i > $o ).

tff(decl_23,type,
    neq: ( $i * $i ) > $o ).

tff(decl_24,type,
    ssList: $i > $o ).

tff(decl_25,type,
    memberP: ( $i * $i ) > $o ).

tff(decl_26,type,
    cons: ( $i * $i ) > $i ).

tff(decl_27,type,
    app: ( $i * $i ) > $i ).

tff(decl_28,type,
    singletonP: $i > $o ).

tff(decl_29,type,
    nil: $i ).

tff(decl_30,type,
    frontsegP: ( $i * $i ) > $o ).

tff(decl_31,type,
    rearsegP: ( $i * $i ) > $o ).

tff(decl_32,type,
    segmentP: ( $i * $i ) > $o ).

tff(decl_33,type,
    cyclefreeP: $i > $o ).

tff(decl_34,type,
    leq: ( $i * $i ) > $o ).

tff(decl_35,type,
    totalorderP: $i > $o ).

tff(decl_36,type,
    strictorderP: $i > $o ).

tff(decl_37,type,
    lt: ( $i * $i ) > $o ).

tff(decl_38,type,
    totalorderedP: $i > $o ).

tff(decl_39,type,
    strictorderedP: $i > $o ).

tff(decl_40,type,
    duplicatefreeP: $i > $o ).

tff(decl_41,type,
    equalelemsP: $i > $o ).

tff(decl_42,type,
    hd: $i > $i ).

tff(decl_43,type,
    tl: $i > $i ).

tff(decl_44,type,
    geq: ( $i * $i ) > $o ).

tff(decl_45,type,
    gt: ( $i * $i ) > $o ).

tff(decl_46,type,
    esk1_0: $i ).

tff(decl_47,type,
    esk2_0: $i ).

tff(decl_48,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_49,type,
    esk4_2: ( $i * $i ) > $i ).

tff(decl_50,type,
    esk5_1: $i > $i ).

tff(decl_51,type,
    esk6_2: ( $i * $i ) > $i ).

tff(decl_52,type,
    esk7_2: ( $i * $i ) > $i ).

tff(decl_53,type,
    esk8_2: ( $i * $i ) > $i ).

tff(decl_54,type,
    esk9_2: ( $i * $i ) > $i ).

tff(decl_55,type,
    esk10_1: $i > $i ).

tff(decl_56,type,
    esk11_1: $i > $i ).

tff(decl_57,type,
    esk12_1: $i > $i ).

tff(decl_58,type,
    esk13_1: $i > $i ).

tff(decl_59,type,
    esk14_1: $i > $i ).

tff(decl_60,type,
    esk15_1: $i > $i ).

tff(decl_61,type,
    esk16_1: $i > $i ).

tff(decl_62,type,
    esk17_1: $i > $i ).

tff(decl_63,type,
    esk18_1: $i > $i ).

tff(decl_64,type,
    esk19_1: $i > $i ).

tff(decl_65,type,
    esk20_1: $i > $i ).

tff(decl_66,type,
    esk21_1: $i > $i ).

tff(decl_67,type,
    esk22_1: $i > $i ).

tff(decl_68,type,
    esk23_1: $i > $i ).

tff(decl_69,type,
    esk24_1: $i > $i ).

tff(decl_70,type,
    esk25_1: $i > $i ).

tff(decl_71,type,
    esk26_1: $i > $i ).

tff(decl_72,type,
    esk27_1: $i > $i ).

tff(decl_73,type,
    esk28_1: $i > $i ).

tff(decl_74,type,
    esk29_1: $i > $i ).

tff(decl_75,type,
    esk30_1: $i > $i ).

tff(decl_76,type,
    esk31_1: $i > $i ).

tff(decl_77,type,
    esk32_1: $i > $i ).

tff(decl_78,type,
    esk33_1: $i > $i ).

tff(decl_79,type,
    esk34_1: $i > $i ).

tff(decl_80,type,
    esk35_1: $i > $i ).

tff(decl_81,type,
    esk36_1: $i > $i ).

tff(decl_82,type,
    esk37_1: $i > $i ).

tff(decl_83,type,
    esk38_1: $i > $i ).

tff(decl_84,type,
    esk39_1: $i > $i ).

tff(decl_85,type,
    esk40_1: $i > $i ).

tff(decl_86,type,
    esk41_1: $i > $i ).

tff(decl_87,type,
    esk42_1: $i > $i ).

tff(decl_88,type,
    esk43_1: $i > $i ).

tff(decl_89,type,
    esk44_1: $i > $i ).

tff(decl_90,type,
    esk45_1: $i > $i ).

tff(decl_91,type,
    esk46_1: $i > $i ).

tff(decl_92,type,
    esk47_1: $i > $i ).

tff(decl_93,type,
    esk48_0: $i ).

tff(decl_94,type,
    esk49_0: $i ).

tff(decl_95,type,
    esk50_0: $i ).

tff(decl_96,type,
    esk51_0: $i ).

tff(decl_97,type,
    esk52_0: $i ).

tff(decl_98,type,
    esk53_0: $i ).

tff(decl_99,type,
    esk54_0: $i ).

tff(decl_100,type,
    esk55_0: $i ).

tff(decl_101,type,
    esk56_0: $i ).

tff(decl_102,type,
    esk57_0: $i ).

tff(decl_103,type,
    esk58_0: $i ).

fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ! [X5] :
                        ( ssList(X5)
                       => ( app(X3,X5) != X4
                          | ~ strictorderedP(X3)
                          | ? [X6] :
                              ( ssItem(X6)
                              & ? [X7] :
                                  ( ssList(X7)
                                  & app(cons(X6,nil),X7) = X5
                                  & ? [X8] :
                                      ( ssItem(X8)
                                      & ? [X9] :
                                          ( ssList(X9)
                                          & app(X9,cons(X8,nil)) = X3
                                          & lt(X8,X6) ) ) ) ) ) )
                    | ! [X10] :
                        ( ssItem(X10)
                       => ! [X11] :
                            ( ssItem(X11)
                           => ! [X12] :
                                ( ssList(X12)
                               => ! [X13] :
                                    ( ssList(X13)
                                   => ! [X14] :
                                        ( ssList(X14)
                                       => ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
                                          | ~ leq(X11,X10)
                                          | ( ! [X15] :
                                                ( ssItem(X15)
                                               => ( ~ memberP(X13,X15)
                                                  | ( leq(X10,X15)
                                                    & leq(X15,X11) ) ) )
                                            & leq(X10,X11) ) ) ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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(ax16,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ssList(cons(X2,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).

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

fof(c_0_9,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ! [X5] :
                          ( ssList(X5)
                         => ( app(X3,X5) != X4
                            | ~ strictorderedP(X3)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ssList(X7)
                                    & app(cons(X6,nil),X7) = X5
                                    & ? [X8] :
                                        ( ssItem(X8)
                                        & ? [X9] :
                                            ( ssList(X9)
                                            & app(X9,cons(X8,nil)) = X3
                                            & lt(X8,X6) ) ) ) ) ) )
                      | ! [X10] :
                          ( ssItem(X10)
                         => ! [X11] :
                              ( ssItem(X11)
                             => ! [X12] :
                                  ( ssList(X12)
                                 => ! [X13] :
                                      ( ssList(X13)
                                     => ! [X14] :
                                          ( ssList(X14)
                                         => ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X1
                                            | ~ leq(X11,X10)
                                            | ( ! [X15] :
                                                  ( ssItem(X15)
                                                 => ( ~ memberP(X13,X15)
                                                    | ( leq(X10,X15)
                                                      & leq(X15,X11) ) ) )
                                              & leq(X10,X11) ) ) ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_10,negated_conjecture,
    ! [X265,X266,X267,X268] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ssList(esk52_0)
      & app(esk50_0,esk52_0) = esk51_0
      & strictorderedP(esk50_0)
      & ( ~ ssItem(X265)
        | ~ ssList(X266)
        | app(cons(X265,nil),X266) != esk52_0
        | ~ ssItem(X267)
        | ~ ssList(X268)
        | app(X268,cons(X267,nil)) != esk50_0
        | ~ lt(X267,X265) )
      & ssItem(esk53_0)
      & ssItem(esk54_0)
      & ssList(esk55_0)
      & ssList(esk56_0)
      & ssList(esk57_0)
      & app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0
      & leq(esk54_0,esk53_0)
      & ( ssItem(esk58_0)
        | ~ leq(esk53_0,esk54_0) )
      & ( memberP(esk56_0,esk58_0)
        | ~ leq(esk53_0,esk54_0) )
      & ( ~ leq(esk53_0,esk58_0)
        | ~ leq(esk58_0,esk54_0)
        | ~ leq(esk53_0,esk54_0) )
      & ( nil = esk51_0
        | nil != esk50_0 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).

cnf(c_0_11,negated_conjecture,
    app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk48_0,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

fof(c_0_13,plain,
    ! [X231,X232,X233] :
      ( ~ ssList(X231)
      | ~ ssList(X232)
      | ~ ssList(X233)
      | app(app(X231,X232),X233) = app(X231,app(X232,X233)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).

cnf(c_0_14,negated_conjecture,
    app(app(app(app(esk55_0,cons(esk53_0,nil)),esk56_0),cons(esk54_0,nil)),esk57_0) = esk50_0,
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,negated_conjecture,
    ssList(esk56_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    ssList(esk55_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_18,plain,
    ! [X120,X121] :
      ( ~ ssList(X120)
      | ~ ssItem(X121)
      | ssList(cons(X121,X120)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

cnf(c_0_19,negated_conjecture,
    ( app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0
    | ~ ssList(cons(esk53_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).

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

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

cnf(c_0_22,negated_conjecture,
    ssItem(esk53_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_23,plain,
    ! [X229,X230] :
      ( ~ ssList(X229)
      | ~ ssItem(X230)
      | cons(X230,X229) = app(cons(X230,nil),X229) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).

cnf(c_0_24,negated_conjecture,
    app(app(app(esk55_0,app(cons(esk53_0,nil),esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).

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

cnf(c_0_26,negated_conjecture,
    app(app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,nil)),esk57_0) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22])]) ).

cnf(c_0_27,negated_conjecture,
    ssList(esk57_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_28,negated_conjecture,
    ( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
    | ~ ssList(app(esk55_0,cons(esk53_0,esk56_0)))
    | ~ ssList(cons(esk54_0,nil)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).

cnf(c_0_29,negated_conjecture,
    ssItem(esk54_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_30,plain,
    ! [X139,X140] :
      ( ~ ssList(X139)
      | ~ ssList(X140)
      | ssList(app(X139,X140)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

cnf(c_0_31,negated_conjecture,
    ( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
    | ~ ssList(app(esk55_0,cons(esk53_0,esk56_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).

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

fof(c_0_33,plain,
    ! [X87,X88,X89,X90,X91,X92] :
      ( ( ~ strictorderedP(X87)
        | ~ ssItem(X88)
        | ~ ssItem(X89)
        | ~ ssList(X90)
        | ~ ssList(X91)
        | ~ ssList(X92)
        | app(app(X90,cons(X88,X91)),cons(X89,X92)) != X87
        | lt(X88,X89)
        | ~ ssList(X87) )
      & ( ssItem(esk30_1(X87))
        | strictorderedP(X87)
        | ~ ssList(X87) )
      & ( ssItem(esk31_1(X87))
        | strictorderedP(X87)
        | ~ ssList(X87) )
      & ( ssList(esk32_1(X87))
        | strictorderedP(X87)
        | ~ ssList(X87) )
      & ( ssList(esk33_1(X87))
        | strictorderedP(X87)
        | ~ ssList(X87) )
      & ( ssList(esk34_1(X87))
        | strictorderedP(X87)
        | ~ ssList(X87) )
      & ( app(app(esk32_1(X87),cons(esk30_1(X87),esk33_1(X87))),cons(esk31_1(X87),esk34_1(X87))) = X87
        | strictorderedP(X87)
        | ~ ssList(X87) )
      & ( ~ lt(esk30_1(X87),esk31_1(X87))
        | strictorderedP(X87)
        | ~ ssList(X87) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])]) ).

cnf(c_0_34,negated_conjecture,
    ( app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0
    | ~ ssList(cons(esk53_0,esk56_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).

fof(c_0_35,plain,
    ! [X1] :
      ( ssItem(X1)
     => ! [X2] :
          ( ssItem(X2)
         => ( lt(X1,X2)
           => ~ lt(X2,X1) ) ) ),
    inference(fof_simplification,[status(thm)],[ax33]) ).

fof(c_0_36,plain,
    ! [X251,X252] :
      ( ~ ssItem(X251)
      | ~ ssItem(X252)
      | ~ leq(X251,X252)
      | X251 = X252
      | lt(X251,X252) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax92])])]) ).

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

cnf(c_0_38,negated_conjecture,
    app(app(esk55_0,cons(esk53_0,esk56_0)),app(cons(esk54_0,nil),esk57_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_16]),c_0_22])]) ).

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

fof(c_0_40,plain,
    ! [X153,X154] :
      ( ~ ssItem(X153)
      | ~ ssItem(X154)
      | ~ lt(X153,X154)
      | ~ lt(X154,X153) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])]) ).

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

cnf(c_0_42,negated_conjecture,
    leq(esk54_0,esk53_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_43,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_37]) ).

cnf(c_0_44,negated_conjecture,
    app(app(esk55_0,cons(esk53_0,esk56_0)),cons(esk54_0,esk57_0)) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_25]),c_0_27]),c_0_29])]) ).

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

cnf(c_0_46,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_39,c_0_12]) ).

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

cnf(c_0_48,negated_conjecture,
    ( esk54_0 = esk53_0
    | lt(esk54_0,esk53_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22]),c_0_29])]) ).

cnf(c_0_49,negated_conjecture,
    lt(esk53_0,esk54_0),
    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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]) ).

cnf(c_0_50,negated_conjecture,
    ( esk54_0 = esk53_0
    | ~ lt(esk53_0,esk54_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_29]),c_0_22])]) ).

cnf(c_0_51,negated_conjecture,
    ~ lt(esk54_0,esk53_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_22]),c_0_29])]) ).

cnf(c_0_52,negated_conjecture,
    esk54_0 = esk53_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49])]) ).

cnf(c_0_53,negated_conjecture,
    ~ lt(esk53_0,esk53_0),
    inference(rw,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_54,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_52]),c_0_53]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC160+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n001.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Aug 28 19:31:36 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 0.19/0.66  % Version  : CSE_E---1.5
% 0.19/0.66  % Problem  : theBenchmark.p
% 0.19/0.66  % Proof found
% 0.19/0.66  % SZS status Theorem for theBenchmark.p
% 0.19/0.66  % SZS output start Proof
% See solution above
% 0.19/0.67  % Total time : 0.104000 s
% 0.19/0.67  % SZS output end Proof
% 0.19/0.67  % Total time : 0.109000 s
%------------------------------------------------------------------------------