%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP196-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 01:35:33 PM UTC 2026
% Result : Satisfiable 0.23s 5.71s
% Output : Saturation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_95ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_95,negated_conjecture,
actual_world(skc73),
clause1,
[final] ).
cnf(c_0_164,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_104]),c_0_94]),
[final] ).
cnf(c_0_200,negated_conjecture,
( ~ actual_world(X1)
| ~ barrel(X1,X11)
| ~ present(X1,X11)
| ~ event(X1,X11)
| ~ chevy(X1,X12)
| ~ white(X1,X12)
| ~ dirty(X1,X12)
| ~ old(X1,X12)
| ~ city(X1,X10)
| ~ street(X1,X10)
| ~ lonely(X1,X10)
| ~ placename(X1,X9)
| ~ hollywood_placename(X1,X9)
| ~ group(X1,X2)
| ~ group(X1,X7)
| ~ two(X1,X7)
| ~ ssSkP0(X7,X1)
| ~ frontseat(X1,X6)
| ~ wheel(X1,X5)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ man(X1,X4)
| ~ state(X1,X3)
| ~ agent(X1,X11,X12)
| ~ down(X1,X11,X10)
| ~ in(X1,X11,X10)
| ~ of(X1,X9,X10)
| ~ of(X1,X8,X4)
| ~ ssSkP2(X7,X2,X1)
| ~ ssSkP1(X6,X7,X1)
| ~ behind(X1,X5,X5)
| ~ be(X1,X3,X4,X5)
| member(X1,skf10(X1,X2),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_164])]),
[final] ).
cnf(c_0_201,negated_conjecture,
be(skc25,skc27,skc29,skc26),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_164])]),
[final] ).
cnf(c_0_202,negated_conjecture,
state(skc25,skc27),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_164])]),
[final] ).
cnf(c_0_203,negated_conjecture,
man(skc25,skc29),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_164])]),
[final] ).
cnf(c_0_204,negated_conjecture,
actual_world(skc25),
clause2,
[final] ).
cnf(c_0_251,negated_conjecture,
( ~ barrel(skc25,X7)
| ~ present(skc25,X7)
| ~ event(skc25,X7)
| ~ chevy(skc25,X8)
| ~ white(skc25,X8)
| ~ dirty(skc25,X8)
| ~ old(skc25,X8)
| ~ city(skc25,X6)
| ~ street(skc25,X6)
| ~ lonely(skc25,X6)
| ~ placename(skc25,X5)
| ~ hollywood_placename(skc25,X5)
| ~ group(skc25,X1)
| ~ group(skc25,X3)
| ~ two(skc25,X3)
| ~ ssSkP0(X3,skc25)
| ~ frontseat(skc25,X2)
| ~ wheel(skc25,skc26)
| ~ jules_forename(skc25,X4)
| ~ forename(skc25,X4)
| ~ agent(skc25,X7,X8)
| ~ down(skc25,X7,X6)
| ~ in(skc25,X7,X6)
| ~ of(skc25,X5,X6)
| ~ of(skc25,X4,skc29)
| ~ ssSkP2(X3,X1,skc25)
| ~ ssSkP1(X2,X3,skc25)
| ~ behind(skc25,skc26,skc26)
| member(skc25,skf10(skc25,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_201]),c_0_202]),c_0_203]),c_0_204])]),
[final] ).
cnf(c_0_252,negated_conjecture,
( ~ member(skc25,X1,skc31)
| coat(skc25,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_164])]),
[final] ).
cnf(c_0_253,negated_conjecture,
( ~ member(skc25,X1,skc31)
| black(skc25,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_206,c_0_164])]),
[final] ).
cnf(c_0_254,negated_conjecture,
( ~ member(skc25,X1,skc31)
| cheap(skc25,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_164])]),
[final] ).
cnf(c_0_255,negated_conjecture,
( ~ actual_world(X1)
| ~ barrel(X1,X12)
| ~ present(X1,X12)
| ~ event(X1,X12)
| ~ chevy(X1,X13)
| ~ white(X1,X13)
| ~ dirty(X1,X13)
| ~ old(X1,X13)
| ~ city(X1,X11)
| ~ street(X1,X11)
| ~ lonely(X1,X11)
| ~ placename(X1,X10)
| ~ hollywood_placename(X1,X10)
| ~ group(X1,X8)
| ~ group(X1,X7)
| ~ two(X1,X7)
| ~ ssSkP0(X7,X1)
| ~ frontseat(X1,X6)
| ~ wheel(X1,X5)
| ~ jules_forename(X1,X9)
| ~ forename(X1,X9)
| ~ man(X1,X4)
| ~ state(X1,X3)
| ~ agent(X1,X12,X13)
| ~ down(X1,X12,X11)
| ~ in(X1,X12,X11)
| ~ of(X1,X10,X11)
| ~ of(X1,X9,X4)
| ~ ssSkP2(X7,X8,X1)
| ~ ssSkP1(X6,X7,X1)
| ~ behind(X1,X5,X5)
| ~ be(X1,X3,X4,X5)
| ~ coat(X1,skf10(X1,X2))
| ~ black(X1,skf10(X1,X2))
| ~ cheap(X1,skf10(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_208,c_0_164])]),
[final] ).
cnf(c_0_256,negated_conjecture,
( ~ event(X1,X2)
| ~ agent(X1,X2,skf21(X3,X1,X4))
| ~ patient(X1,X2,skf19(X3,X1,X4))
| ~ present(X1,X2)
| ~ nonreflexive(X1,X2)
| ~ wear(X1,X2)
| ssSkP2(X3,X5,X1) ),
c_0_209,
[final] ).
cnf(c_0_257,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5)) ),
c_0_210,
[final] ).
cnf(c_0_258,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| patient(X1,skf17(X1,X2,X4),X4) ),
c_0_211,
[final] ).
cnf(c_0_259,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| agent(X1,skf17(X1,X2,X6),X2) ),
c_0_212,
[final] ).
cnf(c_0_260,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| nonreflexive(X1,skf17(X1,X6,X7)) ),
c_0_213,
[final] ).
cnf(c_0_261,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| wear(X1,skf17(X1,X6,X7)) ),
c_0_214,
[final] ).
cnf(c_0_262,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| event(X1,skf17(X1,X6,X7)) ),
c_0_215,
[final] ).
cnf(c_0_263,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ in(X1,X2,X3)
| ssSkP1(X3,X6,X1) ),
c_0_216,
[final] ).
cnf(c_0_264,negated_conjecture,
( ~ ssSkP2(X3,X5,X1)
| ~ member(X1,X4,X5)
| ~ member(X1,X2,X3)
| present(X1,skf17(X1,X6,X7)) ),
c_0_217,
[final] ).
cnf(c_0_265,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| in(X1,skf12(X2,X1,X4),X4) ),
c_0_218,
[final] ).
cnf(c_0_266,negated_conjecture,
( ~ ssSkP1(X4,X3,X1)
| ~ member(X1,X2,X3)
| state(X1,skf13(X1,X5,X6)) ),
c_0_219,
[final] ).
cnf(c_0_267,negated_conjecture,
( member(X3,skf16(X1,X3,X2),X2)
| ssSkP1(X1,X2,X3) ),
clause72,
[final] ).
cnf(c_0_268,negated_conjecture,
( member(X3,skf19(X1,X3,X2),X2)
| ssSkP2(X1,X2,X3) ),
clause74,
[final] ).
cnf(c_0_269,negated_conjecture,
( member(X3,skf21(X1,X3,X4),X1)
| ssSkP2(X1,X2,X3) ),
clause73,
[final] ).
cnf(c_0_270,negated_conjecture,
( member(X2,skf11(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause65,
[final] ).
cnf(c_0_271,negated_conjecture,
( ~ fellow(X1,skf11(X1,X2))
| ~ young(X1,skf11(X1,X2))
| ssSkP0(X3,X1) ),
c_0_220,
[final] ).
cnf(c_0_272,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| young(X1,X2) ),
c_0_221,
[final] ).
cnf(c_0_273,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ member(X1,X2,X3)
| fellow(X1,X2) ),
c_0_222,
[final] ).
cnf(c_0_274,negated_conjecture,
agent(skc25,skc34,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_164])]),
[final] ).
cnf(c_0_275,negated_conjecture,
down(skc25,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_164])]),
[final] ).
cnf(c_0_276,negated_conjecture,
in(skc25,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_164])]),
[final] ).
cnf(c_0_277,negated_conjecture,
of(skc25,skc36,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_164])]),
[final] ).
cnf(c_0_278,negated_conjecture,
of(skc25,skc28,skc29),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_164])]),
[final] ).
cnf(c_0_279,negated_conjecture,
ssSkP2(skc32,skc31,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_164])]),
[final] ).
cnf(c_0_280,negated_conjecture,
ssSkP1(skc33,skc32,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_164])]),
[final] ).
cnf(c_0_281,negated_conjecture,
behind(skc25,skc26,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_164])]),
[final] ).
cnf(c_0_282,negated_conjecture,
barrel(skc25,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_164])]),
[final] ).
cnf(c_0_283,negated_conjecture,
present(skc25,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_164])]),
[final] ).
cnf(c_0_284,negated_conjecture,
event(skc25,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_164])]),
[final] ).
cnf(c_0_285,negated_conjecture,
chevy(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_164])]),
[final] ).
cnf(c_0_286,negated_conjecture,
white(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_235,c_0_164])]),
[final] ).
cnf(c_0_287,negated_conjecture,
dirty(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_164])]),
[final] ).
cnf(c_0_288,negated_conjecture,
old(skc25,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_164])]),
[final] ).
cnf(c_0_289,negated_conjecture,
city(skc25,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_164])]),
[final] ).
cnf(c_0_290,negated_conjecture,
street(skc25,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_164])]),
[final] ).
cnf(c_0_291,negated_conjecture,
lonely(skc25,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_164])]),
[final] ).
cnf(c_0_292,negated_conjecture,
placename(skc25,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_241,c_0_164])]),
[final] ).
cnf(c_0_293,negated_conjecture,
hollywood_placename(skc25,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_164])]),
[final] ).
cnf(c_0_294,negated_conjecture,
group(skc25,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_243,c_0_164])]),
[final] ).
cnf(c_0_295,negated_conjecture,
group(skc25,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_244,c_0_164])]),
[final] ).
cnf(c_0_296,negated_conjecture,
two(skc25,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_245,c_0_164])]),
[final] ).
cnf(c_0_297,negated_conjecture,
ssSkP0(skc32,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_246,c_0_164])]),
[final] ).
cnf(c_0_298,negated_conjecture,
frontseat(skc25,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_247,c_0_164])]),
[final] ).
cnf(c_0_299,negated_conjecture,
wheel(skc25,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_248,c_0_164])]),
[final] ).
cnf(c_0_300,negated_conjecture,
jules_forename(skc25,skc28),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_249,c_0_164])]),
[final] ).
cnf(c_0_301,negated_conjecture,
forename(skc25,skc28),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_250,c_0_164])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP196-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.48 % Computer : n003.cluster.edu
% 0.17/5.48 % Model : x86_64 x86_64
% 0.17/5.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.48 % Memory : 8046.5625MB
% 0.17/5.48 % OS : Linux 6.8.0-71-generic
% 0.17/5.48 % CPULimit : 300
% 0.17/5.48 % WCLimit : 300
% 0.17/5.48 % DateTime : Mon Sep 21 01:49:21 UTC 2026
% 0.17/5.48 % CPUTime :
% 0.17/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.54 Running first-order theorem proving
% 0.23/5.54 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/5.71 % Version: 3.5.1
% 0.23/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/5.71 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.71 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.71 % Starting sh5l with 300s (1) cores
% 0.23/5.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3144903 completed with status 1
% 0.23/5.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/5.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.71 % No SInE strategy applied
% 0.23/5.71 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.23/5.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.71 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/5.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.23/5.71 % Starting new_bool_3 with 136s (1) cores
% 0.23/5.71 % Starting new_bool_1 with 136s (1) cores
% 0.23/5.71 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3144909 completed with status 1
% 0.23/5.71 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/5.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.71 % No SInE strategy applied
% 0.23/5.71 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.23/5.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.71 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/5.71 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 136s (1) cores
% 0.23/5.71 % Preprocessing time : 0.004 s
% 0.23/5.71 % Presaturation interreduction done
% 0.23/5.71
% 0.23/5.71 % No proof found!
% 0.23/5.71 % SZS status Satisfiable
% 0.23/5.71 % SZS output start Saturation
% See solution above
% 0.23/5.71 % Parsed axioms : 92
% 0.23/5.71 % Removed by relevancy pruning/SinE : 0
% 0.23/5.71 % Initial clauses : 92
% 0.23/5.71 % Removed in clause preprocessing : 0
% 0.23/5.71 % Initial clauses in saturation : 92
% 0.23/5.71 % Processed clauses : 364
% 0.23/5.71 % ...of these trivial : 0
% 0.23/5.71 % ...subsumed : 28
% 0.23/5.71 % ...remaining for further processing : 336
% 0.23/5.71 % Other redundant clauses eliminated : 0
% 0.23/5.71 % Clauses deleted for lack of memory : 0
% 0.23/5.71 % Backward-subsumed : 29
% 0.23/5.71 % Backward-rewritten : 157
% 0.23/5.71 % Generated clauses : 161
% 0.23/5.71 % ...of the previous two non-redundant : 197
% 0.23/5.71 % ...aggressively subsumed : 0
% 0.23/5.71 % Contextual simplify-reflections : 90
% 0.23/5.71 % Paramodulations : 161
% 0.23/5.71 % Factorizations : 0
% 0.23/5.71 % NegExts : 0
% 0.23/5.71 % Equation resolutions : 0
% 0.23/5.71 % Disequality decompositions : 0
% 0.23/5.71 % Total rewrite steps : 165
% 0.23/5.71 % ...of those cached : 160
% 0.23/5.71 % Propositional unsat checks : 0
% 0.23/5.71 % Propositional check models : 0
% 0.23/5.71 % Propositional check unsatisfiable : 0
% 0.23/5.71 % Propositional clauses : 0
% 0.23/5.71 % Propositional clauses after purity: 0
% 0.23/5.71 % Propositional unsat core size : 0
% 0.23/5.71 % Propositional preprocessing time : 0.000
% 0.23/5.71 % Propositional encoding time : 0.000
% 0.23/5.71 % Propositional solver time : 0.000
% 0.23/5.71 % Success case prop preproc time : 0.000
% 0.23/5.71 % Success case prop encoding time : 0.000
% 0.23/5.71 % Success case prop solver time : 0.000
% 0.23/5.71 % Current number of processed clauses : 58
% 0.23/5.71 % Positive orientable unit clauses : 34
% 0.23/5.71 % Positive unorientable unit clauses: 0
% 0.23/5.71 % Negative unit clauses : 0
% 0.23/5.71 % Non-unit-clauses : 24
% 0.23/5.71 % Current number of unprocessed clauses: 0
% 0.23/5.71 % ...number of literals in the above : 0
% 0.23/5.71 % Current number of archived formulas : 0
% 0.23/5.71 % Current number of archived clauses : 278
% 0.23/5.71 % Clause-clause subsumption calls (NU) : 45005
% 0.23/5.71 % Rec. Clause-clause subsumption calls : 6575
% 0.23/5.71 % Non-unit clause-clause subsumptions : 147
% 0.23/5.71 % Unit Clause-clause subsumption calls : 12
% 0.23/5.71 % Rewrite failures with RHS unbound : 0
% 0.23/5.71 % BW rewrite match attempts : 1
% 0.23/5.71 % BW rewrite match successes : 1
% 0.23/5.71 % Condensation attempts : 0
% 0.23/5.71 % Condensation successes : 0
% 0.23/5.71 % Termbank termtop insertions : 16090
% 0.23/5.71 % Search garbage collected termcells : 375
% 0.23/5.71
% 0.23/5.71 % -------------------------------------------------
% 0.23/5.71 % User time : 0.107 s
% 0.23/5.71 % System time : 0.006 s
% 0.23/5.71 % Total time : 0.113 s
% 0.23/5.71 % Maximum resident set size: 3748 pages
% 0.23/5.71
% 0.23/5.71 % -------------------------------------------------
% 0.23/5.71 % User time : 0.511 s
% 0.23/5.71 % System time : 0.032 s
% 0.23/5.71 % Total time : 0.543 s
% 0.23/5.71 % Maximum resident set size: 4608 pages
% 0.23/5.71 % E exiting
%------------------------------------------------------------------------------