TSTP Solution File: SWC053-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC053-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:19 EDT 2024
% Result : Unsatisfiable 1.80s 0.73s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of clauses : 76 ( 17 unt; 28 nHn; 74 RR)
% Number of literals : 187 ( 72 equ; 87 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 53 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_16,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_14,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_8,negated_conjecture,
( ssList(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( frontsegP(sk4,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
( ssList(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_11,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_9,negated_conjecture,
( neq(sk5,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_13,negated_conjecture,
( frontsegP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_17,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_12,negated_conjecture,
( neq(sk5,nil)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_22,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_23,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_24,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_22 ).
cnf(c_0_25,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_26,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_27,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_31,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_32,negated_conjecture,
( nil = sk2
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_23 ).
cnf(c_0_33,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_25 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_26 ).
cnf(c_0_37,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_27 ).
cnf(c_0_38,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk3 ),
co1_14 ).
cnf(c_0_39,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,negated_conjecture,
( ssList(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_41,negated_conjecture,
( frontsegP(sk4,sk5)
| nil = sk4 ),
co1_10 ).
cnf(c_0_42,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
( ssList(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_44,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_45,negated_conjecture,
( frontsegP(sk3,sk5)
| nil = sk4 ),
co1_11 ).
cnf(c_0_46,negated_conjecture,
( sk4 = nil
| ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_31]),c_0_29]),c_0_31]) ).
cnf(c_0_47,negated_conjecture,
( neq(sk5,nil)
| nil = sk4 ),
co1_9 ).
cnf(c_0_48,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_49,negated_conjecture,
( app(sk5,skaf45(sk3,sk5)) = sk3
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),c_0_40]) ).
cnf(c_0_50,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_51,negated_conjecture,
( app(sk5,skaf45(sk4,sk5)) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_52,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_53,negated_conjecture,
( app(sk5,skaf45(sk3,sk5)) = sk3
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_45]),c_0_39])]),c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( sk4 = nil
| ~ segmentP(sk3,sk5)
| ~ segmentP(sk4,sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( sk3 = nil
| segmentP(sk3,sk5) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),c_0_40]) ).
cnf(c_0_56,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk5) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_51]),c_0_50])]),c_0_43]) ).
cnf(c_0_57,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_58,negated_conjecture,
( sk4 = nil
| sk5 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_50])]),c_0_43]) ).
cnf(c_0_59,negated_conjecture,
( sk3 = nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( frontsegP(sk4,sk5)
| nil = sk3 ),
co1_13 ).
cnf(c_0_61,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_57 ).
cnf(c_0_62,negated_conjecture,
( sk5 = nil
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_64,negated_conjecture,
( app(sk5,skaf45(sk4,sk5)) = sk4
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_60]),c_0_42])]),c_0_40]) ).
cnf(c_0_65,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( sk4 = nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_47,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
c_0_63 ).
cnf(c_0_68,negated_conjecture,
( sk3 = nil
| sk5 = nil
| sk4 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_64]),c_0_50])]),c_0_40]) ).
cnf(c_0_69,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_35])]) ).
cnf(c_0_70,negated_conjecture,
( neq(sk4,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_31]),c_0_29]) ).
cnf(c_0_71,negated_conjecture,
( neq(sk5,nil)
| nil = sk3 ),
co1_12 ).
cnf(c_0_72,negated_conjecture,
( sk5 = nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_73,negated_conjecture,
( neq(nil,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[c_0_70,c_0_69]) ).
cnf(c_0_74,negated_conjecture,
neq(nil,nil),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_74]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC053-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:16:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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
% 1.80/0.73 # Version: 3.1.0
% 1.80/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.80/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.80/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.80/0.73 # Starting new_bool_1 with 300s (1) cores
% 1.80/0.73 # Starting sh5l with 300s (1) cores
% 1.80/0.73 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23071 completed with status 0
% 1.80/0.73 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.80/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.80/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.80/0.73 # No SInE strategy applied
% 1.80/0.73 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.80/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.80/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.80/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.80/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.80/0.73 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.80/0.73 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.80/0.73 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 23077 completed with status 0
% 1.80/0.73 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.80/0.73 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.80/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/0.73 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.80/0.73 # No SInE strategy applied
% 1.80/0.73 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.80/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.80/0.73 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.80/0.73 # Preprocessing time : 0.003 s
% 1.80/0.73 # Presaturation interreduction done
% 1.80/0.73
% 1.80/0.73 # Proof found!
% 1.80/0.73 # SZS status Unsatisfiable
% 1.80/0.73 # SZS output start CNFRefutation
% See solution above
% 1.80/0.73 # Parsed axioms : 203
% 1.80/0.73 # Removed by relevancy pruning/SinE : 0
% 1.80/0.73 # Initial clauses : 203
% 1.80/0.73 # Removed in clause preprocessing : 0
% 1.80/0.73 # Initial clauses in saturation : 203
% 1.80/0.73 # Processed clauses : 2862
% 1.80/0.73 # ...of these trivial : 14
% 1.80/0.73 # ...subsumed : 1738
% 1.80/0.73 # ...remaining for further processing : 1110
% 1.80/0.73 # Other redundant clauses eliminated : 204
% 1.80/0.73 # Clauses deleted for lack of memory : 0
% 1.80/0.73 # Backward-subsumed : 204
% 1.80/0.73 # Backward-rewritten : 220
% 1.80/0.73 # Generated clauses : 10221
% 1.80/0.73 # ...of the previous two non-redundant : 9486
% 1.80/0.73 # ...aggressively subsumed : 0
% 1.80/0.73 # Contextual simplify-reflections : 326
% 1.80/0.73 # Paramodulations : 10002
% 1.80/0.73 # Factorizations : 0
% 1.80/0.73 # NegExts : 0
% 1.80/0.73 # Equation resolutions : 220
% 1.80/0.73 # Disequality decompositions : 0
% 1.80/0.73 # Total rewrite steps : 8877
% 1.80/0.73 # ...of those cached : 8691
% 1.80/0.73 # Propositional unsat checks : 0
% 1.80/0.73 # Propositional check models : 0
% 1.80/0.73 # Propositional check unsatisfiable : 0
% 1.80/0.73 # Propositional clauses : 0
% 1.80/0.73 # Propositional clauses after purity: 0
% 1.80/0.73 # Propositional unsat core size : 0
% 1.80/0.73 # Propositional preprocessing time : 0.000
% 1.80/0.73 # Propositional encoding time : 0.000
% 1.80/0.73 # Propositional solver time : 0.000
% 1.80/0.73 # Success case prop preproc time : 0.000
% 1.80/0.73 # Success case prop encoding time : 0.000
% 1.80/0.73 # Success case prop solver time : 0.000
% 1.80/0.73 # Current number of processed clauses : 468
% 1.80/0.73 # Positive orientable unit clauses : 63
% 1.80/0.73 # Positive unorientable unit clauses: 0
% 1.80/0.73 # Negative unit clauses : 2
% 1.80/0.73 # Non-unit-clauses : 403
% 1.80/0.73 # Current number of unprocessed clauses: 6986
% 1.80/0.73 # ...number of literals in the above : 39864
% 1.80/0.73 # Current number of archived formulas : 0
% 1.80/0.73 # Current number of archived clauses : 619
% 1.80/0.73 # Clause-clause subsumption calls (NU) : 74121
% 1.80/0.73 # Rec. Clause-clause subsumption calls : 19288
% 1.80/0.73 # Non-unit clause-clause subsumptions : 1978
% 1.80/0.73 # Unit Clause-clause subsumption calls : 158
% 1.80/0.73 # Rewrite failures with RHS unbound : 0
% 1.80/0.73 # BW rewrite match attempts : 4
% 1.80/0.73 # BW rewrite match successes : 4
% 1.80/0.73 # Condensation attempts : 0
% 1.80/0.73 # Condensation successes : 0
% 1.80/0.73 # Termbank termtop insertions : 186741
% 1.80/0.73 # Search garbage collected termcells : 544
% 1.80/0.73
% 1.80/0.73 # -------------------------------------------------
% 1.80/0.73 # User time : 0.227 s
% 1.80/0.73 # System time : 0.009 s
% 1.80/0.73 # Total time : 0.236 s
% 1.80/0.73 # Maximum resident set size: 2144 pages
% 1.80/0.73
% 1.80/0.73 # -------------------------------------------------
% 1.80/0.73 # User time : 1.101 s
% 1.80/0.73 # System time : 0.064 s
% 1.80/0.73 # Total time : 1.165 s
% 1.80/0.73 # Maximum resident set size: 1872 pages
% 1.80/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------