↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV094^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:34:51 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   24 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :  109 (  48 equ;   0 cnn)
%            Maximal formula atoms :   38 (   4 avg)
%            Number of connectives :  392 (  63   ~;  64   |;  27   &; 224   @)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   17 (  17   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   53 (   0   ^;  45   !;   8   ?;  53   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_23,type,
    epred1_0: a > $o ).

thf(decl_24,type,
    epred2_0: a > $o ).

thf(decl_25,type,
    esk1_0: a > a ).

thf(decl_26,type,
    esk2_1: a > a ).

thf(decl_27,type,
    esk3_1: ( a > a ) > a ).

thf(decl_28,type,
    esk4_1: ( a > a ) > a ).

thf(decl_29,type,
    esk5_2: ( a > a ) > a > a ).

thf(cEQP1_1B_pme,conjecture,
    ! [X1: a > $o,X2: a > $o] :
      ( ? [X3: a > a] :
          ( ! [X4: a] :
              ( ( X1 @ X4 )
             => ( X2 @ ( X3 @ X4 ) ) )
          & ! [X5: a] :
              ( ( X2 @ X5 )
             => ? [X4: a] :
                  ( ( X1 @ X4 )
                  & ( X5
                    = ( X3 @ X4 ) )
                  & ! [X6: a] :
                      ( ( ( X1 @ X6 )
                        & ( X5
                          = ( X3 @ X6 ) ) )
                     => ( X6 = X4 ) ) ) ) )
     => ? [X3: a > a] :
          ( ! [X4: a] :
              ( ( X2 @ X4 )
             => ( X1 @ ( X3 @ X4 ) ) )
          & ! [X5: a] :
              ( ( X1 @ X5 )
             => ? [X4: a] :
                  ( ( X2 @ X4 )
                  & ( X5
                    = ( X3 @ X4 ) )
                  & ! [X6: a] :
                      ( ( ( X2 @ X6 )
                        & ( X5
                          = ( X3 @ X6 ) ) )
                     => ( X6 = X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.MuXoI1jgrv/E---3.1_1170987.p',cEQP1_1B_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o] :
        ( ? [X3: a > a] :
            ( ! [X4: a] :
                ( ( X1 @ X4 )
               => ( X2 @ ( X3 @ X4 ) ) )
            & ! [X5: a] :
                ( ( X2 @ X5 )
               => ? [X4: a] :
                    ( ( X1 @ X4 )
                    & ( X5
                      = ( X3 @ X4 ) )
                    & ! [X6: a] :
                        ( ( ( X1 @ X6 )
                          & ( X5
                            = ( X3 @ X6 ) ) )
                       => ( X6 = X4 ) ) ) ) )
       => ? [X3: a > a] :
            ( ! [X4: a] :
                ( ( X2 @ X4 )
               => ( X1 @ ( X3 @ X4 ) ) )
            & ! [X5: a] :
                ( ( X1 @ X5 )
               => ? [X4: a] :
                    ( ( X2 @ X4 )
                    & ( X5
                      = ( X3 @ X4 ) )
                    & ! [X6: a] :
                        ( ( ( X2 @ X6 )
                          & ( X5
                            = ( X3 @ X6 ) ) )
                       => ( X6 = X4 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cEQP1_1B_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X22: a,X23: a,X25: a,X26: a > a,X29: a] :
      ( ( ~ ( epred1_0 @ X22 )
        | ( epred2_0 @ ( esk1_0 @ X22 ) ) )
      & ( ( epred1_0 @ ( esk2_1 @ X23 ) )
        | ~ ( epred2_0 @ X23 ) )
      & ( ( X23
          = ( esk1_0 @ ( esk2_1 @ X23 ) ) )
        | ~ ( epred2_0 @ X23 ) )
      & ( ~ ( epred1_0 @ X25 )
        | ( X23
         != ( esk1_0 @ X25 ) )
        | ( X25
          = ( esk2_1 @ X23 ) )
        | ~ ( epred2_0 @ X23 ) )
      & ( ( epred1_0 @ ( esk4_1 @ X26 ) )
        | ( epred2_0 @ ( esk3_1 @ X26 ) ) )
      & ( ( epred2_0 @ ( esk5_2 @ X26 @ X29 ) )
        | ~ ( epred2_0 @ X29 )
        | ( ( esk4_1 @ X26 )
         != ( X26 @ X29 ) )
        | ( epred2_0 @ ( esk3_1 @ X26 ) ) )
      & ( ( ( esk4_1 @ X26 )
          = ( X26 @ ( esk5_2 @ X26 @ X29 ) ) )
        | ~ ( epred2_0 @ X29 )
        | ( ( esk4_1 @ X26 )
         != ( X26 @ X29 ) )
        | ( epred2_0 @ ( esk3_1 @ X26 ) ) )
      & ( ( ( esk5_2 @ X26 @ X29 )
         != X29 )
        | ~ ( epred2_0 @ X29 )
        | ( ( esk4_1 @ X26 )
         != ( X26 @ X29 ) )
        | ( epred2_0 @ ( esk3_1 @ X26 ) ) )
      & ( ( epred1_0 @ ( esk4_1 @ X26 ) )
        | ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) )
      & ( ( epred2_0 @ ( esk5_2 @ X26 @ X29 ) )
        | ~ ( epred2_0 @ X29 )
        | ( ( esk4_1 @ X26 )
         != ( X26 @ X29 ) )
        | ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) )
      & ( ( ( esk4_1 @ X26 )
          = ( X26 @ ( esk5_2 @ X26 @ X29 ) ) )
        | ~ ( epred2_0 @ X29 )
        | ( ( esk4_1 @ X26 )
         != ( X26 @ X29 ) )
        | ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) )
      & ( ( ( esk5_2 @ X26 @ X29 )
         != X29 )
        | ~ ( epred2_0 @ X29 )
        | ( ( esk4_1 @ X26 )
         != ( X26 @ X29 ) )
        | ~ ( epred1_0 @ ( X26 @ ( esk3_1 @ X26 ) ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X4: a] :
      ( ( X4
        = ( esk1_0 @ ( esk2_1 @ X4 ) ) )
      | ~ ( epred2_0 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X4: a,X3: a > a] :
      ( ( ( esk4_1 @ X3 )
        = ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
      | ~ ( epred2_0 @ X4 )
      | ( ( esk4_1 @ X3 )
       != ( X3 @ X4 ) )
      | ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X4: a,X3: a > a] :
      ( ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
      | ~ ( epred2_0 @ X4 )
      | ( ( esk4_1 @ X3 )
       != ( X3 @ X4 ) )
      | ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X3: a > a,X4: a] :
      ( ( ( esk4_1 @ X3 )
        = ( X3 @ ( esk5_2 @ X3 @ X4 ) ) )
      | ( epred2_0 @ ( esk3_1 @ X3 ) )
      | ~ ( epred2_0 @ X4 )
      | ( ( esk4_1 @ X3 )
       != ( X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X3: a > a,X4: a] :
      ( ( epred2_0 @ ( esk5_2 @ X3 @ X4 ) )
      | ( epred2_0 @ ( esk3_1 @ X3 ) )
      | ~ ( epred2_0 @ X4 )
      | ( ( esk4_1 @ X3 )
       != ( X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ! [X4: a,X3: a > a] :
      ( ( ( esk5_2 @ X3 @ X4 )
       != X4 )
      | ~ ( epred2_0 @ X4 )
      | ( ( esk4_1 @ X3 )
       != ( X3 @ X4 ) )
      | ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ! [X4: a] :
      ( ( epred1_0 @ ( esk2_1 @ X4 ) )
      | ~ ( epred2_0 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ! [X3: a > a,X4: a] :
      ( ( epred2_0 @ ( esk3_1 @ X3 ) )
      | ( ( esk5_2 @ X3 @ X4 )
       != X4 )
      | ~ ( epred2_0 @ X4 )
      | ( ( esk4_1 @ X3 )
       != ( X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ! [X4: a] :
      ( ( ( esk5_2 @ esk2_1 @ X4 )
        = ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
      | ( ( esk4_1 @ esk2_1 )
       != ( esk2_1 @ X4 ) )
      | ~ ( epred1_0 @ ( esk2_1 @ ( esk3_1 @ esk2_1 ) ) )
      | ~ ( epred2_0 @ X4 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

thf(c_0_12,negated_conjecture,
    ! [X4: a] :
      ( ( ( esk5_2 @ esk2_1 @ X4 )
        = ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
      | ( epred2_0 @ ( esk3_1 @ esk2_1 ) )
      | ( ( esk4_1 @ esk2_1 )
       != ( esk2_1 @ X4 ) )
      | ~ ( epred2_0 @ X4 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_7]) ).

thf(c_0_13,negated_conjecture,
    ! [X4: a] :
      ( ( ( esk4_1 @ esk2_1 )
       != ( esk2_1 @ X4 ) )
      | ( ( esk5_2 @ esk2_1 @ X4 )
       != X4 )
      | ~ ( epred2_0 @ X4 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

thf(c_0_14,negated_conjecture,
    ! [X4: a] :
      ( ( ( esk5_2 @ esk2_1 @ X4 )
        = ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
      | ( ( esk4_1 @ esk2_1 )
       != ( esk2_1 @ X4 ) )
      | ~ ( epred2_0 @ X4 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_12]) ).

thf(c_0_15,negated_conjecture,
    ! [X4: a,X5: a] :
      ( ( X4
        = ( esk2_1 @ X5 ) )
      | ~ ( epred1_0 @ X4 )
      | ( X5
       != ( esk1_0 @ X4 ) )
      | ~ ( epred2_0 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_16,negated_conjecture,
    ! [X4: a] :
      ( ( epred2_0 @ ( esk1_0 @ X4 ) )
      | ~ ( epred1_0 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_17,negated_conjecture,
    ! [X3: a > a] :
      ( ( epred1_0 @ ( esk4_1 @ X3 ) )
      | ~ ( epred1_0 @ ( X3 @ ( esk3_1 @ X3 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_18,negated_conjecture,
    ! [X3: a > a] :
      ( ( epred1_0 @ ( esk4_1 @ X3 ) )
      | ( epred2_0 @ ( esk3_1 @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_19,negated_conjecture,
    ( ( ( esk2_1 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) )
     != ( esk4_1 @ esk2_1 ) )
    | ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]) ).

thf(c_0_20,negated_conjecture,
    ! [X4: a] :
      ( ( ( esk2_1 @ ( esk1_0 @ X4 ) )
        = X4 )
      | ~ ( epred1_0 @ X4 ) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16]) ).

thf(c_0_21,negated_conjecture,
    epred1_0 @ ( esk4_1 @ esk2_1 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_9]),c_0_18]) ).

thf(c_0_22,negated_conjecture,
    ~ ( epred2_0 @ ( esk1_0 @ ( esk4_1 @ esk2_1 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

thf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV094^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n020.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 15:10:49 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.MuXoI1jgrv/E---3.1_1170987.p
% 0.08/0.26  % Version: 3.5.1-ho
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.26  % Starting full_lambda_10 with 300s (1) cores
% 0.08/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.08/0.26  % new_ho_8 with pid 1171020 completed with status 0
% 0.08/0.26  % Result found by new_ho_8
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.26  % Starting full_lambda_10 with 300s (1) cores
% 0.08/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,10,,2,20000,1.0,true))
% 0.08/0.26  % SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.08/0.26  % Search class: HGHSF-FFSF21-SSSFFMNN
% 0.08/0.26  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26  % SubtermCWHack with pid 1171028 completed with status 0
% 0.08/0.26  % Result found by SubtermCWHack
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.08/0.26  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting post_as_ho12 with 300s (1) cores
% 0.08/0.26  % Starting new_bool_9 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho4 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho2 with 300s (1) cores
% 0.08/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.26  % Starting full_lambda_10 with 300s (1) cores
% 0.08/0.26  % Starting new_ho_8 with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,10,,2,20000,1.0,true))
% 0.08/0.26  % SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.08/0.26  % Search class: HGHSF-FFSF21-SSSFFMNN
% 0.08/0.26  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.26  % Preprocessing time       : 0.001 s
% 0.08/0.26  
% 0.08/0.26  % Proof found!
% 0.08/0.26  % SZS status Theorem
% 0.08/0.26  % SZS output start CNFRefutation
% See solution above
% 0.08/0.26  % Parsed axioms                        : 2
% 0.08/0.26  % Removed by relevancy pruning/SinE    : 1
% 0.08/0.26  % Initial clauses                      : 12
% 0.08/0.26  % Removed in clause preprocessing      : 0
% 0.08/0.26  % Initial clauses in saturation        : 12
% 0.08/0.26  % Processed clauses                    : 37
% 0.08/0.26  % ...of these trivial                  : 0
% 0.08/0.26  % ...subsumed                          : 6
% 0.08/0.26  % ...remaining for further processing  : 31
% 0.08/0.26  % Other redundant clauses eliminated   : 8
% 0.08/0.26  % Clauses deleted for lack of memory   : 0
% 0.08/0.26  % Backward-subsumed                    : 6
% 0.08/0.26  % Backward-rewritten                   : 0
% 0.08/0.26  % Generated clauses                    : 82
% 0.08/0.26  % ...of the previous two non-redundant : 68
% 0.08/0.26  % ...aggressively subsumed             : 0
% 0.08/0.26  % Contextual simplify-reflections      : 9
% 0.08/0.26  % Paramodulations                      : 74
% 0.08/0.26  % Factorizations                       : 0
% 0.08/0.26  % NegExts                              : 0
% 0.08/0.26  % Equation resolutions                 : 8
% 0.08/0.26  % Disequality decompositions           : 0
% 0.08/0.26  % Total rewrite steps                  : 8
% 0.08/0.26  % ...of those cached                   : 7
% 0.08/0.26  % Propositional unsat checks           : 0
% 0.08/0.26  %    Propositional check models        : 0
% 0.08/0.26  %    Propositional check unsatisfiable : 0
% 0.08/0.26  %    Propositional clauses             : 0
% 0.08/0.26  %    Propositional clauses after purity: 0
% 0.08/0.26  %    Propositional unsat core size     : 0
% 0.08/0.26  %    Propositional preprocessing time  : 0.000
% 0.08/0.26  %    Propositional encoding time       : 0.000
% 0.08/0.26  %    Propositional solver time         : 0.000
% 0.08/0.26  %    Success case prop preproc time    : 0.000
% 0.08/0.26  %    Success case prop encoding time   : 0.000
% 0.08/0.26  %    Success case prop solver time     : 0.000
% 0.08/0.26  % Current number of processed clauses  : 24
% 0.08/0.26  %    Positive orientable unit clauses  : 1
% 0.08/0.26  %    Positive unorientable unit clauses: 0
% 0.08/0.26  %    Negative unit clauses             : 1
% 0.08/0.26  %    Non-unit-clauses                  : 22
% 0.08/0.26  % Current number of unprocessed clauses: 43
% 0.08/0.26  % ...number of literals in the above   : 287
% 0.08/0.26  % Current number of archived formulas  : 0
% 0.08/0.26  % Current number of archived clauses   : 6
% 0.08/0.26  % Clause-clause subsumption calls (NU) : 189
% 0.08/0.26  % Rec. Clause-clause subsumption calls : 45
% 0.08/0.26  % Non-unit clause-clause subsumptions  : 19
% 0.08/0.26  % Unit Clause-clause subsumption calls : 5
% 0.08/0.26  % Rewrite failures with RHS unbound    : 0
% 0.08/0.26  % BW rewrite match attempts            : 0
% 0.08/0.26  % BW rewrite match successes           : 0
% 0.08/0.26  % Condensation attempts                : 0
% 0.08/0.26  % Condensation successes               : 0
% 0.08/0.26  % Termbank termtop insertions          : 3247
% 0.08/0.26  % Search garbage collected termcells   : 400
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.003 s
% 0.08/0.26  % System time              : 0.003 s
% 0.08/0.26  % Total time               : 0.006 s
% 0.08/0.26  % Maximum resident set size: 3636 pages
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.005 s
% 0.08/0.26  % System time              : 0.005 s
% 0.08/0.26  % Total time               : 0.010 s
% 0.08/0.26  % Maximum resident set size: 4864 pages
% 0.08/0.26  % E exiting
%------------------------------------------------------------------------------