TSTP Solution File: LCL405-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : LCL405-1 : TPTP v8.2.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n032.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 23:56:45 EDT 2024

% Result   : Unsatisfiable 6.09s 1.21s
% Output   : CNFRefutation 6.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   65 (  23 unt;   0 nHn;  24 RR)
%            Number of literals    :  131 (   0 equ;  69 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  159 (  32 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(cn_1,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).

cnf(cn_2,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).

cnf(cn_3,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).

cnf(prove_cn_71,negated_conjecture,
    ~ is_a_theorem(not(implies(implies(x,x),not(implies(y,y))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_71) ).

cnf(c_0_5,plain,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    inference(fof_simplification,[status(thm)],[condensed_detachment]) ).

cnf(c_0_6,plain,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    c_0_5 ).

cnf(c_0_7,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
    cn_1 ).

cnf(c_0_8,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X3,X2))
    | ~ is_a_theorem(implies(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_10,axiom,
    is_a_theorem(implies(implies(not(X1),X1),X1)),
    cn_2 ).

cnf(c_0_11,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,axiom,
    is_a_theorem(implies(X1,implies(not(X1),X2))),
    cn_3 ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(implies(not(X2),X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_12]) ).

cnf(c_0_15,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_12]) ).

cnf(c_0_18,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X1,implies(X4,X3)))
    | ~ is_a_theorem(implies(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_19,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
    | ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_20,plain,
    ( is_a_theorem(implies(implies(X1,X2),X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_21,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_12]) ).

cnf(c_0_22,plain,
    ( is_a_theorem(implies(X1,implies(X2,X3)))
    | ~ is_a_theorem(implies(X2,not(X1))) ),
    inference(spm,[status(thm)],[c_0_18,c_0_12]) ).

cnf(c_0_23,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X2,implies(X5,X4)))
    | ~ is_a_theorem(implies(X1,implies(X3,X5))) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,X2)))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_20]) ).

cnf(c_0_25,plain,
    ( is_a_theorem(implies(not(X1),X2))
    | ~ is_a_theorem(implies(X3,X1))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_6,c_0_21]) ).

cnf(c_0_26,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(X1,X4))
    | ~ is_a_theorem(implies(X4,X2)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_21]) ).

cnf(c_0_27,plain,
    is_a_theorem(implies(X1,implies(implies(not(not(X1)),not(X1)),X2))),
    inference(spm,[status(thm)],[c_0_22,c_0_10]) ).

cnf(c_0_28,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X1,implies(X3,not(X2)))) ),
    inference(spm,[status(thm)],[c_0_23,c_0_12]) ).

cnf(c_0_29,plain,
    ( is_a_theorem(implies(implies(X1,implies(X2,X3)),X3))
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_20]) ).

cnf(c_0_30,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X4,X2))
    | ~ is_a_theorem(implies(X1,X4)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_8]) ).

cnf(c_0_31,plain,
    ( is_a_theorem(implies(X1,implies(not(X2),X3)))
    | ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_12]) ).

cnf(c_0_32,plain,
    is_a_theorem(implies(X1,X1)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_33,plain,
    ( is_a_theorem(implies(implies(implies(not(X1),X2),X3),X3))
    | ~ is_a_theorem(implies(not(X3),X1)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_21]) ).

cnf(c_0_34,plain,
    is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_35,plain,
    ( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
    | ~ is_a_theorem(implies(X1,implies(X3,implies(not(not(X2)),not(X2))))) ),
    inference(spm,[status(thm)],[c_0_23,c_0_27]) ).

cnf(c_0_36,plain,
    is_a_theorem(implies(X1,implies(X2,implies(not(X1),X3)))),
    inference(spm,[status(thm)],[c_0_28,c_0_12]) ).

cnf(c_0_37,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(X2,implies(X3,X1)))
    | ~ is_a_theorem(X3)
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_6,c_0_29]) ).

cnf(c_0_38,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
    | ~ is_a_theorem(implies(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_7]) ).

cnf(c_0_39,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(X4,implies(X3,X1)))
    | ~ is_a_theorem(X4) ),
    inference(spm,[status(thm)],[c_0_6,c_0_19]) ).

cnf(c_0_40,plain,
    ( is_a_theorem(implies(not(implies(X1,X2)),X3))
    | ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
    inference(spm,[status(thm)],[c_0_30,c_0_10]) ).

cnf(c_0_41,plain,
    is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_42,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(implies(not(X3),X4),X2)))
    | ~ is_a_theorem(implies(not(X2),X3)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_33]) ).

cnf(c_0_43,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(not(implies(not(X2),X2)),implies(not(X2),X2)))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_34]) ).

cnf(c_0_44,plain,
    is_a_theorem(implies(not(X1),implies(X1,implies(X2,X3)))),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_45,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(X2,X1))
    | ~ is_a_theorem(implies(X3,X2))
    | ~ is_a_theorem(X3) ),
    inference(spm,[status(thm)],[c_0_37,c_0_8]) ).

cnf(c_0_46,plain,
    ( is_a_theorem(implies(implies(not(X1),X2),X1))
    | ~ is_a_theorem(implies(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_38]) ).

cnf(c_0_47,plain,
    ( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
    | ~ is_a_theorem(implies(not(implies(X3,X1)),implies(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_39,c_0_10]) ).

cnf(c_0_48,plain,
    is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_49,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(not(X2),not(X1))) ),
    inference(spm,[status(thm)],[c_0_42,c_0_27]) ).

cnf(c_0_50,plain,
    is_a_theorem(implies(not(not(implies(not(X1),X1))),X1)),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(X2,implies(not(X1),X3)))
    | ~ is_a_theorem(implies(X3,X1))
    | ~ is_a_theorem(X2) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_52,plain,
    is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,plain,
    is_a_theorem(implies(X1,not(implies(not(not(X1)),not(X1))))),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(implies(not(not(X1)),X2),X3))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_55,plain,
    is_a_theorem(implies(implies(not(not(not(X1))),not(not(X1))),X1)),
    inference(spm,[status(thm)],[c_0_49,c_0_53]) ).

cnf(c_0_56,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,X3))
    | ~ is_a_theorem(not(X3)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_21]) ).

cnf(c_0_57,negated_conjecture,
    ~ is_a_theorem(not(implies(implies(x,x),not(implies(y,y))))),
    inference(fof_simplification,[status(thm)],[prove_cn_71]) ).

cnf(c_0_58,plain,
    ( is_a_theorem(not(X1))
    | ~ is_a_theorem(implies(X1,not(X1))) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_59,plain,
    ( is_a_theorem(implies(implies(X1,X2),X3))
    | ~ is_a_theorem(not(X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_56,c_0_20]) ).

cnf(c_0_60,plain,
    is_a_theorem(implies(not(implies(X1,X1)),X2)),
    inference(spm,[status(thm)],[c_0_40,c_0_12]) ).

cnf(c_0_61,negated_conjecture,
    ~ is_a_theorem(not(implies(implies(x,x),not(implies(y,y))))),
    c_0_57 ).

cnf(c_0_62,plain,
    ( is_a_theorem(not(implies(X1,X2)))
    | ~ is_a_theorem(not(X2))
    | ~ is_a_theorem(X1) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_63,plain,
    is_a_theorem(not(not(implies(X1,X1)))),
    inference(spm,[status(thm)],[c_0_58,c_0_60]) ).

cnf(c_0_64,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : LCL405-1 : TPTP v8.2.0. Released v2.3.0.
% 0.06/0.11  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Mon May 20 03:10:07 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.09/1.21  # Version: 3.1.0
% 6.09/1.21  # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.09/1.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.09/1.21  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.09/1.21  # Starting new_bool_3 with 300s (1) cores
% 6.09/1.21  # Starting new_bool_1 with 300s (1) cores
% 6.09/1.21  # Starting sh5l with 300s (1) cores
% 6.09/1.21  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21784 completed with status 0
% 6.09/1.21  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.09/1.21  # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.09/1.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.09/1.21  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.09/1.21  # No SInE strategy applied
% 6.09/1.21  # Search class: FHUNS-FFSF21-MFFFFFNN
% 6.09/1.21  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.09/1.21  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 6.09/1.21  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.09/1.21  # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 6.09/1.21  # Starting new_bool_3 with 136s (1) cores
% 6.09/1.21  # Starting new_bool_1 with 136s (1) cores
% 6.09/1.21  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21790 completed with status 0
% 6.09/1.21  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.09/1.21  # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.09/1.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.09/1.21  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.09/1.21  # No SInE strategy applied
% 6.09/1.21  # Search class: FHUNS-FFSF21-MFFFFFNN
% 6.09/1.21  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.09/1.21  # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 6.09/1.21  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.09/1.21  # Preprocessing time       : 0.002 s
% 6.09/1.21  
% 6.09/1.21  # Proof found!
% 6.09/1.21  # SZS status Unsatisfiable
% 6.09/1.21  # SZS output start CNFRefutation
% See solution above
% 6.09/1.21  # Parsed axioms                        : 5
% 6.09/1.21  # Removed by relevancy pruning/SinE    : 0
% 6.09/1.21  # Initial clauses                      : 5
% 6.09/1.21  # Removed in clause preprocessing      : 0
% 6.09/1.21  # Initial clauses in saturation        : 5
% 6.09/1.21  # Processed clauses                    : 3286
% 6.09/1.21  # ...of these trivial                  : 47
% 6.09/1.21  # ...subsumed                          : 2618
% 6.09/1.21  # ...remaining for further processing  : 621
% 6.09/1.21  # Other redundant clauses eliminated   : 0
% 6.09/1.21  # Clauses deleted for lack of memory   : 0
% 6.09/1.21  # Backward-subsumed                    : 10
% 6.09/1.21  # Backward-rewritten                   : 1
% 6.09/1.21  # Generated clauses                    : 39131
% 6.09/1.21  # ...of the previous two non-redundant : 37483
% 6.09/1.21  # ...aggressively subsumed             : 0
% 6.09/1.21  # Contextual simplify-reflections      : 0
% 6.09/1.21  # Paramodulations                      : 39131
% 6.09/1.21  # Factorizations                       : 0
% 6.09/1.21  # NegExts                              : 0
% 6.09/1.21  # Equation resolutions                 : 0
% 6.09/1.21  # Disequality decompositions           : 0
% 6.09/1.21  # Total rewrite steps                  : 1564
% 6.09/1.21  # ...of those cached                   : 1302
% 6.09/1.21  # Propositional unsat checks           : 0
% 6.09/1.21  #    Propositional check models        : 0
% 6.09/1.21  #    Propositional check unsatisfiable : 0
% 6.09/1.21  #    Propositional clauses             : 0
% 6.09/1.21  #    Propositional clauses after purity: 0
% 6.09/1.21  #    Propositional unsat core size     : 0
% 6.09/1.21  #    Propositional preprocessing time  : 0.000
% 6.09/1.21  #    Propositional encoding time       : 0.000
% 6.09/1.21  #    Propositional solver time         : 0.000
% 6.09/1.21  #    Success case prop preproc time    : 0.000
% 6.09/1.21  #    Success case prop encoding time   : 0.000
% 6.09/1.21  #    Success case prop solver time     : 0.000
% 6.09/1.21  # Current number of processed clauses  : 610
% 6.09/1.21  #    Positive orientable unit clauses  : 55
% 6.09/1.21  #    Positive unorientable unit clauses: 0
% 6.09/1.21  #    Negative unit clauses             : 1
% 6.09/1.21  #    Non-unit-clauses                  : 554
% 6.09/1.21  # Current number of unprocessed clauses: 34140
% 6.09/1.21  # ...number of literals in the above   : 99421
% 6.09/1.21  # Current number of archived formulas  : 0
% 6.09/1.21  # Current number of archived clauses   : 11
% 6.09/1.21  # Clause-clause subsumption calls (NU) : 57620
% 6.09/1.21  # Rec. Clause-clause subsumption calls : 54827
% 6.09/1.21  # Non-unit clause-clause subsumptions  : 2628
% 6.09/1.21  # Unit Clause-clause subsumption calls : 2034
% 6.09/1.21  # Rewrite failures with RHS unbound    : 0
% 6.09/1.21  # BW rewrite match attempts            : 4080
% 6.09/1.21  # BW rewrite match successes           : 1
% 6.09/1.21  # Condensation attempts                : 0
% 6.09/1.21  # Condensation successes               : 0
% 6.09/1.21  # Termbank termtop insertions          : 649213
% 6.09/1.21  # Search garbage collected termcells   : 8
% 6.09/1.21  
% 6.09/1.21  # -------------------------------------------------
% 6.09/1.21  # User time                : 0.731 s
% 6.09/1.21  # System time              : 0.026 s
% 6.09/1.21  # Total time               : 0.757 s
% 6.09/1.21  # Maximum resident set size: 1604 pages
% 6.09/1.21  
% 6.09/1.21  # -------------------------------------------------
% 6.09/1.21  # User time                : 3.705 s
% 6.09/1.21  # System time              : 0.060 s
% 6.09/1.21  # Total time               : 3.765 s
% 6.09/1.21  # Maximum resident set size: 1696 pages
% 6.09/1.21  % E---3.1 exiting
%------------------------------------------------------------------------------