↑ Up

E---3.5.1.SAT-Sat.s

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

% Computer : n015.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 03:25:17 PM UTC 2026

% Result   : Satisfiable 0.20s 5.57s
% Output   : Saturation 0.20s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_102ERROR: Could not build tree for root c_0_158ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_0_77,negated_conjecture,
    ndr1_0,
    inference(spm,[status(thm)],[c_0_72,c_0_73]),
    [final] ).

cnf(c_0_89,negated_conjecture,
    ( ~ c2_1(a43)
    | ssSkC4 ),
    c_0_75,
    [final] ).

cnf(c_0_90,negated_conjecture,
    ( ndr1_1(X1)
    | c2_1(X1)
    | ssSkC0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]),
    [final] ).

cnf(c_0_110,negated_conjecture,
    ( ~ ndr1_1(X1)
    | c5_1(X1)
    | c2_2(X1,X2)
    | c3_2(X1,X2)
    | c3_2(X1,a36)
    | ssSkC2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_77])]),
    [final] ).

cnf(c_0_111,negated_conjecture,
    ( ~ c5_0
    | ~ ssSkC4
    | ndr1_1(a44) ),
    c_0_87,
    [final] ).

cnf(c_0_112,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | ndr1_1(a34) ),
    c_0_88,
    [final] ).

cnf(c_0_113,negated_conjecture,
    ( ssSkC4
    | ndr1_1(a43)
    | ssSkC0 ),
    inference(spm,[status(thm)],[c_0_89,c_0_90]),
    [final] ).

cnf(c_0_114,negated_conjecture,
    ( ssSkC3
    | ndr1_1(a39) ),
    clause9,
    [final] ).

cnf(c_0_158,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c1_2(X1,a27)
    | ~ c4_2(X1,X2)
    | c5_0
    | c5_2(X1,X2)
    | c4_0
    | c3_2(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_77])]),
    [final] ).

cnf(c_0_159,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c5_2(X1,a27)
    | ~ c4_2(X1,X2)
    | c5_0
    | c5_2(X1,X2)
    | c4_0
    | c3_2(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_77])]),
    [final] ).

cnf(c_0_160,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c4_2(X1,X2)
    | c5_0
    | c5_2(X1,X2)
    | c4_2(X1,a27)
    | c4_0
    | c3_2(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_77])]),
    [final] ).

cnf(c_0_161,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c1_2(X1,X2)
    | ~ c1_2(X1,a29)
    | ~ c5_2(X1,X2)
    | ~ c3_2(X1,X2)
    | ~ ssSkC0
    | c3_1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_77])]),
    [final] ).

cnf(c_0_162,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c1_2(X1,X2)
    | ~ c5_2(X1,X2)
    | ~ c3_2(X1,X2)
    | ~ ssSkC0
    | c3_1(X1)
    | c2_2(X1,a29) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_77])]),
    [final] ).

cnf(c_0_163,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c4_1(X1)
    | ~ c5_2(X1,X2)
    | c1_0
    | c2_2(X1,X2)
    | c4_2(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_77])]),
    [final] ).

cnf(c_0_164,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c1_2(X1,a36)
    | c5_1(X1)
    | c2_2(X1,X2)
    | c3_2(X1,X2)
    | ssSkC2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_77])]),
    [final] ).

cnf(c_0_165,negated_conjecture,
    ( ~ ndr1_1(X1)
    | ~ c5_2(X1,a36)
    | c5_1(X1)
    | c2_2(X1,X2)
    | c3_2(X1,X2)
    | ssSkC2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_77])]),
    [final] ).

cnf(c_0_166,negated_conjecture,
    ( ~ ssSkC4
    | ~ c5_0
    | c5_1(a44)
    | c2_2(a44,X1)
    | c3_2(a44,X1)
    | c3_2(a44,a36)
    | ssSkC2 ),
    inference(spm,[status(thm)],[c_0_110,c_0_111]),
    [final] ).

cnf(c_0_167,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | c5_1(a34)
    | c2_2(a34,X1)
    | c3_2(a34,X1)
    | c3_2(a34,a36)
    | ssSkC2 ),
    inference(spm,[status(thm)],[c_0_110,c_0_112]),
    [final] ).

cnf(c_0_168,negated_conjecture,
    ( ssSkC4
    | c5_1(a43)
    | c2_2(a43,X1)
    | c3_2(a43,X1)
    | c3_2(a43,a36)
    | ssSkC0
    | ssSkC2 ),
    inference(spm,[status(thm)],[c_0_110,c_0_113]),
    [final] ).

cnf(c_0_169,negated_conjecture,
    ( ssSkC3
    | c5_1(a39)
    | c2_2(a39,X1)
    | c3_2(a39,X1)
    | c3_2(a39,a36)
    | ssSkC2 ),
    inference(spm,[status(thm)],[c_0_110,c_0_114]),
    [final] ).

cnf(c_0_170,negated_conjecture,
    ( ~ c3_0
    | ~ c5_1(X1)
    | ~ c5_2(X1,a38)
    | c4_1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_115,c_0_77])]),
    [final] ).

cnf(c_0_171,negated_conjecture,
    ( ~ c5_2(a39,X1)
    | ssSkC3
    | c1_2(a39,X1) ),
    inference(spm,[status(thm)],[c_0_116,c_0_114]),
    [final] ).

cnf(c_0_172,negated_conjecture,
    ( ~ c5_2(X1,a28)
    | c2_1(X1)
    | ssSkC0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_77])]),
    [final] ).

cnf(c_0_173,negated_conjecture,
    ( ~ c3_2(X1,a28)
    | c2_1(X1)
    | ssSkC0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_77])]),
    [final] ).

cnf(c_0_174,negated_conjecture,
    ( ~ c2_2(X1,a37)
    | ~ ssSkC2
    | c4_1(X1)
    | c5_1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_77])]),
    [final] ).

cnf(c_0_175,negated_conjecture,
    ( ~ c3_0
    | ~ c5_1(X1)
    | c4_1(X1)
    | c1_2(X1,a38) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_120,c_0_77])]),
    [final] ).

cnf(c_0_176,negated_conjecture,
    ( ~ c3_0
    | ~ c5_1(X1)
    | c4_1(X1)
    | c3_2(X1,a38) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_77])]),
    [final] ).

cnf(c_0_177,negated_conjecture,
    ( ~ ssSkC2
    | c4_1(X1)
    | c5_1(X1)
    | c4_2(X1,a37) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_77])]),
    [final] ).

cnf(c_0_178,negated_conjecture,
    ( ~ ssSkC2
    | c4_1(X1)
    | c5_1(X1)
    | c3_2(X1,a37) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_77])]),
    [final] ).

cnf(c_0_179,negated_conjecture,
    ( ~ c3_0
    | ~ c5_1(X1)
    | ndr1_1(X1)
    | c4_1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_77])]),
    [final] ).

cnf(c_0_180,negated_conjecture,
    ( ~ ssSkC2
    | ndr1_1(X1)
    | c4_1(X1)
    | c5_1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_77])]),
    [final] ).

cnf(c_0_181,negated_conjecture,
    ( ~ c4_2(a31,a32)
    | ~ ssSkC1
    | c5_0 ),
    c_0_126,
    [final] ).

cnf(c_0_182,negated_conjecture,
    ( ~ c4_2(a31,a33)
    | ~ ssSkC1
    | c5_0 ),
    c_0_127,
    [final] ).

cnf(c_0_183,negated_conjecture,
    ( ~ c5_2(a31,a33)
    | ~ ssSkC1
    | c5_0 ),
    c_0_128,
    [final] ).

cnf(c_0_184,negated_conjecture,
    ( ~ c3_2(a41,a42)
    | ~ ssSkC3
    | c3_0 ),
    c_0_129,
    [final] ).

cnf(c_0_185,negated_conjecture,
    ( ~ c5_2(a48,a49)
    | ~ ssSkC5
    | c1_0 ),
    c_0_130,
    [final] ).

cnf(c_0_186,negated_conjecture,
    ( ~ c1_2(a48,a49)
    | ~ ssSkC5
    | c1_0 ),
    c_0_131,
    [final] ).

cnf(c_0_187,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | c1_2(a34,a35) ),
    c_0_132,
    [final] ).

cnf(c_0_188,negated_conjecture,
    ( ~ c5_0
    | ~ ssSkC4
    | c1_2(a44,a45) ),
    c_0_133,
    [final] ).

cnf(c_0_189,negated_conjecture,
    ( ~ ssSkC1
    | c5_0
    | c3_2(a31,a32) ),
    c_0_134,
    [final] ).

cnf(c_0_190,negated_conjecture,
    ( ~ ssSkC1
    | c5_0
    | c5_2(a31,a32) ),
    c_0_135,
    [final] ).

cnf(c_0_191,negated_conjecture,
    ( ~ ssSkC1
    | c5_0
    | c2_2(a31,a33) ),
    c_0_136,
    [final] ).

cnf(c_0_192,negated_conjecture,
    ( ~ ssSkC3
    | c3_0
    | c4_2(a41,a42) ),
    c_0_137,
    [final] ).

cnf(c_0_193,negated_conjecture,
    ( ~ ssSkC3
    | c3_0
    | c5_2(a41,a42) ),
    c_0_138,
    [final] ).

cnf(c_0_194,negated_conjecture,
    ( ~ c2_1(a41)
    | ~ ssSkC3
    | c3_0 ),
    c_0_139,
    [final] ).

cnf(c_0_195,negated_conjecture,
    ( ~ c5_0
    | ~ ssSkC4
    | c4_1(a44) ),
    c_0_140,
    [final] ).

cnf(c_0_196,negated_conjecture,
    ( ~ c5_0
    | ~ ssSkC4
    | c3_1(a44) ),
    c_0_141,
    [final] ).

cnf(c_0_197,negated_conjecture,
    ( ssSkC3
    | c2_2(a39,a40) ),
    clause22,
    [final] ).

cnf(c_0_198,negated_conjecture,
    ( ~ ssSkC1
    | c5_0
    | c1_1(a31) ),
    c_0_142,
    [final] ).

cnf(c_0_199,negated_conjecture,
    ( ~ ssSkC1
    | c5_0
    | ndr1_1(a31) ),
    c_0_143,
    [final] ).

cnf(c_0_200,negated_conjecture,
    ( ~ ssSkC3
    | c3_0
    | ndr1_1(a41) ),
    c_0_144,
    [final] ).

cnf(c_0_201,negated_conjecture,
    ( ~ ssSkC5
    | c1_0
    | c4_1(a48) ),
    c_0_145,
    [final] ).

cnf(c_0_202,negated_conjecture,
    ( ~ ssSkC5
    | c1_0
    | ndr1_1(a48) ),
    c_0_146,
    [final] ).

cnf(c_0_203,negated_conjecture,
    ( ssSkC3
    | c1_2(a39,a40) ),
    clause21,
    [final] ).

cnf(c_0_204,negated_conjecture,
    ( ~ c1_1(a30)
    | ssSkC1 ),
    c_0_147,
    [final] ).

cnf(c_0_205,negated_conjecture,
    ( ~ c5_1(a43)
    | ssSkC4 ),
    c_0_148,
    [final] ).

cnf(c_0_206,negated_conjecture,
    ( ~ c3_1(a47)
    | ssSkC5 ),
    c_0_149,
    [final] ).

cnf(c_0_207,negated_conjecture,
    ( ~ c2_0
    | ~ c4_0
    | c5_0 ),
    c_0_150,
    [final] ).

cnf(c_0_208,negated_conjecture,
    ( ssSkC1
    | c3_1(a30) ),
    clause11,
    [final] ).

cnf(c_0_209,negated_conjecture,
    ( ssSkC3
    | c2_1(a39) ),
    clause10,
    [final] ).

cnf(c_0_210,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | ~ c4_2(a34,a35) ),
    c_0_151,
    [final] ).

cnf(c_0_211,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | ~ c5_2(a34,a35) ),
    c_0_152,
    [final] ).

cnf(c_0_212,negated_conjecture,
    ( ~ c5_0
    | ~ c4_2(a44,a45)
    | ~ ssSkC4 ),
    c_0_153,
    [final] ).

cnf(c_0_213,negated_conjecture,
    ( ~ c5_0
    | ~ c2_2(a44,a45)
    | ~ ssSkC4 ),
    c_0_154,
    [final] ).

cnf(c_0_214,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | ~ c1_1(a34) ),
    c_0_155,
    [final] ).

cnf(c_0_215,negated_conjecture,
    ( ~ c1_0
    | ~ c4_0
    | ~ c2_1(a34) ),
    c_0_156,
    [final] ).

cnf(c_0_216,negated_conjecture,
    ( ~ c2_0
    | ~ c3_1(a46) ),
    c_0_157,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN516-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.44  % Computer : n015.cluster.edu
% 0.16/5.44  % Model    : x86_64 x86_64
% 0.16/5.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44  % Memory   : 8046.5625MB
% 0.16/5.44  % OS       : Linux 6.8.0-71-generic
% 0.16/5.44  % CPULimit : 300
% 0.16/5.44  % WCLimit  : 300
% 0.16/5.44  % DateTime : Mon Sep 21 11:07:56 UTC 2026
% 0.16/5.45  % CPUTime  : 
% 0.16/5.45  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/5.52  Running first-order theorem proving
% 0.20/5.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.20/5.57  % Version: 3.5.1
% 0.20/5.57  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.20/5.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.57  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.20/5.57  % Starting new_bool_3 with 300s (1) cores
% 0.20/5.57  % Starting new_bool_1 with 300s (1) cores
% 0.20/5.57  % Starting sh5l with 300s (1) cores
% 0.20/5.57  % G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 1317452 completed with status 1
% 0.20/5.57  % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 0.20/5.57  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.20/5.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.57  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.20/5.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.57  % No SInE strategy applied
% 0.20/5.57  % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.20/5.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.57  % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.57  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.20/5.57  % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.20/5.57  % Starting G----_425_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.20/5.57  % Starting G-E--_208_B07--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/5.57  % H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with pid 1317458 completed with status 1
% 0.20/5.57  % Result found by H----_011_C07_F1_PI_AE_OS_R8_SP_S1U
% 0.20/5.57  % Preprocessing class: FSLSSLSMSSSNFFN.
% 0.20/5.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/5.57  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 1500s (5) cores
% 0.20/5.57  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/5.57  % No SInE strategy applied
% 0.20/5.57  % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.20/5.57  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/5.57  % Starting SubtermCWHack with 136s (1) cores
% 0.20/5.57  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 151s (1) cores
% 0.20/5.57  % Starting H----_011_C07_F1_PI_AE_OS_R8_SP_S1U with 136s (1) cores
% 0.20/5.57  % Preprocessing time       : 0.003 s
% 0.20/5.57  
% 0.20/5.57  % No proof found!
% 0.20/5.57  % SZS status Satisfiable
% 0.20/5.57  % SZS output start Saturation
% See solution above
% 0.20/5.57  % Parsed axioms                        : 71
% 0.20/5.57  % Removed by relevancy pruning/SinE    : 0
% 0.20/5.57  % Initial clauses                      : 71
% 0.20/5.57  % Removed in clause preprocessing      : 0
% 0.20/5.57  % Initial clauses in saturation        : 71
% 0.20/5.57  % Processed clauses                    : 104
% 0.20/5.57  % ...of these trivial                  : 0
% 0.20/5.57  % ...subsumed                          : 2
% 0.20/5.57  % ...remaining for further processing  : 102
% 0.20/5.57  % Other redundant clauses eliminated   : 0
% 0.20/5.58  % Clauses deleted for lack of memory   : 0
% 0.20/5.58  % Backward-subsumed                    : 5
% 0.20/5.58  % Backward-rewritten                   : 30
% 0.20/5.58  % Generated clauses                    : 26
% 0.20/5.58  % ...of the previous two non-redundant : 43
% 0.20/5.58  % ...aggressively subsumed             : 0
% 0.20/5.58  % Contextual simplify-reflections      : 0
% 0.20/5.58  % Paramodulations                      : 26
% 0.20/5.58  % Factorizations                       : 0
% 0.20/5.58  % NegExts                              : 0
% 0.20/5.58  % Equation resolutions                 : 0
% 0.20/5.58  % Disequality decompositions           : 0
% 0.20/5.58  % Total rewrite steps                  : 30
% 0.20/5.58  % ...of those cached                   : 29
% 0.20/5.58  % Propositional unsat checks           : 0
% 0.20/5.58  %    Propositional check models        : 0
% 0.20/5.58  %    Propositional check unsatisfiable : 0
% 0.20/5.58  %    Propositional clauses             : 0
% 0.20/5.58  %    Propositional clauses after purity: 0
% 0.20/5.58  %    Propositional unsat core size     : 0
% 0.20/5.58  %    Propositional preprocessing time  : 0.000
% 0.20/5.58  %    Propositional encoding time       : 0.000
% 0.20/5.58  %    Propositional solver time         : 0.000
% 0.20/5.58  %    Success case prop preproc time    : 0.000
% 0.20/5.58  %    Success case prop encoding time   : 0.000
% 0.20/5.58  %    Success case prop solver time     : 0.000
% 0.20/5.58  % Current number of processed clauses  : 67
% 0.20/5.58  %    Positive orientable unit clauses  : 1
% 0.20/5.58  %    Positive unorientable unit clauses: 0
% 0.20/5.58  %    Negative unit clauses             : 0
% 0.20/5.58  %    Non-unit-clauses                  : 66
% 0.20/5.58  % Current number of unprocessed clauses: 0
% 0.20/5.58  % ...number of literals in the above   : 0
% 0.20/5.58  % Current number of archived formulas  : 0
% 0.20/5.58  % Current number of archived clauses   : 35
% 0.20/5.58  % Clause-clause subsumption calls (NU) : 795
% 0.20/5.58  % Rec. Clause-clause subsumption calls : 341
% 0.20/5.58  % Non-unit clause-clause subsumptions  : 7
% 0.20/5.58  % Unit Clause-clause subsumption calls : 5
% 0.20/5.58  % Rewrite failures with RHS unbound    : 0
% 0.20/5.58  % BW rewrite match attempts            : 1
% 0.20/5.58  % BW rewrite match successes           : 1
% 0.20/5.58  % Condensation attempts                : 0
% 0.20/5.58  % Condensation successes               : 0
% 0.20/5.58  % Termbank termtop insertions          : 3639
% 0.20/5.58  % Search garbage collected termcells   : 199
% 0.20/5.58  
% 0.20/5.58  % -------------------------------------------------
% 0.20/5.58  % User time                : 0.016 s
% 0.20/5.58  % System time              : 0.003 s
% 0.20/5.58  % Total time               : 0.019 s
% 0.20/5.58  % Maximum resident set size: 3692 pages
% 0.20/5.58  
% 0.20/5.58  % -------------------------------------------------
% 0.20/5.58  % User time                : 0.060 s
% 0.20/5.58  % System time              : 0.017 s
% 0.20/5.58  % Total time               : 0.077 s
% 0.20/5.58  % Maximum resident set size: 4864 pages
% 0.20/5.58  % E exiting
%------------------------------------------------------------------------------