TSTP Solution File: CSR114+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR114+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Mon May 20 19:15:57 EDT 2024
% Result : Theorem 0.72s 0.66s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 354 ( 0 equ)
% Maximal formula atoms : 273 ( 15 avg)
% Number of connectives : 377 ( 46 ~; 38 |; 292 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 273 ( 17 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 25 ( 24 usr; 1 prp; 0-2 aty)
% Number of functors : 69 ( 69 usr; 67 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 9 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_004_insicht_2,conjecture,
? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',synth_qa07_004_insicht_2) ).
fof(ave07_era5_synth_qa07_004_insicht_2,hypothesis,
( attch(c13,c9)
& attr(c20,c21)
& sub(c20,land_1_1)
& sub(c21,name_1_1)
& val(c21,schweiz_0)
& sub(c25,sohn_1_1)
& agt(c3,c9)
& assoc(c3,c25)
& dircl(c3,c37)
& loc(c3,retro_1_1)
& origl(c3,c38)
& subs(c3,gehen_1_1)
& temp(c3,c4)
& attr(c34,c35)
& sub(c34,land_1_1)
& sub(c35,name_1_1)
& val(c35,italien_0)
& flp(c37,c34)
& flp(c38,c20)
& obj(c384,c389)
& subs(c384,aufnehmen_1_1)
& loc(c389,c403)
& sub(c389,konzert__1_1)
& loc(c393,c402)
& sub(c393,kolosseum_1_1)
& attr(c399,c400)
& sub(c399,stadt__1_1)
& attr(c4,c5)
& sub(c400,name_1_1)
& val(c400,rom_0)
& in(c402,c399)
& in(c403,c393)
& sub(c5,jahr__1_1)
& val(c5,c1)
& pred(c9,eltern_1_1)
& sort(c13,o)
& card(c13,int1)
& etype(c13,int0)
& fact(c13,real)
& gener(c13,sp)
& quant(c13,one)
& refer(c13,det)
& varia(c13,varia_c)
& sort(c9,d)
& card(c9,cons(x_constant,cons(int1,nil)))
& etype(c9,int1)
& fact(c9,real)
& gener(c9,sp)
& quant(c9,mult)
& refer(c9,det)
& varia(c9,varia_c)
& sort(c20,d)
& sort(c20,io)
& card(c20,int1)
& etype(c20,int0)
& fact(c20,real)
& gener(c20,sp)
& quant(c20,one)
& refer(c20,det)
& varia(c20,con)
& sort(c21,na)
& card(c21,int1)
& etype(c21,int0)
& fact(c21,real)
& gener(c21,sp)
& quant(c21,one)
& refer(c21,indet)
& varia(c21,varia_c)
& sort(land_1_1,d)
& sort(land_1_1,io)
& card(land_1_1,int1)
& etype(land_1_1,int0)
& fact(land_1_1,real)
& gener(land_1_1,ge)
& quant(land_1_1,one)
& refer(land_1_1,refer_c)
& varia(land_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(schweiz_0,fe)
& sort(c25,d)
& card(c25,int1)
& etype(c25,int0)
& fact(c25,real)
& gener(c25,sp)
& quant(c25,one)
& refer(c25,det)
& varia(c25,con)
& sort(sohn_1_1,d)
& card(sohn_1_1,int1)
& etype(sohn_1_1,int0)
& fact(sohn_1_1,real)
& gener(sohn_1_1,ge)
& quant(sohn_1_1,one)
& refer(sohn_1_1,refer_c)
& varia(sohn_1_1,varia_c)
& sort(c3,da)
& fact(c3,real)
& gener(c3,sp)
& sort(c37,l)
& card(c37,int1)
& etype(c37,int0)
& fact(c37,real)
& gener(c37,sp)
& quant(c37,one)
& refer(c37,det)
& varia(c37,con)
& sort(retro_1_1,l)
& card(retro_1_1,int1)
& etype(retro_1_1,int0)
& fact(retro_1_1,real)
& gener(retro_1_1,sp)
& quant(retro_1_1,one)
& refer(retro_1_1,refer_c)
& varia(retro_1_1,varia_c)
& sort(c38,l)
& card(c38,int1)
& etype(c38,int0)
& fact(c38,real)
& gener(c38,sp)
& quant(c38,one)
& refer(c38,det)
& varia(c38,con)
& sort(gehen_1_1,da)
& fact(gehen_1_1,real)
& gener(gehen_1_1,ge)
& sort(c4,t)
& card(c4,int1)
& etype(c4,int0)
& fact(c4,real)
& gener(c4,sp)
& quant(c4,one)
& refer(c4,det)
& varia(c4,con)
& sort(c34,d)
& sort(c34,io)
& card(c34,int1)
& etype(c34,int0)
& fact(c34,real)
& gener(c34,sp)
& quant(c34,one)
& refer(c34,det)
& varia(c34,con)
& sort(c35,na)
& card(c35,int1)
& etype(c35,int0)
& fact(c35,real)
& gener(c35,sp)
& quant(c35,one)
& refer(c35,indet)
& varia(c35,varia_c)
& sort(italien_0,fe)
& sort(c384,dn)
& fact(c384,real)
& gener(c384,sp)
& sort(c389,ad)
& sort(c389,d)
& sort(c389,io)
& card(c389,int1)
& etype(c389,int0)
& fact(c389,real)
& gener(c389,sp)
& quant(c389,one)
& refer(c389,det)
& varia(c389,con)
& sort(aufnehmen_1_1,dn)
& fact(aufnehmen_1_1,real)
& gener(aufnehmen_1_1,ge)
& sort(c403,l)
& card(c403,int1)
& etype(c403,int0)
& fact(c403,real)
& gener(c403,sp)
& quant(c403,one)
& refer(c403,det)
& varia(c403,con)
& sort(konzert__1_1,ad)
& sort(konzert__1_1,d)
& sort(konzert__1_1,io)
& card(konzert__1_1,int1)
& etype(konzert__1_1,int0)
& fact(konzert__1_1,real)
& gener(konzert__1_1,ge)
& quant(konzert__1_1,one)
& refer(konzert__1_1,refer_c)
& varia(konzert__1_1,varia_c)
& sort(c393,d)
& card(c393,int1)
& etype(c393,int0)
& fact(c393,real)
& gener(c393,sp)
& quant(c393,one)
& refer(c393,det)
& varia(c393,con)
& sort(c402,l)
& card(c402,int1)
& etype(c402,int0)
& fact(c402,real)
& gener(c402,sp)
& quant(c402,one)
& refer(c402,det)
& varia(c402,con)
& sort(kolosseum_1_1,d)
& card(kolosseum_1_1,int1)
& etype(kolosseum_1_1,int0)
& fact(kolosseum_1_1,real)
& gener(kolosseum_1_1,sp)
& quant(kolosseum_1_1,one)
& refer(kolosseum_1_1,det)
& varia(kolosseum_1_1,con)
& sort(c399,d)
& sort(c399,io)
& card(c399,int1)
& etype(c399,int0)
& fact(c399,real)
& gener(c399,sp)
& quant(c399,one)
& refer(c399,det)
& varia(c399,con)
& sort(c400,na)
& card(c400,int1)
& etype(c400,int0)
& fact(c400,real)
& gener(c400,sp)
& quant(c400,one)
& refer(c400,indet)
& varia(c400,varia_c)
& sort(stadt__1_1,d)
& sort(stadt__1_1,io)
& card(stadt__1_1,int1)
& etype(stadt__1_1,int0)
& fact(stadt__1_1,real)
& gener(stadt__1_1,ge)
& quant(stadt__1_1,one)
& refer(stadt__1_1,refer_c)
& varia(stadt__1_1,varia_c)
& sort(c5,me)
& sort(c5,oa)
& sort(c5,ta)
& card(c5,card_c)
& etype(c5,etype_c)
& fact(c5,real)
& gener(c5,sp)
& quant(c5,quant_c)
& refer(c5,refer_c)
& varia(c5,varia_c)
& sort(rom_0,fe)
& sort(jahr__1_1,me)
& sort(jahr__1_1,oa)
& sort(jahr__1_1,ta)
& card(jahr__1_1,card_c)
& etype(jahr__1_1,etype_c)
& fact(jahr__1_1,real)
& gener(jahr__1_1,ge)
& quant(jahr__1_1,quant_c)
& refer(jahr__1_1,refer_c)
& varia(jahr__1_1,varia_c)
& sort(c1,nu)
& card(c1,int1970)
& sort(eltern_1_1,d)
& card(eltern_1_1,int1)
& etype(eltern_1_1,int0)
& fact(eltern_1_1,real)
& gener(eltern_1_1,ge)
& quant(eltern_1_1,one)
& refer(eltern_1_1,refer_c)
& varia(eltern_1_1,varia_c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ave07_era5_synth_qa07_004_insicht_2) ).
fof(loc__stehen_1_1_loc,axiom,
! [X1,X2] :
( loc(X1,X2)
=> ? [X3] :
( loc(X3,X2)
& scar(X3,X1)
& subs(X3,stehen_1_1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR004+0.ax',loc__stehen_1_1_loc) ).
fof(c_0_3,negated_conjecture,
~ ? [X1,X2,X3,X4,X5] :
( in(X3,X1)
& attr(X1,X2)
& loc(X5,X3)
& scar(X5,X4)
& sub(X2,name_1_1)
& sub(X1,stadt__1_1)
& sub(X4,kolosseum_1_1)
& subs(X5,stehen_1_1)
& val(X2,rom_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_004_insicht_2]) ).
fof(c_0_4,negated_conjecture,
! [X8,X9,X10,X11,X12] :
( ~ in(X10,X8)
| ~ attr(X8,X9)
| ~ loc(X12,X10)
| ~ scar(X12,X11)
| ~ sub(X9,name_1_1)
| ~ sub(X8,stadt__1_1)
| ~ sub(X11,kolosseum_1_1)
| ~ subs(X12,stehen_1_1)
| ~ val(X9,rom_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ in(X1,X2)
| ~ attr(X2,X3)
| ~ loc(X4,X1)
| ~ scar(X4,X5)
| ~ sub(X3,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ sub(X5,kolosseum_1_1)
| ~ subs(X4,stehen_1_1)
| ~ val(X3,rom_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,hypothesis,
val(c400,rom_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
cnf(c_0_7,hypothesis,
sub(c400,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
cnf(c_0_8,hypothesis,
( ~ in(X1,X2)
| ~ attr(X2,c400)
| ~ scar(X3,X4)
| ~ loc(X3,X1)
| ~ subs(X3,stehen_1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ sub(X2,stadt__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,hypothesis,
attr(c399,c400),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
cnf(c_0_10,hypothesis,
sub(c399,stadt__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
cnf(c_0_11,hypothesis,
( ~ in(X1,c399)
| ~ scar(X2,X3)
| ~ loc(X2,X1)
| ~ subs(X2,stehen_1_1)
| ~ sub(X3,kolosseum_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_12,hypothesis,
in(c402,c399),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
fof(c_0_13,plain,
! [X36,X37] :
( ( loc(esk6_2(X36,X37),X37)
| ~ loc(X36,X37) )
& ( scar(esk6_2(X36,X37),X36)
| ~ loc(X36,X37) )
& ( subs(esk6_2(X36,X37),stehen_1_1)
| ~ loc(X36,X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__stehen_1_1_loc])])])])]) ).
cnf(c_0_14,hypothesis,
( ~ scar(X1,X2)
| ~ loc(X1,c402)
| ~ subs(X1,stehen_1_1)
| ~ sub(X2,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( scar(esk6_2(X1,X2),X1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( subs(esk6_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
( ~ loc(esk6_2(X1,X2),c402)
| ~ loc(X1,X2)
| ~ sub(X1,kolosseum_1_1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
( loc(esk6_2(X1,X2),X2)
| ~ loc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
( ~ loc(X1,c402)
| ~ sub(X1,kolosseum_1_1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,hypothesis,
loc(c393,c402),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
cnf(c_0_21,hypothesis,
sub(c393,kolosseum_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_004_insicht_2]) ).
cnf(c_0_22,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : CSR114+3 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n003.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 02:11:22 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.72/0.66 # Version: 3.1.0
% 0.72/0.66 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.72/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.66 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.72/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.72/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.72/0.66 # Starting sh5l with 300s (1) cores
% 0.72/0.66 # new_bool_1 with pid 23042 completed with status 0
% 0.72/0.66 # Result found by new_bool_1
% 0.72/0.66 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.72/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.66 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.72/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.72/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.72/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.72/0.66 # Search class: FHHNF-FSLM32-SFFFFFNN
% 0.72/0.66 # partial match(1): FGHNF-FSLM32-SFFFFFNN
% 0.72/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.72/0.66 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.72/0.66 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 23044 completed with status 0
% 0.72/0.66 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.72/0.66 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.72/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.72/0.66 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.72/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.72/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.72/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.72/0.66 # Search class: FHHNF-FSLM32-SFFFFFNN
% 0.72/0.66 # partial match(1): FGHNF-FSLM32-SFFFFFNN
% 0.72/0.66 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.72/0.66 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.72/0.66 # Preprocessing time : 0.009 s
% 0.72/0.66 # Presaturation interreduction done
% 0.72/0.66
% 0.72/0.66 # Proof found!
% 0.72/0.66 # SZS status Theorem
% 0.72/0.66 # SZS output start CNFRefutation
% See solution above
% 0.72/0.66 # Parsed axioms : 10189
% 0.72/0.66 # Removed by relevancy pruning/SinE : 10106
% 0.72/0.66 # Initial clauses : 379
% 0.72/0.66 # Removed in clause preprocessing : 0
% 0.72/0.66 # Initial clauses in saturation : 379
% 0.72/0.66 # Processed clauses : 793
% 0.72/0.66 # ...of these trivial : 0
% 0.72/0.66 # ...subsumed : 0
% 0.72/0.66 # ...remaining for further processing : 793
% 0.72/0.66 # Other redundant clauses eliminated : 0
% 0.72/0.66 # Clauses deleted for lack of memory : 0
% 0.72/0.66 # Backward-subsumed : 0
% 0.72/0.66 # Backward-rewritten : 0
% 0.72/0.66 # Generated clauses : 144
% 0.72/0.66 # ...of the previous two non-redundant : 143
% 0.72/0.66 # ...aggressively subsumed : 0
% 0.72/0.66 # Contextual simplify-reflections : 1
% 0.72/0.66 # Paramodulations : 144
% 0.72/0.66 # Factorizations : 0
% 0.72/0.66 # NegExts : 0
% 0.72/0.66 # Equation resolutions : 0
% 0.72/0.66 # Disequality decompositions : 0
% 0.72/0.66 # Total rewrite steps : 3
% 0.72/0.66 # ...of those cached : 0
% 0.72/0.66 # Propositional unsat checks : 0
% 0.72/0.66 # Propositional check models : 0
% 0.72/0.66 # Propositional check unsatisfiable : 0
% 0.72/0.66 # Propositional clauses : 0
% 0.72/0.66 # Propositional clauses after purity: 0
% 0.72/0.66 # Propositional unsat core size : 0
% 0.72/0.66 # Propositional preprocessing time : 0.000
% 0.72/0.66 # Propositional encoding time : 0.000
% 0.72/0.66 # Propositional solver time : 0.000
% 0.72/0.66 # Success case prop preproc time : 0.000
% 0.72/0.66 # Success case prop encoding time : 0.000
% 0.72/0.66 # Success case prop solver time : 0.000
% 0.72/0.66 # Current number of processed clauses : 414
% 0.72/0.66 # Positive orientable unit clauses : 342
% 0.72/0.66 # Positive unorientable unit clauses: 0
% 0.72/0.66 # Negative unit clauses : 0
% 0.72/0.66 # Non-unit-clauses : 72
% 0.72/0.66 # Current number of unprocessed clauses: 107
% 0.72/0.66 # ...number of literals in the above : 276
% 0.72/0.66 # Current number of archived formulas : 0
% 0.72/0.66 # Current number of archived clauses : 379
% 0.72/0.66 # Clause-clause subsumption calls (NU) : 4581
% 0.72/0.66 # Rec. Clause-clause subsumption calls : 2038
% 0.72/0.66 # Non-unit clause-clause subsumptions : 1
% 0.72/0.66 # Unit Clause-clause subsumption calls : 88
% 0.72/0.66 # Rewrite failures with RHS unbound : 0
% 0.72/0.66 # BW rewrite match attempts : 0
% 0.72/0.66 # BW rewrite match successes : 0
% 0.72/0.66 # Condensation attempts : 0
% 0.72/0.66 # Condensation successes : 0
% 0.72/0.66 # Termbank termtop insertions : 56198
% 0.72/0.66 # Search garbage collected termcells : 39242
% 0.72/0.66
% 0.72/0.66 # -------------------------------------------------
% 0.72/0.66 # User time : 0.066 s
% 0.72/0.66 # System time : 0.053 s
% 0.72/0.66 # Total time : 0.119 s
% 0.72/0.66 # Maximum resident set size: 42656 pages
% 0.72/0.66
% 0.72/0.66 # -------------------------------------------------
% 0.72/0.66 # User time : 0.139 s
% 0.72/0.66 # System time : 0.068 s
% 0.72/0.66 # Total time : 0.207 s
% 0.72/0.66 # Maximum resident set size: 10696 pages
% 0.72/0.66 % E---3.1 exiting
% 0.72/0.66 % E exiting
%------------------------------------------------------------------------------