TSTP Solution File: PLA031-1.003 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA031-1.003 : TPTP v8.2.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Tue May 21 02:19:17 EDT 2024
% Result : Unsatisfiable 64.17s 8.54s
% Output : CNFRefutation 64.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 21
% Syntax : Number of clauses : 79 ( 37 unt; 0 nHn; 79 RR)
% Number of literals : 133 ( 0 equ; 57 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-8 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 266 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk2,axiom,
( s(X1,X2,X3,X4,X5,X9,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X6,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk2) ).
cnf(init,axiom,
s(s1,s2,s2,s0,s2,s0,s1,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(map1,axiom,
path(s0,p0_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map1) ).
cnf(board5,axiom,
( s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ neq(X5,truck1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board5) ).
cnf(load1,axiom,
( s(truck1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load1) ).
cnf(map4,axiom,
path(p0_1,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map4) ).
cnf(neq33,axiom,
neq(s2,truck1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq33) ).
cnf(drive3,axiom,
( s(X1,X2,X3,X4,X5,truck1,X8,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ link(X6,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive3) ).
cnf(load2,axiom,
( s(X1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load2) ).
cnf(map13,axiom,
link(s1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map13) ).
cnf(load9,axiom,
( s(X1,X2,truck1,X4,X5,X6,X3,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X3,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load9) ).
cnf(load10,axiom,
( s(X1,X2,X3,X4,X5,X6,X3,X7)
| ~ s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load10) ).
cnf(map15,axiom,
link(s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map15) ).
cnf(load13,axiom,
( s(X1,X2,X3,truck1,X5,X6,X4,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load13) ).
cnf(load14,axiom,
( s(X1,X2,X3,X4,X5,X6,X4,X7)
| ~ s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load14) ).
cnf(map16,axiom,
link(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map16) ).
cnf(board6,axiom,
( s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board6) ).
cnf(walk1,axiom,
( s(X1,X2,X3,X4,X9,X6,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X5,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk1) ).
cnf(map7,axiom,
path(s2,p1_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).
cnf(goal,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(map6,axiom,
path(p1_2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).
cnf(c_0_21,plain,
( s(X1,X2,X3,X4,X5,X9,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X6,X9) ),
inference(fof_simplification,[status(thm)],[walk2]) ).
cnf(c_0_22,plain,
( s(X1,X2,X3,X4,X5,X9,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X6,X9) ),
c_0_21 ).
cnf(c_0_23,axiom,
s(s1,s2,s2,s0,s2,s0,s1,s1),
init ).
cnf(c_0_24,plain,
( s(s1,s2,s2,s0,s2,X1,s1,s1)
| ~ path(s0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,axiom,
path(s0,p0_1),
map1 ).
cnf(c_0_26,plain,
s(s1,s2,s2,s0,s2,p0_1,s1,s1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ neq(X5,truck1) ),
inference(fof_simplification,[status(thm)],[board5]) ).
cnf(c_0_28,plain,
( s(truck1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X1,X7) ),
inference(fof_simplification,[status(thm)],[load1]) ).
cnf(c_0_29,plain,
( s(s1,s2,s2,s0,s2,X1,s1,s1)
| ~ path(p0_1,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_30,axiom,
path(p0_1,s1),
map4 ).
cnf(c_0_31,plain,
( s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ neq(X5,truck1) ),
c_0_27 ).
cnf(c_0_32,axiom,
neq(s2,truck1),
neq33 ).
cnf(c_0_33,plain,
( s(truck1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X1,X7) ),
c_0_28 ).
cnf(c_0_34,plain,
s(s1,s2,s2,s0,s2,s1,s1,s1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( s(X1,X2,X3,X4,X5,truck1,X8,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ link(X6,X8) ),
inference(fof_simplification,[status(thm)],[drive3]) ).
cnf(c_0_36,plain,
( s(X1,X2,X3,X4,s2,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,s2,X5,X5,X6) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
s(truck1,s2,s2,s0,s2,s1,s1,s1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( s(X1,X2,X3,X4,X5,truck1,X8,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7)
| ~ link(X6,X8) ),
c_0_35 ).
cnf(c_0_39,plain,
s(truck1,s2,s2,s0,s2,truck1,s1,s1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( s(X1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
inference(fof_simplification,[status(thm)],[load2]) ).
cnf(c_0_41,plain,
( s(truck1,s2,s2,s0,s2,truck1,X1,s1)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,axiom,
link(s1,s2),
map13 ).
cnf(c_0_43,plain,
( s(X1,X2,truck1,X4,X5,X6,X3,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X3,X7) ),
inference(fof_simplification,[status(thm)],[load9]) ).
cnf(c_0_44,plain,
( s(X1,X2,X3,X4,X5,X6,X1,X7)
| ~ s(truck1,X2,X3,X4,X5,X6,X1,X7) ),
c_0_40 ).
cnf(c_0_45,plain,
s(truck1,s2,s2,s0,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( s(X1,X2,truck1,X4,X5,X6,X3,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X3,X7) ),
c_0_43 ).
cnf(c_0_47,plain,
s(s2,s2,s2,s0,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
s(s2,s2,truck1,s0,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
( s(X1,X2,X3,X4,X5,X6,X3,X7)
| ~ s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
inference(fof_simplification,[status(thm)],[load10]) ).
cnf(c_0_50,plain,
( s(s2,s2,truck1,s0,s2,truck1,X1,s1)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_51,axiom,
link(s2,s0),
map15 ).
cnf(c_0_52,plain,
( s(X1,X2,X3,truck1,X5,X6,X4,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X4,X7) ),
inference(fof_simplification,[status(thm)],[load13]) ).
cnf(c_0_53,plain,
( s(X1,X2,X3,X4,X5,X6,X3,X7)
| ~ s(X1,X2,truck1,X4,X5,X6,X3,X7) ),
c_0_49 ).
cnf(c_0_54,plain,
s(s2,s2,truck1,s0,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( s(X1,X2,X3,truck1,X5,X6,X4,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X4,X7) ),
c_0_52 ).
cnf(c_0_56,plain,
s(s2,s2,s0,s0,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
s(s2,s2,s0,truck1,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,plain,
( s(X1,X2,X3,X4,X5,X6,X4,X7)
| ~ s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
inference(fof_simplification,[status(thm)],[load14]) ).
cnf(c_0_59,plain,
( s(s2,s2,s0,truck1,s2,truck1,X1,s1)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_57]) ).
cnf(c_0_60,axiom,
link(s0,s2),
map16 ).
cnf(c_0_61,plain,
( s(X1,X2,X3,X4,X5,X6,X4,X7)
| ~ s(X1,X2,X3,truck1,X5,X6,X4,X7) ),
c_0_58 ).
cnf(c_0_62,plain,
s(s2,s2,s0,truck1,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
s(s2,s2,s0,s2,s2,truck1,s2,s1),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,plain,
( s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7) ),
inference(fof_simplification,[status(thm)],[board6]) ).
cnf(c_0_65,plain,
( s(s2,s2,s0,s2,s2,truck1,X1,s1)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_63]) ).
cnf(c_0_66,plain,
( s(X1,X2,X3,X4,X9,X6,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X5,X9) ),
inference(fof_simplification,[status(thm)],[walk1]) ).
cnf(c_0_67,plain,
( s(X1,X2,X3,X4,X5,X6,X6,X7)
| ~ s(X1,X2,X3,X4,X5,truck1,X6,X7) ),
c_0_64 ).
cnf(c_0_68,plain,
s(s2,s2,s0,s2,s2,truck1,s0,s1),
inference(spm,[status(thm)],[c_0_65,c_0_51]) ).
cnf(c_0_69,plain,
( s(X1,X2,X3,X4,X9,X6,X7,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8)
| ~ path(X5,X9) ),
c_0_66 ).
cnf(c_0_70,plain,
s(s2,s2,s0,s2,s2,s0,s0,s1),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
( s(s2,s2,s0,s2,X1,s0,s0,s1)
| ~ path(s2,X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,axiom,
path(s2,p1_2),
map7 ).
cnf(c_0_73,plain,
s(s2,s2,s0,s2,p1_2,s0,s0,s1),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_75,plain,
( s(s2,s2,s0,s2,X1,s0,s0,s1)
| ~ path(p1_2,X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_73]) ).
cnf(c_0_76,axiom,
path(p1_2,s1),
map6 ).
cnf(c_0_77,negated_conjecture,
~ s(s2,s2,s0,s2,s1,X1,s0,X2),
c_0_74 ).
cnf(c_0_78,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA031-1.003 : TPTP v8.2.0. Released v3.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 13:35:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 64.17/8.54 # Version: 3.1.0
% 64.17/8.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 64.17/8.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.17/8.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 64.17/8.54 # Starting new_bool_3 with 300s (1) cores
% 64.17/8.54 # Starting new_bool_1 with 300s (1) cores
% 64.17/8.54 # Starting sh5l with 300s (1) cores
% 64.17/8.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 20061 completed with status 0
% 64.17/8.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 64.17/8.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 64.17/8.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.17/8.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 64.17/8.54 # No SInE strategy applied
% 64.17/8.54 # Search class: FHUNF-FFMM00-SFFFFFNN
% 64.17/8.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 64.17/8.54 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 811s (1) cores
% 64.17/8.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 64.17/8.54 # Starting new_bool_3 with 136s (1) cores
% 64.17/8.54 # Starting new_bool_1 with 136s (1) cores
% 64.17/8.54 # Starting sh5l with 136s (1) cores
% 64.17/8.54 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 20065 completed with status 0
% 64.17/8.54 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 64.17/8.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 64.17/8.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.17/8.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 64.17/8.54 # No SInE strategy applied
% 64.17/8.54 # Search class: FHUNF-FFMM00-SFFFFFNN
% 64.17/8.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 64.17/8.54 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 811s (1) cores
% 64.17/8.54 # Preprocessing time : 0.002 s
% 64.17/8.54
% 64.17/8.54 # Proof found!
% 64.17/8.54 # SZS status Unsatisfiable
% 64.17/8.54 # SZS output start CNFRefutation
% See solution above
% 64.17/8.54 # Parsed axioms : 112
% 64.17/8.54 # Removed by relevancy pruning/SinE : 0
% 64.17/8.54 # Initial clauses : 112
% 64.17/8.54 # Removed in clause preprocessing : 0
% 64.17/8.54 # Initial clauses in saturation : 112
% 64.17/8.54 # Processed clauses : 32164
% 64.17/8.54 # ...of these trivial : 8258
% 64.17/8.54 # ...subsumed : 0
% 64.17/8.54 # ...remaining for further processing : 23906
% 64.17/8.54 # Other redundant clauses eliminated : 0
% 64.17/8.54 # Clauses deleted for lack of memory : 0
% 64.17/8.54 # Backward-subsumed : 0
% 64.17/8.54 # Backward-rewritten : 0
% 64.17/8.54 # Generated clauses : 80856
% 64.17/8.54 # ...of the previous two non-redundant : 56728
% 64.17/8.54 # ...aggressively subsumed : 0
% 64.17/8.54 # Contextual simplify-reflections : 0
% 64.17/8.54 # Paramodulations : 80856
% 64.17/8.54 # Factorizations : 0
% 64.17/8.54 # NegExts : 0
% 64.17/8.54 # Equation resolutions : 0
% 64.17/8.54 # Disequality decompositions : 0
% 64.17/8.54 # Total rewrite steps : 32385
% 64.17/8.54 # ...of those cached : 21144
% 64.17/8.54 # Propositional unsat checks : 0
% 64.17/8.54 # Propositional check models : 0
% 64.17/8.54 # Propositional check unsatisfiable : 0
% 64.17/8.54 # Propositional clauses : 0
% 64.17/8.54 # Propositional clauses after purity: 0
% 64.17/8.54 # Propositional unsat core size : 0
% 64.17/8.54 # Propositional preprocessing time : 0.000
% 64.17/8.54 # Propositional encoding time : 0.000
% 64.17/8.54 # Propositional solver time : 0.000
% 64.17/8.54 # Success case prop preproc time : 0.000
% 64.17/8.54 # Success case prop encoding time : 0.000
% 64.17/8.54 # Success case prop solver time : 0.000
% 64.17/8.54 # Current number of processed clauses : 23906
% 64.17/8.54 # Positive orientable unit clauses : 11947
% 64.17/8.54 # Positive unorientable unit clauses: 0
% 64.17/8.54 # Negative unit clauses : 9
% 64.17/8.54 # Non-unit-clauses : 11950
% 64.17/8.54 # Current number of unprocessed clauses: 24676
% 64.17/8.54 # ...number of literals in the above : 37315
% 64.17/8.54 # Current number of archived formulas : 0
% 64.17/8.54 # Current number of archived clauses : 0
% 64.17/8.54 # Clause-clause subsumption calls (NU) : 3335879
% 64.17/8.54 # Rec. Clause-clause subsumption calls : 3333117
% 64.17/8.54 # Non-unit clause-clause subsumptions : 0
% 64.17/8.54 # Unit Clause-clause subsumption calls : 7639578
% 64.17/8.54 # Rewrite failures with RHS unbound : 0
% 64.17/8.54 # BW rewrite match attempts : 6221471
% 64.17/8.54 # BW rewrite match successes : 0
% 64.17/8.54 # Condensation attempts : 0
% 64.17/8.54 # Condensation successes : 0
% 64.17/8.54 # Termbank termtop insertions : 1187827
% 64.17/8.54 # Search garbage collected termcells : 106
% 64.17/8.54
% 64.17/8.54 # -------------------------------------------------
% 64.17/8.54 # User time : 7.949 s
% 64.17/8.54 # System time : 0.088 s
% 64.17/8.54 # Total time : 8.038 s
% 64.17/8.54 # Maximum resident set size: 1788 pages
% 64.17/8.54
% 64.17/8.54 # -------------------------------------------------
% 64.17/8.54 # User time : 39.894 s
% 64.17/8.54 # System time : 0.232 s
% 64.17/8.54 # Total time : 40.126 s
% 64.17/8.54 # Maximum resident set size: 1752 pages
% 64.17/8.54 % E---3.1 exiting
% 64.17/8.54 % E exiting
%------------------------------------------------------------------------------