TSTP Solution File: PUZ008-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:11:13 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 42 ( 11 unt; 0 nHn; 37 RR)
% Number of literals : 131 ( 0 equ; 97 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 81 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(two_cannibals_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(X3,s(s(X4))) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',two_cannibals_west_to_east) ).
cnf(cannibal_east_to_west,axiom,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',cannibal_east_to_west) ).
cnf(start_on_west_bank,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',start_on_west_bank) ).
cnf(no_missionaries_is_safe,axiom,
safe(n0,X1),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',no_missionaries_is_safe) ).
cnf(same_or_more_missionaries_is_safe,axiom,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',same_or_more_missionaries_is_safe) ).
cnf(great_eq_base,axiom,
greater_or_equal(X1,n0),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',great_eq_base) ).
cnf(two_missionaries_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(s(X3)),X4) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',two_missionaries_west_to_east) ).
cnf(missionary_and_cannibal_east_to_west,axiom,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(X1),s(X2))
| ~ safe(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',missionary_and_cannibal_east_to_west) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(X3),s(X4)) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',missionary_and_cannibal_west_to_east) ).
cnf(missionary_east_to_west,axiom,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X1),X2)
| ~ safe(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',missionary_east_to_west) ).
cnf(prove_can_get_to_east_bank,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',prove_can_get_to_east_bank) ).
cnf(great_eq_recursive,axiom,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.8KUfC8weyD/E---3.1_30802.p',great_eq_recursive) ).
cnf(c_0_12,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(X3,s(s(X4))) ),
two_cannibals_west_to_east ).
cnf(c_0_13,axiom,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
cannibal_east_to_west ).
cnf(c_0_14,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
start_on_west_bank ).
cnf(c_0_15,axiom,
safe(n0,X1),
no_missionaries_is_safe ).
cnf(c_0_16,axiom,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
same_or_more_missionaries_is_safe ).
cnf(c_0_17,axiom,
greater_or_equal(X1,n0),
great_eq_base ).
cnf(c_0_18,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(s(X3)),X4) ),
two_missionaries_west_to_east ).
cnf(c_0_19,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(X2))),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X3,s(s(X4)))
| ~ safe(X1,s(s(X2)))
| ~ safe(X1,X2)
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,hypothesis,
( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_15])]) ).
cnf(c_0_21,plain,
safe(X1,n0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(X1),s(X2))
| ~ safe(X3,X4) ),
missionary_and_cannibal_east_to_west ).
cnf(c_0_23,plain,
( achievable(west(m(X1),c(s(X2))),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(s(s(X1)),s(X2))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,hypothesis,
( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15]),c_0_21]),c_0_15])]) ).
cnf(c_0_25,plain,
( achievable(west(m(X1),c(s(X2))),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(X1)),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(s(X1)),s(X2))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_26,hypothesis,
( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15])]) ).
cnf(c_0_27,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ safe(X1,X2)
| ~ safe(s(X3),s(X4)) ),
missionary_and_cannibal_west_to_east ).
cnf(c_0_28,axiom,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X1),X2)
| ~ safe(X3,X4) ),
missionary_east_to_west ).
cnf(c_0_29,hypothesis,
( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(n0),s(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_15])]) ).
cnf(c_0_30,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ achievable(west(m(X1),c(s(X2))),boatoneast,east(m(s(X3)),c(X4)))
| ~ safe(s(X3),s(X4))
| ~ safe(s(X1),s(X2))
| ~ safe(X1,X2)
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(n0),s(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_15]),c_0_15]),c_0_21])]) ).
cnf(c_0_32,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
prove_can_get_to_east_bank ).
cnf(c_0_33,axiom,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
great_eq_recursive ).
cnf(c_0_34,hypothesis,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(n0),s(n0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_21])]),c_0_32]) ).
cnf(c_0_35,plain,
( safe(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_36,hypothesis,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(n0),s(n0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16]) ).
cnf(c_0_37,hypothesis,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| ~ greater_or_equal(s(s(n0)),s(n0))
| ~ safe(s(s(s(n0))),s(n0))
| ~ safe(s(n0),s(n0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_38,hypothesis,
( ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_33]),c_0_16]) ).
cnf(c_0_39,hypothesis,
( ~ greater_or_equal(s(s(n0)),s(n0))
| ~ greater_or_equal(s(n0),s(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_17])]) ).
cnf(c_0_40,hypothesis,
~ greater_or_equal(s(n0),s(n0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_17])]) ).
cnf(c_0_41,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:51:05 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/tmp/tmp.8KUfC8weyD/E---3.1_30802.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_1 with pid 30967 completed with status 0
% 0.21/0.50 # Result found by new_bool_1
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUNS-FFMF21-MFFFFFNN
% 0.21/0.50 # partial match(1): FHUNS-FFSF21-MFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 0.21/0.50 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 30982 completed with status 0
% 0.21/0.50 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FHUNS-FFMF21-MFFFFFNN
% 0.21/0.50 # partial match(1): FHUNS-FFSF21-MFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 16
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 16
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 16
% 0.21/0.50 # Processed clauses : 113
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 34
% 0.21/0.50 # ...remaining for further processing : 79
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 2
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 237
% 0.21/0.50 # ...of the previous two non-redundant : 211
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 237
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 143
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 61
% 0.21/0.50 # Positive orientable unit clauses : 4
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 55
% 0.21/0.50 # Current number of unprocessed clauses: 130
% 0.21/0.50 # ...number of literals in the above : 1074
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 18
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 3292
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 428
% 0.21/0.50 # Non-unit clause-clause subsumptions : 37
% 0.21/0.50 # Unit Clause-clause subsumption calls : 24
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 14373
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.009 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.013 s
% 0.21/0.50 # Maximum resident set size: 1788 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.010 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.015 s
% 0.21/0.50 # Maximum resident set size: 1696 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------