↑ Up

E-SAT---3.5.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : PUZ054-1 : TPTP v9.3.1. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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:02:27 PM UTC 2026

% Result   : Satisfiable 0.23s 0.58s
% Output   : Saturation 0.23s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_54ERROR: Could not build tree for root c_0_68ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_6,plain,
    ( ~ p(X1,s(s(X2)))
    | p(X1,s(X2)) ),
    c_0_5,
    [final] ).

cnf(c_0_7,axiom,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0)))))))))),
    initial_state,
    [final] ).

cnf(c_0_8,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(n0))))))))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]),
    [final] ).

cnf(c_0_9,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(n0)))))))),
    inference(spm,[status(thm)],[c_0_6,c_0_8]),
    [final] ).

cnf(c_0_10,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_6,c_0_9]),
    [final] ).

cnf(c_0_11,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(n0)))))),
    inference(spm,[status(thm)],[c_0_6,c_0_10]),
    [final] ).

cnf(c_0_12,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_6,c_0_11]),
    [final] ).

cnf(c_0_13,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(n0)))),
    inference(spm,[status(thm)],[c_0_6,c_0_12]),
    [final] ).

cnf(c_0_15,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(n0))),
    inference(spm,[status(thm)],[c_0_6,c_0_13]),
    [final] ).

cnf(c_0_16,plain,
    ( ~ p(s(s(X1)),X2)
    | p(X1,s(X2)) ),
    c_0_14,
    [final] ).

cnf(c_0_17,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(n0)),
    inference(spm,[status(thm)],[c_0_6,c_0_15]),
    [final] ).

cnf(c_0_18,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(n0))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]),
    [final] ).

cnf(c_0_19,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(n0)),
    inference(spm,[status(thm)],[c_0_6,c_0_18]),
    [final] ).

cnf(c_0_20,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(n0))),
    inference(spm,[status(thm)],[c_0_16,c_0_19]),
    [final] ).

cnf(c_0_21,plain,
    p(s(s(s(s(s(s(n0)))))),s(n0)),
    inference(spm,[status(thm)],[c_0_6,c_0_20]),
    [final] ).

cnf(c_0_22,plain,
    p(s(s(s(s(n0)))),s(s(n0))),
    inference(spm,[status(thm)],[c_0_16,c_0_21]),
    [final] ).

cnf(c_0_23,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(s(s(n0))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_7]),
    [final] ).

cnf(c_0_24,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(s(n0)))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_8]),
    [final] ).

cnf(c_0_25,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(n0))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_9]),
    [final] ).

cnf(c_0_26,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(n0)))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_10]),
    [final] ).

cnf(c_0_27,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_11]),
    [final] ).

cnf(c_0_28,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(n0)))))),
    inference(spm,[status(thm)],[c_0_16,c_0_12]),
    [final] ).

cnf(c_0_29,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_16,c_0_13]),
    [final] ).

cnf(c_0_30,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(n0)))),
    inference(spm,[status(thm)],[c_0_16,c_0_15]),
    [final] ).

cnf(c_0_31,plain,
    p(s(s(s(s(n0)))),s(n0)),
    inference(spm,[status(thm)],[c_0_6,c_0_22]),
    [final] ).

cnf(c_0_32,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_23]),
    [final] ).

cnf(c_0_33,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(n0))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_24]),
    [final] ).

cnf(c_0_34,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(n0)))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_25]),
    [final] ).

cnf(c_0_35,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(n0))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_26]),
    [final] ).

cnf(c_0_36,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(n0)))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_27]),
    [final] ).

cnf(c_0_37,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_28]),
    [final] ).

cnf(c_0_38,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(n0)))))),
    inference(spm,[status(thm)],[c_0_16,c_0_29]),
    [final] ).

cnf(c_0_39,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_16,c_0_30]),
    [final] ).

cnf(c_0_40,plain,
    p(s(s(s(s(s(s(n0)))))),s(s(s(n0)))),
    inference(spm,[status(thm)],[c_0_16,c_0_18]),
    [final] ).

cnf(c_0_41,plain,
    p(s(s(n0)),s(s(n0))),
    inference(spm,[status(thm)],[c_0_16,c_0_31]),
    [final] ).

cnf(c_0_42,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_32]),
    [final] ).

cnf(c_0_43,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_33]),
    [final] ).

cnf(c_0_44,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(n0))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_34]),
    [final] ).

cnf(c_0_45,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(n0)))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_35]),
    [final] ).

cnf(c_0_46,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(n0))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_36]),
    [final] ).

cnf(c_0_47,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(s(n0)))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_37]),
    [final] ).

cnf(c_0_48,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_38]),
    [final] ).

cnf(c_0_49,plain,
    p(s(s(s(s(n0)))),s(s(s(s(s(n0)))))),
    inference(spm,[status(thm)],[c_0_16,c_0_39]),
    [final] ).

cnf(c_0_51,plain,
    p(s(s(s(s(n0)))),s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_16,c_0_40]),
    [final] ).

cnf(c_0_52,plain,
    p(s(s(s(s(n0)))),s(s(s(n0)))),
    inference(spm,[status(thm)],[c_0_16,c_0_20]),
    [final] ).

cnf(c_0_53,plain,
    p(s(s(n0)),s(n0)),
    inference(spm,[status(thm)],[c_0_6,c_0_41]),
    [final] ).

cnf(c_0_55,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_42]),
    [final] ).

cnf(c_0_56,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_43]),
    [final] ).

cnf(c_0_57,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_44]),
    [final] ).

cnf(c_0_58,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(n0))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_45]),
    [final] ).

cnf(c_0_59,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(s(s(n0)))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_46]),
    [final] ).

cnf(c_0_60,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(s(n0))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_47]),
    [final] ).

cnf(c_0_61,plain,
    p(s(s(n0)),s(s(s(s(s(s(s(n0)))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_48]),
    [final] ).

cnf(c_0_62,plain,
    p(s(s(n0)),s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_49]),
    [final] ).

cnf(c_0_63,plain,
    ( ~ p(s(X1),s(X2))
    | p(s(X1),X2) ),
    c_0_50,
    [final] ).

cnf(c_0_64,plain,
    p(s(s(n0)),s(s(s(s(s(n0)))))),
    inference(spm,[status(thm)],[c_0_16,c_0_51]),
    [final] ).

cnf(c_0_65,plain,
    p(s(s(n0)),s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_16,c_0_52]),
    [final] ).

cnf(c_0_66,plain,
    p(s(s(n0)),s(s(s(n0)))),
    inference(spm,[status(thm)],[c_0_16,c_0_22]),
    [final] ).

cnf(c_0_67,plain,
    p(n0,s(s(n0))),
    inference(spm,[status(thm)],[c_0_16,c_0_53]),
    [final] ).

cnf(c_0_68,negated_conjecture,
    ~ p(s(n0),n0),
    c_0_54,
    [final] ).

cnf(c_0_69,plain,
    p(n0,s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_55]),
    [final] ).

cnf(c_0_70,plain,
    p(n0,s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_56]),
    [final] ).

cnf(c_0_71,plain,
    p(n0,s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_57]),
    [final] ).

cnf(c_0_72,plain,
    p(n0,s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_58]),
    [final] ).

cnf(c_0_73,plain,
    p(n0,s(s(s(s(s(s(s(s(s(s(n0))))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_59]),
    [final] ).

cnf(c_0_74,plain,
    p(n0,s(s(s(s(s(s(s(s(s(n0)))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_60]),
    [final] ).

cnf(c_0_75,plain,
    p(n0,s(s(s(s(s(s(s(s(n0))))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_61]),
    [final] ).

cnf(c_0_76,plain,
    p(n0,s(s(s(s(s(s(s(n0)))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_62]),
    [final] ).

cnf(c_0_77,plain,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),n0),
    inference(spm,[status(thm)],[c_0_63,c_0_17]),
    [final] ).

cnf(c_0_78,plain,
    p(n0,s(s(s(s(s(s(n0))))))),
    inference(spm,[status(thm)],[c_0_16,c_0_64]),
    [final] ).

cnf(c_0_79,plain,
    p(s(s(s(s(s(s(s(s(n0)))))))),n0),
    inference(spm,[status(thm)],[c_0_63,c_0_19]),
    [final] ).

cnf(c_0_80,plain,
    p(n0,s(s(s(s(s(n0)))))),
    inference(spm,[status(thm)],[c_0_16,c_0_65]),
    [final] ).

cnf(c_0_81,plain,
    p(s(s(s(s(s(s(n0)))))),n0),
    inference(spm,[status(thm)],[c_0_63,c_0_21]),
    [final] ).

cnf(c_0_82,plain,
    p(n0,s(s(s(s(n0))))),
    inference(spm,[status(thm)],[c_0_16,c_0_66]),
    [final] ).

cnf(c_0_83,plain,
    p(s(s(s(s(n0)))),n0),
    inference(spm,[status(thm)],[c_0_63,c_0_31]),
    [final] ).

cnf(c_0_84,plain,
    p(n0,s(s(s(n0)))),
    inference(spm,[status(thm)],[c_0_16,c_0_41]),
    [final] ).

cnf(c_0_85,plain,
    p(s(s(n0)),n0),
    inference(spm,[status(thm)],[c_0_63,c_0_53]),
    [final] ).

cnf(c_0_86,plain,
    p(n0,s(n0)),
    inference(spm,[status(thm)],[c_0_6,c_0_67]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PUZ054-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45  % Computer : n016.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Mon Sep 21 03:51:53 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52  Running first-order theorem proving
% 0.23/0.52  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.58  % Version: 3.5.1
% 0.23/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58  % Starting sh5l with 300s (1) cores
% 0.23/0.58  % new_bool_3 with pid 1486950 completed with status 1
% 0.23/0.58  % Result found by new_bool_3
% 0.23/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58  % Search class: FHUNF-FFSF11-DFFFFFNN
% 0.23/0.58  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58  % SubtermCWHack with pid 1486953 completed with status 1
% 0.23/0.58  % Result found by SubtermCWHack
% 0.23/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58  % Search class: FHUNF-FFSF11-DFFFFFNN
% 0.23/0.58  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58  % Preprocessing time       : 0.001 s
% 0.23/0.58  
% 0.23/0.58  % No proof found!
% 0.23/0.58  % SZS status Satisfiable
% 0.23/0.58  % SZS output start Saturation
% See solution above
% 0.23/0.58  % Parsed axioms                        : 5
% 0.23/0.58  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.58  % Initial clauses                      : 5
% 0.23/0.58  % Removed in clause preprocessing      : 0
% 0.23/0.58  % Initial clauses in saturation        : 5
% 0.23/0.58  % Processed clauses                    : 96
% 0.23/0.58  % ...of these trivial                  : 18
% 0.23/0.58  % ...subsumed                          : 0
% 0.23/0.58  % ...remaining for further processing  : 78
% 0.23/0.58  % Other redundant clauses eliminated   : 0
% 0.23/0.58  % Clauses deleted for lack of memory   : 0
% 0.23/0.58  % Backward-subsumed                    : 0
% 0.23/0.58  % Backward-rewritten                   : 0
% 0.23/0.58  % Generated clauses                    : 178
% 0.23/0.58  % ...of the previous two non-redundant : 91
% 0.23/0.58  % ...aggressively subsumed             : 0
% 0.23/0.58  % Contextual simplify-reflections      : 0
% 0.23/0.58  % Paramodulations                      : 178
% 0.23/0.58  % Factorizations                       : 0
% 0.23/0.58  % NegExts                              : 0
% 0.23/0.58  % Equation resolutions                 : 0
% 0.23/0.58  % Disequality decompositions           : 0
% 0.23/0.58  % Total rewrite steps                  : 105
% 0.23/0.58  % ...of those cached                   : 42
% 0.23/0.58  % Propositional unsat checks           : 0
% 0.23/0.58  %    Propositional check models        : 0
% 0.23/0.58  %    Propositional check unsatisfiable : 0
% 0.23/0.58  %    Propositional clauses             : 0
% 0.23/0.58  %    Propositional clauses after purity: 0
% 0.23/0.58  %    Propositional unsat core size     : 0
% 0.23/0.58  %    Propositional preprocessing time  : 0.000
% 0.23/0.58  %    Propositional encoding time       : 0.000
% 0.23/0.58  %    Propositional solver time         : 0.000
% 0.23/0.58  %    Success case prop preproc time    : 0.000
% 0.23/0.58  %    Success case prop encoding time   : 0.000
% 0.23/0.58  %    Success case prop solver time     : 0.000
% 0.23/0.58  % Current number of processed clauses  : 78
% 0.23/0.58  %    Positive orientable unit clauses  : 74
% 0.23/0.58  %    Positive unorientable unit clauses: 0
% 0.23/0.58  %    Negative unit clauses             : 1
% 0.23/0.58  %    Non-unit-clauses                  : 3
% 0.23/0.58  % Current number of unprocessed clauses: 0
% 0.23/0.58  % ...number of literals in the above   : 0
% 0.23/0.58  % Current number of archived formulas  : 0
% 0.23/0.58  % Current number of archived clauses   : 0
% 0.23/0.58  % Clause-clause subsumption calls (NU) : 6
% 0.23/0.58  % Rec. Clause-clause subsumption calls : 6
% 0.23/0.58  % Non-unit clause-clause subsumptions  : 0
% 0.23/0.58  % Unit Clause-clause subsumption calls : 0
% 0.23/0.58  % Rewrite failures with RHS unbound    : 0
% 0.23/0.58  % BW rewrite match attempts            : 1323
% 0.23/0.58  % BW rewrite match successes           : 0
% 0.23/0.58  % Condensation attempts                : 0
% 0.23/0.58  % Condensation successes               : 0
% 0.23/0.58  % Termbank termtop insertions          : 3095
% 0.23/0.58  % Search garbage collected termcells   : 11
% 0.23/0.58  
% 0.23/0.58  % -------------------------------------------------
% 0.23/0.58  % User time                : 0.008 s
% 0.23/0.58  % System time              : 0.002 s
% 0.23/0.58  % Total time               : 0.010 s
% 0.23/0.58  % Maximum resident set size: 3636 pages
% 0.23/0.58  
% 0.23/0.58  % -------------------------------------------------
% 0.23/0.58  % User time                : 0.008 s
% 0.23/0.58  % System time              : 0.008 s
% 0.23/0.58  % Total time               : 0.017 s
% 0.23/0.58  % Maximum resident set size: 4608 pages
% 0.23/0.58  % E exiting
%------------------------------------------------------------------------------