TSTP Solution File: CSR115+61 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR115+61 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:08 EDT 2024
% Result : Theorem 2.03s 2.46s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 283 ( 0 equ)
% Maximal formula atoms : 147 ( 10 avg)
% Number of connectives : 340 ( 84 ~; 72 |; 182 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 147 ( 12 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 26 ( 25 usr; 1 prp; 0-2 aty)
% Number of functors : 54 ( 54 usr; 50 con; 0-3 aty)
% Number of variables : 87 ( 32 sgn 17 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1334,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& obj(X5,X1)
& sub(X2,name_1_1)
& sub(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/export/starexec/sandbox2/tmp/tmp.qf0Xz4jpm8/E---3.1_22425.p',synth_qa07_007_mira_news_1334) ).
fof(ave07_era5_synth_qa07_007_mira_news_1334,hypothesis,
( attr(c11682,c11683)
& sub(c11682,firma_1_1)
& sub(c11683,name_1_1)
& val(c11683,bmw_0)
& prop(c11687,britisch__1_1)
& sub(c11687,marke_1_1)
& agt(c11873,c11965)
& benf(c11873,c11682)
& obj(c11873,c11687)
& subs(c11873,nehmen_1_7)
& attr(c11965,c11966)
& sub(c11965,firma_1_1)
& sub(c11966,name_1_1)
& val(c11966,rover_0)
& modl(c11981,so_1_1)
& scar(c11981,c11682)
& semrel(c11981,c11873)
& subs(c11981,befinden_1_2)
& temp(c11981,bald_1_1)
& temp(c11981,future_0)
& temp(c11981,re_1_1)
& modl(c5,so_1_1)
& scar(c5,c10386)
& subs(c5,befinden_1_2)
& temp(c5,c11873)
& sort(c11682,d)
& sort(c11682,io)
& card(c11682,int1)
& etype(c11682,int0)
& fact(c11682,real)
& gener(c11682,sp)
& quant(c11682,one)
& refer(c11682,det)
& varia(c11682,con)
& sort(c11683,na)
& card(c11683,int1)
& etype(c11683,int0)
& fact(c11683,real)
& gener(c11683,sp)
& quant(c11683,one)
& refer(c11683,indet)
& varia(c11683,varia_c)
& sort(firma_1_1,d)
& sort(firma_1_1,io)
& card(firma_1_1,int1)
& etype(firma_1_1,int0)
& fact(firma_1_1,real)
& gener(firma_1_1,ge)
& quant(firma_1_1,one)
& refer(firma_1_1,refer_c)
& varia(firma_1_1,varia_c)
& sort(name_1_1,na)
& card(name_1_1,int1)
& etype(name_1_1,int0)
& fact(name_1_1,real)
& gener(name_1_1,ge)
& quant(name_1_1,one)
& refer(name_1_1,refer_c)
& varia(name_1_1,varia_c)
& sort(bmw_0,fe)
& sort(c11687,io)
& sort(c11687,oa)
& card(c11687,int1)
& etype(c11687,int0)
& fact(c11687,real)
& gener(c11687,sp)
& quant(c11687,one)
& refer(c11687,det)
& varia(c11687,con)
& sort(britisch__1_1,nq)
& sort(marke_1_1,io)
& sort(marke_1_1,oa)
& card(marke_1_1,int1)
& etype(marke_1_1,int0)
& fact(marke_1_1,real)
& gener(marke_1_1,ge)
& quant(marke_1_1,one)
& refer(marke_1_1,refer_c)
& varia(marke_1_1,varia_c)
& sort(c11873,da)
& fact(c11873,real)
& gener(c11873,sp)
& sort(c11965,d)
& sort(c11965,io)
& card(c11965,int1)
& etype(c11965,int0)
& fact(c11965,real)
& gener(c11965,sp)
& quant(c11965,one)
& refer(c11965,det)
& varia(c11965,con)
& sort(nehmen_1_7,da)
& fact(nehmen_1_7,real)
& gener(nehmen_1_7,ge)
& sort(c11966,na)
& card(c11966,int1)
& etype(c11966,int0)
& fact(c11966,real)
& gener(c11966,sp)
& quant(c11966,one)
& refer(c11966,indet)
& varia(c11966,varia_c)
& sort(rover_0,fe)
& sort(c11981,st)
& fact(c11981,real)
& gener(c11981,sp)
& sort(so_1_1,md)
& fact(so_1_1,real)
& gener(so_1_1,gener_c)
& sort(befinden_1_2,st)
& fact(befinden_1_2,real)
& gener(befinden_1_2,ge)
& sort(bald_1_1,t)
& card(bald_1_1,int1)
& etype(bald_1_1,int0)
& fact(bald_1_1,real)
& gener(bald_1_1,sp)
& quant(bald_1_1,one)
& refer(bald_1_1,refer_c)
& varia(bald_1_1,varia_c)
& sort(future_0,t)
& card(future_0,int1)
& etype(future_0,int0)
& fact(future_0,real)
& gener(future_0,sp)
& quant(future_0,one)
& refer(future_0,refer_c)
& varia(future_0,varia_c)
& sort(re_1_1,t)
& card(re_1_1,int1)
& etype(re_1_1,int0)
& fact(re_1_1,real)
& gener(re_1_1,sp)
& quant(re_1_1,one)
& refer(re_1_1,refer_c)
& varia(re_1_1,varia_c)
& sort(c5,st)
& fact(c5,real)
& gener(c5,sp)
& sort(c10386,co)
& card(c10386,card_c)
& etype(c10386,etype_c)
& fact(c10386,real)
& gener(c10386,sp)
& quant(c10386,quant_c)
& refer(c10386,det)
& varia(c10386,varia_c) ),
file('/export/starexec/sandbox2/tmp/tmp.qf0Xz4jpm8/E---3.1_22425.p',ave07_era5_synth_qa07_007_mira_news_1334) ).
fof(sub__bezeichnen_1_1_als,axiom,
! [X1,X2,X3] :
( ( arg1(X1,X2)
& arg2(X1,X3)
& subr(X1,sub_0) )
=> ? [X4,X5,X6] :
( arg1(X5,X2)
& arg2(X5,X6)
& hsit(X1,X4)
& mcont(X4,X5)
& obj(X4,X2)
& sub(X6,X3)
& subr(X5,rprs_0)
& subs(X4,bezeichnen_1_1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qf0Xz4jpm8/E---3.1_22425.p',sub__bezeichnen_1_1_als) ).
fof(sub__sub_0_expansion,axiom,
! [X1,X2] :
( sub(X1,X2)
=> ? [X3] :
( arg1(X3,X1)
& arg2(X3,X2)
& subr(X3,sub_0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qf0Xz4jpm8/E---3.1_22425.p',sub__sub_0_expansion) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& obj(X5,X1)
& sub(X2,name_1_1)
& sub(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1334]) ).
fof(c_0_5,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ attr(X8,X9)
| ~ attr(X11,X10)
| ~ attr(X13,X14)
| ~ obj(X12,X8)
| ~ sub(X9,name_1_1)
| ~ sub(X8,firma_1_1)
| ~ sub(X10,name_1_1)
| ~ val(X9,bmw_0)
| ~ val(X10,bmw_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ obj(X7,X1)
| ~ sub(X2,name_1_1)
| ~ sub(X1,firma_1_1)
| ~ sub(X4,name_1_1)
| ~ val(X2,bmw_0)
| ~ val(X4,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
val(c11683,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1334]) ).
cnf(c_0_8,hypothesis,
sub(c11683,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1334]) ).
cnf(c_0_9,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(X2,c11683)
| ~ attr(X3,X4)
| ~ attr(X5,X1)
| ~ obj(X6,X5)
| ~ sub(X1,name_1_1)
| ~ sub(X5,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_10,hypothesis,
( ~ attr(X1,c11683)
| ~ attr(X2,c11683)
| ~ attr(X3,X4)
| ~ obj(X5,X2)
| ~ sub(X2,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_8])]) ).
cnf(c_0_11,hypothesis,
attr(c11682,c11683),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1334]) ).
cnf(c_0_12,hypothesis,
( ~ attr(X1,c11683)
| ~ attr(X2,X3)
| ~ obj(X4,X1)
| ~ sub(X1,firma_1_1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
sub(c11682,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1334]) ).
fof(c_0_14,plain,
! [X339,X340,X341] :
( ( arg1(esk47_3(X339,X340,X341),X340)
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( arg2(esk47_3(X339,X340,X341),esk48_3(X339,X340,X341))
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( hsit(X339,esk46_3(X339,X340,X341))
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( mcont(esk46_3(X339,X340,X341),esk47_3(X339,X340,X341))
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( obj(esk46_3(X339,X340,X341),X340)
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( sub(esk48_3(X339,X340,X341),X341)
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( subr(esk47_3(X339,X340,X341),rprs_0)
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) )
& ( subs(esk46_3(X339,X340,X341),bezeichnen_1_1)
| ~ arg1(X339,X340)
| ~ arg2(X339,X341)
| ~ subr(X339,sub_0) ) ),
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)],[sub__bezeichnen_1_1_als])])])])])]) ).
cnf(c_0_15,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c11682) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13])]) ).
cnf(c_0_16,plain,
( obj(esk46_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X362,X363] :
( ( arg1(esk49_2(X362,X363),X362)
| ~ sub(X362,X363) )
& ( arg2(esk49_2(X362,X363),X363)
| ~ sub(X362,X363) )
& ( subr(esk49_2(X362,X363),sub_0)
| ~ sub(X362,X363) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sub__sub_0_expansion])])])])]) ).
cnf(c_0_18,hypothesis,
( ~ subr(X1,sub_0)
| ~ attr(X2,X3)
| ~ arg2(X1,X4)
| ~ arg1(X1,c11682) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( subr(esk49_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk49_2(X3,X4),X5)
| ~ arg1(esk49_2(X3,X4),c11682)
| ~ sub(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( arg1(esk49_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk49_2(c11682,X3),X4)
| ~ sub(c11682,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( arg2(esk49_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,hypothesis,
( ~ attr(X1,X2)
| ~ sub(c11682,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.94/0.97 % Problem : CSR115+61 : TPTP v8.1.2. Released v4.0.0.
% 0.94/0.98 % Command : run_E %s %d THM
% 1.00/1.17 % Computer : n032.cluster.edu
% 1.00/1.17 % Model : x86_64 x86_64
% 1.00/1.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.00/1.17 % Memory : 8042.1875MB
% 1.00/1.17 % OS : Linux 3.10.0-693.el7.x86_64
% 1.00/1.17 % CPULimit : 300
% 1.00/1.17 % WCLimit : 300
% 1.00/1.17 % DateTime : Fri May 3 14:42:23 EDT 2024
% 1.00/1.17 % CPUTime :
% 1.96/2.20 Running first-order theorem proving
% 1.96/2.20 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/tmp/tmp.qf0Xz4jpm8/E---3.1_22425.p
% 2.03/2.46 # Version: 3.1.0
% 2.03/2.46 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.03/2.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/2.46 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.03/2.46 # Starting new_bool_3 with 300s (1) cores
% 2.03/2.46 # Starting new_bool_1 with 300s (1) cores
% 2.03/2.46 # Starting sh5l with 300s (1) cores
% 2.03/2.46 # sh5l with pid 22755 completed with status 0
% 2.03/2.46 # Result found by sh5l
% 2.03/2.46 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.03/2.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/2.46 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.03/2.46 # Starting new_bool_3 with 300s (1) cores
% 2.03/2.46 # Starting new_bool_1 with 300s (1) cores
% 2.03/2.46 # Starting sh5l with 300s (1) cores
% 2.03/2.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.03/2.46 # Search class: FHHNS-FSLM32-MFFFFFNN
% 2.03/2.46 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.03/2.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.03/2.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.03/2.46 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22762 completed with status 0
% 2.03/2.46 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.03/2.46 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.03/2.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.03/2.46 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.03/2.46 # Starting new_bool_3 with 300s (1) cores
% 2.03/2.46 # Starting new_bool_1 with 300s (1) cores
% 2.03/2.46 # Starting sh5l with 300s (1) cores
% 2.03/2.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.03/2.46 # Search class: FHHNS-FSLM32-MFFFFFNN
% 2.03/2.46 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.03/2.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.03/2.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.03/2.46 # Preprocessing time : 0.013 s
% 2.03/2.46 # Presaturation interreduction done
% 2.03/2.46
% 2.03/2.46 # Proof found!
% 2.03/2.46 # SZS status Theorem
% 2.03/2.46 # SZS output start CNFRefutation
% See solution above
% 2.03/2.46 # Parsed axioms : 10189
% 2.03/2.46 # Removed by relevancy pruning/SinE : 9963
% 2.03/2.46 # Initial clauses : 525
% 2.03/2.46 # Removed in clause preprocessing : 0
% 2.03/2.46 # Initial clauses in saturation : 525
% 2.03/2.46 # Processed clauses : 1047
% 2.03/2.46 # ...of these trivial : 0
% 2.03/2.46 # ...subsumed : 1
% 2.03/2.46 # ...remaining for further processing : 1046
% 2.03/2.46 # Other redundant clauses eliminated : 0
% 2.03/2.46 # Clauses deleted for lack of memory : 0
% 2.03/2.46 # Backward-subsumed : 16
% 2.03/2.46 # Backward-rewritten : 0
% 2.03/2.46 # Generated clauses : 430
% 2.03/2.46 # ...of the previous two non-redundant : 428
% 2.03/2.46 # ...aggressively subsumed : 0
% 2.03/2.46 # Contextual simplify-reflections : 0
% 2.03/2.46 # Paramodulations : 428
% 2.03/2.46 # Factorizations : 0
% 2.03/2.46 # NegExts : 0
% 2.03/2.46 # Equation resolutions : 0
% 2.03/2.46 # Disequality decompositions : 0
% 2.03/2.46 # Total rewrite steps : 4
% 2.03/2.46 # ...of those cached : 1
% 2.03/2.46 # Propositional unsat checks : 0
% 2.03/2.46 # Propositional check models : 0
% 2.03/2.46 # Propositional check unsatisfiable : 0
% 2.03/2.46 # Propositional clauses : 0
% 2.03/2.46 # Propositional clauses after purity: 0
% 2.03/2.46 # Propositional unsat core size : 0
% 2.03/2.46 # Propositional preprocessing time : 0.000
% 2.03/2.46 # Propositional encoding time : 0.000
% 2.03/2.46 # Propositional solver time : 0.000
% 2.03/2.46 # Success case prop preproc time : 0.000
% 2.03/2.46 # Success case prop encoding time : 0.000
% 2.03/2.46 # Success case prop solver time : 0.000
% 2.03/2.46 # Current number of processed clauses : 503
% 2.03/2.46 # Positive orientable unit clauses : 317
% 2.03/2.46 # Positive unorientable unit clauses: 0
% 2.03/2.46 # Negative unit clauses : 1
% 2.03/2.46 # Non-unit-clauses : 185
% 2.03/2.46 # Current number of unprocessed clauses: 431
% 2.03/2.46 # ...number of literals in the above : 1451
% 2.03/2.46 # Current number of archived formulas : 0
% 2.03/2.46 # Current number of archived clauses : 543
% 2.03/2.46 # Clause-clause subsumption calls (NU) : 28476
% 2.03/2.46 # Rec. Clause-clause subsumption calls : 11599
% 2.03/2.46 # Non-unit clause-clause subsumptions : 4
% 2.03/2.46 # Unit Clause-clause subsumption calls : 589
% 2.03/2.46 # Rewrite failures with RHS unbound : 0
% 2.03/2.46 # BW rewrite match attempts : 0
% 2.03/2.46 # BW rewrite match successes : 0
% 2.03/2.46 # Condensation attempts : 0
% 2.03/2.46 # Condensation successes : 0
% 2.03/2.46 # Termbank termtop insertions : 72946
% 2.03/2.46 # Search garbage collected termcells : 40726
% 2.03/2.46
% 2.03/2.46 # -------------------------------------------------
% 2.03/2.46 # User time : 0.097 s
% 2.03/2.46 # System time : 0.077 s
% 2.03/2.46 # Total time : 0.174 s
% 2.03/2.46 # Maximum resident set size: 47960 pages
% 2.03/2.46
% 2.03/2.46 # -------------------------------------------------
% 2.03/2.46 # User time : 0.149 s
% 2.03/2.46 # System time : 0.088 s
% 2.03/2.46 # Total time : 0.237 s
% 2.03/2.46 # Maximum resident set size: 10796 pages
% 2.03/2.46 % E---3.1 exiting
% 2.03/2.46 % E exiting
%------------------------------------------------------------------------------