TSTP Solution File: SWC149-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC149-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 04:27:57 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 17
% Syntax : Number of clauses : 70 ( 16 unt; 13 nHn; 68 RR)
% Number of literals : 188 ( 55 equ; 119 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 87 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_9,negated_conjecture,
~ singletonP(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_17,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_18,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_19,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_20,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_17 ).
cnf(c_0_21,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_18 ).
cnf(c_0_22,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_25,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_26,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_27,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_25 ).
cnf(c_0_29,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_30,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]) ).
cnf(c_0_31,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_33,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != sk4 ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_37,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_38,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_23])]) ).
cnf(c_0_39,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_23])]) ).
cnf(c_0_40,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_37 ).
cnf(c_0_42,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_38]),c_0_23])]),c_0_39]) ).
cnf(c_0_43,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_44,negated_conjecture,
( app(cons(X1,cons(X2,nil)),X3) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_43 ).
cnf(c_0_46,negated_conjecture,
( cons(X1,app(cons(X2,nil),X3)) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42]) ).
cnf(c_0_47,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_48,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_49,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_50,negated_conjecture,
( cons(X1,cons(X2,X3)) != sk2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_51,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_47 ).
cnf(c_0_52,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_48 ).
cnf(c_0_53,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_49 ).
cnf(c_0_54,negated_conjecture,
( nil = X1
| cons(X2,X1) != sk2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]) ).
cnf(c_0_55,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_56,negated_conjecture,
( tl(sk2) = nil
| sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51])]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
( tl(sk2) = nil
| sk2 = nil
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
( tl(sk2) = nil
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_52]),c_0_55])]) ).
cnf(c_0_59,negated_conjecture,
~ singletonP(sk2),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_60,negated_conjecture,
( cons(hd(sk2),nil) = sk2
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_58]),c_0_55])]) ).
cnf(c_0_61,negated_conjecture,
~ singletonP(sk2),
c_0_59 ).
cnf(c_0_62,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_63,negated_conjecture,
( sk2 = nil
| ~ ssItem(hd(sk2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_60]),c_0_61]) ).
cnf(c_0_64,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_62 ).
cnf(c_0_65,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_66,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_53]),c_0_55])]) ).
cnf(c_0_67,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_68,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC149-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:54:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.55 # Version: 3.1.0
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # sh5l with pid 29787 completed with status 0
% 0.21/0.55 # Result found by sh5l
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.55 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.55 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.21/0.55 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 29796 completed with status 0
% 0.21/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.21/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.55 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.55 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.21/0.55 # Preprocessing time : 0.003 s
% 0.21/0.55 # Presaturation interreduction done
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 194
% 0.21/0.55 # Removed by relevancy pruning/SinE : 26
% 0.21/0.55 # Initial clauses : 168
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 168
% 0.21/0.55 # Processed clauses : 564
% 0.21/0.55 # ...of these trivial : 2
% 0.21/0.55 # ...subsumed : 158
% 0.21/0.55 # ...remaining for further processing : 404
% 0.21/0.55 # Other redundant clauses eliminated : 69
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 13
% 0.21/0.55 # Backward-rewritten : 33
% 0.21/0.55 # Generated clauses : 693
% 0.21/0.55 # ...of the previous two non-redundant : 571
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 14
% 0.21/0.55 # Paramodulations : 620
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 74
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 590
% 0.21/0.55 # ...of those cached : 566
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 177
% 0.21/0.55 # Positive orientable unit clauses : 47
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 2
% 0.21/0.55 # Non-unit-clauses : 128
% 0.21/0.55 # Current number of unprocessed clauses: 323
% 0.21/0.55 # ...number of literals in the above : 1713
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 206
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 11572
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 2192
% 0.21/0.55 # Non-unit clause-clause subsumptions : 116
% 0.21/0.55 # Unit Clause-clause subsumption calls : 146
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 2
% 0.21/0.55 # BW rewrite match successes : 2
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 18880
% 0.21/0.55 # Search garbage collected termcells : 603
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.038 s
% 0.21/0.55 # System time : 0.008 s
% 0.21/0.55 # Total time : 0.046 s
% 0.21/0.55 # Maximum resident set size: 2312 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.042 s
% 0.21/0.55 # System time : 0.011 s
% 0.21/0.55 # Total time : 0.053 s
% 0.21/0.55 # Maximum resident set size: 1896 pages
% 0.21/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------