TSTP Solution File: SWC315+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC315+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %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  : 600s
% DateTime : Tue Jul 19 20:28:00 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   77 (  23 unt;   0 def)
%            Number of atoms       :  242 ( 124 equ)
%            Maximal formula atoms :   32 (   3 avg)
%            Number of connectives :  270 ( 105   ~; 111   |;  28   &)
%                                         (   2 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  44   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ~ ssList(X4)
                  | X2 != X4
                  | X1 != X3
                  | ( nil != X3
                    & nil = X4 )
                  | ( ! [X5] :
                        ( ssItem(X5)
                       => ! [X6] :
                            ( ~ ssList(X6)
                            | app(cons(X5,nil),X6) != X2
                            | app(X6,cons(X5,nil)) = X1 ) )
                    & ( nil != X2
                      | nil = X1 ) )
                  | ( ! [X7] :
                        ( ssItem(X7)
                       => ! [X8] :
                            ( ~ ssList(X8)
                            | app(cons(X7,nil),X8) != X4
                            | app(X8,cons(X7,nil)) != X3 ) )
                    & neq(X4,nil) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

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

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

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(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(c_0_9,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | ( nil != X3
                      & nil = X4 )
                    | ( ! [X5] :
                          ( ssItem(X5)
                         => ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X2
                              | app(X6,cons(X5,nil)) = X1 ) )
                      & ( nil != X2
                        | nil = X1 ) )
                    | ( ! [X7] :
                          ( ssItem(X7)
                         => ! [X8] :
                              ( ~ ssList(X8)
                              | app(cons(X7,nil),X8) != X4
                              | app(X8,cons(X7,nil)) != X3 ) )
                      & neq(X4,nil) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_10,negated_conjecture,
    ( 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 )
    & ( 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 )
    & ( ssItem(esk54_0)
      | ~ neq(esk51_0,nil) )
    & ( ssList(esk55_0)
      | ~ neq(esk51_0,nil) )
    & ( app(cons(esk54_0,nil),esk55_0) = esk51_0
      | ~ neq(esk51_0,nil) )
    & ( app(esk55_0,cons(esk54_0,nil)) = esk50_0
      | ~ neq(esk51_0,nil) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])])])])]) ).

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

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

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

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

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

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

cnf(c_0_17,negated_conjecture,
    ( app(cons(esk52_0,nil),esk53_0) = esk51_0
    | nil != esk48_0 ),
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( nil = esk48_0
    | nil != esk51_0 ),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_19,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | ssList(cons(X4,X3)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])])]) ).

cnf(c_0_20,negated_conjecture,
    ( esk53_0 = nil
    | nil != esk51_0
    | ~ ssList(cons(esk52_0,nil))
    | ~ ssList(esk53_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

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

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

cnf(c_0_23,negated_conjecture,
    ( esk53_0 = nil
    | nil != esk51_0
    | ~ ssList(esk53_0)
    | ~ ssItem(esk52_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_24,negated_conjecture,
    ( ssList(esk53_0)
    | nil != esk48_0 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_25,negated_conjecture,
    ( esk53_0 = nil
    | nil != esk51_0
    | ~ ssItem(esk52_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).

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

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

cnf(c_0_28,negated_conjecture,
    ( esk53_0 = nil
    | nil != esk51_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_18]) ).

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

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

cnf(c_0_31,negated_conjecture,
    ( app(cons(esk52_0,nil),nil) = esk51_0
    | nil != esk51_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_18]) ).

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

cnf(c_0_33,negated_conjecture,
    ( cons(esk52_0,nil) = esk51_0
    | nil != esk51_0
    | ~ ssItem(esk52_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).

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

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

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

cnf(c_0_37,negated_conjecture,
    ( nil != esk51_0
    | ~ ssItem(esk52_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22])]) ).

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

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

cnf(c_0_40,negated_conjecture,
    ( app(cons(esk54_0,nil),esk55_0) = esk51_0
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_42,negated_conjecture,
    ssList(esk51_0),
    inference(rw,[status(thm)],[c_0_35,c_0_13]) ).

cnf(c_0_43,negated_conjecture,
    ( ssList(esk55_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_44,negated_conjecture,
    ( ssItem(esk54_0)
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_45,negated_conjecture,
    ( app(cons(esk52_0,nil),esk53_0) = esk51_0
    | nil = esk51_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_13]),c_0_13]) ).

cnf(c_0_46,negated_conjecture,
    nil != esk51_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_18]) ).

cnf(c_0_47,negated_conjecture,
    ( nil = esk51_0
    | ssList(esk53_0) ),
    inference(rw,[status(thm)],[c_0_38,c_0_13]) ).

cnf(c_0_48,negated_conjecture,
    ( nil = esk51_0
    | ssItem(esk52_0) ),
    inference(rw,[status(thm)],[c_0_39,c_0_13]) ).

cnf(c_0_49,negated_conjecture,
    ( app(cons(esk54_0,nil),esk55_0) = esk51_0
    | nil = esk51_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22]),c_0_42])]) ).

cnf(c_0_50,negated_conjecture,
    ( nil = esk51_0
    | ssList(esk55_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_41]),c_0_22]),c_0_42])]) ).

cnf(c_0_51,negated_conjecture,
    ( nil = esk51_0
    | ssItem(esk54_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_41]),c_0_22]),c_0_42])]) ).

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

cnf(c_0_53,negated_conjecture,
    app(cons(esk52_0,nil),esk53_0) = esk51_0,
    inference(sr,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_54,negated_conjecture,
    ssList(esk53_0),
    inference(sr,[status(thm)],[c_0_47,c_0_46]) ).

cnf(c_0_55,negated_conjecture,
    ssItem(esk52_0),
    inference(sr,[status(thm)],[c_0_48,c_0_46]) ).

cnf(c_0_56,negated_conjecture,
    app(cons(esk54_0,nil),esk55_0) = esk51_0,
    inference(sr,[status(thm)],[c_0_49,c_0_46]) ).

cnf(c_0_57,negated_conjecture,
    ssList(esk55_0),
    inference(sr,[status(thm)],[c_0_50,c_0_46]) ).

cnf(c_0_58,negated_conjecture,
    ssItem(esk54_0),
    inference(sr,[status(thm)],[c_0_51,c_0_46]) ).

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

cnf(c_0_60,negated_conjecture,
    cons(esk52_0,esk53_0) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_53]),c_0_54]),c_0_55])]) ).

cnf(c_0_61,negated_conjecture,
    ( app(esk55_0,cons(esk54_0,nil)) = esk50_0
    | ~ neq(esk51_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_62,negated_conjecture,
    cons(esk54_0,esk55_0) = esk51_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_56]),c_0_57]),c_0_58])]) ).

cnf(c_0_63,negated_conjecture,
    hd(esk51_0) = esk52_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_54]),c_0_55])]) ).

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

cnf(c_0_65,negated_conjecture,
    ( app(esk55_0,cons(esk54_0,nil)) = esk48_0
    | ~ neq(esk51_0,nil) ),
    inference(rw,[status(thm)],[c_0_61,c_0_15]) ).

cnf(c_0_66,negated_conjecture,
    esk54_0 = esk52_0,
    inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_62]),c_0_57]),c_0_58])]),c_0_63]) ).

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

cnf(c_0_68,negated_conjecture,
    ( app(esk55_0,cons(esk54_0,nil)) = esk48_0
    | nil = esk51_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_41]),c_0_22]),c_0_42])]) ).

cnf(c_0_69,negated_conjecture,
    cons(esk52_0,esk55_0) = esk51_0,
    inference(rw,[status(thm)],[c_0_62,c_0_66]) ).

cnf(c_0_70,negated_conjecture,
    tl(esk51_0) = esk53_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_60]),c_0_54]),c_0_55])]) ).

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

cnf(c_0_72,negated_conjecture,
    app(esk55_0,cons(esk54_0,nil)) = esk48_0,
    inference(sr,[status(thm)],[c_0_68,c_0_46]) ).

cnf(c_0_73,negated_conjecture,
    esk55_0 = esk53_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_69]),c_0_70]),c_0_57]),c_0_55])]) ).

cnf(c_0_74,negated_conjecture,
    ( nil = esk51_0
    | app(esk53_0,cons(esk52_0,nil)) != esk48_0 ),
    inference(rw,[status(thm)],[c_0_71,c_0_13]) ).

cnf(c_0_75,negated_conjecture,
    app(esk53_0,cons(esk52_0,nil)) = esk48_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_66]),c_0_73]) ).

cnf(c_0_76,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),c_0_46]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWC315+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n029.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  : 600
% 0.13/0.33  % DateTime : Sun Jun 12 15:04:39 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.24/1.41  # Preprocessing time       : 0.025 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 77
% 0.24/1.41  # Proof object clause steps            : 59
% 0.24/1.41  # Proof object formula steps           : 18
% 0.24/1.41  # Proof object conjectures             : 54
% 0.24/1.41  # Proof object clause conjectures      : 51
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 23
% 0.24/1.41  # Proof object initial formulas used   : 9
% 0.24/1.41  # Proof object generating inferences   : 18
% 0.24/1.41  # Proof object simplifying inferences  : 65
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 96
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.41  # Initial clauses                      : 209
% 0.24/1.41  # Removed in clause preprocessing      : 2
% 0.24/1.41  # Initial clauses in saturation        : 207
% 0.24/1.41  # Processed clauses                    : 439
% 0.24/1.41  # ...of these trivial                  : 5
% 0.24/1.41  # ...subsumed                          : 113
% 0.24/1.41  # ...remaining for further processing  : 321
% 0.24/1.41  # Other redundant clauses eliminated   : 86
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 19
% 0.24/1.41  # Backward-rewritten                   : 38
% 0.24/1.41  # Generated clauses                    : 2555
% 0.24/1.41  # ...of the previous two non-trivial   : 2271
% 0.24/1.41  # Contextual simplify-reflections      : 94
% 0.24/1.41  # Paramodulations                      : 2441
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 104
% 0.24/1.41  # Current number of processed clauses  : 250
% 0.24/1.41  #    Positive orientable unit clauses  : 24
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 8
% 0.24/1.41  #    Non-unit-clauses                  : 218
% 0.24/1.41  # Current number of unprocessed clauses: 1589
% 0.24/1.41  # ...number of literals in the above   : 11028
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 64
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 12037
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 2862
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 143
% 0.24/1.41  # Unit Clause-clause subsumption calls : 1077
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 12
% 0.24/1.41  # BW rewrite match successes           : 12
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 59558
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.087 s
% 0.24/1.41  # System time              : 0.002 s
% 0.24/1.41  # Total time               : 0.089 s
% 0.24/1.41  # Maximum resident set size: 5596 pages
% 0.24/23.40  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.inCannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------