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

View Problem - Process Solution

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

% Computer : n023.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 : Thu Jul 14 16:50:33 EDT 2022

% Result   : Theorem 0.46s 49.64s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   38 (  14 unt;   0 def)
%            Number of atoms       :  132 (   0 equ)
%            Maximal formula atoms :   23 (   3 avg)
%            Number of connectives :  163 (  69   ~;  65   |;  14   &)
%                                         (   1 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-5 aty)
%            Number of variables   :   67 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t5_closure3,conjecture,
    ! [X1,X2] :
      ( m1_pboole(X2,X1)
     => ! [X3] :
          ( m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X1,X2)))
         => ! [X4] :
              ( m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X1,X2)))
             => ! [X5] :
                  ( m1_subset_1(X5,k1_zfmisc_1(k1_closure2(X1,X2)))
                 => ( ( r2_closure3(X1,X2,X3,X4)
                      & r2_closure3(X1,X2,X4,X5) )
                   => r2_closure3(X1,X2,X3,X5) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t5_closure3) ).

fof(d2_closure3,axiom,
    ! [X1,X2] :
      ( m1_pboole(X2,X1)
     => ! [X3] :
          ( m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X1,X2)))
         => ! [X4] :
              ( m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X1,X2)))
             => ( r2_closure3(X1,X2,X3,X4)
              <=> ! [X5] :
                    ~ ( r2_hidden(X5,X3)
                      & ! [X6] :
                          ~ ( r2_hidden(X6,X4)
                            & r1_tarski(X6,X5) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d2_closure3) ).

fof(t1_xboole_1,axiom,
    ! [X1,X2,X3] :
      ( ( r1_tarski(X1,X2)
        & r1_tarski(X2,X3) )
     => r1_tarski(X1,X3) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_xboole_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( m1_pboole(X2,X1)
       => ! [X3] :
            ( m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X1,X2)))
           => ! [X4] :
                ( m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X1,X2)))
               => ! [X5] :
                    ( m1_subset_1(X5,k1_zfmisc_1(k1_closure2(X1,X2)))
                   => ( ( r2_closure3(X1,X2,X3,X4)
                        & r2_closure3(X1,X2,X4,X5) )
                     => r2_closure3(X1,X2,X3,X5) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[t5_closure3]) ).

fof(c_0_4,plain,
    ! [X7,X8,X9,X10,X11,X14] :
      ( ( r2_hidden(esk6_5(X7,X8,X9,X10,X11),X10)
        | ~ r2_hidden(X11,X9)
        | ~ r2_closure3(X7,X8,X9,X10)
        | ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_pboole(X8,X7) )
      & ( r1_tarski(esk6_5(X7,X8,X9,X10,X11),X11)
        | ~ r2_hidden(X11,X9)
        | ~ r2_closure3(X7,X8,X9,X10)
        | ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_pboole(X8,X7) )
      & ( r2_hidden(esk7_4(X7,X8,X9,X10),X9)
        | r2_closure3(X7,X8,X9,X10)
        | ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_pboole(X8,X7) )
      & ( ~ r2_hidden(X14,X10)
        | ~ r1_tarski(X14,esk7_4(X7,X8,X9,X10))
        | r2_closure3(X7,X8,X9,X10)
        | ~ m1_subset_1(X10,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_subset_1(X9,k1_zfmisc_1(k1_closure2(X7,X8)))
        | ~ m1_pboole(X8,X7) ) ),
    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)],[d2_closure3])])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ( m1_pboole(esk2_0,esk1_0)
    & m1_subset_1(esk3_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0)))
    & m1_subset_1(esk4_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0)))
    & m1_subset_1(esk5_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0)))
    & r2_closure3(esk1_0,esk2_0,esk3_0,esk4_0)
    & r2_closure3(esk1_0,esk2_0,esk4_0,esk5_0)
    & ~ r2_closure3(esk1_0,esk2_0,esk3_0,esk5_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)],[c_0_3])])])])]) ).

cnf(c_0_6,plain,
    ( r2_hidden(esk6_5(X2,X1,X3,X4,X5),X4)
    | ~ m1_pboole(X1,X2)
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ r2_closure3(X2,X1,X3,X4)
    | ~ r2_hidden(X5,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    m1_subset_1(esk4_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    m1_pboole(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( r2_closure3(X2,X1,X3,X4)
    | r2_hidden(esk7_4(X2,X1,X3,X4),X3)
    | ~ m1_pboole(X1,X2)
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    m1_subset_1(esk5_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( r1_tarski(esk6_5(X2,X1,X3,X4,X5),X5)
    | ~ m1_pboole(X1,X2)
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ r2_closure3(X2,X1,X3,X4)
    | ~ r2_hidden(X5,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_12,negated_conjecture,
    ( r2_hidden(esk6_5(esk1_0,esk2_0,X1,esk4_0,X2),esk4_0)
    | ~ r2_hidden(X2,X1)
    | ~ r2_closure3(esk1_0,esk2_0,X1,esk4_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).

cnf(c_0_13,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    r2_closure3(esk1_0,esk2_0,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    ( r2_hidden(esk7_4(esk1_0,esk2_0,X1,esk5_0),X1)
    | r2_closure3(esk1_0,esk2_0,X1,esk5_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).

cnf(c_0_16,negated_conjecture,
    ~ r2_closure3(esk1_0,esk2_0,esk3_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_17,negated_conjecture,
    ( r1_tarski(esk6_5(esk1_0,esk2_0,X1,esk4_0,X2),X2)
    | ~ r2_hidden(X2,X1)
    | ~ r2_closure3(esk1_0,esk2_0,X1,esk4_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_8])]) ).

cnf(c_0_18,plain,
    ( r2_closure3(X2,X1,X3,X4)
    | ~ m1_pboole(X1,X2)
    | ~ m1_subset_1(X3,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ m1_subset_1(X4,k1_zfmisc_1(k1_closure2(X2,X1)))
    | ~ r1_tarski(X5,esk7_4(X2,X1,X3,X4))
    | ~ r2_hidden(X5,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_19,negated_conjecture,
    ( r2_hidden(esk6_5(esk1_0,esk2_0,X1,esk5_0,X2),esk5_0)
    | ~ r2_hidden(X2,X1)
    | ~ r2_closure3(esk1_0,esk2_0,X1,esk5_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_8])]) ).

cnf(c_0_20,negated_conjecture,
    r2_closure3(esk1_0,esk2_0,esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_21,negated_conjecture,
    ( r2_hidden(esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,X1),esk4_0)
    | ~ r2_hidden(X1,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_22,negated_conjecture,
    r2_hidden(esk7_4(esk1_0,esk2_0,esk3_0,esk5_0),esk3_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_16]) ).

fof(c_0_23,plain,
    ! [X4,X5,X6] :
      ( ~ r1_tarski(X4,X5)
      | ~ r1_tarski(X5,X6)
      | r1_tarski(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).

cnf(c_0_24,negated_conjecture,
    ( r1_tarski(esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,X1),X1)
    | ~ r2_hidden(X1,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_14])]) ).

cnf(c_0_25,negated_conjecture,
    ( r1_tarski(esk6_5(esk1_0,esk2_0,X1,esk5_0,X2),X2)
    | ~ r2_hidden(X2,X1)
    | ~ r2_closure3(esk1_0,esk2_0,X1,esk5_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_8])]) ).

cnf(c_0_26,negated_conjecture,
    ( r2_closure3(esk1_0,esk2_0,X1,esk5_0)
    | ~ r1_tarski(X2,esk7_4(esk1_0,esk2_0,X1,esk5_0))
    | ~ r2_hidden(X2,esk5_0)
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_closure2(esk1_0,esk2_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_8])]) ).

cnf(c_0_27,negated_conjecture,
    ( r2_hidden(esk6_5(esk1_0,esk2_0,esk4_0,esk5_0,X1),esk5_0)
    | ~ r2_hidden(X1,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_7]),c_0_20])]) ).

cnf(c_0_28,negated_conjecture,
    r2_hidden(esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0)),esk4_0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_29,plain,
    ( r1_tarski(X1,X2)
    | ~ r1_tarski(X3,X2)
    | ~ r1_tarski(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_30,negated_conjecture,
    r1_tarski(esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0)),esk7_4(esk1_0,esk2_0,esk3_0,esk5_0)),
    inference(spm,[status(thm)],[c_0_24,c_0_22]) ).

cnf(c_0_31,negated_conjecture,
    ( r1_tarski(esk6_5(esk1_0,esk2_0,esk4_0,esk5_0,X1),X1)
    | ~ r2_hidden(X1,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_7]),c_0_20])]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ r1_tarski(X1,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))
    | ~ r2_hidden(X1,esk5_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_16]) ).

cnf(c_0_33,negated_conjecture,
    r2_hidden(esk6_5(esk1_0,esk2_0,esk4_0,esk5_0,esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))),esk5_0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    ( r1_tarski(X1,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))
    | ~ r1_tarski(X1,esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    r1_tarski(esk6_5(esk1_0,esk2_0,esk4_0,esk5_0,esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))),esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))),
    inference(spm,[status(thm)],[c_0_31,c_0_28]) ).

cnf(c_0_36,negated_conjecture,
    ~ r1_tarski(esk6_5(esk1_0,esk2_0,esk4_0,esk5_0,esk6_5(esk1_0,esk2_0,esk3_0,esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,esk5_0))),esk7_4(esk1_0,esk2_0,esk3_0,esk5_0)),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ALG224+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n023.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 : Wed Jun  8 04:44:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.32/23.39  eprover: CPU time limit exceeded, terminating
% 0.32/23.40  eprover: CPU time limit exceeded, terminating
% 0.32/23.40  eprover: CPU time limit exceeded, terminating
% 0.32/23.41  eprover: CPU time limit exceeded, terminating
% 0.44/46.41  eprover: CPU time limit exceeded, terminating
% 0.44/46.42  eprover: CPU time limit exceeded, terminating
% 0.44/46.42  eprover: CPU time limit exceeded, terminating
% 0.44/46.46  eprover: CPU time limit exceeded, terminating
% 0.46/49.64  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.46/49.64  
% 0.46/49.64  # Failure: Resource limit exceeded (time)
% 0.46/49.64  # OLD status Res
% 0.46/49.64  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.46/49.64  # Preprocessing time       : 0.016 s
% 0.46/49.64  # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.46/49.64  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.46/49.64  # Preprocessing time       : 0.015 s
% 0.46/49.64  
% 0.46/49.64  # Failure: Out of unprocessed clauses!
% 0.46/49.64  # OLD status GaveUp
% 0.46/49.64  # Parsed axioms                        : 42
% 0.46/49.64  # Removed by relevancy pruning/SinE    : 34
% 0.46/49.64  # Initial clauses                      : 19
% 0.46/49.64  # Removed in clause preprocessing      : 0
% 0.46/49.64  # Initial clauses in saturation        : 19
% 0.46/49.64  # Processed clauses                    : 32
% 0.46/49.64  # ...of these trivial                  : 0
% 0.46/49.64  # ...subsumed                          : 6
% 0.46/49.64  # ...remaining for further processing  : 26
% 0.46/49.64  # Other redundant clauses eliminated   : 0
% 0.46/49.64  # Clauses deleted for lack of memory   : 0
% 0.46/49.64  # Backward-subsumed                    : 1
% 0.46/49.64  # Backward-rewritten                   : 0
% 0.46/49.64  # Generated clauses                    : 15
% 0.46/49.64  # ...of the previous two non-trivial   : 15
% 0.46/49.64  # Contextual simplify-reflections      : 9
% 0.46/49.64  # Paramodulations                      : 15
% 0.46/49.64  # Factorizations                       : 0
% 0.46/49.64  # Equation resolutions                 : 0
% 0.46/49.64  # Current number of processed clauses  : 25
% 0.46/49.64  #    Positive orientable unit clauses  : 10
% 0.46/49.64  #    Positive unorientable unit clauses: 0
% 0.46/49.64  #    Negative unit clauses             : 2
% 0.46/49.64  #    Non-unit-clauses                  : 13
% 0.46/49.64  # Current number of unprocessed clauses: 0
% 0.46/49.64  # ...number of literals in the above   : 0
% 0.46/49.64  # Current number of archived formulas  : 0
% 0.46/49.64  # Current number of archived clauses   : 1
% 0.46/49.64  # Clause-clause subsumption calls (NU) : 123
% 0.46/49.64  # Rec. Clause-clause subsumption calls : 29
% 0.46/49.64  # Non-unit clause-clause subsumptions  : 16
% 0.46/49.64  # Unit Clause-clause subsumption calls : 0
% 0.46/49.64  # Rewrite failures with RHS unbound    : 0
% 0.46/49.64  # BW rewrite match attempts            : 1
% 0.46/49.64  # BW rewrite match successes           : 0
% 0.46/49.64  # Condensation attempts                : 0
% 0.46/49.64  # Condensation successes               : 0
% 0.46/49.64  # Termbank termtop insertions          : 2220
% 0.46/49.64  
% 0.46/49.64  # -------------------------------------------------
% 0.46/49.64  # User time                : 0.015 s
% 0.46/49.64  # System time              : 0.002 s
% 0.46/49.64  # Total time               : 0.017 s
% 0.46/49.64  # Maximum resident set size: 2980 pages
% 0.46/49.64  # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.46/49.64  
% 0.46/49.64  # Failure: Resource limit exceeded (time)
% 0.46/49.64  # OLD status Res
% 0.46/49.64  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.46/49.64  # Preprocessing time       : 0.016 s
% 0.46/49.64  # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.46/49.64  # Preprocessing time       : 0.017 s
% 0.46/49.64  
% 0.46/49.64  # Proof found!
% 0.46/49.64  # SZS status Theorem
% 0.46/49.64  # SZS output start CNFRefutation
% See solution above
% 0.46/49.64  # Proof object total steps             : 38
% 0.46/49.64  # Proof object clause steps            : 31
% 0.46/49.64  # Proof object formula steps           : 7
% 0.46/49.64  # Proof object conjectures             : 29
% 0.46/49.64  # Proof object clause conjectures      : 26
% 0.46/49.64  # Proof object formula conjectures     : 3
% 0.46/49.64  # Proof object initial clauses used    : 12
% 0.46/49.64  # Proof object initial formulas used   : 3
% 0.46/49.64  # Proof object generating inferences   : 19
% 0.46/49.64  # Proof object simplifying inferences  : 23
% 0.46/49.64  # Training examples: 0 positive, 0 negative
% 0.46/49.64  # Parsed axioms                        : 42
% 0.46/49.64  # Removed by relevancy pruning/SinE    : 0
% 0.46/49.64  # Initial clauses                      : 83
% 0.46/49.64  # Removed in clause preprocessing      : 6
% 0.46/49.64  # Initial clauses in saturation        : 77
% 0.46/49.64  # Processed clauses                    : 36640
% 0.46/49.64  # ...of these trivial                  : 330
% 0.46/49.64  # ...subsumed                          : 25421
% 0.46/49.64  # ...remaining for further processing  : 10889
% 0.46/49.64  # Other redundant clauses eliminated   : 0
% 0.46/49.64  # Clauses deleted for lack of memory   : 0
% 0.46/49.64  # Backward-subsumed                    : 649
% 0.46/49.64  # Backward-rewritten                   : 153
% 0.46/49.64  # Generated clauses                    : 197747
% 0.46/49.64  # ...of the previous two non-trivial   : 182510
% 0.46/49.64  # Contextual simplify-reflections      : 0
% 0.46/49.64  # Paramodulations                      : 197411
% 0.46/49.64  # Factorizations                       : 0
% 0.46/49.64  # Equation resolutions                 : 0
% 0.46/49.64  # Current number of processed clauses  : 9761
% 0.46/49.64  #    Positive orientable unit clauses  : 1271
% 0.46/49.64  #    Positive unorientable unit clauses: 0
% 0.46/49.64  #    Negative unit clauses             : 434
% 0.46/49.64  #    Non-unit-clauses                  : 8056
% 0.46/49.64  # Current number of unprocessed clauses: 135319
% 0.46/49.64  # ...number of literals in the above   : 501035
% 0.46/49.64  # Current number of archived formulas  : 0
% 0.46/49.64  # Current number of archived clauses   : 1123
% 0.46/49.64  # Clause-clause subsumption calls (NU) : 1750177
% 0.46/49.64  # Rec. Clause-clause subsumption calls : 1352103
% 0.46/49.64  # Non-unit clause-clause subsumptions  : 18698
% 0.46/49.64  # Unit Clause-clause subsumption calls : 53961
% 0.46/49.64  # Rewrite failures with RHS unbound    : 0
% 0.46/49.64  # BW rewrite match attempts            : 65375
% 0.46/49.64  # BW rewrite match successes           : 24
% 0.46/49.64  # Condensation attempts                : 0
% 0.46/49.64  # Condensation successes               : 0
% 0.46/49.64  # Termbank termtop insertions          : 3707602
% 0.46/49.64  
% 0.46/49.64  # -------------------------------------------------
% 0.46/49.64  # User time                : 3.063 s
% 0.46/49.64  # System time              : 0.074 s
% 0.46/49.64  # Total time               : 3.137 s
% 0.46/49.64  # Maximum resident set size: 115428 pages
% 0.46/69.43  eprover: CPU time limit exceeded, terminating
% 0.46/69.43  eprover: CPU time limit exceeded, terminating
% 0.46/69.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.45  eprover: No such file or directory
% 0.46/69.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.45  eprover: No such file or directory
% 0.46/69.45  eprover: CPU time limit exceeded, terminating
% 0.46/69.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.45  eprover: No such file or directory
% 0.46/69.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.45  eprover: No such file or directory
% 0.46/69.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.46  eprover: No such file or directory
% 0.46/69.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.46  eprover: No such file or directory
% 0.46/69.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.46  eprover: No such file or directory
% 0.46/69.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47  eprover: No such file or directory
% 0.46/69.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.47  eprover: No such file or directory
% 0.46/69.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47  eprover: No such file or directory
% 0.46/69.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.47  eprover: No such file or directory
% 0.46/69.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47  eprover: No such file or directory
% 0.46/69.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.47  eprover: No such file or directory
% 0.46/69.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.48  eprover: No such file or directory
% 0.46/69.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48  eprover: No such file or directory
% 0.46/69.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.48  eprover: No such file or directory
% 0.46/69.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48  eprover: No such file or directory
% 0.46/69.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.48  eprover: No such file or directory
% 0.46/69.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/69.49  eprover: No such file or directory
% 0.46/69.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49  eprover: No such file or directory
% 0.46/69.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49  eprover: No such file or directory
% 0.46/69.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49  eprover: No such file or directory
% 0.46/69.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.49  eprover: No such file or directory
% 0.46/69.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.50  eprover: No such file or directory
% 0.46/69.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.50  eprover: No such file or directory
% 0.46/69.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.51  eprover: No such file or directory
% 0.46/69.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/69.51  eprover: No such file or directory
%------------------------------------------------------------------------------