↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWC022+1 : TPTP v9.2.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n029.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 : Tue May  5 05:17:56 PM UTC 2026

% Result   : Theorem 1.45s 1.76s
% Output   : CNFRefutation 1.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   73 (  12 unt;   0 def)
%            Number of atoms       :  271 (  77 equ)
%            Maximal formula atoms :   34 (   3 avg)
%            Number of connectives :  325 ( 127   ~; 133   |;  33   &)
%                                         (   2 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   84 (   0 sgn  50   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
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)
                            & frontsegP(X2,X5)
                            & frontsegP(X1,X5) )
                        | ? [X6] :
                            ( ssList(X6)
                            & X3 != X6
                            & ? [X7] :
                                ( ssItem(X7)
                                & cons(X7,nil) = X6
                                & hd(X4) = X7
                                & neq(nil,X4) ) ) )
                      & ( ~ neq(X2,nil)
                        | neq(X4,nil) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

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

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

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

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

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

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

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

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

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

fof(c_0_14,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)
                              & frontsegP(X2,X5)
                              & frontsegP(X1,X5) )
                          | ? [X6] :
                              ( ssList(X6)
                              & X3 != X6
                              & ? [X7] :
                                  ( ssItem(X7)
                                  & cons(X7,nil) = X6
                                  & hd(X4) = X7
                                  & neq(nil,X4) ) ) )
                        & ( ~ neq(X2,nil)
                          | neq(X4,nil) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_15,negated_conjecture,
    ! [X466,X467,X468] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & ( neq(esk49_0,nil)
        | neq(esk49_0,nil) )
      & ( ~ neq(esk51_0,nil)
        | neq(esk49_0,nil) )
      & ( neq(esk49_0,nil)
        | ~ ssList(X466)
        | ~ neq(X466,nil)
        | ~ frontsegP(esk49_0,X466)
        | ~ frontsegP(esk48_0,X466) )
      & ( ~ neq(esk51_0,nil)
        | ~ ssList(X466)
        | ~ neq(X466,nil)
        | ~ frontsegP(esk49_0,X466)
        | ~ frontsegP(esk48_0,X466) )
      & ( neq(esk49_0,nil)
        | ~ ssList(X467)
        | esk50_0 = X467
        | ~ ssItem(X468)
        | cons(X468,nil) != X467
        | hd(esk51_0) != X468
        | ~ neq(nil,esk51_0) )
      & ( ~ neq(esk51_0,nil)
        | ~ ssList(X467)
        | esk50_0 = X467
        | ~ ssItem(X468)
        | cons(X468,nil) != X467
        | hd(esk51_0) != X468
        | ~ neq(nil,esk51_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_14])])])])]) ).

cnf(c_0_16,negated_conjecture,
    ( neq(esk49_0,nil)
    | neq(esk49_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    neq(esk49_0,nil),
    inference(cn,[status(thm)],[c_0_16]) ).

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

cnf(c_0_19,negated_conjecture,
    ( esk50_0 = X1
    | ~ neq(esk51_0,nil)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,nil) != X1
    | hd(esk51_0) != X2
    | ~ neq(nil,esk51_0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

fof(c_0_22,plain,
    ! [X322,X323] :
      ( ~ ssList(X322)
      | ~ ssItem(X323)
      | ssList(cons(X323,X322)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).

cnf(c_0_23,negated_conjecture,
    ( cons(hd(esk51_0),nil) = esk48_0
    | ~ ssList(cons(hd(esk51_0),nil))
    | ~ neq(nil,esk51_0)
    | ~ ssItem(hd(esk51_0)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])])])]) ).

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

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

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

cnf(c_0_27,negated_conjecture,
    ssList(esk49_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

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

cnf(c_0_30,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_27,c_0_18]) ).

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

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

cnf(c_0_33,negated_conjecture,
    ( cons(hd(esk51_0),nil) = esk48_0
    | esk51_0 = nil
    | ~ neq(nil,esk51_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

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

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

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

cnf(c_0_37,negated_conjecture,
    ( cons(hd(esk51_0),nil) = esk48_0
    | esk51_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30]),c_0_25])]) ).

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

cnf(c_0_39,negated_conjecture,
    ( hd(esk48_0) = hd(esk51_0)
    | esk51_0 = nil
    | ~ ssItem(hd(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_25])]) ).

cnf(c_0_40,negated_conjecture,
    ( esk51_0 = nil
    | esk48_0 != nil
    | ~ ssItem(hd(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_37]),c_0_25])]) ).

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

cnf(c_0_42,negated_conjecture,
    ( hd(esk48_0) = hd(esk51_0)
    | esk51_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_30])]) ).

cnf(c_0_43,negated_conjecture,
    ssList(esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_44,negated_conjecture,
    ( esk51_0 = nil
    | esk48_0 != nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_30])]) ).

fof(c_0_45,plain,
    ! [X424] :
      ( ~ ssList(X424)
      | nil = X424
      | cons(hd(X424),tl(X424)) = X424 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).

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

cnf(c_0_47,negated_conjecture,
    ( esk51_0 = nil
    | ssItem(hd(esk51_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_42]),c_0_43])]),c_0_44]) ).

fof(c_0_48,plain,
    ! [X231,X232,X234] :
      ( ( ssList(esk6_2(X231,X232))
        | ~ frontsegP(X231,X232)
        | ~ ssList(X232)
        | ~ ssList(X231) )
      & ( app(X232,esk6_2(X231,X232)) = X231
        | ~ frontsegP(X231,X232)
        | ~ ssList(X232)
        | ~ ssList(X231) )
      & ( ~ ssList(X234)
        | app(X232,X234) != X231
        | frontsegP(X231,X232)
        | ~ ssList(X232)
        | ~ ssList(X231) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])]) ).

fof(c_0_49,plain,
    ! [X341,X342] :
      ( ~ ssList(X341)
      | ~ ssList(X342)
      | ssList(app(X341,X342)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).

cnf(c_0_50,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_51,negated_conjecture,
    ( cons(hd(esk51_0),X1) = app(esk48_0,X1)
    | esk51_0 = nil
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_37]),c_0_47]) ).

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

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

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

cnf(c_0_55,negated_conjecture,
    ( app(esk48_0,tl(esk51_0)) = esk51_0
    | esk51_0 = nil
    | ~ ssList(tl(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_30])]) ).

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

cnf(c_0_57,negated_conjecture,
    ( ~ neq(esk51_0,nil)
    | ~ ssList(X1)
    | ~ neq(X1,nil)
    | ~ frontsegP(esk49_0,X1)
    | ~ frontsegP(esk48_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_59,plain,
    ( frontsegP(app(X1,X2),X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_53]),c_0_54]) ).

cnf(c_0_60,negated_conjecture,
    ( app(esk48_0,tl(esk51_0)) = esk51_0
    | esk51_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_30])]) ).

cnf(c_0_61,negated_conjecture,
    ( ~ frontsegP(esk48_0,X1)
    | ~ frontsegP(esk51_0,X1)
    | ~ ssList(X1)
    | ~ neq(X1,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_18]),c_0_21])]) ).

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

cnf(c_0_63,negated_conjecture,
    ( esk51_0 = nil
    | frontsegP(esk51_0,esk48_0)
    | ~ ssList(tl(esk51_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_43])]) ).

fof(c_0_64,plain,
    ! [X382] :
      ( ~ ssList(X382)
      | frontsegP(X382,nil) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).

cnf(c_0_65,negated_conjecture,
    ( ~ frontsegP(esk51_0,esk48_0)
    | ~ neq(esk48_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_43])]) ).

cnf(c_0_66,negated_conjecture,
    ( esk51_0 = nil
    | frontsegP(esk51_0,esk48_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_56]),c_0_30])]) ).

cnf(c_0_67,plain,
    ( frontsegP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_64]) ).

cnf(c_0_68,negated_conjecture,
    ( esk51_0 = nil
    | ~ neq(esk48_0,nil) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_69,negated_conjecture,
    ( ~ frontsegP(esk51_0,nil)
    | ~ neq(nil,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_67]),c_0_25]),c_0_43])]) ).

cnf(c_0_70,negated_conjecture,
    esk51_0 = nil,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_34]),c_0_25]),c_0_43])]),c_0_44]) ).

cnf(c_0_71,negated_conjecture,
    ~ neq(nil,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_30])]) ).

cnf(c_0_72,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_70]),c_0_71]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWC022+1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32  % Computer : n029.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 04:15:59 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.45/1.76  % Version  : CSE_E---1.7
% 1.45/1.76  % Problem  : theBenchmark.p
% 1.45/1.76  % SZS status Theorem for theBenchmark.p
% 1.45/1.76  % SZS output start CNFRefutation
% See solution above
% 1.45/1.76  % Total time : 1.373s
%------------------------------------------------------------------------------