%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP002-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:34:02 PM UTC 2026
% Result : Satisfiable 0.07s 0.34s
% Output : Saturation 0.07s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_81ERROR: Could not build tree for root c_0_97ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_56,axiom,
ifeq2(car(X1),true,vehicle(X1),true) = true,
clause20,
[final] ).
cnf(c_0_57,negated_conjecture,
car(skc4) = true,
clause48,
[final] ).
cnf(c_0_58,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_001,
[final] ).
cnf(c_0_59,axiom,
ifeq2(vehicle(X1),true,transport(X1),true) = true,
clause19,
[final] ).
cnf(c_0_60,negated_conjecture,
vehicle(skc4) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),
[final] ).
cnf(c_0_61,axiom,
ifeq2(transport(X1),true,instrumentality(X1),true) = true,
clause18,
[final] ).
cnf(c_0_62,negated_conjecture,
transport(skc4) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_58]),
[final] ).
cnf(c_0_63,axiom,
ifeq2(city(X1),true,location(X1),true) = true,
clause11,
[final] ).
cnf(c_0_64,negated_conjecture,
city(skc7) = true,
clause40,
[final] ).
cnf(c_0_65,axiom,
ifeq2(way(X1),true,artifact(X1),true) = true,
clause15,
[final] ).
cnf(c_0_66,negated_conjecture,
way(skc5) = true,
clause43,
[final] ).
cnf(c_0_67,axiom,
ifeq2(instrumentality(X1),true,artifact(X1),true) = true,
clause17,
[final] ).
cnf(c_0_68,negated_conjecture,
instrumentality(skc4) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_58]),
[final] ).
cnf(c_0_69,axiom,
ifeq2(location(X1),true,object(X1),true) = true,
clause10,
[final] ).
cnf(c_0_70,negated_conjecture,
location(skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_58]),
[final] ).
cnf(c_0_71,axiom,
ifeq2(artifact(X1),true,object(X1),true) = true,
clause14,
[final] ).
cnf(c_0_72,negated_conjecture,
artifact(skc5) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_58]),
[final] ).
cnf(c_0_73,negated_conjecture,
artifact(skc4) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_58]),
[final] ).
cnf(c_0_74,axiom,
ifeq2(event(X1),true,eventuality(X1),true) = true,
clause13,
[final] ).
cnf(c_0_75,axiom,
event(skf1(X1,X2)) = true,
clause1,
[final] ).
cnf(c_0_76,negated_conjecture,
event(skc6) = true,
clause41,
[final] ).
cnf(c_0_77,axiom,
ifeq2(object(X1),true,entity(X1),true) = true,
clause9,
[final] ).
cnf(c_0_78,negated_conjecture,
object(skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_58]),
[final] ).
cnf(c_0_79,negated_conjecture,
object(skc5) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_58]),
[final] ).
cnf(c_0_80,negated_conjecture,
object(skc4) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_73]),c_0_58]),
[final] ).
cnf(c_0_82,axiom,
ifeq2(have(X1,X2,X3),true,ifeq2(event(X1),true,of(X2,X3),true),true) = true,
clause35,
[final] ).
cnf(c_0_83,axiom,
ifeq3(partof(X1,X2),true,ifeq3(partof(X1,X3),true,X2,X3),X3) = X3,
clause34,
[final] ).
cnf(c_0_84,axiom,
ifeq(tuple(eventuality(X1),abstraction(X1)),tuple(true,true),a,b) = b,
clause25,
[final] ).
cnf(c_0_85,plain,
eventuality(skf1(X1,X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_58]),
[final] ).
cnf(c_0_86,axiom,
ifeq(tuple(entity(X1),eventuality(X1)),tuple(true,true),a,b) = b,
clause27,
[final] ).
cnf(c_0_87,axiom,
ifeq(tuple(old(X1),new(X1)),tuple(true,true),a,b) = b,
clause28,
[final] ).
cnf(c_0_88,negated_conjecture,
old(skc4) = true,
clause45,
[final] ).
cnf(c_0_89,axiom,
ifeq(tuple(way(X1),instrumentality(X1)),tuple(true,true),a,b) = b,
clause30,
[final] ).
cnf(c_0_90,negated_conjecture,
eventuality(skc6) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_76]),c_0_58]),
[final] ).
cnf(c_0_91,axiom,
ifeq(tuple(location(X1),artifact(X1)),tuple(true,true),a,b) = b,
clause29,
[final] ).
cnf(c_0_92,axiom,
ifeq(tuple(entity(X1),abstraction(X1)),tuple(true,true),a,b) = b,
clause26,
[final] ).
cnf(c_0_93,negated_conjecture,
entity(skc7) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_58]),
[final] ).
cnf(c_0_94,negated_conjecture,
entity(skc5) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_79]),c_0_58]),
[final] ).
cnf(c_0_95,negated_conjecture,
entity(skc4) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_80]),c_0_58]),
[final] ).
cnf(c_0_96,axiom,
ifeq2(nonhuman(X1),true,entity(X1),true) = true,
clause2,
[final] ).
cnf(c_0_97,negated_conjecture,
a != b,
c_0_81,
[final] ).
cnf(c_0_98,axiom,
ifeq2(have(X1,X2,X3),true,ifeq2(nonhuman(X2),true,ifeq2(nonhuman(X3),true,partof(X3,X2),true),true),true) = true,
clause38,
[final] ).
cnf(c_0_99,axiom,
ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,have(X3,X1,X2),true),true) = true,
clause37,
[final] ).
cnf(c_0_100,axiom,
ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,of(X2,X3),true),true) = true,
clause36,
[final] ).
cnf(c_0_101,plain,
ifeq2(have(skf1(X1,X2),X3,X4),true,of(X3,X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_75]),c_0_58]),
[final] ).
cnf(c_0_102,negated_conjecture,
ifeq2(have(skc6,X1,X2),true,of(X1,X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_76]),c_0_58]),
[final] ).
cnf(c_0_103,axiom,
ifeq2(have(X1,X2,X3),true,ifeq2(human(X2),true,owner(X2),true),true) = true,
clause33,
[final] ).
cnf(c_0_104,plain,
ifeq3(partof(X1,ifeq3(partof(X1,X2),true,X2,X2)),true,X2,X2) = X2,
inference(spm,[status(thm)],[c_0_83,c_0_83]),
[final] ).
cnf(c_0_105,axiom,
ifeq2(of(X1,X2),true,ifeq2(owner(X1),true,human(X1),true),true) = true,
clause31,
[final] ).
cnf(c_0_106,plain,
ifeq(tuple(true,abstraction(skf1(X1,X2))),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_84,c_0_85]),
[final] ).
cnf(c_0_107,plain,
ifeq(tuple(entity(skf1(X1,X2)),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_86,c_0_85]),
[final] ).
cnf(c_0_108,axiom,
ifeq2(of(X1,X2),true,have(skf1(X1,X2),X2,X1),true) = true,
clause32,
[final] ).
cnf(c_0_109,negated_conjecture,
ifeq(tuple(true,new(skc4)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_87,c_0_88]),
[final] ).
cnf(c_0_110,negated_conjecture,
ifeq(tuple(true,instrumentality(skc5)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_89,c_0_66]),
[final] ).
cnf(c_0_111,negated_conjecture,
ifeq(tuple(way(skc4),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_89,c_0_68]),
[final] ).
cnf(c_0_112,negated_conjecture,
ifeq(tuple(true,abstraction(skc6)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_84,c_0_90]),
[final] ).
cnf(c_0_113,negated_conjecture,
ifeq(tuple(true,artifact(skc7)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_91,c_0_70]),
[final] ).
cnf(c_0_114,negated_conjecture,
ifeq(tuple(location(skc5),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_91,c_0_72]),
[final] ).
cnf(c_0_115,negated_conjecture,
ifeq(tuple(location(skc4),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_91,c_0_73]),
[final] ).
cnf(c_0_116,axiom,
ifeq(tuple(female(X1),male(X1)),tuple(true,true),a,b) = b,
clause24,
[final] ).
cnf(c_0_117,axiom,
ifeq(tuple(woman(X1),man(X1)),tuple(true,true),a,b) = b,
clause23,
[final] ).
cnf(c_0_118,negated_conjecture,
ifeq(tuple(true,abstraction(skc7)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_92,c_0_93]),
[final] ).
cnf(c_0_119,negated_conjecture,
ifeq(tuple(true,abstraction(skc5)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_92,c_0_94]),
[final] ).
cnf(c_0_120,negated_conjecture,
ifeq(tuple(true,abstraction(skc4)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_92,c_0_95]),
[final] ).
cnf(c_0_121,negated_conjecture,
ifeq(tuple(true,eventuality(skc7)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_86,c_0_93]),
[final] ).
cnf(c_0_122,negated_conjecture,
ifeq(tuple(true,eventuality(skc5)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_86,c_0_94]),
[final] ).
cnf(c_0_123,negated_conjecture,
ifeq(tuple(true,eventuality(skc4)),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_86,c_0_95]),
[final] ).
cnf(c_0_124,negated_conjecture,
ifeq(tuple(entity(skc6),true),tuple(true,true),a,b) = b,
inference(spm,[status(thm)],[c_0_86,c_0_90]),
[final] ).
cnf(c_0_125,axiom,
ifeq(tuple(nonhuman(X1),human(X1)),tuple(true,true),a,b) = b,
clause22,
[final] ).
cnf(c_0_126,negated_conjecture,
ifeq2(nonhuman(skc4),true,true,true) = true,
inference(spm,[status(thm)],[c_0_96,c_0_95]),
[final] ).
cnf(c_0_127,negated_conjecture,
ifeq2(location(skc4),true,true,true) = true,
inference(spm,[status(thm)],[c_0_69,c_0_80]),
[final] ).
cnf(c_0_128,negated_conjecture,
ifeq2(way(skc4),true,true,true) = true,
inference(spm,[status(thm)],[c_0_65,c_0_73]),
[final] ).
cnf(c_0_129,axiom,
ifeq2(chevy(X1),true,car(X1),true) = true,
clause21,
[final] ).
cnf(c_0_130,negated_conjecture,
ifeq2(instrumentality(skc5),true,true,true) = true,
inference(spm,[status(thm)],[c_0_67,c_0_72]),
[final] ).
cnf(c_0_131,negated_conjecture,
ifeq2(nonhuman(skc5),true,true,true) = true,
inference(spm,[status(thm)],[c_0_96,c_0_94]),
[final] ).
cnf(c_0_132,negated_conjecture,
ifeq2(location(skc5),true,true,true) = true,
inference(spm,[status(thm)],[c_0_69,c_0_79]),
[final] ).
cnf(c_0_133,axiom,
ifeq2(street(X1),true,way(X1),true) = true,
clause16,
[final] ).
cnf(c_0_134,negated_conjecture,
ifeq2(artifact(skc7),true,true,true) = true,
inference(spm,[status(thm)],[c_0_71,c_0_78]),
[final] ).
cnf(c_0_135,negated_conjecture,
ifeq2(nonhuman(skc7),true,true,true) = true,
inference(spm,[status(thm)],[c_0_96,c_0_93]),
[final] ).
cnf(c_0_136,axiom,
ifeq2(hollywood(X1),true,city(X1),true) = true,
clause12,
[final] ).
cnf(c_0_137,axiom,
ifeq2(man(X1),true,male(X1),true) = true,
clause8,
[final] ).
cnf(c_0_138,axiom,
ifeq2(male(X1),true,human(X1),true) = true,
clause7,
[final] ).
cnf(c_0_139,axiom,
ifeq2(female(X1),true,human(X1),true) = true,
clause6,
[final] ).
cnf(c_0_140,axiom,
ifeq2(woman(X1),true,female(X1),true) = true,
clause5,
[final] ).
cnf(c_0_141,axiom,
ifeq2(proposition(X1),true,drs(X1),true) = true,
clause4,
[final] ).
cnf(c_0_142,axiom,
ifeq2(drs(X1),true,proposition(X1),true) = true,
clause3,
[final] ).
cnf(c_0_143,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_002,
[final] ).
cnf(c_0_144,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom,
[final] ).
cnf(c_0_145,negated_conjecture,
barrel(skc6,skc4) = true,
clause52,
[final] ).
cnf(c_0_146,negated_conjecture,
down(skc6,skc5) = true,
clause51,
[final] ).
cnf(c_0_147,negated_conjecture,
in(skc6,skc7) = true,
clause50,
[final] ).
cnf(c_0_148,negated_conjecture,
white(skc4) = true,
clause47,
[final] ).
cnf(c_0_149,negated_conjecture,
dirty(skc4) = true,
clause46,
[final] ).
cnf(c_0_150,negated_conjecture,
lonely(skc5) = true,
clause44,
[final] ).
cnf(c_0_151,negated_conjecture,
chevy(skc4) = true,
clause49,
[final] ).
cnf(c_0_152,negated_conjecture,
street(skc5) = true,
clause42,
[final] ).
cnf(c_0_153,negated_conjecture,
hollywood(skc7) = true,
clause39,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NLP002-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 01:30:07 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1312535 completed with status 1
% 0.07/0.34 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.34 % No SInE strategy applied
% 0.07/0.34 % Search class: FUUPM-FFMM31-MFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.07/0.34 % Starting new_bool_3 with 136s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 136s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1312539 completed with status 1
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.34 % No SInE strategy applied
% 0.07/0.34 % Search class: FUUPM-FFMM31-MFFFFFNN
% 0.07/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % No proof found!
% 0.07/0.34 % SZS status Satisfiable
% 0.07/0.34 % SZS output start Saturation
% See solution above
% 0.07/0.34 % Parsed axioms : 56
% 0.07/0.34 % Removed by relevancy pruning/SinE : 0
% 0.07/0.34 % Initial clauses : 56
% 0.07/0.34 % Removed in clause preprocessing : 0
% 0.07/0.34 % Initial clauses in saturation : 56
% 0.07/0.34 % Processed clauses : 97
% 0.07/0.34 % ...of these trivial : 0
% 0.07/0.34 % ...subsumed : 0
% 0.07/0.34 % ...remaining for further processing : 97
% 0.07/0.34 % Other redundant clauses eliminated : 0
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 0
% 0.07/0.34 % Backward-rewritten : 0
% 0.07/0.34 % Generated clauses : 61
% 0.07/0.34 % ...of the previous two non-redundant : 41
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 0
% 0.07/0.34 % Paramodulations : 61
% 0.07/0.34 % Factorizations : 0
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 0
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 56
% 0.07/0.34 % ...of those cached : 22
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 97
% 0.07/0.34 % Positive orientable unit clauses : 96
% 0.07/0.34 % Positive unorientable unit clauses: 0
% 0.07/0.34 % Negative unit clauses : 1
% 0.07/0.34 % Non-unit-clauses : 0
% 0.07/0.34 % Current number of unprocessed clauses: 0
% 0.07/0.34 % ...number of literals in the above : 0
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 0
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.34 % Non-unit clause-clause subsumptions : 0
% 0.07/0.34 % Unit Clause-clause subsumption calls : 0
% 0.07/0.34 % Rewrite failures with RHS unbound : 0
% 0.07/0.34 % BW rewrite match attempts : 28
% 0.07/0.34 % BW rewrite match successes : 0
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 1999
% 0.07/0.34 % Search garbage collected termcells : 2
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.004 s
% 0.07/0.34 % System time : 0.002 s
% 0.07/0.34 % Total time : 0.006 s
% 0.07/0.34 % Maximum resident set size: 3668 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.015 s
% 0.07/0.34 % System time : 0.010 s
% 0.07/0.34 % Total time : 0.025 s
% 0.07/0.34 % Maximum resident set size: 4864 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------