TSTP Solution File: SWV379+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV379+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 05:34:37 EDT 2024
% Result : Theorem 1.28s 0.67s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 10 unt; 0 def)
% Number of atoms : 118 ( 43 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 111 ( 40 ~; 42 |; 16 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 103 ( 19 sgn 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax48,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(ax47,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(stricly_smaller_definition,axiom,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(totality,axiom,
! [X1,X2] :
( less_than(X1,X2)
| less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(l15_co,conjecture,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l15_co) ).
fof(ax41,axiom,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(ax40,axiom,
! [X1,X2] :
( ok(triple(X1,X2,bad))
<=> ~ $true ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(ax49,axiom,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(ax46,axiom,
! [X1,X2] : findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(c_0_9,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax48]) ).
fof(c_0_10,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& ~ contains_slb(X2,findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad) ),
inference(fof_simplification,[status(thm)],[ax47]) ).
fof(c_0_11,plain,
! [X1,X2] :
( strictly_less_than(X1,X2)
<=> ( less_than(X1,X2)
& ~ less_than(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[stricly_smaller_definition]) ).
fof(c_0_12,plain,
! [X106,X107,X108] :
( X107 = create_slb
| ~ contains_slb(X107,findmin_pqp_res(X106))
| ~ strictly_less_than(findmin_pqp_res(X106),lookup_slb(X107,findmin_pqp_res(X106)))
| findmin_cpq_eff(triple(X106,X107,X108)) = triple(X106,update_slb(X107,findmin_pqp_res(X106)),bad) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X103,X104,X105] :
( X104 = create_slb
| contains_slb(X104,findmin_pqp_res(X103))
| findmin_cpq_eff(triple(X103,X104,X105)) = triple(X103,update_slb(X104,findmin_pqp_res(X103)),bad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X12,X13] :
( ( less_than(X12,X13)
| ~ strictly_less_than(X12,X13) )
& ( ~ less_than(X13,X12)
| ~ strictly_less_than(X12,X13) )
& ( ~ less_than(X12,X13)
| less_than(X13,X12)
| strictly_less_than(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_15,plain,
! [X9,X10] :
( less_than(X9,X10)
| less_than(X10,X9) ),
inference(variable_rename,[status(thm)],[totality]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> ~ ok(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l15_co])]) ).
fof(c_0_17,plain,
! [X1,X2,X3] :
( ~ ok(triple(X1,X2,X3))
=> X3 = bad ),
inference(fof_simplification,[status(thm)],[ax41]) ).
fof(c_0_18,plain,
! [X80,X81] :
( ( ~ ok(triple(X80,X81,bad))
| ~ $true )
& ( $true
| ok(triple(X80,X81,bad)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax40])])]) ).
cnf(c_0_19,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ strictly_less_than(findmin_pqp_res(X2),lookup_slb(X1,findmin_pqp_res(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),bad) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( less_than(X2,X1)
| strictly_less_than(X1,X2)
| ~ less_than(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( less_than(X1,X2)
| less_than(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,negated_conjecture,
( ~ ok(triple(esk1_0,esk2_0,esk3_0))
& ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_24,plain,
! [X82,X83,X84] :
( ok(triple(X82,X83,X84))
| X84 = bad ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
cnf(c_0_25,plain,
( ~ ok(triple(X1,X2,bad))
| $false ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| ~ strictly_less_than(findmin_pqp_res(X1),lookup_slb(X2,findmin_pqp_res(X1))) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( strictly_less_than(X1,X2)
| less_than(X2,X1) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ ok(triple(esk1_0,esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ok(triple(X1,X2,X3))
| X3 = bad ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,plain,
! [X1,X2,X3,X4] :
( ( X2 != create_slb
& contains_slb(X2,findmin_pqp_res(X1))
& less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) )
=> findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),X3) ),
inference(fof_simplification,[status(thm)],[ax49]) ).
cnf(c_0_31,plain,
~ ok(triple(X1,X2,bad)),
inference(cn,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( findmin_cpq_eff(triple(X1,X2,X3)) = triple(X1,update_slb(X2,findmin_pqp_res(X1)),bad)
| X2 = create_slb
| less_than(lookup_slb(X2,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
esk3_0 = bad,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_35,plain,
! [X109,X110,X111] :
( X110 = create_slb
| ~ contains_slb(X110,findmin_pqp_res(X109))
| ~ less_than(lookup_slb(X110,findmin_pqp_res(X109)),findmin_pqp_res(X109))
| findmin_cpq_eff(triple(X109,X110,X111)) = triple(X109,update_slb(X110,findmin_pqp_res(X109)),X111) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_30])])])]) ).
cnf(c_0_36,plain,
( X1 = create_slb
| less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ok(findmin_cpq_eff(triple(esk1_0,esk2_0,bad))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( X1 = create_slb
| contains_slb(X1,findmin_pqp_res(X2))
| ~ ok(findmin_cpq_eff(triple(X2,X1,X3))) ),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_39,plain,
( X1 = create_slb
| findmin_cpq_eff(triple(X2,X1,X3)) = triple(X2,update_slb(X1,findmin_pqp_res(X2)),X3)
| ~ contains_slb(X1,findmin_pqp_res(X2))
| ~ less_than(lookup_slb(X1,findmin_pqp_res(X2)),findmin_pqp_res(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( esk2_0 = create_slb
| less_than(lookup_slb(esk2_0,findmin_pqp_res(esk1_0)),findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( esk2_0 = create_slb
| contains_slb(esk2_0,findmin_pqp_res(esk1_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( triple(esk1_0,update_slb(esk2_0,findmin_pqp_res(esk1_0)),X1) = findmin_cpq_eff(triple(esk1_0,esk2_0,X1))
| esk2_0 = create_slb ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
fof(c_0_43,plain,
! [X101,X102] : findmin_cpq_eff(triple(X101,create_slb,X102)) = triple(X101,create_slb,bad),
inference(variable_rename,[status(thm)],[ax46]) ).
cnf(c_0_44,negated_conjecture,
esk2_0 = create_slb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_42]),c_0_37])]) ).
cnf(c_0_45,plain,
findmin_cpq_eff(triple(X1,create_slb,X2)) = triple(X1,create_slb,bad),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_44]),c_0_34]),c_0_45]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWV379+1 : TPTP v8.2.0. Released v3.3.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.16/0.39 % Computer : n007.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Sun May 19 07:16:53 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.25/0.52 Running first-order model finding
% 0.25/0.52 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.28/0.67 # Version: 3.1.0
% 1.28/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.28/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.28/0.67 # Starting sh5l with 300s (1) cores
% 1.28/0.67 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6075 completed with status 0
% 1.28/0.67 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.28/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.67 # No SInE strategy applied
% 1.28/0.67 # Search class: FGHSM-FFMF31-MFFFFFNN
% 1.28/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.28/0.67 # Starting new_bool_3 with 136s (1) cores
% 1.28/0.67 # Starting new_bool_1 with 136s (1) cores
% 1.28/0.67 # Starting sh5l with 136s (1) cores
% 1.28/0.67 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6082 completed with status 0
% 1.28/0.67 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.28/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.67 # No SInE strategy applied
% 1.28/0.67 # Search class: FGHSM-FFMF31-MFFFFFNN
% 1.28/0.67 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 811s (1) cores
% 1.28/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.28/0.67 # Preprocessing time : 0.002 s
% 1.28/0.67 # Presaturation interreduction done
% 1.28/0.67
% 1.28/0.67 # Proof found!
% 1.28/0.67 # SZS status Theorem
% 1.28/0.67 # SZS output start CNFRefutation
% See solution above
% 1.28/0.67 # Parsed axioms : 42
% 1.28/0.67 # Removed by relevancy pruning/SinE : 0
% 1.28/0.67 # Initial clauses : 54
% 1.28/0.67 # Removed in clause preprocessing : 4
% 1.28/0.67 # Initial clauses in saturation : 50
% 1.28/0.67 # Processed clauses : 763
% 1.28/0.67 # ...of these trivial : 1
% 1.28/0.67 # ...subsumed : 341
% 1.28/0.67 # ...remaining for further processing : 421
% 1.28/0.67 # Other redundant clauses eliminated : 3
% 1.28/0.67 # Clauses deleted for lack of memory : 0
% 1.28/0.67 # Backward-subsumed : 11
% 1.28/0.67 # Backward-rewritten : 30
% 1.28/0.67 # Generated clauses : 4069
% 1.28/0.67 # ...of the previous two non-redundant : 3846
% 1.28/0.67 # ...aggressively subsumed : 0
% 1.28/0.67 # Contextual simplify-reflections : 5
% 1.28/0.67 # Paramodulations : 4047
% 1.28/0.67 # Factorizations : 20
% 1.28/0.67 # NegExts : 0
% 1.28/0.67 # Equation resolutions : 3
% 1.28/0.67 # Disequality decompositions : 0
% 1.28/0.67 # Total rewrite steps : 815
% 1.28/0.67 # ...of those cached : 652
% 1.28/0.67 # Propositional unsat checks : 0
% 1.28/0.67 # Propositional check models : 0
% 1.28/0.67 # Propositional check unsatisfiable : 0
% 1.28/0.67 # Propositional clauses : 0
% 1.28/0.67 # Propositional clauses after purity: 0
% 1.28/0.67 # Propositional unsat core size : 0
% 1.28/0.67 # Propositional preprocessing time : 0.000
% 1.28/0.67 # Propositional encoding time : 0.000
% 1.28/0.67 # Propositional solver time : 0.000
% 1.28/0.67 # Success case prop preproc time : 0.000
% 1.28/0.67 # Success case prop encoding time : 0.000
% 1.28/0.67 # Success case prop solver time : 0.000
% 1.28/0.67 # Current number of processed clauses : 328
% 1.28/0.67 # Positive orientable unit clauses : 27
% 1.28/0.67 # Positive unorientable unit clauses: 0
% 1.28/0.67 # Negative unit clauses : 60
% 1.28/0.67 # Non-unit-clauses : 241
% 1.28/0.67 # Current number of unprocessed clauses: 3169
% 1.28/0.67 # ...number of literals in the above : 14237
% 1.28/0.67 # Current number of archived formulas : 0
% 1.28/0.67 # Current number of archived clauses : 93
% 1.28/0.67 # Clause-clause subsumption calls (NU) : 9774
% 1.28/0.67 # Rec. Clause-clause subsumption calls : 3506
% 1.28/0.67 # Non-unit clause-clause subsumptions : 263
% 1.28/0.67 # Unit Clause-clause subsumption calls : 1480
% 1.28/0.67 # Rewrite failures with RHS unbound : 0
% 1.28/0.67 # BW rewrite match attempts : 13
% 1.28/0.67 # BW rewrite match successes : 1
% 1.28/0.67 # Condensation attempts : 0
% 1.28/0.67 # Condensation successes : 0
% 1.28/0.67 # Termbank termtop insertions : 87056
% 1.28/0.67 # Search garbage collected termcells : 572
% 1.28/0.67
% 1.28/0.67 # -------------------------------------------------
% 1.28/0.67 # User time : 0.109 s
% 1.28/0.67 # System time : 0.008 s
% 1.28/0.67 # Total time : 0.117 s
% 1.28/0.67 # Maximum resident set size: 1912 pages
% 1.28/0.67
% 1.28/0.67 # -------------------------------------------------
% 1.28/0.67 # User time : 0.635 s
% 1.28/0.67 # System time : 0.020 s
% 1.28/0.67 # Total time : 0.655 s
% 1.28/0.67 # Maximum resident set size: 1748 pages
% 1.28/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------