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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWC363+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 : 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  : 300s
% DateTime : Thu Aug 31 20:21:58 EDT 2023

% Result   : Theorem 278.65s 278.93s
% Output   : CNFRefutation 278.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   92
% Syntax   : Number of formulae    :  169 (  28 unt;  76 typ;   0 def)
%            Number of atoms       :  335 (  63 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  412 ( 170   ~; 166   |;  31   &)
%                                         (   4 <=>;  41  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    4 (   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    :   57 (  57 usr;   8 con; 0-2 aty)
%            Number of variables   :  138 (   0 sgn;  72   !;   6   ?;   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 ).

fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ neq(X2,nil)
                    | segmentP(X2,X1)
                    | ( nil != X3
                      & nil = X4 )
                    | ( ! [X5] :
                          ( ssItem(X5)
                         => ( cons(X5,nil) != X3
                            | ~ memberP(X4,X5) ) )
                      & neq(X4,nil) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

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

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

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

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

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

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

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

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

fof(c_0_17,negated_conjecture,
    ( ssList(esk48_0)
    & ssList(esk49_0)
    & ssList(esk50_0)
    & ssList(esk51_0)
    & esk49_0 = esk51_0
    & esk48_0 = esk50_0
    & neq(esk49_0,nil)
    & ~ segmentP(esk49_0,esk48_0)
    & ( nil = esk50_0
      | nil != esk51_0 )
    & ( ssItem(esk52_0)
      | ~ neq(esk51_0,nil) )
    & ( cons(esk52_0,nil) = esk50_0
      | ~ neq(esk51_0,nil) )
    & ( memberP(esk51_0,esk52_0)
      | ~ neq(esk51_0,nil) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).

cnf(c_0_18,negated_conjecture,
    neq(esk49_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_19,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_20,plain,
    ! [X179,X180,X181] :
      ( ~ ssList(X179)
      | ~ ssList(X180)
      | ~ ssList(X181)
      | ~ rearsegP(X179,X180)
      | rearsegP(app(X181,X179),X180) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax50])])]) ).

fof(c_0_21,plain,
    ! [X182] :
      ( ~ ssList(X182)
      | rearsegP(X182,nil) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).

fof(c_0_22,plain,
    ! [X11,X12,X15,X16] :
      ( ( ssList(esk3_2(X11,X12))
        | ~ memberP(X11,X12)
        | ~ ssItem(X12)
        | ~ ssList(X11) )
      & ( ssList(esk4_2(X11,X12))
        | ~ memberP(X11,X12)
        | ~ ssItem(X12)
        | ~ ssList(X11) )
      & ( app(esk3_2(X11,X12),cons(X12,esk4_2(X11,X12))) = X11
        | ~ memberP(X11,X12)
        | ~ ssItem(X12)
        | ~ ssList(X11) )
      & ( ~ ssList(X15)
        | ~ ssList(X16)
        | app(X15,cons(X12,X16)) != X11
        | memberP(X11,X12)
        | ~ ssItem(X12)
        | ~ ssList(X11) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).

cnf(c_0_23,negated_conjecture,
    ( memberP(esk51_0,esk52_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    neq(esk51_0,nil),
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_26,negated_conjecture,
    ( ssItem(esk52_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_27,plain,
    ( rearsegP(app(X3,X1),X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ rearsegP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    ( rearsegP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

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

cnf(c_0_30,plain,
    ( app(esk3_2(X1,X2),cons(X2,esk4_2(X1,X2))) = X1
    | ~ memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_31,negated_conjecture,
    memberP(esk51_0,esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).

cnf(c_0_32,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_25,c_0_19]) ).

cnf(c_0_33,negated_conjecture,
    ssItem(esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]) ).

cnf(c_0_34,plain,
    ( ssList(esk3_2(X1,X2))
    | ~ memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_35,plain,
    ( rearsegP(app(X1,X2),nil)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).

cnf(c_0_36,negated_conjecture,
    app(esk3_2(esk51_0,esk52_0),cons(esk52_0,esk4_2(esk51_0,esk52_0))) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).

cnf(c_0_37,negated_conjecture,
    ssList(esk3_2(esk51_0,esk52_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_32]),c_0_33])]) ).

fof(c_0_38,plain,
    ! [X111,X112] :
      ( ~ ssList(X111)
      | ~ ssItem(X112)
      | ssList(cons(X112,X111)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

cnf(c_0_39,plain,
    ( ssList(esk4_2(X1,X2))
    | ~ memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

fof(c_0_40,plain,
    ! [X24,X25,X27] :
      ( ( ssList(esk7_2(X24,X25))
        | ~ rearsegP(X24,X25)
        | ~ ssList(X25)
        | ~ ssList(X24) )
      & ( app(esk7_2(X24,X25),X25) = X24
        | ~ rearsegP(X24,X25)
        | ~ ssList(X25)
        | ~ ssList(X24) )
      & ( ~ ssList(X27)
        | app(X27,X25) != X24
        | rearsegP(X24,X25)
        | ~ ssList(X25)
        | ~ ssList(X24) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])]) ).

cnf(c_0_41,negated_conjecture,
    ( rearsegP(esk51_0,nil)
    | ~ ssList(cons(esk52_0,esk4_2(esk51_0,esk52_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).

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

cnf(c_0_43,negated_conjecture,
    ssList(esk4_2(esk51_0,esk52_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_32]),c_0_33])]) ).

fof(c_0_44,plain,
    ! [X28,X29,X32,X33] :
      ( ( ssList(esk8_2(X28,X29))
        | ~ segmentP(X28,X29)
        | ~ ssList(X29)
        | ~ ssList(X28) )
      & ( ssList(esk9_2(X28,X29))
        | ~ segmentP(X28,X29)
        | ~ ssList(X29)
        | ~ ssList(X28) )
      & ( app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28
        | ~ segmentP(X28,X29)
        | ~ ssList(X29)
        | ~ ssList(X28) )
      & ( ~ ssList(X32)
        | ~ ssList(X33)
        | app(app(X32,X29),X33) != X28
        | segmentP(X28,X29)
        | ~ ssList(X29)
        | ~ ssList(X28) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])]) ).

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

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

cnf(c_0_47,negated_conjecture,
    ( cons(esk52_0,nil) = esk50_0
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

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

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

cnf(c_0_50,negated_conjecture,
    rearsegP(esk51_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_33])]) ).

cnf(c_0_51,plain,
    ( ssList(esk7_2(X1,X2))
    | ~ rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

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

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

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

cnf(c_0_55,negated_conjecture,
    cons(esk52_0,nil) = esk50_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_24])]) ).

cnf(c_0_56,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_57,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_58,plain,
    ! [X130,X131] :
      ( ~ ssList(X130)
      | ~ ssList(X131)
      | ssList(app(X130,X131)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

fof(c_0_59,plain,
    ! [X20,X21,X23] :
      ( ( ssList(esk6_2(X20,X21))
        | ~ frontsegP(X20,X21)
        | ~ ssList(X21)
        | ~ ssList(X20) )
      & ( app(X21,esk6_2(X20,X21)) = X20
        | ~ frontsegP(X20,X21)
        | ~ ssList(X21)
        | ~ ssList(X20) )
      & ( ~ ssList(X23)
        | app(X21,X23) != X20
        | frontsegP(X20,X21)
        | ~ ssList(X21)
        | ~ ssList(X20) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).

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

cnf(c_0_61,negated_conjecture,
    app(esk7_2(esk51_0,nil),nil) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_29]),c_0_32])]) ).

cnf(c_0_62,negated_conjecture,
    ssList(esk7_2(esk51_0,nil)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_50]),c_0_29]),c_0_32])]) ).

cnf(c_0_63,plain,
    ( segmentP(X1,X2)
    | app(X2,X3) != X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_29])]) ).

cnf(c_0_64,negated_conjecture,
    ( app(esk50_0,X1) = cons(esk52_0,X1)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_33])]) ).

cnf(c_0_65,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_56,c_0_57]) ).

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

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

cnf(c_0_68,negated_conjecture,
    esk7_2(esk51_0,nil) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).

fof(c_0_69,plain,
    ! [X190,X191,X192,X193] :
      ( ~ ssList(X190)
      | ~ ssList(X191)
      | ~ ssList(X192)
      | ~ ssList(X193)
      | ~ segmentP(X190,X191)
      | segmentP(app(app(X192,X190),X193),X191) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])]) ).

cnf(c_0_70,negated_conjecture,
    ( segmentP(X1,esk50_0)
    | cons(esk52_0,X2) != X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).

cnf(c_0_71,negated_conjecture,
    ( ssList(cons(esk52_0,X1))
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_64]),c_0_65])]) ).

fof(c_0_72,plain,
    ! [X217,X218,X219] :
      ( ~ ssList(X217)
      | ~ ssList(X218)
      | ~ ssList(X219)
      | app(X218,X219) != app(X218,X217)
      | X219 = X217 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])]) ).

cnf(c_0_73,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_67]),c_0_66]) ).

cnf(c_0_74,negated_conjecture,
    app(esk51_0,nil) = esk51_0,
    inference(rw,[status(thm)],[c_0_61,c_0_68]) ).

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

cnf(c_0_76,negated_conjecture,
    ( segmentP(cons(esk52_0,X1),esk50_0)
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_70]),c_0_71]) ).

fof(c_0_77,plain,
    ! [X163] :
      ( ~ ssList(X163)
      | frontsegP(X163,X163) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])]) ).

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

cnf(c_0_79,plain,
    ( app(X1,esk6_2(X2,X1)) = X2
    | ~ frontsegP(X2,X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_59]) ).

cnf(c_0_80,negated_conjecture,
    frontsegP(esk51_0,esk51_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_32]),c_0_29])]) ).

cnf(c_0_81,plain,
    ( ssList(esk6_2(X1,X2))
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_59]) ).

cnf(c_0_82,negated_conjecture,
    ( segmentP(app(app(X1,cons(esk52_0,X2)),X3),esk50_0)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_65])]),c_0_71]) ).

cnf(c_0_83,plain,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_77]) ).

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

cnf(c_0_85,negated_conjecture,
    app(esk51_0,esk6_2(esk51_0,esk51_0)) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_32])]) ).

cnf(c_0_86,negated_conjecture,
    ssList(esk6_2(esk51_0,esk51_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_80]),c_0_32])]) ).

cnf(c_0_87,negated_conjecture,
    ~ segmentP(esk49_0,esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_88,negated_conjecture,
    ( segmentP(app(esk51_0,X1),esk50_0)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_36]),c_0_37]),c_0_43])]) ).

cnf(c_0_89,plain,
    ( app(X1,esk6_2(X1,X1)) = X1
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_79,c_0_83]) ).

cnf(c_0_90,negated_conjecture,
    esk6_2(esk51_0,esk51_0) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_32]),c_0_86])]) ).

cnf(c_0_91,negated_conjecture,
    ~ segmentP(esk51_0,esk50_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_19]),c_0_57]) ).

cnf(c_0_92,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_29]),c_0_32])]),c_0_91]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SWC363+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n016.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 28 18:31:45 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.51/0.58  start to proof: theBenchmark
% 278.65/278.93  % Version  : CSE_E---1.5
% 278.65/278.93  % Problem  : theBenchmark.p
% 278.65/278.93  % Proof found
% 278.65/278.93  % SZS status Theorem for theBenchmark.p
% 278.65/278.93  % SZS output start Proof
% See solution above
% 278.65/278.94  % Total time : 277.983000 s
% 278.65/278.94  % SZS output end Proof
% 278.65/278.94  % Total time : 278.000000 s
%------------------------------------------------------------------------------