↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET105+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 00:49:15 EDT 2022

% Result   : Theorem 0.22s 2.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   18
% Syntax   : Number of formulae    :  153 (  52 unt;   0 def)
%            Number of atoms       :  363 ( 109 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  340 ( 130   ~; 162   |;  36   &)
%                                         (   9 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   7 con; 0-2 aty)
%            Number of variables   :  247 (  47 sgn  89   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(disjoint_defn,axiom,
    ! [X1,X2] :
      ( disjoint(X1,X2)
    <=> ! [X3] :
          ~ ( member(X3,X1)
            & member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',disjoint_defn) ).

fof(regularity,axiom,
    ! [X1] :
      ( X1 != null_class
     => ? [X3] :
          ( member(X3,universal_class)
          & member(X3,X1)
          & disjoint(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).

fof(unordered_pair_defn,axiom,
    ! [X3,X1,X2] :
      ( member(X3,unordered_pair(X1,X2))
    <=> ( member(X3,universal_class)
        & ( X3 = X1
          | X3 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).

fof(subclass_defn,axiom,
    ! [X1,X2] :
      ( subclass(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).

fof(class_elements_are_sets,axiom,
    ! [X1] : subclass(X1,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).

fof(property_3_of_ordered_pair,conjecture,
    ! [X1,X2] :
      ( unordered_pair(null_class,singleton(null_class)) = ordered_pair(X1,X2)
      | member(X1,universal_class)
      | member(X2,universal_class) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',property_3_of_ordered_pair) ).

fof(unordered_pair,axiom,
    ! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair) ).

fof(null_class_defn,axiom,
    ! [X1] : ~ member(X1,null_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',null_class_defn) ).

fof(ordered_pair_defn,axiom,
    ! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',ordered_pair_defn) ).

fof(singleton_set_defn,axiom,
    ! [X1] : singleton(X1) = unordered_pair(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).

fof(complement,axiom,
    ! [X1,X5] :
      ( member(X5,complement(X1))
    <=> ( member(X5,universal_class)
        & ~ member(X5,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',complement) ).

fof(cross_product_defn,axiom,
    ! [X3,X4,X1,X2] :
      ( member(ordered_pair(X3,X4),cross_product(X1,X2))
    <=> ( member(X3,X1)
        & member(X4,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',cross_product_defn) ).

fof(element_relation,axiom,
    subclass(element_relation,cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',element_relation) ).

fof(element_relation_defn,axiom,
    ! [X1,X2] :
      ( member(ordered_pair(X1,X2),element_relation)
    <=> ( member(X2,universal_class)
        & member(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',element_relation_defn) ).

fof(extensionality,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subclass(X1,X2)
        & subclass(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',extensionality) ).

fof(inductive_defn,axiom,
    ! [X1] :
      ( inductive(X1)
    <=> ( member(null_class,X1)
        & subclass(image(successor_relation,X1),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',inductive_defn) ).

fof(infinity,axiom,
    ? [X1] :
      ( member(X1,universal_class)
      & inductive(X1)
      & ! [X2] :
          ( inductive(X2)
         => subclass(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',infinity) ).

fof(union_defn,axiom,
    ! [X1,X2,X5] :
      ( member(X5,union(X1,X2))
    <=> ( member(X5,X1)
        | member(X5,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',union_defn) ).

fof(c_0_18,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ disjoint(X4,X5)
        | ~ member(X6,X4)
        | ~ member(X6,X5) )
      & ( member(esk5_2(X4,X5),X4)
        | disjoint(X4,X5) )
      & ( member(esk5_2(X4,X5),X5)
        | disjoint(X4,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)],[disjoint_defn])])])])])])]) ).

fof(c_0_19,plain,
    ! [X4] :
      ( ( member(esk6_1(X4),universal_class)
        | X4 = null_class )
      & ( member(esk6_1(X4),X4)
        | X4 = null_class )
      & ( disjoint(esk6_1(X4),X4)
        | X4 = null_class ) ),
    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)],[regularity])])])])])]) ).

fof(c_0_20,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( member(X4,universal_class)
        | ~ member(X4,unordered_pair(X5,X6)) )
      & ( X4 = X5
        | X4 = X6
        | ~ member(X4,unordered_pair(X5,X6)) )
      & ( X4 != X5
        | ~ member(X4,universal_class)
        | member(X4,unordered_pair(X5,X6)) )
      & ( X4 != X6
        | ~ member(X4,universal_class)
        | member(X4,unordered_pair(X5,X6)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).

cnf(c_0_21,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,X3)
    | ~ disjoint(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,plain,
    ( X1 = null_class
    | disjoint(esk6_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,plain,
    ( X1 = X3
    | X1 = X2
    | ~ member(X1,unordered_pair(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_24,plain,
    ( X1 = null_class
    | member(esk6_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_25,plain,
    ( X1 = null_class
    | ~ member(X2,esk6_1(X1))
    | ~ member(X2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | esk6_1(unordered_pair(X1,X2)) = X1
    | unordered_pair(X1,X2) = null_class ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

fof(c_0_27,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subclass(X4,X5)
        | ~ member(X6,X4)
        | member(X6,X5) )
      & ( member(esk1_2(X4,X5),X4)
        | subclass(X4,X5) )
      & ( ~ member(esk1_2(X4,X5),X5)
        | subclass(X4,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)],[subclass_defn])])])])])])]) ).

fof(c_0_28,plain,
    ! [X2] : subclass(X2,universal_class),
    inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).

cnf(c_0_29,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | unordered_pair(X1,X2) = null_class
    | ~ member(X3,unordered_pair(X1,X2))
    | ~ member(X3,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( member(X1,unordered_pair(X2,X3))
    | ~ member(X1,universal_class)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_31,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subclass(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_32,plain,
    subclass(X1,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_33,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | unordered_pair(X1,X2) = null_class
    | ~ member(esk6_1(unordered_pair(X1,X2)),X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_24]) ).

cnf(c_0_34,plain,
    ( X1 = null_class
    | member(esk6_1(X1),universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_35,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X1
    | unordered_pair(X1,X2) = null_class
    | ~ member(X3,unordered_pair(X1,X2))
    | ~ member(X3,X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_36,plain,
    ( member(X1,unordered_pair(X1,X2))
    | ~ member(X1,universal_class) ),
    inference(er,[status(thm)],[c_0_30]) ).

cnf(c_0_37,plain,
    ( member(X1,universal_class)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_38,plain,
    ( esk6_1(unordered_pair(universal_class,X1)) = X1
    | unordered_pair(universal_class,X1) = null_class ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X1
    | unordered_pair(X1,X2) = null_class
    | ~ member(X1,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_40,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | unordered_pair(X1,X2) = null_class
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_34,c_0_26]) ).

fof(c_0_41,negated_conjecture,
    ~ ! [X1,X2] :
        ( unordered_pair(null_class,singleton(null_class)) = ordered_pair(X1,X2)
        | member(X1,universal_class)
        | member(X2,universal_class) ),
    inference(assume_negation,[status(cth)],[property_3_of_ordered_pair]) ).

cnf(c_0_42,plain,
    ( member(X1,unordered_pair(X2,X3))
    | ~ member(X1,universal_class)
    | X1 != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_43,plain,
    ( unordered_pair(universal_class,X1) = null_class
    | universal_class = X1
    | ~ member(universal_class,X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_44,plain,
    ( unordered_pair(X1,X2) = null_class
    | member(X2,unordered_pair(X1,X2))
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_24,c_0_40]) ).

fof(c_0_45,plain,
    ! [X3,X4] : member(unordered_pair(X3,X4),universal_class),
    inference(variable_rename,[status(thm)],[unordered_pair]) ).

fof(c_0_46,plain,
    ! [X2] : ~ member(X2,null_class),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[null_class_defn])]) ).

cnf(c_0_47,plain,
    ( esk6_1(unordered_pair(X1,X1)) = X1
    | unordered_pair(X1,X1) = null_class ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_26])]) ).

fof(c_0_48,plain,
    ! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(singleton(X3),unordered_pair(X3,singleton(X4))),
    inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).

fof(c_0_49,plain,
    ! [X2] : singleton(X2) = unordered_pair(X2,X2),
    inference(variable_rename,[status(thm)],[singleton_set_defn]) ).

fof(c_0_50,plain,
    ! [X6,X7,X6,X7] :
      ( ( member(X7,universal_class)
        | ~ member(X7,complement(X6)) )
      & ( ~ member(X7,X6)
        | ~ member(X7,complement(X6)) )
      & ( ~ member(X7,universal_class)
        | member(X7,X6)
        | member(X7,complement(X6)) ) ),
    inference(distribute,[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)],[complement])])])])])]) ).

fof(c_0_51,negated_conjecture,
    ( unordered_pair(null_class,singleton(null_class)) != ordered_pair(esk8_0,esk9_0)
    & ~ member(esk8_0,universal_class)
    & ~ member(esk9_0,universal_class) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])]) ).

cnf(c_0_52,plain,
    ( member(X1,unordered_pair(X2,X1))
    | ~ member(X1,universal_class) ),
    inference(er,[status(thm)],[c_0_42]) ).

cnf(c_0_53,plain,
    ( unordered_pair(universal_class,unordered_pair(X1,universal_class)) = null_class
    | unordered_pair(X1,universal_class) = null_class
    | unordered_pair(X1,universal_class) = universal_class
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_54,plain,
    member(unordered_pair(X1,X2),universal_class),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_55,plain,
    ~ member(X1,null_class),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_56,plain,
    ( unordered_pair(X1,X1) = null_class
    | ~ member(X2,unordered_pair(X1,X1))
    | ~ member(X2,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_47]) ).

cnf(c_0_57,plain,
    ( unordered_pair(X1,X1) = null_class
    | member(X1,unordered_pair(X1,X1)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_47]) ).

fof(c_0_58,plain,
    ! [X5,X6,X7,X8,X5,X6,X7,X8] :
      ( ( member(X5,X7)
        | ~ member(ordered_pair(X5,X6),cross_product(X7,X8)) )
      & ( member(X6,X8)
        | ~ member(ordered_pair(X5,X6),cross_product(X7,X8)) )
      & ( ~ member(X5,X7)
        | ~ member(X6,X8)
        | member(ordered_pair(X5,X6),cross_product(X7,X8)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cross_product_defn])])])])]) ).

cnf(c_0_59,plain,
    ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_60,plain,
    singleton(X1) = unordered_pair(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_61,plain,
    ( subclass(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_62,plain,
    ( subclass(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_63,plain,
    ( member(X1,complement(X2))
    | member(X1,X2)
    | ~ member(X1,universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

cnf(c_0_64,negated_conjecture,
    ~ member(esk9_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_65,plain,
    ( unordered_pair(X1,universal_class) = universal_class
    | unordered_pair(X1,universal_class) = null_class
    | member(X1,universal_class) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),c_0_55]) ).

cnf(c_0_66,plain,
    ( unordered_pair(X1,X1) = null_class
    | ~ member(X1,X1) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_67,plain,
    ( unordered_pair(X1,X1) = null_class
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_34,c_0_47]) ).

cnf(c_0_68,plain,
    ( member(X1,X3)
    | ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_69,plain,
    ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_60]) ).

cnf(c_0_70,plain,
    subclass(element_relation,cross_product(universal_class,universal_class)),
    inference(split_conjunct,[status(thm)],[element_relation]) ).

cnf(c_0_71,plain,
    ( esk1_2(unordered_pair(X1,X2),X3) = X2
    | esk1_2(unordered_pair(X1,X2),X3) = X1
    | subclass(unordered_pair(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_23,c_0_61]) ).

cnf(c_0_72,plain,
    ( member(esk1_2(X1,complement(X2)),X2)
    | subclass(X1,complement(X2))
    | ~ member(esk1_2(X1,complement(X2)),universal_class) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_73,negated_conjecture,
    ( unordered_pair(esk9_0,universal_class) = null_class
    | unordered_pair(esk9_0,universal_class) = universal_class ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_74,plain,
    unordered_pair(universal_class,universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

fof(c_0_75,plain,
    ! [X3,X4,X3,X4] :
      ( ( member(X4,universal_class)
        | ~ member(ordered_pair(X3,X4),element_relation) )
      & ( member(X3,X4)
        | ~ member(ordered_pair(X3,X4),element_relation) )
      & ( ~ member(X4,universal_class)
        | ~ member(X3,X4)
        | member(ordered_pair(X3,X4),element_relation) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[element_relation_defn])])])])]) ).

cnf(c_0_76,plain,
    ( member(X1,X3)
    | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4)) ),
    inference(rw,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_77,plain,
    ( member(X1,cross_product(universal_class,universal_class))
    | ~ member(X1,element_relation) ),
    inference(spm,[status(thm)],[c_0_31,c_0_70]) ).

cnf(c_0_78,negated_conjecture,
    ~ member(esk8_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_79,plain,
    ( esk1_2(unordered_pair(X1,X2),X3) = X2
    | subclass(unordered_pair(X1,X2),X3)
    | ~ member(X1,X3) ),
    inference(spm,[status(thm)],[c_0_62,c_0_71]) ).

cnf(c_0_80,plain,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_50]) ).

fof(c_0_81,plain,
    ! [X3,X4,X3,X4] :
      ( ( subclass(X3,X4)
        | X3 != X4 )
      & ( subclass(X4,X3)
        | X3 != X4 )
      & ( ~ subclass(X3,X4)
        | ~ subclass(X4,X3)
        | X3 = X4 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])])]) ).

cnf(c_0_82,plain,
    ( member(esk1_2(universal_class,complement(X1)),X1)
    | subclass(universal_class,complement(X1)) ),
    inference(spm,[status(thm)],[c_0_72,c_0_61]) ).

cnf(c_0_83,plain,
    ( esk6_1(X1) = null_class
    | X1 = null_class
    | ~ member(esk6_1(esk6_1(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_84,negated_conjecture,
    ( unordered_pair(esk9_0,universal_class) = universal_class
    | null_class != universal_class ),
    inference(ef,[status(thm)],[c_0_73]) ).

cnf(c_0_85,plain,
    ~ member(universal_class,universal_class),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_74]),c_0_55]) ).

cnf(c_0_86,plain,
    ( member(ordered_pair(X1,X2),element_relation)
    | ~ member(X1,X2)
    | ~ member(X2,universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_75]) ).

cnf(c_0_87,plain,
    ( member(X1,universal_class)
    | ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation) ),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_88,negated_conjecture,
    unordered_pair(esk8_0,esk8_0) = null_class,
    inference(spm,[status(thm)],[c_0_78,c_0_67]) ).

cnf(c_0_89,plain,
    ( member(X1,unordered_pair(X2,X1))
    | subclass(unordered_pair(X2,X1),X3)
    | ~ member(X2,X3) ),
    inference(spm,[status(thm)],[c_0_61,c_0_79]) ).

cnf(c_0_90,plain,
    ( complement(X1) = null_class
    | ~ member(esk6_1(complement(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_80,c_0_24]) ).

cnf(c_0_91,plain,
    ( X1 = X2
    | ~ subclass(X2,X1)
    | ~ subclass(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_81]) ).

cnf(c_0_92,plain,
    subclass(universal_class,complement(null_class)),
    inference(spm,[status(thm)],[c_0_55,c_0_82]) ).

cnf(c_0_93,plain,
    ( esk6_1(universal_class) = null_class
    | null_class = universal_class ),
    inference(spm,[status(thm)],[c_0_83,c_0_34]) ).

cnf(c_0_94,negated_conjecture,
    null_class != universal_class,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_84]),c_0_85]) ).

cnf(c_0_95,negated_conjecture,
    unordered_pair(esk9_0,esk9_0) = null_class,
    inference(spm,[status(thm)],[c_0_64,c_0_67]) ).

cnf(c_0_96,plain,
    ( member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation)
    | ~ member(X1,X2)
    | ~ member(X2,universal_class) ),
    inference(rw,[status(thm)],[c_0_86,c_0_69]) ).

cnf(c_0_97,negated_conjecture,
    ~ member(unordered_pair(null_class,unordered_pair(esk8_0,unordered_pair(X1,X1))),element_relation),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_78]) ).

cnf(c_0_98,plain,
    ( member(X1,unordered_pair(X2,X1))
    | subclass(unordered_pair(X2,X1),unordered_pair(X3,X2))
    | ~ member(X2,universal_class) ),
    inference(spm,[status(thm)],[c_0_89,c_0_52]) ).

cnf(c_0_99,plain,
    ( complement(complement(X1)) = null_class
    | member(esk6_1(complement(complement(X1))),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_63]),c_0_34]) ).

cnf(c_0_100,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_90,c_0_34]) ).

cnf(c_0_101,plain,
    complement(null_class) = universal_class,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_32])]) ).

cnf(c_0_102,plain,
    esk6_1(universal_class) = null_class,
    inference(sr,[status(thm)],[c_0_93,c_0_94]) ).

cnf(c_0_103,negated_conjecture,
    ~ member(unordered_pair(null_class,unordered_pair(esk9_0,unordered_pair(X1,X1))),element_relation),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_95]),c_0_64]) ).

cnf(c_0_104,negated_conjecture,
    ( ~ member(X1,universal_class)
    | ~ member(esk8_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_88]),c_0_97]) ).

cnf(c_0_105,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | unordered_pair(X1,X2) = null_class
    | ~ member(X2,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_52]),c_0_37]) ).

cnf(c_0_106,plain,
    ( member(X1,unordered_pair(null_class,X1))
    | subclass(unordered_pair(null_class,X1),unordered_pair(X2,null_class)) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101]),c_0_102]),c_0_100]),c_0_101]),c_0_102]),c_0_100]),c_0_101]),c_0_102]),c_0_100]),c_0_101]),c_0_94]) ).

fof(c_0_107,plain,
    ! [X2,X2] :
      ( ( member(null_class,X2)
        | ~ inductive(X2) )
      & ( subclass(image(successor_relation,X2),X2)
        | ~ inductive(X2) )
      & ( ~ member(null_class,X2)
        | ~ subclass(image(successor_relation,X2),X2)
        | inductive(X2) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inductive_defn])])])])]) ).

fof(c_0_108,plain,
    ! [X4] :
      ( member(esk2_0,universal_class)
      & inductive(esk2_0)
      & ( ~ inductive(X4)
        | subclass(esk2_0,X4) ) ),
    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)],[infinity])])])])])]) ).

cnf(c_0_109,negated_conjecture,
    ( ~ member(X1,universal_class)
    | ~ member(esk9_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_95]),c_0_103]) ).

cnf(c_0_110,negated_conjecture,
    ~ member(esk8_0,unordered_pair(X1,X2)),
    inference(spm,[status(thm)],[c_0_104,c_0_54]) ).

cnf(c_0_111,plain,
    ( unordered_pair(X1,X2) = null_class
    | member(X2,unordered_pair(X1,X2))
    | ~ member(X2,X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_105]) ).

fof(c_0_112,plain,
    ! [X6,X7,X8,X6,X7,X8] :
      ( ( ~ member(X8,union(X6,X7))
        | member(X8,X6)
        | member(X8,X7) )
      & ( ~ member(X8,X6)
        | member(X8,union(X6,X7)) )
      & ( ~ member(X8,X7)
        | member(X8,union(X6,X7)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])])]) ).

cnf(c_0_113,plain,
    ( member(X1,universal_class)
    | subclass(unordered_pair(null_class,X1),unordered_pair(X2,null_class)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_106]) ).

cnf(c_0_114,plain,
    ( esk1_2(unordered_pair(X1,X1),X2) = X1
    | subclass(unordered_pair(X1,X1),X2) ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_71])]) ).

cnf(c_0_115,plain,
    ( member(null_class,X1)
    | ~ inductive(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_107]) ).

cnf(c_0_116,plain,
    inductive(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_108]) ).

cnf(c_0_117,plain,
    ( unordered_pair(universal_class,X1) = null_class
    | ~ member(X2,unordered_pair(universal_class,X1))
    | ~ member(X2,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_38]) ).

cnf(c_0_118,negated_conjecture,
    ~ member(esk9_0,unordered_pair(X1,X2)),
    inference(spm,[status(thm)],[c_0_109,c_0_54]) ).

cnf(c_0_119,negated_conjecture,
    ( unordered_pair(X1,esk8_0) = null_class
    | ~ member(esk8_0,X1) ),
    inference(spm,[status(thm)],[c_0_110,c_0_111]) ).

cnf(c_0_120,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_112]) ).

cnf(c_0_121,plain,
    ( unordered_pair(X1,null_class) = unordered_pair(null_class,X2)
    | member(X2,universal_class)
    | ~ subclass(unordered_pair(X1,null_class),unordered_pair(null_class,X2)) ),
    inference(spm,[status(thm)],[c_0_91,c_0_113]) ).

cnf(c_0_122,plain,
    ( subclass(unordered_pair(X1,X1),X2)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_62,c_0_114]) ).

cnf(c_0_123,plain,
    member(null_class,esk2_0),
    inference(spm,[status(thm)],[c_0_115,c_0_116]) ).

cnf(c_0_124,plain,
    ( unordered_pair(universal_class,X1) = null_class
    | ~ member(universal_class,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_36]),c_0_37]) ).

cnf(c_0_125,negated_conjecture,
    ( unordered_pair(X1,esk9_0) = null_class
    | ~ member(esk9_0,X1) ),
    inference(spm,[status(thm)],[c_0_118,c_0_111]) ).

cnf(c_0_126,negated_conjecture,
    ( unordered_pair(union(X1,X2),esk8_0) = null_class
    | ~ member(esk8_0,X2) ),
    inference(spm,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_127,plain,
    ( unordered_pair(null_class,null_class) = unordered_pair(null_class,X1)
    | member(X1,universal_class)
    | ~ member(null_class,unordered_pair(null_class,X1)) ),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_128,plain,
    member(null_class,universal_class),
    inference(spm,[status(thm)],[c_0_37,c_0_123]) ).

cnf(c_0_129,plain,
    ( unordered_pair(universal_class,union(X1,X2)) = null_class
    | ~ member(universal_class,X2) ),
    inference(spm,[status(thm)],[c_0_124,c_0_120]) ).

cnf(c_0_130,negated_conjecture,
    ( unordered_pair(union(X1,X2),esk9_0) = null_class
    | ~ member(esk9_0,X2) ),
    inference(spm,[status(thm)],[c_0_125,c_0_120]) ).

cnf(c_0_131,negated_conjecture,
    ~ member(esk8_0,X1),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_126]),c_0_55]),c_0_37]) ).

cnf(c_0_132,plain,
    ( unordered_pair(null_class,null_class) = unordered_pair(null_class,X1)
    | member(X1,universal_class) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_36]),c_0_128])]) ).

cnf(c_0_133,plain,
    ~ member(universal_class,X1),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_129]),c_0_55]),c_0_37]) ).

cnf(c_0_134,negated_conjecture,
    ~ member(esk9_0,X1),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_130]),c_0_55]),c_0_37]) ).

cnf(c_0_135,negated_conjecture,
    unordered_pair(null_class,singleton(null_class)) != ordered_pair(esk8_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_136,negated_conjecture,
    unordered_pair(null_class,esk8_0) = unordered_pair(null_class,null_class),
    inference(spm,[status(thm)],[c_0_131,c_0_132]) ).

cnf(c_0_137,plain,
    unordered_pair(null_class,null_class) = unordered_pair(null_class,universal_class),
    inference(spm,[status(thm)],[c_0_133,c_0_132]) ).

cnf(c_0_138,negated_conjecture,
    unordered_pair(null_class,esk9_0) = unordered_pair(null_class,null_class),
    inference(spm,[status(thm)],[c_0_134,c_0_132]) ).

cnf(c_0_139,negated_conjecture,
    unordered_pair(null_class,unordered_pair(null_class,null_class)) != unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_60]),c_0_69]) ).

cnf(c_0_140,negated_conjecture,
    unordered_pair(null_class,esk8_0) = unordered_pair(null_class,universal_class),
    inference(rw,[status(thm)],[c_0_136,c_0_137]) ).

cnf(c_0_141,plain,
    ( member(esk1_2(X1,X2),universal_class)
    | subclass(X1,X2) ),
    inference(spm,[status(thm)],[c_0_37,c_0_61]) ).

cnf(c_0_142,plain,
    ( esk1_2(unordered_pair(X1,X2),X3) = X1
    | subclass(unordered_pair(X1,X2),X3)
    | ~ member(X2,X3) ),
    inference(spm,[status(thm)],[c_0_62,c_0_71]) ).

cnf(c_0_143,negated_conjecture,
    member(null_class,unordered_pair(null_class,null_class)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_138]),c_0_128])]) ).

cnf(c_0_144,negated_conjecture,
    unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,null_class)) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
    inference(rw,[status(thm)],[c_0_139,c_0_95]) ).

cnf(c_0_145,negated_conjecture,
    ( unordered_pair(X1,null_class) = unordered_pair(null_class,universal_class)
    | ~ subclass(unordered_pair(X1,null_class),unordered_pair(null_class,universal_class)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_140]),c_0_78]) ).

cnf(c_0_146,plain,
    ( member(X1,universal_class)
    | subclass(unordered_pair(X1,X2),X3)
    | ~ member(X2,X3) ),
    inference(spm,[status(thm)],[c_0_141,c_0_142]) ).

cnf(c_0_147,negated_conjecture,
    member(null_class,unordered_pair(null_class,universal_class)),
    inference(rw,[status(thm)],[c_0_143,c_0_137]) ).

cnf(c_0_148,negated_conjecture,
    unordered_pair(null_class,unordered_pair(esk8_0,null_class)) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
    inference(rw,[status(thm)],[c_0_144,c_0_88]) ).

cnf(c_0_149,negated_conjecture,
    ( unordered_pair(X1,null_class) = unordered_pair(null_class,universal_class)
    | member(X1,universal_class) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147])]) ).

cnf(c_0_150,negated_conjecture,
    unordered_pair(null_class,unordered_pair(esk8_0,null_class)) != unordered_pair(null_class,unordered_pair(null_class,universal_class)),
    inference(rw,[status(thm)],[c_0_148,c_0_137]) ).

cnf(c_0_151,negated_conjecture,
    unordered_pair(esk8_0,null_class) = unordered_pair(null_class,universal_class),
    inference(spm,[status(thm)],[c_0_131,c_0_149]) ).

cnf(c_0_152,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_151])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET105+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  9 19:17:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.22/2.41  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.22/2.41  # Preprocessing time       : 0.020 s
% 0.22/2.41  
% 0.22/2.41  # Proof found!
% 0.22/2.41  # SZS status Theorem
% 0.22/2.41  # SZS output start CNFRefutation
% See solution above
% 0.22/2.41  # Proof object total steps             : 153
% 0.22/2.41  # Proof object clause steps            : 117
% 0.22/2.41  # Proof object formula steps           : 36
% 0.22/2.41  # Proof object conjectures             : 36
% 0.22/2.41  # Proof object clause conjectures      : 33
% 0.22/2.41  # Proof object formula conjectures     : 3
% 0.22/2.41  # Proof object initial clauses used    : 27
% 0.22/2.41  # Proof object initial formulas used   : 18
% 0.22/2.41  # Proof object generating inferences   : 77
% 0.22/2.41  # Proof object simplifying inferences  : 58
% 0.22/2.41  # Training examples: 0 positive, 0 negative
% 0.22/2.41  # Parsed axioms                        : 44
% 0.22/2.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/2.41  # Initial clauses                      : 92
% 0.22/2.41  # Removed in clause preprocessing      : 8
% 0.22/2.41  # Initial clauses in saturation        : 84
% 0.22/2.41  # Processed clauses                    : 5846
% 0.22/2.41  # ...of these trivial                  : 51
% 0.22/2.41  # ...subsumed                          : 3763
% 0.22/2.41  # ...remaining for further processing  : 2032
% 0.22/2.41  # Other redundant clauses eliminated   : 53
% 0.22/2.41  # Clauses deleted for lack of memory   : 0
% 0.22/2.41  # Backward-subsumed                    : 75
% 0.22/2.41  # Backward-rewritten                   : 356
% 0.22/2.41  # Generated clauses                    : 103961
% 0.22/2.41  # ...of the previous two non-trivial   : 95089
% 0.22/2.41  # Contextual simplify-reflections      : 1489
% 0.22/2.41  # Paramodulations                      : 103672
% 0.22/2.41  # Factorizations                       : 197
% 0.22/2.41  # Equation resolutions                 : 55
% 0.22/2.41  # Current number of processed clauses  : 1560
% 0.22/2.41  #    Positive orientable unit clauses  : 98
% 0.22/2.41  #    Positive unorientable unit clauses: 0
% 0.22/2.41  #    Negative unit clauses             : 80
% 0.22/2.41  #    Non-unit-clauses                  : 1382
% 0.22/2.41  # Current number of unprocessed clauses: 77038
% 0.22/2.41  # ...number of literals in the above   : 318095
% 0.22/2.41  # Current number of archived formulas  : 0
% 0.22/2.41  # Current number of archived clauses   : 476
% 0.22/2.41  # Clause-clause subsumption calls (NU) : 515315
% 0.22/2.41  # Rec. Clause-clause subsumption calls : 286558
% 0.22/2.41  # Non-unit clause-clause subsumptions  : 3014
% 0.22/2.41  # Unit Clause-clause subsumption calls : 24522
% 0.22/2.41  # Rewrite failures with RHS unbound    : 0
% 0.22/2.41  # BW rewrite match attempts            : 200
% 0.22/2.41  # BW rewrite match successes           : 50
% 0.22/2.41  # Condensation attempts                : 0
% 0.22/2.41  # Condensation successes               : 0
% 0.22/2.41  # Termbank termtop insertions          : 3224496
% 0.22/2.41  
% 0.22/2.41  # -------------------------------------------------
% 0.22/2.41  # User time                : 1.632 s
% 0.22/2.41  # System time              : 0.051 s
% 0.22/2.41  # Total time               : 1.683 s
% 0.22/2.41  # Maximum resident set size: 89168 pages
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 0.22/23.42  eprover: CPU time limit exceeded, terminating
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: eprover: No such file or directory
% 0.22/23.42  CPU time limit exceeded, terminating
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------