↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET810+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.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 : Thu Sep 24 02:15:26 PM UTC 2026

% Result   : Theorem 0.09s 0.45s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  10 unt;   0 def)
%            Number of atoms       :  196 (   0 equ)
%            Maximal formula atoms :   84 (   6 avg)
%            Number of connectives :  221 (  57   ~;  98   |;  53   &)
%                                         (   5 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   4 con; 0-3 aty)
%            Number of variables   :   66 (   0 sgn  47   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thV3,conjecture,
    ! [X1,X2] :
      ( ( member(X2,on)
        & member(X1,on) )
     => ~ ( member(X2,X1)
          & member(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thV3) ).

fof(ordinal_number,axiom,
    ! [X1] :
      ( member(X1,on)
    <=> ( ! [X3] :
            ( member(X3,X1)
           => subset(X3,X1) )
        & strict_well_order(member_predicate,X1)
        & set(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+4.ax',ordinal_number) ).

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

fof(rel_member,axiom,
    ! [X3,X5] :
      ( apply(member_predicate,X3,X5)
    <=> member(X3,X5) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+4.ax',rel_member) ).

fof(strict_order,axiom,
    ! [X6,X4] :
      ( strict_order(X6,X4)
    <=> ( ! [X3,X5,X8] :
            ( ( member(X8,X4)
              & member(X5,X4)
              & member(X3,X4) )
           => ( ( apply(X6,X5,X8)
                & apply(X6,X3,X5) )
             => apply(X6,X3,X8) ) )
        & ! [X3,X5] :
            ( ( member(X5,X4)
              & member(X3,X4) )
           => ~ ( apply(X6,X5,X3)
                & apply(X6,X3,X5) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+4.ax',strict_order) ).

fof(strict_well_order,axiom,
    ! [X6,X4] :
      ( strict_well_order(X6,X4)
    <=> ( ! [X1] :
            ( ( ? [X3] : member(X3,X1)
              & subset(X1,X4) )
           => ? [X5] : least(X5,X6,X1) )
        & strict_order(X6,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+4.ax',strict_well_order) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( member(X2,on)
          & member(X1,on) )
       => ~ ( member(X2,X1)
            & member(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[thV3]) ).

fof(c_0_7,plain,
    ! [X46,X47,X48] :
      ( ( member(X48,on)
        | ~ strict_well_order(member_predicate,X48)
        | ~ set(X48)
        | ~ subset(esk4_1(X48),X48) )
      & ( member(X48,on)
        | ~ strict_well_order(member_predicate,X48)
        | ~ set(X48)
        | member(esk4_1(X48),X48) )
      & ( ~ member(X46,on)
        | subset(X47,X46)
        | ~ member(X47,X46) )
      & ( ~ member(X46,on)
        | strict_well_order(member_predicate,X46) )
      & ( ~ member(X46,on)
        | set(X46) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[ordinal_number])])])])])])]) ).

fof(c_0_8,negated_conjecture,
    ( member(esk15_0,esk14_0)
    & member(esk14_0,esk15_0)
    & member(esk15_0,on)
    & member(esk14_0,on) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

cnf(c_0_9,plain,
    ( ~ member(X2,on)
    | ~ member(X1,X2)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    member(esk14_0,on),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_11,plain,
    ! [X9,X10,X11,X12,X13] :
      ( ( subset(X12,X13)
        | ~ member(esk1_2(X12,X13),X13) )
      & ( subset(X12,X13)
        | member(esk1_2(X12,X13),X12) )
      & ( member(X11,X10)
        | ~ member(X11,X9)
        | ~ subset(X9,X10) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])])]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ member(X1,esk14_0)
    | subset(X1,esk14_0) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    member(esk15_0,esk14_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( ~ member(X3,X1)
    | ~ subset(X1,X2)
    | member(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    subset(esk15_0,esk14_0),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_16,plain,
    ! [X68,X69] :
      ( ( apply(member_predicate,X68,X69)
        | ~ member(X68,X69) )
      & ( member(X68,X69)
        | ~ apply(member_predicate,X68,X69) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rel_member])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ member(X1,esk15_0)
    | member(X1,esk14_0) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    member(esk14_0,esk15_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_19,plain,
    ! [X70,X71,X72,X73,X74,X75,X76,X77,X78] :
      ( ( strict_order(X77,X78)
        | apply(X77,esk10_2(X77,X78),esk9_2(X77,X78))
        | ~ apply(X77,esk11_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | apply(X77,esk10_2(X77,X78),esk9_2(X77,X78))
        | apply(X77,esk12_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | apply(X77,esk10_2(X77,X78),esk9_2(X77,X78))
        | apply(X77,esk11_2(X77,X78),esk12_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | apply(X77,esk10_2(X77,X78),esk9_2(X77,X78))
        | member(esk13_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | apply(X77,esk10_2(X77,X78),esk9_2(X77,X78))
        | member(esk12_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | apply(X77,esk10_2(X77,X78),esk9_2(X77,X78))
        | member(esk11_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | apply(X77,esk9_2(X77,X78),esk10_2(X77,X78))
        | ~ apply(X77,esk11_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | apply(X77,esk9_2(X77,X78),esk10_2(X77,X78))
        | apply(X77,esk12_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | apply(X77,esk9_2(X77,X78),esk10_2(X77,X78))
        | apply(X77,esk11_2(X77,X78),esk12_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | apply(X77,esk9_2(X77,X78),esk10_2(X77,X78))
        | member(esk13_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | apply(X77,esk9_2(X77,X78),esk10_2(X77,X78))
        | member(esk12_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | apply(X77,esk9_2(X77,X78),esk10_2(X77,X78))
        | member(esk11_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | member(esk10_2(X77,X78),X78)
        | ~ apply(X77,esk11_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | member(esk10_2(X77,X78),X78)
        | apply(X77,esk12_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | member(esk10_2(X77,X78),X78)
        | apply(X77,esk11_2(X77,X78),esk12_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | member(esk10_2(X77,X78),X78)
        | member(esk13_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | member(esk10_2(X77,X78),X78)
        | member(esk12_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | member(esk10_2(X77,X78),X78)
        | member(esk11_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | member(esk9_2(X77,X78),X78)
        | ~ apply(X77,esk11_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | member(esk9_2(X77,X78),X78)
        | apply(X77,esk12_2(X77,X78),esk13_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | member(esk9_2(X77,X78),X78)
        | apply(X77,esk11_2(X77,X78),esk12_2(X77,X78)) )
      & ( strict_order(X77,X78)
        | member(esk9_2(X77,X78),X78)
        | member(esk13_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | member(esk9_2(X77,X78),X78)
        | member(esk12_2(X77,X78),X78) )
      & ( strict_order(X77,X78)
        | member(esk9_2(X77,X78),X78)
        | member(esk11_2(X77,X78),X78) )
      & ( ~ strict_order(X70,X71)
        | apply(X70,X74,X76)
        | ~ apply(X70,X75,X76)
        | ~ apply(X70,X74,X75)
        | ~ member(X76,X71)
        | ~ member(X75,X71)
        | ~ member(X74,X71) )
      & ( ~ strict_order(X70,X71)
        | ~ apply(X70,X73,X72)
        | ~ apply(X70,X72,X73)
        | ~ member(X73,X71)
        | ~ member(X72,X71) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[strict_order])])])])])])]) ).

cnf(c_0_20,plain,
    ( ~ member(X1,X2)
    | apply(member_predicate,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    member(esk14_0,esk14_0),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

fof(c_0_22,plain,
    ! [X50,X51,X52,X53,X55,X56,X59] :
      ( ( strict_well_order(X55,X56)
        | ~ strict_order(X55,X56)
        | ~ least(X59,X55,esk6_2(X55,X56)) )
      & ( strict_well_order(X55,X56)
        | ~ strict_order(X55,X56)
        | member(esk7_2(X55,X56),esk6_2(X55,X56)) )
      & ( strict_well_order(X55,X56)
        | ~ strict_order(X55,X56)
        | subset(esk6_2(X55,X56),X56) )
      & ( ~ strict_well_order(X50,X51)
        | least(esk5_3(X50,X51,X52),X50,X52)
        | ~ member(X53,X52)
        | ~ subset(X52,X51) )
      & ( ~ strict_well_order(X50,X51)
        | strict_order(X50,X51) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[strict_well_order])])])])])])]) ).

cnf(c_0_23,plain,
    ( ~ member(X1,on)
    | strict_well_order(member_predicate,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_24,negated_conjecture,
    member(esk15_0,on),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_25,plain,
    ( ~ strict_order(X4,X2)
    | ~ apply(X4,X3,X1)
    | ~ apply(X4,X1,X3)
    | ~ member(X3,X2)
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    apply(member_predicate,esk14_0,esk14_0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ strict_well_order(X1,X2)
    | strict_order(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    strict_well_order(member_predicate,esk15_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ member(esk14_0,X1)
    | ~ strict_order(member_predicate,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26])]) ).

cnf(c_0_30,negated_conjecture,
    strict_order(member_predicate,esk15_0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET810+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n001.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 05:44:43 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.45  % Version: 3.5.1
% 0.09/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45  % Starting sh5l with 300s (1) cores
% 0.09/0.45  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2306732 completed with status 0
% 0.09/0.45  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45  % No SInE strategy applied
% 0.09/0.45  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.09/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.45  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.09/0.45  % Starting new_bool_3 with 189s (1) cores
% 0.09/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.09/0.45  % 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 2306743 completed with status 0
% 0.09/0.45  % Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.09/0.45  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.45  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45  % No SInE strategy applied
% 0.09/0.45  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.09/0.45  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.45  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.09/0.45  % Starting new_bool_3 with 189s (1) cores
% 0.09/0.45  % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.09/0.45  % Preprocessing time       : 0.002 s
% 0.09/0.45  % Presaturation interreduction done
% 0.09/0.45  
% 0.09/0.45  % Proof found!
% 0.09/0.45  % SZS status Theorem
% 0.09/0.45  % SZS output start CNFRefutation
% See solution above
% 0.09/0.45  % Parsed axioms                        : 20
% 0.09/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.45  % Initial clauses                      : 82
% 0.09/0.45  % Removed in clause preprocessing      : 0
% 0.09/0.45  % Initial clauses in saturation        : 82
% 0.09/0.45  % Processed clauses                    : 155
% 0.09/0.45  % ...of these trivial                  : 0
% 0.09/0.45  % ...subsumed                          : 0
% 0.09/0.45  % ...remaining for further processing  : 155
% 0.09/0.45  % Other redundant clauses eliminated   : 3
% 0.09/0.45  % Clauses deleted for lack of memory   : 0
% 0.09/0.45  % Backward-subsumed                    : 0
% 0.09/0.45  % Backward-rewritten                   : 0
% 0.09/0.45  % Generated clauses                    : 118
% 0.09/0.45  % ...of the previous two non-redundant : 98
% 0.09/0.45  % ...aggressively subsumed             : 0
% 0.09/0.45  % Contextual simplify-reflections      : 0
% 0.09/0.45  % Paramodulations                      : 115
% 0.09/0.45  % Factorizations                       : 0
% 0.09/0.45  % NegExts                              : 0
% 0.09/0.45  % Equation resolutions                 : 3
% 0.09/0.45  % Disequality decompositions           : 0
% 0.09/0.45  % Total rewrite steps                  : 15
% 0.09/0.45  % ...of those cached                   : 9
% 0.09/0.45  % Propositional unsat checks           : 0
% 0.09/0.45  %    Propositional check models        : 0
% 0.09/0.45  %    Propositional check unsatisfiable : 0
% 0.09/0.45  %    Propositional clauses             : 0
% 0.09/0.45  %    Propositional clauses after purity: 0
% 0.09/0.45  %    Propositional unsat core size     : 0
% 0.09/0.45  %    Propositional preprocessing time  : 0.000
% 0.09/0.45  %    Propositional encoding time       : 0.000
% 0.09/0.45  %    Propositional solver time         : 0.000
% 0.09/0.45  %    Success case prop preproc time    : 0.000
% 0.09/0.45  %    Success case prop encoding time   : 0.000
% 0.09/0.45  %    Success case prop solver time     : 0.000
% 0.09/0.45  % Current number of processed clauses  : 70
% 0.09/0.45  %    Positive orientable unit clauses  : 23
% 0.09/0.45  %    Positive unorientable unit clauses: 0
% 0.09/0.45  %    Negative unit clauses             : 3
% 0.09/0.45  %    Non-unit-clauses                  : 44
% 0.09/0.45  % Current number of unprocessed clauses: 107
% 0.09/0.45  % ...number of literals in the above   : 281
% 0.09/0.45  % Current number of archived formulas  : 0
% 0.09/0.45  % Current number of archived clauses   : 82
% 0.09/0.45  % Clause-clause subsumption calls (NU) : 1739
% 0.09/0.45  % Rec. Clause-clause subsumption calls : 1217
% 0.09/0.45  % Non-unit clause-clause subsumptions  : 0
% 0.09/0.45  % Unit Clause-clause subsumption calls : 3
% 0.09/0.45  % Rewrite failures with RHS unbound    : 0
% 0.09/0.45  % BW rewrite match attempts            : 14
% 0.09/0.45  % BW rewrite match successes           : 0
% 0.09/0.45  % Condensation attempts                : 0
% 0.09/0.45  % Condensation successes               : 0
% 0.09/0.45  % Termbank termtop insertions          : 6531
% 0.09/0.45  % Search garbage collected termcells   : 1246
% 0.09/0.45  
% 0.09/0.45  % -------------------------------------------------
% 0.09/0.45  % User time                : 0.014 s
% 0.09/0.45  % System time              : 0.006 s
% 0.09/0.45  % Total time               : 0.020 s
% 0.09/0.45  % Maximum resident set size: 3412 pages
% 0.09/0.45  
% 0.09/0.45  % -------------------------------------------------
% 0.09/0.45  % User time                : 0.091 s
% 0.09/0.45  % System time              : 0.019 s
% 0.09/0.45  % Total time               : 0.110 s
% 0.09/0.45  % Maximum resident set size: 4608 pages
% 0.09/0.45  % E exiting
%------------------------------------------------------------------------------