%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR115+55 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 12:17:14 PM UTC 2026
% Result : Theorem 0.33s 0.95s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 270 ( 0 equ)
% Maximal formula atoms : 159 ( 9 avg)
% Number of connectives : 305 ( 64 ~; 54 |; 184 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 159 ( 11 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-9 aty)
% Number of functors : 56 ( 56 usr; 51 con; 0-3 aty)
% Number of variables : 81 ( 28 sgn 20 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1312_a19984,conjecture,
? [X1,X2,X3,X4,X5,X6] :
( sub(X2,name_1_1)
& sub(X1,firma_1_1)
& prop(X1,britisch__1_1)
& obj(X4,X1)
& attr(X5,X6)
& attr(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',synth_qa07_007_mira_news_1312_a19984) ).
fof(ave07_era5_synth_qa07_007_mira_news_1312_a19984,hypothesis,
( varia(c50786,varia_c)
& refer(c50786,det)
& quant(c50786,one)
& gener(c50786,sp)
& fact(c50786,real)
& etype(c50786,int0)
& card(c50786,int1)
& sort(c50786,o)
& varia(c51219,varia_c)
& refer(c51219,refer_c)
& quant(c51219,quant_c)
& gener(c51219,gener_c)
& fact(c51219,real)
& etype(c51219,etype_c)
& card(c51219,card_c)
& sort(c51219,ent)
& varia(aktion__344r_1_1,varia_c)
& refer(aktion__344r_1_1,refer_c)
& quant(aktion__344r_1_1,one)
& gener(aktion__344r_1_1,ge)
& fact(aktion__344r_1_1,real)
& etype(aktion__344r_1_1,int0)
& card(aktion__344r_1_1,int1)
& sort(aktion__344r_1_1,io)
& sort(aktion__344r_1_1,d)
& varia(c50870,con)
& refer(c50870,det)
& quant(c50870,mult)
& gener(c50870,sp)
& fact(c50870,real)
& etype(c50870,int1)
& card(c50870,cons(x_constant,cons(int1,nil)))
& sort(c50870,io)
& sort(c50870,d)
& varia(rat_1_1,varia_c)
& refer(rat_1_1,refer_c)
& quant(rat_1_1,one)
& gener(rat_1_1,ge)
& fact(rat_1_1,real)
& etype(rat_1_1,int0)
& card(rat_1_1,int1)
& sort(rat_1_1,io)
& sort(rat_1_1,ad)
& sort(negativ_1_1,nq)
& varia(c50864,varia_c)
& refer(c50864,refer_c)
& quant(c50864,one)
& gener(c50864,sp)
& fact(c50864,nonreal)
& etype(c50864,int0)
& card(c50864,int1)
& sort(c50864,io)
& sort(c50864,ad)
& varia(tee__1_1,varia_c)
& refer(tee__1_1,refer_c)
& quant(tee__1_1,one)
& gener(tee__1_1,ge)
& fact(tee__1_1,real)
& etype(tee__1_1,int0)
& card(tee__1_1,int1)
& sort(tee__1_1,s)
& varia(c50852,varia_c)
& refer(c50852,refer_c)
& quant(c50852,one)
& gener(c50852,gener_c)
& fact(c50852,real)
& etype(c50852,int0)
& card(c50852,int1)
& sort(c50852,s)
& varia(abwart_1_1,varia_c)
& refer(abwart_1_1,refer_c)
& quant(abwart_1_1,one)
& gener(abwart_1_1,ge)
& fact(abwart_1_1,real)
& etype(abwart_1_1,int0)
& card(abwart_1_1,int1)
& sort(abwart_1_1,o)
& varia(c50848,varia_c)
& refer(c50848,indet)
& quant(c50848,mult)
& gener(c50848,gener_c)
& fact(c50848,real)
& etype(c50848,int1)
& card(c50848,cons(x_constant,cons(int1,nil)))
& sort(c50848,o)
& sort(britisch__1_1,nq)
& varia(c50830,varia_c)
& refer(c50830,indet)
& quant(c50830,one)
& gener(c50830,sp)
& fact(c50830,real)
& etype(c50830,int0)
& card(c50830,int1)
& sort(c50830,io)
& sort(c50830,d)
& sort(rover_0,fe)
& varia(name_1_1,varia_c)
& refer(name_1_1,refer_c)
& quant(name_1_1,one)
& gener(name_1_1,ge)
& fact(name_1_1,real)
& etype(name_1_1,int0)
& card(name_1_1,int1)
& sort(name_1_1,na)
& varia(firma_1_1,varia_c)
& refer(firma_1_1,refer_c)
& quant(firma_1_1,one)
& gener(firma_1_1,ge)
& fact(firma_1_1,real)
& etype(firma_1_1,int0)
& card(firma_1_1,int1)
& sort(firma_1_1,io)
& sort(firma_1_1,d)
& varia(c50826,varia_c)
& refer(c50826,indet)
& quant(c50826,one)
& gener(c50826,sp)
& fact(c50826,real)
& etype(c50826,int0)
& card(c50826,int1)
& sort(c50826,na)
& varia(c50825,con)
& refer(c50825,det)
& quant(c50825,one)
& gener(c50825,sp)
& fact(c50825,real)
& etype(c50825,int0)
& card(c50825,int1)
& sort(c50825,io)
& sort(c50825,d)
& varia(sich_1_1,varia_c)
& refer(sich_1_1,refer_c)
& quant(sich_1_1,one)
& gener(sich_1_1,gener_c)
& fact(sich_1_1,real)
& etype(sich_1_1,int0)
& card(sich_1_1,int1)
& sort(sich_1_1,o)
& varia(c50787,varia_c)
& refer(c50787,refer_c)
& quant(c50787,one)
& gener(c50787,gener_c)
& fact(c50787,real)
& etype(c50787,int0)
& card(c50787,int1)
& sort(c50787,o)
& tupl_p9(c51219,c50786,c50787,c50825,c50830,c50848,c50852,c50864,c50870)
& pred(c50870,aktion__344r_1_1)
& sub(c50864,rat_1_1)
& prop(c50864,negativ_1_1)
& sub(c50852,tee__1_1)
& pred(c50848,abwart_1_1)
& sub(c50830,firma_1_1)
& prop(c50830,britisch__1_1)
& val(c50826,rover_0)
& sub(c50826,name_1_1)
& sub(c50825,firma_1_1)
& attr(c50825,c50826)
& sub(c50787,sich_1_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ave07_era5_synth_qa07_007_mira_news_1312_a19984) ).
fof(loc__geben_1_1_loc,axiom,
! [X1,X2] :
( ( loc(X2,X1)
& has_fact_leq(X2,real) )
=> ? [X3] :
( subs(X3,geben_1_1)
& obj(X3,X2)
& loc(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',loc__geben_1_1_loc) ).
fof(has_fact_eq,axiom,
! [X1,X2] :
( fact(X1,X2)
=> has_fact_leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',has_fact_eq) ).
fof(state_adjective__in_state,axiom,
! [X1,X2,X3] :
( ( state_adjective_state_binding(X2,X3)
& prop(X1,X2) )
=> ? [X4,X5,X6] :
( val(X5,X3)
& sub(X5,name_1_1)
& sub(X4,land_1_1)
& loc(X1,X6)
& attr(X4,X5)
& in(X6,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',state_adjective__in_state) ).
fof(fact_8846,axiom,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR004+0.ax',fact_8846) ).
fof(c_0_6,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6] :
( sub(X2,name_1_1)
& sub(X1,firma_1_1)
& prop(X1,britisch__1_1)
& obj(X4,X1)
& attr(X5,X6)
& attr(X3,X2) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1312_a19984]) ).
fof(c_0_7,negated_conjecture,
! [X8,X9,X10,X11,X12,X13] :
( ~ sub(X9,name_1_1)
| ~ sub(X8,firma_1_1)
| ~ prop(X8,britisch__1_1)
| ~ obj(X11,X8)
| ~ attr(X12,X13)
| ~ attr(X10,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ sub(X2,name_1_1)
| ~ sub(X6,firma_1_1)
| ~ prop(X6,britisch__1_1)
| ~ obj(X5,X6)
| ~ attr(X3,X4)
| ~ attr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,hypothesis,
prop(c50830,britisch__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1312_a19984]) ).
cnf(c_0_10,hypothesis,
sub(c50830,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1312_a19984]) ).
fof(c_0_11,plain,
! [X98,X99] :
( ( ~ loc(X99,X98)
| ~ has_fact_leq(X99,real)
| subs(esk12_2(X98,X99),geben_1_1) )
& ( ~ loc(X99,X98)
| ~ has_fact_leq(X99,real)
| obj(esk12_2(X98,X99),X99) )
& ( ~ loc(X99,X98)
| ~ has_fact_leq(X99,real)
| loc(esk12_2(X98,X99),X98) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__geben_1_1_loc])])])])]) ).
cnf(c_0_12,hypothesis,
( ~ sub(X4,name_1_1)
| ~ obj(X5,c50830)
| ~ attr(X3,X4)
| ~ attr(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ loc(X2,X1)
| ~ has_fact_leq(X2,real)
| obj(esk12_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X86,X87] :
( has_fact_leq(X86,X87)
| ~ fact(X86,X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[has_fact_eq])])]) ).
cnf(c_0_15,hypothesis,
( ~ has_fact_leq(c50830,real)
| ~ sub(X4,name_1_1)
| ~ loc(c50830,X5)
| ~ attr(X3,X4)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ fact(X1,X2)
| has_fact_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
fact(c50830,real),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1312_a19984]) ).
fof(c_0_18,plain,
! [X23,X24,X25] :
( ( ~ state_adjective_state_binding(X24,X25)
| ~ prop(X23,X24)
| val(esk2_3(X23,X24,X25),X25) )
& ( ~ state_adjective_state_binding(X24,X25)
| ~ prop(X23,X24)
| sub(esk2_3(X23,X24,X25),name_1_1) )
& ( ~ state_adjective_state_binding(X24,X25)
| ~ prop(X23,X24)
| sub(esk1_3(X23,X24,X25),land_1_1) )
& ( ~ state_adjective_state_binding(X24,X25)
| ~ prop(X23,X24)
| loc(X23,esk3_3(X23,X24,X25)) )
& ( ~ state_adjective_state_binding(X24,X25)
| ~ prop(X23,X24)
| attr(esk1_3(X23,X24,X25),esk2_3(X23,X24,X25)) )
& ( ~ state_adjective_state_binding(X24,X25)
| ~ prop(X23,X24)
| in(esk3_3(X23,X24,X25),esk1_3(X23,X24,X25)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[state_adjective__in_state])])])])])]) ).
cnf(c_0_19,hypothesis,
( ~ sub(X4,name_1_1)
| ~ loc(c50830,X5)
| ~ attr(X3,X4)
| ~ attr(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ state_adjective_state_binding(X2,X3)
| ~ prop(X1,X2)
| loc(X1,esk3_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,hypothesis,
( ~ sub(X6,name_1_1)
| ~ attr(X5,X6)
| ~ attr(X3,X4)
| ~ prop(c50830,X1)
| ~ state_adjective_state_binding(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,hypothesis,
( ~ sub(X5,name_1_1)
| ~ attr(X4,X5)
| ~ attr(X2,X3)
| ~ state_adjective_state_binding(britisch__1_1,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_23,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
inference(split_conjunct,[status(thm)],[fact_8846]) ).
cnf(c_0_24,hypothesis,
( ~ sub(X4,name_1_1)
| ~ attr(X3,X4)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
attr(c50825,c50826),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1312_a19984]) ).
cnf(c_0_26,hypothesis,
( ~ sub(X2,name_1_1)
| ~ attr(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,hypothesis,
sub(c50826,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1312_a19984]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR115+55 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 15:10:21 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.33/0.95 % Version: 3.5.1
% 0.33/0.95 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.33/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.95 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.33/0.95 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.95 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.95 % Starting sh5l with 300s (1) cores
% 0.33/0.95 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1749472 completed with status 0
% 0.33/0.95 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 0.33/0.95 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.33/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.95 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.33/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.95 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.33/0.95 % Search class: FHHNS-FSLM32-MFFFFFNN
% 0.33/0.95 % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 0.33/0.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.95 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.95 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.33/0.95 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.33/0.95 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.95 % Starting new_bool_1 with 136s (1) cores
% 0.33/0.95 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1749479 completed with status 0
% 0.33/0.95 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 0.33/0.95 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.33/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.95 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.33/0.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.95 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.33/0.95 % Search class: FHHNS-FSLM32-MFFFFFNN
% 0.33/0.95 % partial match(2): FHHNS-SMLM32-MFFFFFNN
% 0.33/0.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.95 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.95 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.33/0.95 % Preprocessing time : 0.019 s
% 0.33/0.95 % Presaturation interreduction done
% 0.33/0.95
% 0.33/0.95 % Proof found!
% 0.33/0.95 % SZS status Theorem
% 0.33/0.95 % SZS output start CNFRefutation
% See solution above
% 0.33/0.95 % Parsed axioms : 10189
% 0.33/0.95 % Removed by relevancy pruning/SinE : 9945
% 0.33/0.95 % Initial clauses : 555
% 0.33/0.95 % Removed in clause preprocessing : 0
% 0.33/0.95 % Initial clauses in saturation : 555
% 0.33/0.95 % Processed clauses : 1045
% 0.33/0.95 % ...of these trivial : 0
% 0.33/0.95 % ...subsumed : 0
% 0.33/0.95 % ...remaining for further processing : 1045
% 0.33/0.95 % Other redundant clauses eliminated : 0
% 0.33/0.95 % Clauses deleted for lack of memory : 0
% 0.33/0.95 % Backward-subsumed : 7
% 0.33/0.95 % Backward-rewritten : 0
% 0.33/0.95 % Generated clauses : 512
% 0.33/0.95 % ...of the previous two non-redundant : 511
% 0.33/0.95 % ...aggressively subsumed : 0
% 0.33/0.95 % Contextual simplify-reflections : 0
% 0.33/0.95 % Paramodulations : 512
% 0.33/0.95 % Factorizations : 0
% 0.33/0.95 % NegExts : 0
% 0.33/0.95 % Equation resolutions : 0
% 0.33/0.95 % Disequality decompositions : 0
% 0.33/0.95 % Total rewrite steps : 3
% 0.33/0.95 % ...of those cached : 0
% 0.33/0.95 % Propositional unsat checks : 0
% 0.33/0.95 % Propositional check models : 0
% 0.33/0.95 % Propositional check unsatisfiable : 0
% 0.33/0.95 % Propositional clauses : 0
% 0.33/0.95 % Propositional clauses after purity: 0
% 0.33/0.95 % Propositional unsat core size : 0
% 0.33/0.95 % Propositional preprocessing time : 0.000
% 0.33/0.95 % Propositional encoding time : 0.000
% 0.33/0.95 % Propositional solver time : 0.000
% 0.33/0.95 % Success case prop preproc time : 0.000
% 0.33/0.95 % Success case prop encoding time : 0.000
% 0.33/0.95 % Success case prop solver time : 0.000
% 0.33/0.95 % Current number of processed clauses : 483
% 0.33/0.95 % Positive orientable unit clauses : 330
% 0.33/0.95 % Positive unorientable unit clauses: 0
% 0.33/0.95 % Negative unit clauses : 0
% 0.33/0.95 % Non-unit-clauses : 153
% 0.33/0.95 % Current number of unprocessed clauses: 576
% 0.33/0.95 % ...number of literals in the above : 1615
% 0.33/0.95 % Current number of archived formulas : 0
% 0.33/0.95 % Current number of archived clauses : 562
% 0.33/0.95 % Clause-clause subsumption calls (NU) : 25228
% 0.33/0.95 % Rec. Clause-clause subsumption calls : 12452
% 0.33/0.95 % Non-unit clause-clause subsumptions : 7
% 0.33/0.95 % Unit Clause-clause subsumption calls : 64
% 0.33/0.95 % Rewrite failures with RHS unbound : 0
% 0.33/0.95 % BW rewrite match attempts : 0
% 0.33/0.95 % BW rewrite match successes : 0
% 0.33/0.95 % Condensation attempts : 0
% 0.33/0.95 % Condensation successes : 0
% 0.33/0.95 % Termbank termtop insertions : 75367
% 0.33/0.95 % Search garbage collected termcells : 40699
% 0.33/0.95
% 0.33/0.95 % -------------------------------------------------
% 0.33/0.95 % User time : 0.168 s
% 0.33/0.95 % System time : 0.128 s
% 0.33/0.95 % Total time : 0.296 s
% 0.33/0.95 % Maximum resident set size: 50228 pages
% 0.33/0.95
% 0.33/0.95 % -------------------------------------------------
% 0.33/0.95 % User time : 0.752 s
% 0.33/0.95 % System time : 0.429 s
% 0.33/0.95 % Total time : 1.181 s
% 0.33/0.95 % Maximum resident set size: 14336 pages
% 0.33/0.95 % E exiting
%------------------------------------------------------------------------------