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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SWC081+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 : n020.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:19:39 EDT 2023

% Result   : Theorem 0.40s 0.70s
% Output   : CNFRefutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   84
% Syntax   : Number of formulae    :  134 (  14 unt;  76 typ;   0 def)
%            Number of atoms       :  227 (  68 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  264 (  95   ~; 112   |;  34   &)
%                                         (   3 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 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   :   60 (   0 sgn;  34   !;   5   ?;   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)
                    | ? [X5] :
                        ( ssList(X5)
                        & neq(X5,nil)
                        & segmentP(X2,X5)
                        & segmentP(X1,X5) )
                    | ( ! [X6] :
                          ( ssList(X6)
                         => ( ~ neq(X6,nil)
                            | ~ frontsegP(X4,X6)
                            | ~ frontsegP(X3,X6) ) )
                      & ( nil != X4
                        | nil != X3 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

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(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(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

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

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

fof(c_0_8,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X5,nil)
                          & segmentP(X2,X5)
                          & segmentP(X1,X5) )
                      | ( ! [X6] :
                            ( ssList(X6)
                           => ( ~ neq(X6,nil)
                              | ~ frontsegP(X4,X6)
                              | ~ frontsegP(X3,X6) ) )
                        & ( nil != X4
                          | nil != X3 ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_9,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_10,negated_conjecture,
    ! [X255] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & neq(esk49_0,nil)
      & ( ~ ssList(X255)
        | ~ neq(X255,nil)
        | ~ segmentP(esk49_0,X255)
        | ~ segmentP(esk48_0,X255) )
      & ( nil = esk51_0
        | ssList(esk52_0) )
      & ( nil = esk50_0
        | ssList(esk52_0) )
      & ( nil = esk51_0
        | neq(esk52_0,nil) )
      & ( nil = esk50_0
        | neq(esk52_0,nil) )
      & ( nil = esk51_0
        | frontsegP(esk51_0,esk52_0) )
      & ( nil = esk50_0
        | frontsegP(esk51_0,esk52_0) )
      & ( nil = esk51_0
        | frontsegP(esk50_0,esk52_0) )
      & ( nil = esk50_0
        | frontsegP(esk50_0,esk52_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_8])])])])]) ).

cnf(c_0_11,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_9]) ).

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

fof(c_0_13,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_14,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_15,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

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

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

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

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

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

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

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

cnf(c_0_24,negated_conjecture,
    ( nil = esk50_0
    | frontsegP(esk50_0,esk52_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_25,negated_conjecture,
    ssList(esk50_0),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_26,negated_conjecture,
    ( nil = esk50_0
    | ssList(esk52_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_28,negated_conjecture,
    ( nil = esk50_0
    | frontsegP(esk51_0,esk52_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_29,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

fof(c_0_30,plain,
    ! [X225,X226] :
      ( ( nil = X226
        | nil != app(X225,X226)
        | ~ ssList(X226)
        | ~ ssList(X225) )
      & ( nil = X225
        | nil != app(X225,X226)
        | ~ ssList(X226)
        | ~ ssList(X225) )
      & ( nil != X226
        | nil != X225
        | nil = app(X225,X226)
        | ~ ssList(X226)
        | ~ ssList(X225) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).

cnf(c_0_31,negated_conjecture,
    ( nil = esk51_0
    | frontsegP(esk50_0,esk52_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_32,negated_conjecture,
    ( nil = esk51_0
    | ssList(esk52_0) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ segmentP(esk49_0,X1)
    | ~ segmentP(esk48_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_34,plain,
    ( segmentP(app(X1,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(cn,[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_35,negated_conjecture,
    ( app(esk52_0,esk6_2(esk50_0,esk52_0)) = esk50_0
    | esk50_0 = nil ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_36,negated_conjecture,
    ( esk50_0 = nil
    | ssList(esk6_2(esk50_0,esk52_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_37,negated_conjecture,
    ( app(esk52_0,esk6_2(esk51_0,esk52_0)) = esk51_0
    | esk50_0 = nil ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_29])]),c_0_26]) ).

cnf(c_0_38,negated_conjecture,
    ( esk50_0 = nil
    | ssList(esk6_2(esk51_0,esk52_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_26]) ).

fof(c_0_39,plain,
    ! [X194] :
      ( ~ ssList(X194)
      | segmentP(X194,nil) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).

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

cnf(c_0_41,negated_conjecture,
    ( app(esk52_0,esk6_2(esk50_0,esk52_0)) = esk50_0
    | esk51_0 = nil ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_25])]),c_0_32]) ).

cnf(c_0_42,negated_conjecture,
    ( esk51_0 = nil
    | ssList(esk6_2(esk50_0,esk52_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_25])]),c_0_32]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ segmentP(esk50_0,X1)
    | ~ segmentP(esk51_0,X1)
    | ~ ssList(X1)
    | ~ neq(X1,nil) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_16]),c_0_18]) ).

cnf(c_0_44,negated_conjecture,
    ( esk50_0 = nil
    | segmentP(esk50_0,esk52_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_26]),c_0_36]) ).

cnf(c_0_45,negated_conjecture,
    ( nil = esk50_0
    | neq(esk52_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_46,negated_conjecture,
    ( esk50_0 = nil
    | segmentP(esk51_0,esk52_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_37]),c_0_26]),c_0_38]) ).

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

cnf(c_0_48,negated_conjecture,
    ( esk51_0 = nil
    | esk52_0 = nil
    | esk50_0 != nil ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_32]),c_0_42]) ).

cnf(c_0_49,negated_conjecture,
    esk50_0 = nil,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_26]),c_0_46]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ segmentP(esk51_0,nil)
    | ~ neq(nil,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_47]),c_0_21]),c_0_25])]) ).

cnf(c_0_51,negated_conjecture,
    neq(esk49_0,nil),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_52,negated_conjecture,
    ( nil = esk51_0
    | neq(esk52_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_53,negated_conjecture,
    ( esk52_0 = nil
    | esk51_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).

cnf(c_0_54,negated_conjecture,
    ~ neq(nil,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_47]),c_0_29])]) ).

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

cnf(c_0_56,negated_conjecture,
    esk51_0 = nil,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_54]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC081+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Aug 28 15:23:44 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.40/0.70  % Version  : CSE_E---1.5
% 0.40/0.70  % Problem  : theBenchmark.p
% 0.40/0.70  % Proof found
% 0.40/0.70  % SZS status Theorem for theBenchmark.p
% 0.40/0.70  % SZS output start Proof
% See solution above
% 0.55/0.70  % Total time : 0.111000 s
% 0.55/0.70  % SZS output end Proof
% 0.55/0.70  % Total time : 0.116000 s
%------------------------------------------------------------------------------