↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU383+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n014.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 09:19:33 EDT 2022

% Result   : Theorem 0.43s 25.62s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   69 (  14 unt;   0 def)
%            Number of atoms       :  252 (  26 equ)
%            Maximal formula atoms :   28 (   3 avg)
%            Number of connectives :  293 ( 110   ~; 114   |;  41   &)
%                                         (   6 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   2 con; 0-2 aty)
%            Number of variables   :  106 (   0 sgn  56   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d20_waybel_0,axiom,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => ( upper_relstr_subset(X2,X1)
          <=> ! [X3] :
                ( element(X3,the_carrier(X1))
               => ! [X4] :
                    ( element(X4,the_carrier(X1))
                   => ( ( in(X3,X2)
                        & related(X1,X3,X4) )
                     => in(X4,X2) ) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d20_waybel_0) ).

fof(t4_subset,axiom,
    ! [X1,X2,X3] :
      ( ( in(X1,X2)
        & element(X2,powerset(X3)) )
     => element(X1,X3) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t4_subset) ).

fof(t8_waybel_7,conjecture,
    ! [X1] :
      ( ( ~ empty_carrier(X1)
        & reflexive_relstr(X1)
        & transitive_relstr(X1)
        & antisymmetric_relstr(X1)
        & lower_bounded_relstr(X1)
        & rel_str(X1) )
     => ! [X2] :
          ( ( ~ empty(X2)
            & filtered_subset(X2,X1)
            & upper_relstr_subset(X2,X1)
            & element(X2,powerset(the_carrier(X1))) )
         => ( proper_element(X2,powerset(the_carrier(X1)))
          <=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t8_waybel_7) ).

fof(t44_yellow_0,lemma,
    ! [X1] :
      ( ( ~ empty_carrier(X1)
        & antisymmetric_relstr(X1)
        & lower_bounded_relstr(X1)
        & rel_str(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => related(X1,bottom_of_relstr(X1),X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t44_yellow_0) ).

fof(t5_tex_2,lemma,
    ! [X1,X2] :
      ( element(X2,powerset(X1))
     => ( proper_element(X2,powerset(X1))
      <=> X2 != X1 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t5_tex_2) ).

fof(t1_subset,axiom,
    ! [X1,X2] :
      ( in(X1,X2)
     => element(X1,X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t1_subset) ).

fof(t2_tarski,axiom,
    ! [X1,X2] :
      ( ! [X3] :
          ( in(X3,X1)
        <=> in(X3,X2) )
     => X1 = X2 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t2_tarski) ).

fof(l71_subset_1,lemma,
    ! [X1,X2] :
      ( ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) )
     => element(X1,powerset(X2)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',l71_subset_1) ).

fof(l3_subset_1,lemma,
    ! [X1,X2] :
      ( element(X2,powerset(X1))
     => ! [X3] :
          ( in(X3,X2)
         => in(X3,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',l3_subset_1) ).

fof(d2_tex_2,axiom,
    ! [X1,X2] :
      ( element(X2,X1)
     => ( proper_element(X2,X1)
      <=> X2 != union(X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d2_tex_2) ).

fof(dt_k3_yellow_0,axiom,
    ! [X1] :
      ( rel_str(X1)
     => element(bottom_of_relstr(X1),the_carrier(X1)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k3_yellow_0) ).

fof(t2_subset,axiom,
    ! [X1,X2] :
      ( element(X1,X2)
     => ( empty(X2)
        | in(X1,X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t2_subset) ).

fof(c_0_12,plain,
    ! [X5,X6,X7,X8] :
      ( ( ~ upper_relstr_subset(X6,X5)
        | ~ element(X7,the_carrier(X5))
        | ~ element(X8,the_carrier(X5))
        | ~ in(X7,X6)
        | ~ related(X5,X7,X8)
        | in(X8,X6)
        | ~ element(X6,powerset(the_carrier(X5)))
        | ~ rel_str(X5) )
      & ( element(esk8_2(X5,X6),the_carrier(X5))
        | upper_relstr_subset(X6,X5)
        | ~ element(X6,powerset(the_carrier(X5)))
        | ~ rel_str(X5) )
      & ( element(esk9_2(X5,X6),the_carrier(X5))
        | upper_relstr_subset(X6,X5)
        | ~ element(X6,powerset(the_carrier(X5)))
        | ~ rel_str(X5) )
      & ( in(esk8_2(X5,X6),X6)
        | upper_relstr_subset(X6,X5)
        | ~ element(X6,powerset(the_carrier(X5)))
        | ~ rel_str(X5) )
      & ( related(X5,esk8_2(X5,X6),esk9_2(X5,X6))
        | upper_relstr_subset(X6,X5)
        | ~ element(X6,powerset(the_carrier(X5)))
        | ~ rel_str(X5) )
      & ( ~ in(esk9_2(X5,X6),X6)
        | upper_relstr_subset(X6,X5)
        | ~ element(X6,powerset(the_carrier(X5)))
        | ~ rel_str(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[d20_waybel_0])])])])])])]) ).

fof(c_0_13,plain,
    ! [X4,X5,X6] :
      ( ~ in(X4,X5)
      | ~ element(X5,powerset(X6))
      | element(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).

fof(c_0_14,negated_conjecture,
    ~ ! [X1] :
        ( ( ~ empty_carrier(X1)
          & reflexive_relstr(X1)
          & transitive_relstr(X1)
          & antisymmetric_relstr(X1)
          & lower_bounded_relstr(X1)
          & rel_str(X1) )
       => ! [X2] :
            ( ( ~ empty(X2)
              & filtered_subset(X2,X1)
              & upper_relstr_subset(X2,X1)
              & element(X2,powerset(the_carrier(X1))) )
           => ( proper_element(X2,powerset(the_carrier(X1)))
            <=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
    inference(assume_negation,[status(cth)],[t8_waybel_7]) ).

cnf(c_0_15,plain,
    ( in(X3,X2)
    | ~ rel_str(X1)
    | ~ element(X2,powerset(the_carrier(X1)))
    | ~ related(X1,X4,X3)
    | ~ in(X4,X2)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X4,the_carrier(X1))
    | ~ upper_relstr_subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( element(X1,X2)
    | ~ element(X3,powerset(X2))
    | ~ in(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_17,negated_conjecture,
    ( ~ empty_carrier(esk1_0)
    & reflexive_relstr(esk1_0)
    & transitive_relstr(esk1_0)
    & antisymmetric_relstr(esk1_0)
    & lower_bounded_relstr(esk1_0)
    & rel_str(esk1_0)
    & ~ empty(esk2_0)
    & filtered_subset(esk2_0,esk1_0)
    & upper_relstr_subset(esk2_0,esk1_0)
    & element(esk2_0,powerset(the_carrier(esk1_0)))
    & ( ~ proper_element(esk2_0,powerset(the_carrier(esk1_0)))
      | in(bottom_of_relstr(esk1_0),esk2_0) )
    & ( proper_element(esk2_0,powerset(the_carrier(esk1_0)))
      | ~ in(bottom_of_relstr(esk1_0),esk2_0) ) ),
    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_14])])])])])]) ).

cnf(c_0_18,plain,
    ( in(X1,X2)
    | ~ upper_relstr_subset(X2,X3)
    | ~ related(X3,X4,X1)
    | ~ element(X2,powerset(the_carrier(X3)))
    | ~ element(X1,the_carrier(X3))
    | ~ in(X4,X2)
    | ~ rel_str(X3) ),
    inference(csr,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    element(esk2_0,powerset(the_carrier(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    upper_relstr_subset(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    rel_str(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_22,lemma,
    ! [X3,X4] :
      ( empty_carrier(X3)
      | ~ antisymmetric_relstr(X3)
      | ~ lower_bounded_relstr(X3)
      | ~ rel_str(X3)
      | ~ element(X4,the_carrier(X3))
      | related(X3,bottom_of_relstr(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)],[inference(fof_simplification,[status(thm)],[t44_yellow_0])])])])])]) ).

fof(c_0_23,lemma,
    ! [X3,X4] :
      ( ( ~ proper_element(X4,powerset(X3))
        | X4 != X3
        | ~ element(X4,powerset(X3)) )
      & ( X4 = X3
        | proper_element(X4,powerset(X3))
        | ~ element(X4,powerset(X3)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_tex_2])])]) ).

cnf(c_0_24,negated_conjecture,
    ( in(X1,esk2_0)
    | ~ related(esk1_0,X2,X1)
    | ~ element(X1,the_carrier(esk1_0))
    | ~ in(X2,esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).

cnf(c_0_25,lemma,
    ( related(X1,bottom_of_relstr(X1),X2)
    | empty_carrier(X1)
    | ~ element(X2,the_carrier(X1))
    | ~ rel_str(X1)
    | ~ lower_bounded_relstr(X1)
    | ~ antisymmetric_relstr(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    lower_bounded_relstr(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_27,negated_conjecture,
    antisymmetric_relstr(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_28,negated_conjecture,
    ~ empty_carrier(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_29,negated_conjecture,
    ( in(bottom_of_relstr(esk1_0),esk2_0)
    | ~ proper_element(esk2_0,powerset(the_carrier(esk1_0))) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_30,lemma,
    ( proper_element(X1,powerset(X2))
    | X1 = X2
    | ~ element(X1,powerset(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

fof(c_0_31,plain,
    ! [X3,X4] :
      ( ~ in(X3,X4)
      | element(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).

fof(c_0_32,plain,
    ! [X4,X5] :
      ( ( ~ in(esk3_2(X4,X5),X4)
        | ~ in(esk3_2(X4,X5),X5)
        | X4 = X5 )
      & ( in(esk3_2(X4,X5),X4)
        | in(esk3_2(X4,X5),X5)
        | X4 = X5 ) ),
    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)],[t2_tarski])])])])])]) ).

fof(c_0_33,lemma,
    ! [X4,X5] :
      ( ( in(esk6_2(X4,X5),X4)
        | element(X4,powerset(X5)) )
      & ( ~ in(esk6_2(X4,X5),X5)
        | element(X4,powerset(X5)) ) ),
    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)],[l71_subset_1])])])])])]) ).

fof(c_0_34,lemma,
    ! [X4,X5,X6] :
      ( ~ element(X5,powerset(X4))
      | ~ in(X6,X5)
      | in(X6,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)],[l3_subset_1])])])])]) ).

cnf(c_0_35,lemma,
    ( in(X1,esk2_0)
    | ~ element(X1,the_carrier(esk1_0))
    | ~ in(bottom_of_relstr(esk1_0),esk2_0) ),
    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_24,c_0_25]),c_0_26]),c_0_27]),c_0_21])]),c_0_28]) ).

cnf(c_0_36,negated_conjecture,
    ( the_carrier(esk1_0) = esk2_0
    | in(bottom_of_relstr(esk1_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19])]) ).

cnf(c_0_37,plain,
    ( element(X1,X2)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_38,plain,
    ( X1 = X2
    | in(esk3_2(X1,X2),X2)
    | in(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_39,lemma,
    ( ~ element(X1,powerset(X2))
    | X1 != X2
    | ~ proper_element(X1,powerset(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_40,lemma,
    ( element(X1,powerset(X2))
    | ~ in(esk6_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_41,lemma,
    ( element(X1,powerset(X2))
    | in(esk6_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_42,lemma,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ element(X3,powerset(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_43,negated_conjecture,
    ( the_carrier(esk1_0) = esk2_0
    | in(X1,esk2_0)
    | ~ element(X1,the_carrier(esk1_0)) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_44,plain,
    ( X1 = X2
    | element(esk3_2(X1,X2),X2)
    | in(esk3_2(X1,X2),X1) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

fof(c_0_45,plain,
    ! [X3,X4] :
      ( ( ~ proper_element(X4,X3)
        | X4 != union(X3)
        | ~ element(X4,X3) )
      & ( X4 = union(X3)
        | proper_element(X4,X3)
        | ~ element(X4,X3) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tex_2])])]) ).

cnf(c_0_46,lemma,
    ( ~ proper_element(X1,powerset(X1))
    | ~ element(X1,powerset(X1)) ),
    inference(er,[status(thm)],[c_0_39]) ).

cnf(c_0_47,lemma,
    element(X1,powerset(X1)),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_48,plain,
    ( X1 = X2
    | ~ in(esk3_2(X1,X2),X2)
    | ~ in(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_49,negated_conjecture,
    ( in(X1,the_carrier(esk1_0))
    | ~ in(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_42,c_0_19]) ).

cnf(c_0_50,negated_conjecture,
    ( the_carrier(esk1_0) = esk2_0
    | X1 = the_carrier(esk1_0)
    | in(esk3_2(X1,the_carrier(esk1_0)),esk2_0)
    | in(esk3_2(X1,the_carrier(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ( ~ element(X1,X2)
    | X1 != union(X2)
    | ~ proper_element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_52,negated_conjecture,
    ( proper_element(esk2_0,powerset(the_carrier(esk1_0)))
    | ~ in(bottom_of_relstr(esk1_0),esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_53,plain,
    ( proper_element(X1,X2)
    | X1 = union(X2)
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_54,lemma,
    ~ proper_element(X1,powerset(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).

fof(c_0_55,plain,
    ! [X2] :
      ( ~ rel_str(X2)
      | element(bottom_of_relstr(X2),the_carrier(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_yellow_0])]) ).

cnf(c_0_56,negated_conjecture,
    ( X1 = the_carrier(esk1_0)
    | ~ in(esk3_2(X1,the_carrier(esk1_0)),esk2_0)
    | ~ in(esk3_2(X1,the_carrier(esk1_0)),X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_57,negated_conjecture,
    ( the_carrier(esk1_0) = esk2_0
    | in(esk3_2(esk2_0,the_carrier(esk1_0)),esk2_0) ),
    inference(ef,[status(thm)],[c_0_50]) ).

cnf(c_0_58,negated_conjecture,
    ( union(powerset(the_carrier(esk1_0))) != esk2_0
    | ~ in(bottom_of_relstr(esk1_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_19])]) ).

cnf(c_0_59,lemma,
    union(powerset(X1)) = X1,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_47]),c_0_54]) ).

fof(c_0_60,plain,
    ! [X3,X4] :
      ( ~ element(X3,X4)
      | empty(X4)
      | in(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).

cnf(c_0_61,plain,
    ( element(bottom_of_relstr(X1),the_carrier(X1))
    | ~ rel_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_55]) ).

cnf(c_0_62,negated_conjecture,
    the_carrier(esk1_0) = esk2_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_57]) ).

cnf(c_0_63,negated_conjecture,
    ( the_carrier(esk1_0) != esk2_0
    | ~ in(bottom_of_relstr(esk1_0),esk2_0) ),
    inference(rw,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_64,plain,
    ( in(X1,X2)
    | empty(X2)
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_60]) ).

cnf(c_0_65,negated_conjecture,
    element(bottom_of_relstr(esk1_0),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_21])]) ).

cnf(c_0_66,negated_conjecture,
    ~ empty(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_67,negated_conjecture,
    ~ in(bottom_of_relstr(esk1_0),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_62])]) ).

cnf(c_0_68,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_67]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SEU383+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n014.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 : Mon Jun 20 10:07:32 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.42/23.47  eprover: CPU time limit exceeded, terminating
% 0.42/23.48  eprover: CPU time limit exceeded, terminating
% 0.42/23.48  eprover: CPU time limit exceeded, terminating
% 0.42/23.49  eprover: CPU time limit exceeded, terminating
% 0.43/25.62  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.43/25.62  
% 0.43/25.62  # Failure: Resource limit exceeded (time)
% 0.43/25.62  # OLD status Res
% 0.43/25.62  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.43/25.62  # Preprocessing time       : 0.053 s
% 0.43/25.62  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.43/25.62  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.43/25.62  # Preprocessing time       : 0.047 s
% 0.43/25.62  
% 0.43/25.62  # Proof found!
% 0.43/25.62  # SZS status Theorem
% 0.43/25.62  # SZS output start CNFRefutation
% See solution above
% 0.43/25.62  # Proof object total steps             : 69
% 0.43/25.62  # Proof object clause steps            : 44
% 0.43/25.62  # Proof object formula steps           : 25
% 0.43/25.62  # Proof object conjectures             : 25
% 0.43/25.62  # Proof object clause conjectures      : 22
% 0.43/25.62  # Proof object formula conjectures     : 3
% 0.43/25.62  # Proof object initial clauses used    : 24
% 0.43/25.62  # Proof object initial formulas used   : 12
% 0.43/25.62  # Proof object generating inferences   : 15
% 0.43/25.62  # Proof object simplifying inferences  : 25
% 0.43/25.62  # Training examples: 0 positive, 0 negative
% 0.43/25.62  # Parsed axioms                        : 844
% 0.43/25.62  # Removed by relevancy pruning/SinE    : 805
% 0.43/25.62  # Initial clauses                      : 84
% 0.43/25.62  # Removed in clause preprocessing      : 0
% 0.43/25.62  # Initial clauses in saturation        : 84
% 0.43/25.62  # Processed clauses                    : 6403
% 0.43/25.62  # ...of these trivial                  : 6
% 0.43/25.62  # ...subsumed                          : 4824
% 0.43/25.62  # ...remaining for further processing  : 1573
% 0.43/25.62  # Other redundant clauses eliminated   : 1
% 0.43/25.62  # Clauses deleted for lack of memory   : 0
% 0.43/25.62  # Backward-subsumed                    : 38
% 0.43/25.62  # Backward-rewritten                   : 517
% 0.43/25.62  # Generated clauses                    : 51311
% 0.43/25.62  # ...of the previous two non-trivial   : 48037
% 0.43/25.62  # Contextual simplify-reflections      : 6848
% 0.43/25.62  # Paramodulations                      : 51022
% 0.43/25.62  # Factorizations                       : 18
% 0.43/25.62  # Equation resolutions                 : 1
% 0.43/25.62  # Current number of processed clauses  : 927
% 0.43/25.62  #    Positive orientable unit clauses  : 62
% 0.43/25.62  #    Positive unorientable unit clauses: 0
% 0.43/25.62  #    Negative unit clauses             : 56
% 0.43/25.62  #    Non-unit-clauses                  : 809
% 0.43/25.62  # Current number of unprocessed clauses: 26911
% 0.43/25.62  # ...number of literals in the above   : 128103
% 0.43/25.62  # Current number of archived formulas  : 0
% 0.43/25.62  # Current number of archived clauses   : 555
% 0.43/25.62  # Clause-clause subsumption calls (NU) : 1631677
% 0.43/25.62  # Rec. Clause-clause subsumption calls : 365967
% 0.43/25.62  # Non-unit clause-clause subsumptions  : 10080
% 0.43/25.62  # Unit Clause-clause subsumption calls : 27899
% 0.43/25.62  # Rewrite failures with RHS unbound    : 0
% 0.43/25.62  # BW rewrite match attempts            : 60
% 0.43/25.62  # BW rewrite match successes           : 42
% 0.43/25.62  # Condensation attempts                : 0
% 0.43/25.62  # Condensation successes               : 0
% 0.43/25.62  # Termbank termtop insertions          : 1149676
% 0.43/25.62  
% 0.43/25.62  # -------------------------------------------------
% 0.43/25.62  # User time                : 1.208 s
% 0.43/25.62  # System time              : 0.021 s
% 0.43/25.62  # Total time               : 1.229 s
% 0.43/25.62  # Maximum resident set size: 41420 pages
% 0.43/46.48  eprover: CPU time limit exceeded, terminating
% 0.43/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.50  eprover: No such file or directory
% 0.43/46.50  eprover: CPU time limit exceeded, terminating
% 0.43/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.50  eprover: No such file or directory
% 0.43/46.51  eprover: CPU time limit exceeded, terminating
% 0.43/46.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.51  eprover: No such file or directory
% 0.43/46.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.51  eprover: No such file or directory
% 0.43/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.52  eprover: No such file or directory
% 0.43/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.52  eprover: No such file or directory
% 0.43/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.52  eprover: No such file or directory
% 0.43/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.52  eprover: No such file or directory
% 0.43/46.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.52  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.53  eprover: No such file or directory
% 0.43/46.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.54  eprover: No such file or directory
% 0.43/46.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.54  eprover: No such file or directory
% 0.43/46.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.54  eprover: No such file or directory
% 0.43/46.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.54  eprover: No such file or directory
% 0.43/46.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.54  eprover: No such file or directory
% 0.43/46.54  eprover: eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.54  Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.54  eprover: No such file or directory
% 0.43/46.55  eprover: No such file or directory
% 0.43/46.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.55  eprover: No such file or directory
% 0.43/46.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.55  eprover: No such file or directory
% 0.43/46.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.55  eprover: No such file or directory
% 0.43/46.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.55  eprover: No such file or directory
% 0.43/46.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.56  eprover: No such file or directory
% 0.43/46.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.56  eprover: No such file or directory
% 0.43/46.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.56  eprover: No such file or directory
%------------------------------------------------------------------------------