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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n013.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:18:18 EDT 2022

% Result   : Theorem 1.07s 187.26s
% Output   : CNFRefutation 1.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  10 unt;   0 def)
%            Number of atoms       :  144 (  34 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  179 (  75   ~;  82   |;  12   &)
%                                         (   4 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-3 aty)
%            Number of variables   :  108 (   7 sgn  43   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_wellord1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2,X3] :
          ( X3 = fiber(X1,X2)
        <=> ! [X4] :
              ( in(X4,X3)
            <=> ( X4 != X2
                & in(ordered_pair(X4,X2),X1) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_wellord1) ).

fof(d5_tarski,axiom,
    ! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).

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

fof(commutativity_k2_tarski,axiom,
    ! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).

fof(t16_wellord1,axiom,
    ! [X1,X2,X3] :
      ( relation(X3)
     => ( in(X1,relation_restriction(X3,X2))
      <=> ( in(X1,X3)
          & in(X1,cartesian_product2(X2,X2)) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_wellord1) ).

fof(t21_wellord1,conjecture,
    ! [X1,X2,X3] :
      ( relation(X3)
     => subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_wellord1) ).

fof(dt_k2_wellord1,axiom,
    ! [X1,X2] :
      ( relation(X1)
     => relation(relation_restriction(X1,X2)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_wellord1) ).

fof(c_0_7,plain,
    ! [X5,X6,X7,X8,X8,X6,X7] :
      ( ( X8 != X6
        | ~ in(X8,X7)
        | X7 != fiber(X5,X6)
        | ~ relation(X5) )
      & ( in(ordered_pair(X8,X6),X5)
        | ~ in(X8,X7)
        | X7 != fiber(X5,X6)
        | ~ relation(X5) )
      & ( X8 = X6
        | ~ in(ordered_pair(X8,X6),X5)
        | in(X8,X7)
        | X7 != fiber(X5,X6)
        | ~ relation(X5) )
      & ( ~ in(esk1_3(X5,X6,X7),X7)
        | esk1_3(X5,X6,X7) = X6
        | ~ in(ordered_pair(esk1_3(X5,X6,X7),X6),X5)
        | X7 = fiber(X5,X6)
        | ~ relation(X5) )
      & ( esk1_3(X5,X6,X7) != X6
        | in(esk1_3(X5,X6,X7),X7)
        | X7 = fiber(X5,X6)
        | ~ relation(X5) )
      & ( in(ordered_pair(esk1_3(X5,X6,X7),X6),X5)
        | in(esk1_3(X5,X6,X7),X7)
        | X7 = fiber(X5,X6)
        | ~ relation(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)],[d1_wellord1])])])])])])]) ).

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

cnf(c_0_9,plain,
    ( in(ordered_pair(X4,X3),X1)
    | ~ relation(X1)
    | X2 != fiber(X1,X3)
    | ~ in(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_11,plain,
    ( in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)
    | X2 != fiber(X1,X3)
    | ~ relation(X1)
    | ~ in(X4,X2) ),
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

fof(c_0_12,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subset(X4,X5)
        | ~ in(X6,X4)
        | in(X6,X5) )
      & ( in(esk2_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ in(esk2_2(X4,X5),X5)
        | subset(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)],[d3_tarski])])])])])])]) ).

fof(c_0_13,plain,
    ! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
    inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).

cnf(c_0_14,plain,
    ( in(X4,X2)
    | X4 = X3
    | ~ relation(X1)
    | X2 != fiber(X1,X3)
    | ~ in(ordered_pair(X4,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_15,plain,
    ! [X4,X5,X6] :
      ( ( in(X4,X6)
        | ~ in(X4,relation_restriction(X6,X5))
        | ~ relation(X6) )
      & ( in(X4,cartesian_product2(X5,X5))
        | ~ in(X4,relation_restriction(X6,X5))
        | ~ relation(X6) )
      & ( ~ in(X4,X6)
        | ~ in(X4,cartesian_product2(X5,X5))
        | in(X4,relation_restriction(X6,X5))
        | ~ relation(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])]) ).

cnf(c_0_16,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | ~ relation(X3)
    | ~ in(X1,fiber(X3,X2)) ),
    inference(er,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( X3 = X4
    | in(X4,X2)
    | X2 != fiber(X1,X3)
    | ~ relation(X1)
    | ~ in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1) ),
    inference(rw,[status(thm)],[c_0_14,c_0_10]) ).

cnf(c_0_20,plain,
    ( in(X2,X1)
    | ~ relation(X1)
    | ~ in(X2,relation_restriction(X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    ( subset(fiber(X1,X2),X3)
    | in(unordered_pair(unordered_pair(X2,esk2_2(fiber(X1,X2),X3)),singleton(esk2_2(fiber(X1,X2),X3))),X1)
    | ~ relation(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_22,plain,
    ( X1 = X2
    | in(X2,X3)
    | X3 != fiber(X4,X1)
    | ~ relation(X4)
    | ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X4) ),
    inference(spm,[status(thm)],[c_0_19,c_0_18]) ).

cnf(c_0_23,plain,
    ( subset(fiber(relation_restriction(X1,X2),X3),X4)
    | in(unordered_pair(unordered_pair(X3,esk2_2(fiber(relation_restriction(X1,X2),X3),X4)),singleton(esk2_2(fiber(relation_restriction(X1,X2),X3),X4))),X1)
    | ~ relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_24,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( relation(X3)
       => subset(fiber(relation_restriction(X3,X1),X2),fiber(X3,X2)) ),
    inference(assume_negation,[status(cth)],[t21_wellord1]) ).

cnf(c_0_25,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_26,plain,
    ( esk2_2(fiber(relation_restriction(X1,X2),X3),X4) = X3
    | subset(fiber(relation_restriction(X1,X2),X3),X4)
    | in(esk2_2(fiber(relation_restriction(X1,X2),X3),X4),X5)
    | X5 != fiber(X1,X3)
    | ~ relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( ~ relation(X1)
    | X2 != fiber(X1,X3)
    | ~ in(X4,X2)
    | X4 != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_28,negated_conjecture,
    ( relation(esk11_0)
    & ~ subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).

cnf(c_0_29,plain,
    ( esk2_2(fiber(relation_restriction(X1,X2),X3),X4) = X3
    | subset(fiber(relation_restriction(X1,X2),X3),X4)
    | X4 != fiber(X1,X3)
    | ~ relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( X1 != fiber(X2,X3)
    | ~ relation(X2)
    | ~ in(X3,X1) ),
    inference(er,[status(thm)],[c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ~ subset(fiber(relation_restriction(esk11_0,esk9_0),esk10_0),fiber(esk11_0,esk10_0)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_32,plain,
    ( subset(fiber(relation_restriction(X1,X2),X3),X4)
    | in(X3,fiber(relation_restriction(X1,X2),X3))
    | X4 != fiber(X1,X3)
    | ~ relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    relation(esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,plain,
    ( ~ relation(X1)
    | ~ in(X2,fiber(X1,X2)) ),
    inference(er,[status(thm)],[c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    ( in(esk10_0,fiber(relation_restriction(esk11_0,esk9_0),esk10_0))
    | ~ relation(relation_restriction(esk11_0,esk9_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).

fof(c_0_36,plain,
    ! [X3,X4] :
      ( ~ relation(X3)
      | relation(relation_restriction(X3,X4)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])])]) ).

cnf(c_0_37,negated_conjecture,
    ~ relation(relation_restriction(esk11_0,esk9_0)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    ( relation(relation_restriction(X1,X2))
    | ~ relation(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SEU251+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n013.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 : Mon Jun 20 04:54:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.31/23.39  eprover: CPU time limit exceeded, terminating
% 0.31/23.40  eprover: CPU time limit exceeded, terminating
% 0.31/23.42  eprover: CPU time limit exceeded, terminating
% 0.33/24.76  eprover: CPU time limit exceeded, terminating
% 0.44/46.41  eprover: CPU time limit exceeded, terminating
% 0.44/46.41  eprover: CPU time limit exceeded, terminating
% 0.44/46.43  eprover: CPU time limit exceeded, terminating
% 0.44/47.77  eprover: CPU time limit exceeded, terminating
% 0.53/69.42  eprover: CPU time limit exceeded, terminating
% 0.53/69.42  eprover: CPU time limit exceeded, terminating
% 0.53/69.44  eprover: CPU time limit exceeded, terminating
% 0.54/70.78  eprover: CPU time limit exceeded, terminating
% 0.65/92.43  eprover: CPU time limit exceeded, terminating
% 0.65/92.44  eprover: CPU time limit exceeded, terminating
% 0.65/92.46  eprover: CPU time limit exceeded, terminating
% 0.65/93.79  eprover: CPU time limit exceeded, terminating
% 0.75/115.45  eprover: CPU time limit exceeded, terminating
% 0.75/115.50  eprover: CPU time limit exceeded, terminating
% 0.75/116.82  eprover: CPU time limit exceeded, terminating
% 0.75/117.46  eprover: CPU time limit exceeded, terminating
% 0.86/138.49  eprover: CPU time limit exceeded, terminating
% 0.86/139.19  eprover: CPU time limit exceeded, terminating
% 0.86/139.84  eprover: CPU time limit exceeded, terminating
% 0.86/140.47  eprover: CPU time limit exceeded, terminating
% 0.97/161.53  eprover: CPU time limit exceeded, terminating
% 0.97/162.20  eprover: CPU time limit exceeded, terminating
% 0.97/162.87  eprover: CPU time limit exceeded, terminating
% 0.98/163.51  eprover: CPU time limit exceeded, terminating
% 1.06/185.26  eprover: CPU time limit exceeded, terminating
% 1.07/185.93  eprover: CPU time limit exceeded, terminating
% 1.07/186.53  eprover: CPU time limit exceeded, terminating
% 1.07/186.81  eprover: CPU time limit exceeded, terminating
% 1.07/187.26  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 1.07/187.26  # Preprocessing time       : 0.016 s
% 1.07/187.26  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # Preprocessing time       : 0.017 s
% 1.07/187.26  # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # Preprocessing time       : 0.008 s
% 1.07/187.26  # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 1.07/187.26  # Preprocessing time       : 0.016 s
% 1.07/187.26  # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 1.07/187.26  # Preprocessing time       : 0.015 s
% 1.07/187.26  
% 1.07/187.26  # Failure: Out of unprocessed clauses!
% 1.07/187.26  # OLD status GaveUp
% 1.07/187.26  # Parsed axioms                        : 40
% 1.07/187.26  # Removed by relevancy pruning/SinE    : 29
% 1.07/187.26  # Initial clauses                      : 19
% 1.07/187.26  # Removed in clause preprocessing      : 0
% 1.07/187.26  # Initial clauses in saturation        : 19
% 1.07/187.26  # Processed clauses                    : 1485
% 1.07/187.26  # ...of these trivial                  : 0
% 1.07/187.26  # ...subsumed                          : 199
% 1.07/187.26  # ...remaining for further processing  : 1286
% 1.07/187.26  # Other redundant clauses eliminated   : 1
% 1.07/187.26  # Clauses deleted for lack of memory   : 7551
% 1.07/187.26  # Backward-subsumed                    : 0
% 1.07/187.26  # Backward-rewritten                   : 0
% 1.07/187.26  # Generated clauses                    : 9085
% 1.07/187.26  # ...of the previous two non-trivial   : 9017
% 1.07/187.26  # Contextual simplify-reflections      : 0
% 1.07/187.26  # Paramodulations                      : 8983
% 1.07/187.26  # Factorizations                       : 26
% 1.07/187.26  # Equation resolutions                 : 76
% 1.07/187.26  # Current number of processed clauses  : 1285
% 1.07/187.26  #    Positive orientable unit clauses  : 374
% 1.07/187.26  #    Positive unorientable unit clauses: 0
% 1.07/187.26  #    Negative unit clauses             : 3
% 1.07/187.26  #    Non-unit-clauses                  : 908
% 1.07/187.26  # Current number of unprocessed clauses: 0
% 1.07/187.26  # ...number of literals in the above   : 0
% 1.07/187.26  # Current number of archived formulas  : 0
% 1.07/187.26  # Current number of archived clauses   : 0
% 1.07/187.26  # Clause-clause subsumption calls (NU) : 74736
% 1.07/187.26  # Rec. Clause-clause subsumption calls : 10151
% 1.07/187.26  # Non-unit clause-clause subsumptions  : 199
% 1.07/187.26  # Unit Clause-clause subsumption calls : 1
% 1.07/187.26  # Rewrite failures with RHS unbound    : 0
% 1.07/187.26  # BW rewrite match attempts            : 67897
% 1.07/187.26  # BW rewrite match successes           : 0
% 1.07/187.26  # Condensation attempts                : 0
% 1.07/187.26  # Condensation successes               : 0
% 1.07/187.26  # Termbank termtop insertions          : 5187320
% 1.07/187.26  
% 1.07/187.26  # -------------------------------------------------
% 1.07/187.26  # User time                : 1.906 s
% 1.07/187.26  # System time              : 0.082 s
% 1.07/187.26  # Total time               : 1.988 s
% 1.07/187.26  # Maximum resident set size: 176180 pages
% 1.07/187.26  # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 1.07/187.26  # Preprocessing time       : 0.016 s
% 1.07/187.26  # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 1.07/187.26  # Preprocessing time       : 0.015 s
% 1.07/187.26  # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 1.07/187.26  # Preprocessing time       : 0.016 s
% 1.07/187.26  # Running protocol protocol_eprover_1f734394cb6ce69b36c9826f6782d3567d6ecd6c for 23 seconds:
% 1.07/187.26  
% 1.07/187.26  # Failure: Resource limit exceeded (time)
% 1.07/187.26  # OLD status Res
% 1.07/187.26  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,20000,1.0)
% 1.07/187.26  # Preprocessing time       : 0.015 s
% 1.07/187.26  # Running protocol protocol_eprover_e9eb28a402764e1f99b41605245cd0a359f475fb for 23 seconds:
% 1.07/187.26  # Preprocessing time       : 0.016 s
% 1.07/187.26  
% 1.07/187.26  # Proof found!
% 1.07/187.26  # SZS status Theorem
% 1.07/187.26  # SZS output start CNFRefutation
% See solution above
% 1.07/187.26  # Proof object total steps             : 40
% 1.07/187.26  # Proof object clause steps            : 25
% 1.07/187.26  # Proof object formula steps           : 15
% 1.07/187.26  # Proof object conjectures             : 8
% 1.07/187.26  # Proof object clause conjectures      : 5
% 1.07/187.26  # Proof object formula conjectures     : 3
% 1.07/187.26  # Proof object initial clauses used    : 11
% 1.07/187.26  # Proof object initial formulas used   : 7
% 1.07/187.26  # Proof object generating inferences   : 11
% 1.07/187.26  # Proof object simplifying inferences  : 8
% 1.07/187.26  # Training examples: 0 positive, 0 negative
% 1.07/187.26  # Parsed axioms                        : 40
% 1.07/187.26  # Removed by relevancy pruning/SinE    : 0
% 1.07/187.26  # Initial clauses                      : 58
% 1.07/187.26  # Removed in clause preprocessing      : 12
% 1.07/187.26  # Initial clauses in saturation        : 46
% 1.07/187.26  # Processed clauses                    : 2854
% 1.07/187.26  # ...of these trivial                  : 20
% 1.07/187.26  # ...subsumed                          : 1995
% 1.07/187.26  # ...remaining for further processing  : 839
% 1.07/187.26  # Other redundant clauses eliminated   : 3
% 1.07/187.26  # Clauses deleted for lack of memory   : 0
% 1.07/187.26  # Backward-subsumed                    : 32
% 1.07/187.26  # Backward-rewritten                   : 34
% 1.07/187.26  # Generated clauses                    : 47564
% 1.07/187.26  # ...of the previous two non-trivial   : 41824
% 1.07/187.26  # Contextual simplify-reflections      : 0
% 1.07/187.26  # Paramodulations                      : 47208
% 1.07/187.26  # Factorizations                       : 248
% 1.07/187.26  # Equation resolutions                 : 36
% 1.07/187.26  # Current number of processed clauses  : 748
% 1.07/187.26  #    Positive orientable unit clauses  : 35
% 1.07/187.26  #    Positive unorientable unit clauses: 2
% 1.07/187.26  #    Negative unit clauses             : 28
% 1.07/187.26  #    Non-unit-clauses                  : 683
% 1.07/187.26  # Current number of unprocessed clauses: 37399
% 1.07/187.26  # ...number of literals in the above   : 264907
% 1.07/187.26  # Current number of archived formulas  : 0
% 1.07/187.26  # Current number of archived clauses   : 67
% 1.07/187.26  # Clause-clause subsumption calls (NU) : 109179
% 1.07/187.26  # Rec. Clause-clause subsumption calls : 21254
% 1.07/187.26  # Non-unit clause-clause subsumptions  : 1862
% 1.07/187.26  # Unit Clause-clause subsumption calls : 5019
% 1.07/187.26  # Rewrite failures with RHS unbound    : 0
% 1.07/187.26  # BW rewrite match attempts            : 56
% 1.07/187.26  # BW rewrite match successes           : 18
% 1.07/187.26  # Condensation attempts                : 0
% 1.07/187.26  # Condensation successes               : 0
% 1.07/187.26  # Termbank termtop insertions          : 929474
% 1.07/187.26  
% 1.07/187.26  # -------------------------------------------------
% 1.07/187.26  # User time                : 0.554 s
% 1.07/187.26  # System time              : 0.025 s
% 1.07/187.26  # Total time               : 0.579 s
% 1.07/187.26  # Maximum resident set size: 35420 pages
% 1.07/208.30  eprover: CPU time limit exceeded, terminating
% 1.07/208.31  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.07/208.31  eprover: No such file or directory
% 1.07/208.32  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.07/208.32  eprover: No such file or directory
% 1.07/208.98  eprover: CPU time limit exceeded, terminating
% 1.07/208.99  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.07/208.99  eprover: No such file or directory
% 1.07/209.00  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.07/209.00  eprover: No such file or directory
% 1.07/209.82  eprover: CPU time limit exceeded, terminating
% 1.07/209.84  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.07/209.84  eprover: No such file or directory
% 1.07/209.85  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.07/209.85  eprover: No such file or directory
%------------------------------------------------------------------------------