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

View Problem - Process Solution

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

% Computer : n005.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:36 EDT 2023

% Result   : Theorem 0.19s 0.59s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   88
% Syntax   : Number of formulae    :  140 (  12 unt;  77 typ;   0 def)
%            Number of atoms       :  263 ( 118 equ)
%            Maximal formula atoms :   36 (   4 avg)
%            Number of connectives :  319 ( 119   ~; 131   |;  42   &)
%                                         (   1 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (   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    :   58 (  58 usr;   9 con; 0-2 aty)
%            Number of variables   :   80 (   0 sgn;  48   !;   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 ).

fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ~ ssList(X4)
                  | X2 != X4
                  | X1 != X3
                  | ( nil != X3
                    & nil = X4 )
                  | ( ? [X5] :
                        ( ssList(X5)
                        & X3 != X5
                        & ? [X6] :
                            ( ssList(X6)
                            & ? [X7] :
                                ( ssList(X7)
                                & tl(X4) = X6
                                & app(X6,X7) = X5
                                & ? [X8] :
                                    ( ssItem(X8)
                                    & cons(X8,nil) = X7
                                    & hd(X4) = X8
                                    & neq(nil,X4) )
                                & neq(nil,X4) ) ) )
                    & neq(X4,nil) )
                  | ( ! [X9] :
                        ( ssItem(X9)
                       => ! [X10] :
                            ( ~ ssList(X10)
                            | app(cons(X9,nil),X10) != X2
                            | app(X10,cons(X9,nil)) = X1 ) )
                    & ( nil != X2
                      | nil = X1 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

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

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

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

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

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

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

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

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

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

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

fof(c_0_11,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | ( nil != X3
                      & nil = X4 )
                    | ( ? [X5] :
                          ( ssList(X5)
                          & X3 != X5
                          & ? [X6] :
                              ( ssList(X6)
                              & ? [X7] :
                                  ( ssList(X7)
                                  & tl(X4) = X6
                                  & app(X6,X7) = X5
                                  & ? [X8] :
                                      ( ssItem(X8)
                                      & cons(X8,nil) = X7
                                      & hd(X4) = X8
                                      & neq(nil,X4) )
                                  & neq(nil,X4) ) ) )
                      & neq(X4,nil) )
                    | ( ! [X9] :
                          ( ssItem(X9)
                         => ! [X10] :
                              ( ~ ssList(X10)
                              | app(cons(X9,nil),X10) != X2
                              | app(X10,cons(X9,nil)) = X1 ) )
                      & ( nil != X2
                        | nil = X1 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_12,negated_conjecture,
    ! [X259,X260,X261,X262] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ( nil = esk50_0
        | nil != esk51_0 )
      & ( ~ ssList(X259)
        | esk50_0 = X259
        | ~ ssList(X260)
        | ~ ssList(X261)
        | tl(esk51_0) != X260
        | app(X260,X261) != X259
        | ~ ssItem(X262)
        | cons(X262,nil) != X261
        | hd(esk51_0) != X262
        | ~ neq(nil,esk51_0)
        | ~ neq(nil,esk51_0)
        | ~ neq(esk51_0,nil) )
      & ( nil = esk49_0
        | ssItem(esk52_0) )
      & ( nil != esk48_0
        | ssItem(esk52_0) )
      & ( nil = esk49_0
        | ssList(esk53_0) )
      & ( nil != esk48_0
        | ssList(esk53_0) )
      & ( nil = esk49_0
        | app(cons(esk52_0,nil),esk53_0) = esk49_0 )
      & ( nil != esk48_0
        | app(cons(esk52_0,nil),esk53_0) = esk49_0 )
      & ( nil = esk49_0
        | app(esk53_0,cons(esk52_0,nil)) != esk48_0 )
      & ( nil != esk48_0
        | app(esk53_0,cons(esk52_0,nil)) != esk48_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_11])])])])]) ).

cnf(c_0_13,negated_conjecture,
    ( esk50_0 = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | tl(esk51_0) != X2
    | app(X2,X3) != X1
    | ~ ssItem(X4)
    | cons(X4,nil) != X3
    | hd(esk51_0) != X4
    | ~ neq(nil,esk51_0)
    | ~ neq(nil,esk51_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_14,plain,
    ! [X134,X135] :
      ( ~ ssList(X134)
      | ~ ssList(X135)
      | ssList(app(X134,X135)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

cnf(c_0_15,negated_conjecture,
    ( esk50_0 = X1
    | hd(esk51_0) != X4
    | tl(esk51_0) != X2
    | app(X2,X3) != X1
    | cons(X4,nil) != X3
    | ~ ssItem(X4)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ neq(nil,esk51_0)
    | ~ neq(esk51_0,nil) ),
    inference(cn,[status(thm)],[c_0_13]) ).

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

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

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

fof(c_0_19,plain,
    ! [X131] :
      ( ~ ssList(X131)
      | nil = X131
      | ssList(tl(X131)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).

cnf(c_0_20,negated_conjecture,
    ( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
    | ~ ssList(cons(hd(esk49_0),nil))
    | ~ ssList(tl(esk49_0))
    | ~ neq(nil,esk49_0)
    | ~ neq(esk49_0,nil)
    | ~ ssItem(hd(esk49_0)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17]),c_0_17]),c_0_17])])])])]),c_0_18]) ).

cnf(c_0_21,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_23,plain,
    ! [X115,X116] :
      ( ~ ssList(X115)
      | ~ ssItem(X116)
      | ssList(cons(X116,X115)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

cnf(c_0_24,negated_conjecture,
    ( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
    | esk49_0 = nil
    | ~ ssList(cons(hd(esk49_0),nil))
    | ~ neq(nil,esk49_0)
    | ~ neq(esk49_0,nil)
    | ~ ssItem(hd(esk49_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

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

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

fof(c_0_27,plain,
    ! [X128] :
      ( ~ ssList(X128)
      | nil = X128
      | ssItem(hd(X128)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).

cnf(c_0_28,negated_conjecture,
    ( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
    | esk49_0 = nil
    | ~ neq(nil,esk49_0)
    | ~ neq(esk49_0,nil)
    | ~ ssItem(hd(esk49_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).

cnf(c_0_29,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

fof(c_0_30,plain,
    ! [X113,X114] :
      ( ( ~ neq(X113,X114)
        | X113 != X114
        | ~ ssList(X114)
        | ~ ssList(X113) )
      & ( X113 = X114
        | neq(X113,X114)
        | ~ ssList(X114)
        | ~ ssList(X113) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).

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

cnf(c_0_32,negated_conjecture,
    ( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
    | esk49_0 = nil
    | ~ neq(nil,esk49_0)
    | ~ neq(esk49_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]) ).

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

fof(c_0_34,plain,
    ! [X129,X130] :
      ( ~ ssList(X129)
      | ~ ssItem(X130)
      | hd(cons(X130,X129)) = X130 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).

cnf(c_0_35,negated_conjecture,
    ( nil = esk49_0
    | app(cons(esk52_0,nil),esk53_0) = esk49_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

cnf(c_0_37,negated_conjecture,
    ( nil = esk49_0
    | ssItem(esk52_0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_38,negated_conjecture,
    ( nil = esk49_0
    | ssList(esk53_0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_39,negated_conjecture,
    ( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
    | esk49_0 = nil
    | ~ neq(esk49_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22]),c_0_26])]) ).

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

cnf(c_0_41,negated_conjecture,
    ( cons(esk52_0,esk53_0) = esk49_0
    | esk49_0 = nil ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]) ).

fof(c_0_42,plain,
    ! [X132,X133] :
      ( ~ ssList(X132)
      | ~ ssItem(X133)
      | tl(cons(X133,X132)) = X132 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax25])])]) ).

cnf(c_0_43,negated_conjecture,
    ( app(tl(esk49_0),cons(hd(esk49_0),nil)) = esk48_0
    | esk49_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_26]),c_0_22])]) ).

cnf(c_0_44,negated_conjecture,
    ( hd(esk49_0) = esk52_0
    | esk49_0 = nil ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_37]),c_0_38]) ).

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

cnf(c_0_46,negated_conjecture,
    ( nil = esk50_0
    | nil != esk51_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_47,negated_conjecture,
    ( app(tl(esk49_0),cons(esk52_0,nil)) = esk48_0
    | esk49_0 = nil ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    ( tl(esk49_0) = esk53_0
    | esk49_0 = nil ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_41]),c_0_37]),c_0_38]) ).

cnf(c_0_49,negated_conjecture,
    ( nil = esk49_0
    | app(esk53_0,cons(esk52_0,nil)) != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_50,negated_conjecture,
    ( esk48_0 = nil
    | esk49_0 != nil ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_16]),c_0_17]) ).

cnf(c_0_51,negated_conjecture,
    esk49_0 = nil,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).

cnf(c_0_52,negated_conjecture,
    ( app(cons(esk52_0,nil),esk53_0) = esk49_0
    | nil != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_53,negated_conjecture,
    esk48_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).

cnf(c_0_54,negated_conjecture,
    ( ssList(esk53_0)
    | nil != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_55,negated_conjecture,
    ( ssItem(esk52_0)
    | nil != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_56,plain,
    ! [X126,X127] :
      ( ~ ssList(X126)
      | ~ ssItem(X127)
      | nil != cons(X127,X126) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).

cnf(c_0_57,negated_conjecture,
    app(cons(esk52_0,nil),esk53_0) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_51]),c_0_53])]) ).

cnf(c_0_58,negated_conjecture,
    ssList(esk53_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_53])]) ).

cnf(c_0_59,negated_conjecture,
    ssItem(esk52_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_53])]) ).

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

cnf(c_0_61,negated_conjecture,
    cons(esk52_0,esk53_0) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_57]),c_0_58]),c_0_59])]) ).

cnf(c_0_62,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_58]),c_0_59])]),
    [proof] ).

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