↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP050^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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:04:12 AM UTC 2026

% Result   : Theorem 1.20s 0.52s
% Output   : CNFRefutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   34 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   72 (   7 equ;   0 cnn)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  252 (  25   ~;  23   |;   3   &; 193   @)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   7 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   5 con; 0-4 aty)
%            Number of variables   :   66 (   4   ^;  62   !;   0   ?;  66   :)

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

thf(decl_sort2,type,
    a: $tType ).

thf(decl_sort3,type,
    set_Pr1986765409at_nat: $tType ).

thf(decl_sort4,type,
    nat: $tType ).

thf(decl_sort5,type,
    list_P559422087at_nat: $tType ).

thf(decl_33,type,
    e_a: ( product_prod_nat_nat > a ) > set_Pr1986765409at_nat ).

thf(decl_38,type,
    isPath_a: ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat > nat > $o ).

thf(decl_39,type,
    isShortestPath_a: ( product_prod_nat_nat > a ) > nat > list_P559422087at_nat > nat > $o ).

thf(decl_46,type,
    inf_in586391887at_nat: set_Pr1986765409at_nat > set_Pr1986765409at_nat > set_Pr1986765409at_nat ).

thf(decl_51,type,
    set_Pr2131844118at_nat: list_P559422087at_nat > set_Pr1986765409at_nat ).

thf(decl_55,type,
    ord_le841296385at_nat: set_Pr1986765409at_nat > set_Pr1986765409at_nat > $o ).

thf(decl_60,type,
    member701585322at_nat: product_prod_nat_nat > set_Pr1986765409at_nat > $o ).

thf(decl_63,type,
    c: product_prod_nat_nat > a ).

thf(decl_64,type,
    edges: set_Pr1986765409at_nat ).

thf(decl_65,type,
    p: list_P559422087at_nat ).

thf(decl_66,type,
    s: nat ).

thf(decl_67,type,
    t: nat ).

thf(decl_152,type,
    esk85_2: set_Pr1986765409at_nat > set_Pr1986765409at_nat > product_prod_nat_nat ).

thf(fact_257_inf_Oorder__iff,axiom,
    ( ord_le841296385at_nat
    = ( ^ [X28: set_Pr1986765409at_nat,X29: set_Pr1986765409at_nat] :
          ( X28
          = ( inf_in586391887at_nat @ X28 @ X29 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_257_inf_Oorder__iff) ).

thf(fact_200_Graph_OshortestPath__is__path,axiom,
    ! [X17: product_prod_nat_nat > a,X2: nat,X14: list_P559422087at_nat,X15: nat] :
      ( ( isShortestPath_a @ X17 @ X2 @ X14 @ X15 )
     => ( isPath_a @ X17 @ X2 @ X14 @ X15 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_200_Graph_OshortestPath__is__path) ).

thf(fact_164_IntD2,axiom,
    ! [X377: product_prod_nat_nat,X3: set_Pr1986765409at_nat,X4: set_Pr1986765409at_nat] :
      ( ( member701585322at_nat @ X377 @ ( inf_in586391887at_nat @ X3 @ X4 ) )
     => ( member701585322at_nat @ X377 @ X4 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_164_IntD2) ).

thf(fact_146_Graph_OisPath__edgeset,axiom,
    ! [X17: product_prod_nat_nat > a,X2: nat,X14: list_P559422087at_nat,X15: nat,X16: product_prod_nat_nat] :
      ( ( isPath_a @ X17 @ X2 @ X14 @ X15 )
     => ( ( member701585322at_nat @ X16 @ ( set_Pr2131844118at_nat @ X14 ) )
       => ( member701585322at_nat @ X16 @ ( e_a @ X17 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_146_Graph_OisPath__edgeset) ).

thf(fact_0_SP,axiom,
    isShortestPath_a @ c @ s @ p @ t,
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_0_SP) ).

thf(fact_130_subset__eq,axiom,
    ( ord_le841296385at_nat
    = ( ^ [X313: set_Pr1986765409at_nat,X314: set_Pr1986765409at_nat] :
        ! [X336: product_prod_nat_nat] :
          ( ( member701585322at_nat @ X336 @ X313 )
         => ( member701585322at_nat @ X336 @ X314 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_130_subset__eq) ).

thf(fact_1_SP__EDGES,axiom,
    ord_le841296385at_nat @ edges @ ( set_Pr2131844118at_nat @ p ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',fact_1_SP__EDGES) ).

thf(conj_0,conjecture,
    ord_le841296385at_nat @ edges @ ( e_a @ c ),
    file('/export/starexec/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p',conj_0) ).

thf(c_0_8,plain,
    ! [X1647: set_Pr1986765409at_nat,X1648: set_Pr1986765409at_nat] :
      ( ( ord_le841296385at_nat @ X1647 @ X1648 )
    <=> ( X1647
        = ( inf_in586391887at_nat @ X1647 @ X1648 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_257_inf_Oorder__iff])]) ).

thf(c_0_9,plain,
    ! [X2246: product_prod_nat_nat > a,X2247: nat,X2248: list_P559422087at_nat,X2249: nat] :
      ( ~ ( isShortestPath_a @ X2246 @ X2247 @ X2248 @ X2249 )
      | ( isPath_a @ X2246 @ X2247 @ X2248 @ X2249 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_200_Graph_OshortestPath__is__path])])]) ).

thf(c_0_10,plain,
    ! [X2167: product_prod_nat_nat,X2168: set_Pr1986765409at_nat,X2169: set_Pr1986765409at_nat] :
      ( ~ ( member701585322at_nat @ X2167 @ ( inf_in586391887at_nat @ X2168 @ X2169 ) )
      | ( member701585322at_nat @ X2167 @ X2169 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_164_IntD2])])]) ).

thf(c_0_11,plain,
    ! [X2368: set_Pr1986765409at_nat,X2369: set_Pr1986765409at_nat] :
      ( ( ~ ( ord_le841296385at_nat @ X2368 @ X2369 )
        | ( X2368
          = ( inf_in586391887at_nat @ X2368 @ X2369 ) ) )
      & ( ( X2368
         != ( inf_in586391887at_nat @ X2368 @ X2369 ) )
        | ( ord_le841296385at_nat @ X2368 @ X2369 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

thf(c_0_12,plain,
    ! [X2114: product_prod_nat_nat > a,X2115: nat,X2116: list_P559422087at_nat,X2117: nat,X2118: product_prod_nat_nat] :
      ( ~ ( isPath_a @ X2114 @ X2115 @ X2116 @ X2117 )
      | ~ ( member701585322at_nat @ X2118 @ ( set_Pr2131844118at_nat @ X2116 ) )
      | ( member701585322at_nat @ X2118 @ ( e_a @ X2114 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_146_Graph_OisPath__edgeset])])]) ).

thf(c_0_13,plain,
    ! [X2: nat,X17: product_prod_nat_nat > a,X14: list_P559422087at_nat,X8: nat] :
      ( ( isPath_a @ X17 @ X2 @ X14 @ X8 )
      | ~ ( isShortestPath_a @ X17 @ X2 @ X14 @ X8 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_14,plain,
    isShortestPath_a @ c @ s @ p @ t,
    inference(split_conjunct,[status(thm)],[fact_0_SP]) ).

thf(c_0_15,plain,
    ! [X3: set_Pr1986765409at_nat,X5: product_prod_nat_nat,X4: set_Pr1986765409at_nat] :
      ( ( member701585322at_nat @ X5 @ X4 )
      | ~ ( member701585322at_nat @ X5 @ ( inf_in586391887at_nat @ X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_16,plain,
    ! [X3: set_Pr1986765409at_nat,X4: set_Pr1986765409at_nat] :
      ( ( X3
        = ( inf_in586391887at_nat @ X3 @ X4 ) )
      | ~ ( ord_le841296385at_nat @ X3 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_17,plain,
    ! [X1630: set_Pr1986765409at_nat,X1631: set_Pr1986765409at_nat] :
      ( ( ord_le841296385at_nat @ X1630 @ X1631 )
    <=> ! [X336: product_prod_nat_nat] :
          ( ( member701585322at_nat @ X336 @ X1630 )
         => ( member701585322at_nat @ X336 @ X1631 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_130_subset__eq])]) ).

thf(c_0_18,plain,
    ! [X2: nat,X5: product_prod_nat_nat,X8: nat,X17: product_prod_nat_nat > a,X14: list_P559422087at_nat] :
      ( ( member701585322at_nat @ X5 @ ( e_a @ X17 ) )
      | ~ ( isPath_a @ X17 @ X2 @ X14 @ X8 )
      | ~ ( member701585322at_nat @ X5 @ ( set_Pr2131844118at_nat @ X14 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_19,plain,
    isPath_a @ c @ s @ p @ t,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_20,plain,
    ! [X5: product_prod_nat_nat,X4: set_Pr1986765409at_nat,X3: set_Pr1986765409at_nat] :
      ( ( member701585322at_nat @ X5 @ X3 )
      | ~ ( member701585322at_nat @ X5 @ X4 )
      | ~ ( ord_le841296385at_nat @ X4 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

thf(c_0_21,plain,
    ord_le841296385at_nat @ edges @ ( set_Pr2131844118at_nat @ p ),
    inference(split_conjunct,[status(thm)],[fact_1_SP__EDGES]) ).

thf(c_0_22,negated_conjecture,
    ~ ( ord_le841296385at_nat @ edges @ ( e_a @ c ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_23,plain,
    ! [X2073: set_Pr1986765409at_nat,X2074: set_Pr1986765409at_nat,X2075: product_prod_nat_nat,X2076: set_Pr1986765409at_nat,X2077: set_Pr1986765409at_nat] :
      ( ( ~ ( ord_le841296385at_nat @ X2073 @ X2074 )
        | ~ ( member701585322at_nat @ X2075 @ X2073 )
        | ( member701585322at_nat @ X2075 @ X2074 ) )
      & ( ( member701585322at_nat @ ( esk85_2 @ X2076 @ X2077 ) @ X2076 )
        | ( ord_le841296385at_nat @ X2076 @ X2077 ) )
      & ( ~ ( member701585322at_nat @ ( esk85_2 @ X2076 @ X2077 ) @ X2077 )
        | ( ord_le841296385at_nat @ X2076 @ X2077 ) ) ),
    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)],[c_0_17])])])])])])]) ).

thf(c_0_24,plain,
    ! [X5: product_prod_nat_nat] :
      ( ( member701585322at_nat @ X5 @ ( e_a @ c ) )
      | ~ ( member701585322at_nat @ X5 @ ( set_Pr2131844118at_nat @ p ) ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_25,plain,
    ! [X5: product_prod_nat_nat] :
      ( ( member701585322at_nat @ X5 @ ( set_Pr2131844118at_nat @ p ) )
      | ~ ( member701585322at_nat @ X5 @ edges ) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

thf(c_0_26,negated_conjecture,
    ~ ( ord_le841296385at_nat @ edges @ ( e_a @ c ) ),
    inference(fof_simplification,[status(thm)],[c_0_22]) ).

thf(c_0_27,plain,
    ! [X3: set_Pr1986765409at_nat,X4: set_Pr1986765409at_nat] :
      ( ( ord_le841296385at_nat @ X3 @ X4 )
      | ~ ( member701585322at_nat @ ( esk85_2 @ X3 @ X4 ) @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

thf(c_0_28,plain,
    ! [X5: product_prod_nat_nat] :
      ( ( member701585322at_nat @ X5 @ ( e_a @ c ) )
      | ~ ( member701585322at_nat @ X5 @ edges ) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

thf(c_0_29,negated_conjecture,
    ~ ( ord_le841296385at_nat @ edges @ ( e_a @ c ) ),
    inference(fof_nnf,[status(thm)],[c_0_26]) ).

thf(c_0_30,plain,
    ! [X3: set_Pr1986765409at_nat] :
      ( ( ord_le841296385at_nat @ X3 @ ( e_a @ c ) )
      | ~ ( member701585322at_nat @ ( esk85_2 @ X3 @ ( e_a @ c ) ) @ edges ) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

thf(c_0_31,plain,
    ! [X3: set_Pr1986765409at_nat,X4: set_Pr1986765409at_nat] :
      ( ( member701585322at_nat @ ( esk85_2 @ X3 @ X4 ) @ X3 )
      | ( ord_le841296385at_nat @ X3 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

thf(c_0_32,negated_conjecture,
    ~ ( ord_le841296385at_nat @ edges @ ( e_a @ c ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_33,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP050^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n004.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 19:43:21 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.20/0.28  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.8kn7x1B5Ya/E---3.1_1741471.p
% 1.20/0.52  % Version: 3.5.1-ho
% 1.20/0.52  % Preprocessing class: HSLSSMSSSSMNHSA.
% 1.20/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.52  % Starting sh1 with 1500s (5) cores
% 1.20/0.52  % Starting new_ho_8 with 300s (1) cores
% 1.20/0.52  % Starting new_ho_11 with 300s (1) cores
% 1.20/0.52  % Starting sh5l with 300s (1) cores
% 1.20/0.52  % sh1 with pid 1741484 completed with status 0
% 1.20/0.52  % Result found by sh1
% 1.20/0.52  % Preprocessing class: HSLSSMSSSSMNHSA.
% 1.20/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.52  % Starting sh1 with 1500s (5) cores
% 1.20/0.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.20/0.52  % No SInE strategy applied
% 1.20/0.52  % Search class: HGHSM-FSLM32-MHSFFSBN
% 1.20/0.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.52  % Starting SubtermCWHack with 136s (1) cores
% 1.20/0.52  % Starting sh1 with 151s (1) cores
% 1.20/0.52  % Starting full_lambda_9 with 136s (1) cores
% 1.20/0.52  % Starting ehoh_best with 136s (1) cores
% 1.20/0.52  % Starting post_as_ho6 with 136s (1) cores
% 1.20/0.52  % post_as_ho6 with pid 1741495 completed with status 0
% 1.20/0.52  % Result found by post_as_ho6
% 1.20/0.52  % Preprocessing class: HSLSSMSSSSMNHSA.
% 1.20/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.52  % Starting sh1 with 1500s (5) cores
% 1.20/0.52  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.20/0.52  % No SInE strategy applied
% 1.20/0.52  % Search class: HGHSM-FSLM32-MHSFFSBN
% 1.20/0.52  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.52  % Starting SubtermCWHack with 136s (1) cores
% 1.20/0.52  % Starting sh1 with 151s (1) cores
% 1.20/0.52  % Starting full_lambda_9 with 136s (1) cores
% 1.20/0.52  % Starting ehoh_best with 136s (1) cores
% 1.20/0.52  % Starting post_as_ho6 with 136s (1) cores
% 1.20/0.52  % Preprocessing time       : 0.010 s
% 1.20/0.52  % Presaturation interreduction done
% 1.20/0.52  
% 1.20/0.52  % Proof found!
% 1.20/0.52  % SZS status Theorem
% 1.20/0.52  % SZS output start CNFRefutation
% See solution above
% 1.20/0.52  % Parsed axioms                        : 408
% 1.20/0.52  % Removed by relevancy pruning/SinE    : 0
% 1.20/0.52  % Initial clauses                      : 707
% 1.20/0.52  % Removed in clause preprocessing      : 94
% 1.20/0.52  % Initial clauses in saturation        : 613
% 1.20/0.52  % Processed clauses                    : 973
% 1.20/0.52  % ...of these trivial                  : 24
% 1.20/0.52  % ...subsumed                          : 256
% 1.20/0.52  % ...remaining for further processing  : 693
% 1.20/0.52  % Other redundant clauses eliminated   : 82
% 1.20/0.52  % Clauses deleted for lack of memory   : 0
% 1.20/0.52  % Backward-subsumed                    : 5
% 1.20/0.52  % Backward-rewritten                   : 5
% 1.20/0.52  % Generated clauses                    : 932
% 1.20/0.52  % ...of the previous two non-redundant : 757
% 1.20/0.52  % ...aggressively subsumed             : 0
% 1.20/0.52  % Contextual simplify-reflections      : 1
% 1.20/0.52  % Paramodulations                      : 843
% 1.20/0.52  % Factorizations                       : 2
% 1.20/0.52  % NegExts                              : 0
% 1.20/0.52  % Equation resolutions                 : 84
% 1.20/0.52  % Disequality decompositions           : 0
% 1.20/0.52  % Total rewrite steps                  : 155
% 1.20/0.52  % ...of those cached                   : 112
% 1.20/0.52  % Propositional unsat checks           : 0
% 1.20/0.52  %    Propositional check models        : 0
% 1.20/0.52  %    Propositional check unsatisfiable : 0
% 1.20/0.52  %    Propositional clauses             : 0
% 1.20/0.52  %    Propositional clauses after purity: 0
% 1.20/0.52  %    Propositional unsat core size     : 0
% 1.20/0.52  %    Propositional preprocessing time  : 0.000
% 1.20/0.52  %    Propositional encoding time       : 0.000
% 1.20/0.52  %    Propositional solver time         : 0.000
% 1.20/0.52  %    Success case prop preproc time    : 0.000
% 1.20/0.52  %    Success case prop encoding time   : 0.000
% 1.20/0.52  %    Success case prop solver time     : 0.000
% 1.20/0.52  % Current number of processed clauses  : 260
% 1.20/0.52  %    Positive orientable unit clauses  : 43
% 1.20/0.52  %    Positive unorientable unit clauses: 0
% 1.20/0.52  %    Negative unit clauses             : 2
% 1.20/0.52  %    Non-unit-clauses                  : 215
% 1.20/0.52  % Current number of unprocessed clauses: 743
% 1.20/0.52  % ...number of literals in the above   : 2264
% 1.20/0.52  % Current number of archived formulas  : 0
% 1.20/0.52  % Current number of archived clauses   : 357
% 1.20/0.52  % Clause-clause subsumption calls (NU) : 35509
% 1.20/0.52  % Rec. Clause-clause subsumption calls : 25158
% 1.20/0.52  % Non-unit clause-clause subsumptions  : 276
% 1.20/0.52  % Unit Clause-clause subsumption calls : 244
% 1.20/0.52  % Rewrite failures with RHS unbound    : 0
% 1.20/0.52  % BW rewrite match attempts            : 21
% 1.20/0.52  % BW rewrite match successes           : 5
% 1.20/0.52  % Condensation attempts                : 973
% 1.20/0.52  % Condensation successes               : 14
% 1.20/0.52  % Termbank termtop insertions          : 69955
% 1.20/0.52  % Search garbage collected termcells   : 14627
% 1.20/0.52  
% 1.20/0.52  % -------------------------------------------------
% 1.20/0.52  % User time                : 0.126 s
% 1.20/0.52  % System time              : 0.014 s
% 1.20/0.52  % Total time               : 0.140 s
% 1.20/0.52  % Maximum resident set size: 6816 pages
% 1.20/0.52  
% 1.20/0.52  % -------------------------------------------------
% 1.20/0.52  % User time                : 0.650 s
% 1.20/0.52  % System time              : 0.061 s
% 1.20/0.52  % Total time               : 0.711 s
% 1.20/0.52  % Maximum resident set size: 5888 pages
% 1.20/0.52  % E exiting
%------------------------------------------------------------------------------