TSTP Solution File: ITP006^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP006^5 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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  : 300s
% DateTime : Mon May 20 22:15:17 EDT 2024

% Result   : Theorem 3.38s 1.20s
% Output   : CNFRefutation 3.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   38 (   8 unt;  13 typ;   0 def)
%            Number of atoms       :   90 (   0 equ;   0 cnn)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :  503 (  41   ~;  34   |;   7   &; 397   @)
%                                         (   2 <=>;  22  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (  11 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   13 (  13   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  12 usr;   7 con; 0-4 aty)
%            Number of variables   :   60 (   0   ^  60   !;   0   ?;  60   :)

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

thf(decl_22,type,
    bool: del ).

thf(decl_24,type,
    arr: del > del > del ).

thf(decl_25,type,
    mem: $i > del > $o ).

thf(decl_26,type,
    ap: $i > $i > $i ).

thf(decl_28,type,
    p: $i > $o ).

thf(decl_618,type,
    c_2EquantHeuristics_2EGUESS__FORALL__POINT: del > del > $i ).

thf(decl_629,type,
    esk1_0: del ).

thf(decl_630,type,
    esk2_0: del ).

thf(decl_631,type,
    esk3_0: $i ).

thf(decl_632,type,
    esk4_0: $i ).

thf(decl_633,type,
    esk5_0: $i ).

thf(decl_634,type,
    esk6_4: del > del > $i > $i > $i ).

thf(ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def,axiom,
    ! [X13: del,X20: del,X109: $i] :
      ( ( mem @ X109 @ ( arr @ X13 @ X20 ) )
     => ! [X58: $i] :
          ( ( mem @ X58 @ ( arr @ X20 @ bool ) )
         => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X20 ) @ X109 ) @ X58 ) )
          <=> ! [X2817: $i] :
                ( ( mem @ X2817 @ X13 )
               => ~ ( p @ ( ap @ X58 @ ( ap @ X109 @ X2817 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def) ).

thf(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
    ! [X13: del,X20: del,X109: $i] :
      ( ( mem @ X109 @ ( arr @ X20 @ X13 ) )
     => ! [X58: $i] :
          ( ( mem @ X58 @ ( arr @ X13 @ bool ) )
         => ! [X80: $i] :
              ( ( mem @ X80 @ ( arr @ X13 @ bool ) )
             => ( ! [X32: $i] :
                    ( ( mem @ X32 @ X13 )
                   => ( ( p @ ( ap @ X80 @ X32 ) )
                     => ( p @ ( ap @ X58 @ X32 ) ) ) )
               => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X58 ) )
                 => ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X80 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).

thf(ap_tp,axiom,
    ! [X3: del,X4: del,X5: $i] :
      ( ( mem @ X5 @ ( arr @ X3 @ X4 ) )
     => ! [X6: $i] :
          ( ( mem @ X6 @ X3 )
         => ( mem @ ( ap @ X5 @ X6 ) @ X4 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001^2.ax',ap_tp) ).

thf(c_0_3,plain,
    ! [X13: del,X20: del,X109: $i] :
      ( ( mem @ X109 @ ( arr @ X13 @ X20 ) )
     => ! [X58: $i] :
          ( ( mem @ X58 @ ( arr @ X20 @ bool ) )
         => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X20 ) @ X109 ) @ X58 ) )
          <=> ! [X2817: $i] :
                ( ( mem @ X2817 @ X13 )
               => ~ ( p @ ( ap @ X58 @ ( ap @ X109 @ X2817 ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def]) ).

thf(c_0_4,negated_conjecture,
    ~ ! [X13: del,X20: del,X109: $i] :
        ( ( mem @ X109 @ ( arr @ X20 @ X13 ) )
       => ! [X58: $i] :
            ( ( mem @ X58 @ ( arr @ X13 @ bool ) )
           => ! [X80: $i] :
                ( ( mem @ X80 @ ( arr @ X13 @ bool ) )
               => ( ! [X32: $i] :
                      ( ( mem @ X32 @ X13 )
                     => ( ( p @ ( ap @ X80 @ X32 ) )
                       => ( p @ ( ap @ X58 @ X32 ) ) ) )
                 => ( ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X58 ) )
                   => ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X13 ) @ X109 ) @ X80 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT]) ).

thf(c_0_5,plain,
    ! [X3506: del,X3507: del,X3508: $i,X3509: $i,X3510: $i] :
      ( ( ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3506 @ X3507 ) @ X3508 ) @ X3509 ) )
        | ~ ( mem @ X3510 @ X3506 )
        | ~ ( p @ ( ap @ X3509 @ ( ap @ X3508 @ X3510 ) ) )
        | ~ ( mem @ X3509 @ ( arr @ X3507 @ bool ) )
        | ~ ( mem @ X3508 @ ( arr @ X3506 @ X3507 ) ) )
      & ( ( mem @ ( esk6_4 @ X3506 @ X3507 @ X3508 @ X3509 ) @ X3506 )
        | ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3506 @ X3507 ) @ X3508 ) @ X3509 ) )
        | ~ ( mem @ X3509 @ ( arr @ X3507 @ bool ) )
        | ~ ( mem @ X3508 @ ( arr @ X3506 @ X3507 ) ) )
      & ( ( p @ ( ap @ X3509 @ ( ap @ X3508 @ ( esk6_4 @ X3506 @ X3507 @ X3508 @ X3509 ) ) ) )
        | ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3506 @ X3507 ) @ X3508 ) @ X3509 ) )
        | ~ ( mem @ X3509 @ ( arr @ X3507 @ bool ) )
        | ~ ( mem @ X3508 @ ( arr @ X3506 @ X3507 ) ) ) ),
    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_3])])])])])]) ).

thf(c_0_6,negated_conjecture,
    ! [X3503: $i] :
      ( ( mem @ esk3_0 @ ( arr @ esk2_0 @ esk1_0 ) )
      & ( mem @ esk4_0 @ ( arr @ esk1_0 @ bool ) )
      & ( mem @ esk5_0 @ ( arr @ esk1_0 @ bool ) )
      & ( ~ ( mem @ X3503 @ esk1_0 )
        | ~ ( p @ ( ap @ esk5_0 @ X3503 ) )
        | ( p @ ( ap @ esk4_0 @ X3503 ) ) )
      & ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk4_0 ) )
      & ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk5_0 ) ) ),
    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_4])])])])]) ).

thf(c_0_7,plain,
    ! [X3551: del,X3552: del,X3553: $i,X3554: $i] :
      ( ~ ( mem @ X3553 @ ( arr @ X3551 @ X3552 ) )
      | ~ ( mem @ X3554 @ X3551 )
      | ( mem @ ( ap @ X3553 @ X3554 ) @ X3552 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).

thf(c_0_8,plain,
    ! [X2: $i,X3: del,X6: $i,X5: $i,X4: del] :
      ( ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ X4 ) @ X2 ) @ X5 ) )
      | ~ ( mem @ X6 @ X3 )
      | ~ ( p @ ( ap @ X5 @ ( ap @ X2 @ X6 ) ) )
      | ~ ( mem @ X5 @ ( arr @ X4 @ bool ) )
      | ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,negated_conjecture,
    mem @ esk4_0 @ ( arr @ esk1_0 @ bool ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ! [X2: $i,X5: $i,X4: del,X3: del] :
      ( ( mem @ ( ap @ X2 @ X5 ) @ X4 )
      | ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) )
      | ~ ( mem @ X5 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,negated_conjecture,
    mem @ esk3_0 @ ( arr @ esk2_0 @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_12,negated_conjecture,
    ! [X2: $i,X5: $i,X3: del] :
      ( ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ esk1_0 ) @ X2 ) @ esk4_0 ) )
      | ~ ( p @ ( ap @ esk4_0 @ ( ap @ X2 @ X5 ) ) )
      | ~ ( mem @ X2 @ ( arr @ X3 @ esk1_0 ) )
      | ~ ( mem @ X5 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_13,negated_conjecture,
    p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_14,negated_conjecture,
    ! [X2: $i] :
      ( ( p @ ( ap @ esk4_0 @ X2 ) )
      | ~ ( mem @ X2 @ esk1_0 )
      | ~ ( p @ ( ap @ esk5_0 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_15,negated_conjecture,
    ! [X2: $i] :
      ( ( mem @ ( ap @ esk3_0 @ X2 ) @ esk1_0 )
      | ~ ( mem @ X2 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_16,negated_conjecture,
    ! [X2: $i] :
      ( ~ ( p @ ( ap @ esk4_0 @ ( ap @ esk3_0 @ X2 ) ) )
      | ~ ( mem @ X2 @ esk2_0 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13])]) ).

thf(c_0_17,negated_conjecture,
    ~ ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0 ) @ esk3_0 ) @ esk5_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_18,plain,
    ! [X2: $i,X3: del,X5: $i,X4: del] :
      ( ( mem @ ( esk6_4 @ X3 @ X4 @ X2 @ X5 ) @ X3 )
      | ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ X4 ) @ X2 ) @ X5 ) )
      | ~ ( mem @ X5 @ ( arr @ X4 @ bool ) )
      | ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_19,negated_conjecture,
    mem @ esk5_0 @ ( arr @ esk1_0 @ bool ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_20,negated_conjecture,
    ! [X2: $i] :
      ( ~ ( p @ ( ap @ esk5_0 @ ( ap @ esk3_0 @ X2 ) ) )
      | ~ ( mem @ X2 @ esk2_0 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

thf(c_0_21,negated_conjecture,
    mem @ ( esk6_4 @ esk2_0 @ esk1_0 @ esk3_0 @ esk5_0 ) @ esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_11])]) ).

thf(c_0_22,negated_conjecture,
    ~ ( p @ ( ap @ esk5_0 @ ( ap @ esk3_0 @ ( esk6_4 @ esk2_0 @ esk1_0 @ esk3_0 @ esk5_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

thf(c_0_23,plain,
    ! [X2: $i,X3: del,X5: $i,X4: del] :
      ( ( p @ ( ap @ X2 @ ( ap @ X5 @ ( esk6_4 @ X3 @ X4 @ X5 @ X2 ) ) ) )
      | ( p @ ( ap @ ( ap @ ( c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X3 @ X4 ) @ X5 ) @ X2 ) )
      | ~ ( mem @ X2 @ ( arr @ X4 @ bool ) )
      | ~ ( mem @ X5 @ ( arr @ X3 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_11])]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : ITP006^5 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n005.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat May 18 15:56:38 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.23/0.50  Running higher-order theorem proving
% 0.23/0.50  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/benchmark/theBenchmark.p
% 3.38/1.20  # Version: 3.1.0-ho
% 3.38/1.20  # Preprocessing class: HMLMSMLLSSLNSFA.
% 3.38/1.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.38/1.20  # Starting post_as_ho7 with 1200s (4) cores
% 3.38/1.20  # Starting full_lambda_5 with 600s (2) cores
% 3.38/1.20  # Starting full_lambda_9 with 300s (1) cores
% 3.38/1.20  # Starting full_lambda_7 with 300s (1) cores
% 3.38/1.20  # post_as_ho7 with pid 21081 completed with status 0
% 3.38/1.20  # Result found by post_as_ho7
% 3.38/1.20  # Preprocessing class: HMLMSMLLSSLNSFA.
% 3.38/1.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.38/1.20  # Starting post_as_ho7 with 1200s (4) cores
% 3.38/1.20  # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 3.38/1.20  # Search class: HGHSM-FSLS32-DSFFFFNN
% 3.38/1.20  # partial match(2): FGHSM-FSLS32-DFFFFFNN
% 3.38/1.20  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 3.38/1.20  # Starting SAT001_MinMin_p005000_rr_RG with 360s (1) cores
% 3.38/1.20  # Starting post_as_ho7 with 121s (1) cores
% 3.38/1.20  # Starting new_bool_3 with 181s (1) cores
% 3.38/1.20  # Starting new_bool_1 with 181s (1) cores
% 3.38/1.20  # post_as_ho7 with pid 21128 completed with status 0
% 3.38/1.20  # Result found by post_as_ho7
% 3.38/1.20  # Preprocessing class: HMLMSMLLSSLNSFA.
% 3.38/1.20  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.38/1.20  # Starting post_as_ho7 with 1200s (4) cores
% 3.38/1.20  # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 3.38/1.20  # Search class: HGHSM-FSLS32-DSFFFFNN
% 3.38/1.20  # partial match(2): FGHSM-FSLS32-DFFFFFNN
% 3.38/1.20  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 3.38/1.20  # Starting SAT001_MinMin_p005000_rr_RG with 360s (1) cores
% 3.38/1.20  # Starting post_as_ho7 with 121s (1) cores
% 3.38/1.20  # Preprocessing time       : 0.018 s
% 3.38/1.20  
% 3.38/1.20  # Proof found!
% 3.38/1.20  # SZS status Theorem
% 3.38/1.20  # SZS output start CNFRefutation
% See solution above
% 3.38/1.20  # Parsed axioms                        : 4394
% 3.38/1.20  # Removed by relevancy pruning/SinE    : 4212
% 3.38/1.20  # Initial clauses                      : 1267
% 3.38/1.20  # Removed in clause preprocessing      : 901
% 3.38/1.20  # Initial clauses in saturation        : 366
% 3.38/1.20  # Processed clauses                    : 466
% 3.38/1.20  # ...of these trivial                  : 1
% 3.38/1.20  # ...subsumed                          : 29
% 3.38/1.20  # ...remaining for further processing  : 436
% 3.38/1.20  # Other redundant clauses eliminated   : 34
% 3.38/1.20  # Clauses deleted for lack of memory   : 0
% 3.38/1.20  # Backward-subsumed                    : 0
% 3.38/1.20  # Backward-rewritten                   : 1
% 3.38/1.20  # Generated clauses                    : 8767
% 3.38/1.20  # ...of the previous two non-redundant : 8703
% 3.38/1.20  # ...aggressively subsumed             : 0
% 3.38/1.20  # Contextual simplify-reflections      : 3
% 3.38/1.20  # Paramodulations                      : 8638
% 3.38/1.20  # Factorizations                       : 0
% 3.38/1.20  # NegExts                              : 8
% 3.38/1.20  # Equation resolutions                 : 41
% 3.38/1.20  # Disequality decompositions           : 0
% 3.38/1.20  # Total rewrite steps                  : 65
% 3.38/1.20  # ...of those cached                   : 50
% 3.38/1.20  # Propositional unsat checks           : 0
% 3.38/1.20  #    Propositional check models        : 0
% 3.38/1.20  #    Propositional check unsatisfiable : 0
% 3.38/1.20  #    Propositional clauses             : 0
% 3.38/1.20  #    Propositional clauses after purity: 0
% 3.38/1.20  #    Propositional unsat core size     : 0
% 3.38/1.20  #    Propositional preprocessing time  : 0.000
% 3.38/1.20  #    Propositional encoding time       : 0.000
% 3.38/1.20  #    Propositional solver time         : 0.000
% 3.38/1.20  #    Success case prop preproc time    : 0.000
% 3.38/1.20  #    Success case prop encoding time   : 0.000
% 3.38/1.20  #    Success case prop solver time     : 0.000
% 3.38/1.20  # Current number of processed clauses  : 434
% 3.38/1.20  #    Positive orientable unit clauses  : 26
% 3.38/1.20  #    Positive unorientable unit clauses: 4
% 3.38/1.20  #    Negative unit clauses             : 7
% 3.38/1.20  #    Non-unit-clauses                  : 397
% 3.38/1.20  # Current number of unprocessed clauses: 8579
% 3.38/1.20  # ...number of literals in the above   : 57353
% 3.38/1.20  # Current number of archived formulas  : 0
% 3.38/1.20  # Current number of archived clauses   : 1
% 3.38/1.20  # Clause-clause subsumption calls (NU) : 44350
% 3.38/1.20  # Rec. Clause-clause subsumption calls : 1811
% 3.38/1.20  # Non-unit clause-clause subsumptions  : 27
% 3.38/1.20  # Unit Clause-clause subsumption calls : 546
% 3.38/1.20  # Rewrite failures with RHS unbound    : 0
% 3.38/1.20  # BW rewrite match attempts            : 3317
% 3.38/1.20  # BW rewrite match successes           : 15
% 3.38/1.20  # Condensation attempts                : 0
% 3.38/1.20  # Condensation successes               : 0
% 3.38/1.20  # Termbank termtop insertions          : 1039202
% 3.38/1.20  # Search garbage collected termcells   : 85399
% 3.38/1.20  
% 3.38/1.20  # -------------------------------------------------
% 3.38/1.20  # User time                : 0.402 s
% 3.38/1.20  # System time              : 0.023 s
% 3.38/1.20  # Total time               : 0.425 s
% 3.38/1.20  # Maximum resident set size: 15832 pages
% 3.38/1.20  
% 3.38/1.20  # -------------------------------------------------
% 3.38/1.20  # User time                : 1.565 s
% 3.38/1.20  # System time              : 0.093 s
% 3.38/1.20  # Total time               : 1.658 s
% 3.38/1.20  # Maximum resident set size: 12888 pages
% 3.38/1.20  % E---3.1 exiting
% 3.38/1.20  % E exiting
%------------------------------------------------------------------------------