TSTP Solution File: CSR115+45 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR115+45 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:03 EDT 2024
% Result : Theorem 3.70s 3.00s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 287 ( 0 equ)
% Maximal formula atoms : 171 ( 10 avg)
% Number of connectives : 329 ( 69 ~; 58 |; 200 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 171 ( 12 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 1 prp; 0-3 aty)
% Number of functors : 54 ( 54 usr; 50 con; 0-3 aty)
% Number of variables : 77 ( 28 sgn 16 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1256_a19984,conjecture,
? [X1,X2,X3,X4,X5,X6] :
( attr(X3,X2)
& attr(X5,X6)
& obj(X4,X1)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& val(X2,bmw_0) ),
file('/export/starexec/sandbox2/tmp/tmp.AW2T2TBlLs/E---3.1_2431.p',synth_qa07_007_mira_news_1256_a19984) ).
fof(ave07_era5_synth_qa07_007_mira_news_1256_a19984,hypothesis,
( assoc(autofirma_1_1,auto__1_1)
& sub(autofirma_1_1,firma_1_1)
& agt(c484,c893)
& benf(c484,c858)
& obj(c484,c902)
& subs(c484,nehmen_1_7)
& temp(c484,c865)
& attr(c858,c859)
& sub(c858,firma_1_1)
& sub(c859,name_1_1)
& val(c859,bmw_0)
& prop(c865,pass__351_1_1)
& sub(c865,sommer__1_1)
& attr(c893,c894)
& sub(c893,autofirma_1_1)
& sub(c894,name_1_1)
& val(c894,rover_0)
& prop(c902,britisch__1_1)
& prop(c902,unabh__344ngig_1_1)
& sub(c902,c904)
& pmod(c904,letzt_1_1,massenhersteller_1_1)
& agt(c907,c902)
& subs(c907,herstellen_1_1)
& assoc(massenhersteller_1_1,masse_1_1)
& sub(massenhersteller_1_1,fabrikant_1_1)
& sort(autofirma_1_1,d)
& sort(autofirma_1_1,io)
& card(autofirma_1_1,int1)
& etype(autofirma_1_1,int0)
& fact(autofirma_1_1,real)
& gener(autofirma_1_1,ge)
& quant(autofirma_1_1,one)
& refer(autofirma_1_1,refer_c)
& varia(autofirma_1_1,varia_c)
& sort(auto__1_1,d)
& card(auto__1_1,int1)
& etype(auto__1_1,int0)
& fact(auto__1_1,real)
& gener(auto__1_1,ge)
& quant(auto__1_1,one)
& refer(auto__1_1,refer_c)
& varia(auto__1_1,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(c484,da)
& fact(c484,real)
& gener(c484,sp)
& sort(c893,d)
& sort(c893,io)
& card(c893,int1)
& etype(c893,int0)
& fact(c893,real)
& gener(c893,sp)
& quant(c893,one)
& refer(c893,det)
& varia(c893,con)
& sort(c858,d)
& sort(c858,io)
& card(c858,int1)
& etype(c858,int0)
& fact(c858,real)
& gener(c858,sp)
& quant(c858,one)
& refer(c858,det)
& varia(c858,con)
& sort(c902,io)
& card(c902,int1)
& etype(c902,int0)
& fact(c902,real)
& gener(c902,sp)
& quant(c902,one)
& refer(c902,det)
& varia(c902,con)
& sort(nehmen_1_7,da)
& fact(nehmen_1_7,real)
& gener(nehmen_1_7,ge)
& sort(c865,ta)
& card(c865,int1)
& etype(c865,int0)
& fact(c865,real)
& gener(c865,sp)
& quant(c865,one)
& refer(c865,det)
& varia(c865,con)
& sort(c859,na)
& card(c859,int1)
& etype(c859,int0)
& fact(c859,real)
& gener(c859,sp)
& quant(c859,one)
& refer(c859,indet)
& varia(c859,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(pass__351_1_1,tq)
& sort(sommer__1_1,ta)
& card(sommer__1_1,int1)
& etype(sommer__1_1,int0)
& fact(sommer__1_1,real)
& gener(sommer__1_1,ge)
& quant(sommer__1_1,one)
& refer(sommer__1_1,refer_c)
& varia(sommer__1_1,varia_c)
& sort(c894,na)
& card(c894,int1)
& etype(c894,int0)
& fact(c894,real)
& gener(c894,sp)
& quant(c894,one)
& refer(c894,indet)
& varia(c894,varia_c)
& sort(rover_0,fe)
& sort(britisch__1_1,nq)
& sort(unabh__344ngig_1_1,nq)
& sort(c904,d)
& sort(c904,io)
& card(c904,int1)
& etype(c904,int0)
& fact(c904,real)
& gener(c904,ge)
& quant(c904,one)
& refer(c904,refer_c)
& varia(c904,varia_c)
& sort(letzt_1_1,oq)
& card(letzt_1_1,card_c)
& sort(massenhersteller_1_1,d)
& sort(massenhersteller_1_1,io)
& card(massenhersteller_1_1,int1)
& etype(massenhersteller_1_1,int0)
& fact(massenhersteller_1_1,real)
& gener(massenhersteller_1_1,ge)
& quant(massenhersteller_1_1,one)
& refer(massenhersteller_1_1,refer_c)
& varia(massenhersteller_1_1,varia_c)
& sort(c907,da)
& fact(c907,real)
& gener(c907,sp)
& sort(herstellen_1_1,da)
& fact(herstellen_1_1,real)
& gener(herstellen_1_1,ge)
& sort(masse_1_1,io)
& card(masse_1_1,card_c)
& etype(masse_1_1,int1)
& fact(masse_1_1,real)
& gener(masse_1_1,ge)
& quant(masse_1_1,quant_c)
& refer(masse_1_1,refer_c)
& varia(masse_1_1,varia_c)
& sort(fabrikant_1_1,d)
& sort(fabrikant_1_1,io)
& card(fabrikant_1_1,int1)
& etype(fabrikant_1_1,int0)
& fact(fabrikant_1_1,real)
& gener(fabrikant_1_1,ge)
& quant(fabrikant_1_1,one)
& refer(fabrikant_1_1,refer_c)
& varia(fabrikant_1_1,varia_c) ),
file('/export/starexec/sandbox2/tmp/tmp.AW2T2TBlLs/E---3.1_2431.p',ave07_era5_synth_qa07_007_mira_news_1256_a19984) ).
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.AW2T2TBlLs/E---3.1_2431.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.AW2T2TBlLs/E---3.1_2431.p',sub__sub_0_expansion) ).
fof(c_0_4,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6] :
( attr(X3,X2)
& attr(X5,X6)
& obj(X4,X1)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& val(X2,bmw_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1256_a19984]) ).
fof(c_0_5,negated_conjecture,
! [X8,X9,X10,X11,X12,X13] :
( ~ attr(X10,X9)
| ~ attr(X12,X13)
| ~ obj(X11,X8)
| ~ sub(X8,firma_1_1)
| ~ sub(X9,name_1_1)
| ~ val(X9,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)
| ~ obj(X5,X6)
| ~ sub(X6,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ val(X2,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
val(c859,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1256_a19984]) ).
cnf(c_0_8,hypothesis,
sub(c859,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1256_a19984]) ).
cnf(c_0_9,hypothesis,
( ~ attr(X1,c859)
| ~ attr(X2,X3)
| ~ obj(X4,X5)
| ~ 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(c858,c859),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1256_a19984]) ).
cnf(c_0_11,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,X4)
| ~ sub(X4,firma_1_1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,hypothesis,
sub(c858,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1256_a19984]) ).
fof(c_0_13,plain,
! [X302,X303,X304] :
( ( arg1(esk40_3(X302,X303,X304),X303)
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( arg2(esk40_3(X302,X303,X304),esk41_3(X302,X303,X304))
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( hsit(X302,esk39_3(X302,X303,X304))
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( mcont(esk39_3(X302,X303,X304),esk40_3(X302,X303,X304))
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( obj(esk39_3(X302,X303,X304),X303)
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( sub(esk41_3(X302,X303,X304),X304)
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( subr(esk40_3(X302,X303,X304),rprs_0)
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,sub_0) )
& ( subs(esk39_3(X302,X303,X304),bezeichnen_1_1)
| ~ arg1(X302,X303)
| ~ arg2(X302,X304)
| ~ subr(X302,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_14,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c858) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( obj(esk39_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X382,X383] :
( ( arg1(esk49_2(X382,X383),X382)
| ~ sub(X382,X383) )
& ( arg2(esk49_2(X382,X383),X383)
| ~ sub(X382,X383) )
& ( subr(esk49_2(X382,X383),sub_0)
| ~ sub(X382,X383) ) ),
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_17,hypothesis,
( ~ subr(X1,sub_0)
| ~ attr(X2,X3)
| ~ arg2(X1,X4)
| ~ arg1(X1,c858) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( subr(esk49_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk49_2(X3,X4),X5)
| ~ arg1(esk49_2(X3,X4),c858)
| ~ sub(X3,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( arg1(esk49_2(X1,X2),X1)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,hypothesis,
( ~ attr(X1,X2)
| ~ arg2(esk49_2(c858,X3),X4)
| ~ sub(c858,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( arg2(esk49_2(X1,X2),X2)
| ~ sub(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
( ~ attr(X1,X2)
| ~ sub(c858,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,hypothesis,
attr(c893,c894),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1256_a19984]) ).
cnf(c_0_25,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.05/1.14 % Problem : CSR115+45 : TPTP v8.1.2. Released v4.0.0.
% 1.05/1.15 % Command : run_E %s %d THM
% 1.14/1.36 % Computer : n015.cluster.edu
% 1.14/1.36 % Model : x86_64 x86_64
% 1.14/1.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.14/1.36 % Memory : 8042.1875MB
% 1.14/1.36 % OS : Linux 3.10.0-693.el7.x86_64
% 1.14/1.36 % CPULimit : 300
% 1.14/1.36 % WCLimit : 300
% 1.14/1.36 % DateTime : Fri May 3 15:13:09 EDT 2024
% 1.14/1.36 % CPUTime :
% 2.43/2.67 Running first-order theorem proving
% 2.43/2.67 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.AW2T2TBlLs/E---3.1_2431.p
% 3.70/3.00 # Version: 3.1.0
% 3.70/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.70/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.70/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.70/3.00 # Starting new_bool_3 with 300s (1) cores
% 3.70/3.00 # Starting new_bool_1 with 300s (1) cores
% 3.70/3.00 # Starting sh5l with 300s (1) cores
% 3.70/3.00 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2509 completed with status 0
% 3.70/3.00 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 3.70/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.70/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.70/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.70/3.00 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 3.70/3.00 # Search class: FHHNS-FSLM32-MFFFFFNN
% 3.70/3.00 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 3.70/3.00 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.70/3.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.70/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 3.70/3.00 # Starting new_bool_3 with 136s (1) cores
% 3.70/3.00 # Starting new_bool_1 with 136s (1) cores
% 3.70/3.00 # Starting sh5l with 136s (1) cores
% 3.70/3.00 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2515 completed with status 0
% 3.70/3.00 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.70/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.70/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.70/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.70/3.00 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 3.70/3.00 # Search class: FHHNS-FSLM32-MFFFFFNN
% 3.70/3.00 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 3.70/3.00 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.70/3.00 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.70/3.00 # Preprocessing time : 0.012 s
% 3.70/3.00 # Presaturation interreduction done
% 3.70/3.00
% 3.70/3.00 # Proof found!
% 3.70/3.00 # SZS status Theorem
% 3.70/3.00 # SZS output start CNFRefutation
% See solution above
% 3.70/3.00 # Parsed axioms : 10189
% 3.70/3.00 # Removed by relevancy pruning/SinE : 9938
% 3.70/3.00 # Initial clauses : 574
% 3.70/3.00 # Removed in clause preprocessing : 0
% 3.70/3.00 # Initial clauses in saturation : 574
% 3.70/3.00 # Processed clauses : 1180
% 3.70/3.00 # ...of these trivial : 0
% 3.70/3.00 # ...subsumed : 3
% 3.70/3.00 # ...remaining for further processing : 1177
% 3.70/3.00 # Other redundant clauses eliminated : 0
% 3.70/3.00 # Clauses deleted for lack of memory : 0
% 3.70/3.00 # Backward-subsumed : 32
% 3.70/3.00 # Backward-rewritten : 0
% 3.70/3.00 # Generated clauses : 532
% 3.70/3.00 # ...of the previous two non-redundant : 530
% 3.70/3.00 # ...aggressively subsumed : 0
% 3.70/3.00 # Contextual simplify-reflections : 0
% 3.70/3.00 # Paramodulations : 530
% 3.70/3.00 # Factorizations : 0
% 3.70/3.00 # NegExts : 0
% 3.70/3.00 # Equation resolutions : 0
% 3.70/3.00 # Disequality decompositions : 0
% 3.70/3.00 # Total rewrite steps : 4
% 3.70/3.00 # ...of those cached : 0
% 3.70/3.00 # Propositional unsat checks : 0
% 3.70/3.00 # Propositional check models : 0
% 3.70/3.00 # Propositional check unsatisfiable : 0
% 3.70/3.00 # Propositional clauses : 0
% 3.70/3.00 # Propositional clauses after purity: 0
% 3.70/3.00 # Propositional unsat core size : 0
% 3.70/3.00 # Propositional preprocessing time : 0.000
% 3.70/3.00 # Propositional encoding time : 0.000
% 3.70/3.00 # Propositional solver time : 0.000
% 3.70/3.00 # Success case prop preproc time : 0.000
% 3.70/3.00 # Success case prop encoding time : 0.000
% 3.70/3.00 # Success case prop solver time : 0.000
% 3.70/3.00 # Current number of processed clauses : 569
% 3.70/3.00 # Positive orientable unit clauses : 371
% 3.70/3.00 # Positive unorientable unit clauses: 0
% 3.70/3.00 # Negative unit clauses : 1
% 3.70/3.00 # Non-unit-clauses : 197
% 3.70/3.00 # Current number of unprocessed clauses: 498
% 3.70/3.00 # ...number of literals in the above : 1612
% 3.70/3.00 # Current number of archived formulas : 0
% 3.70/3.00 # Current number of archived clauses : 608
% 3.70/3.00 # Clause-clause subsumption calls (NU) : 33278
% 3.70/3.00 # Rec. Clause-clause subsumption calls : 14158
% 3.70/3.00 # Non-unit clause-clause subsumptions : 9
% 3.70/3.00 # Unit Clause-clause subsumption calls : 297
% 3.70/3.00 # Rewrite failures with RHS unbound : 0
% 3.70/3.00 # BW rewrite match attempts : 0
% 3.70/3.00 # BW rewrite match successes : 0
% 3.70/3.00 # Condensation attempts : 0
% 3.70/3.00 # Condensation successes : 0
% 3.70/3.00 # Termbank termtop insertions : 74985
% 3.70/3.00 # Search garbage collected termcells : 40673
% 3.70/3.00
% 3.70/3.00 # -------------------------------------------------
% 3.70/3.00 # User time : 0.125 s
% 3.70/3.00 # System time : 0.072 s
% 3.70/3.00 # Total time : 0.197 s
% 3.70/3.00 # Maximum resident set size: 48020 pages
% 3.70/3.00
% 3.70/3.00 # -------------------------------------------------
% 3.70/3.00 # User time : 0.559 s
% 3.70/3.00 # System time : 0.156 s
% 3.70/3.00 # Total time : 0.715 s
% 3.70/3.00 # Maximum resident set size: 10800 pages
% 3.70/3.00 % E---3.1 exiting
% 3.70/3.00 % E exiting
%------------------------------------------------------------------------------