%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT037-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:26:51 PM UTC 2026
% Result : Satisfiable 0.10s 0.45s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_27ERROR: Could not build tree for root c_0_40ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_29,hypothesis,
( ~ greater(zero,growth_rate(X4,X2))
| ~ greater(resilience(X4),resilience(X3))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(zero,growth_rate(X3,X2)) ),
c_0_27,
[final] ).
cnf(c_0_30,plain,
( cardinality_at_time(efficient_producers,X2) != zero
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| greater(zero,growth_rate(efficient_producers,sk1(X2,X1))) ),
c_0_28,
[final] ).
cnf(c_0_33,hypothesis,
( ~ environment(X3)
| ~ environment(X4)
| ~ greater_or_equal(X2,appear(efficient_producers,X3))
| ~ greater(resilience(efficient_producers),resilience(X1))
| ~ in_environment(X4,sk1(X2,X3))
| cardinality_at_time(efficient_producers,X2) != zero
| greater(zero,growth_rate(X1,sk1(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]),
[final] ).
cnf(c_0_34,hypothesis,
greater(resilience(efficient_producers),resilience(first_movers)),
a2_44,
[final] ).
cnf(c_0_35,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(efficient_producers,X2),zero)
| cardinality_at_time(efficient_producers,X2) = zero ),
c_0_31,
[final] ).
cnf(c_0_36,negated_conjecture,
in_environment(sk3,sk4),
prove_t6_52,
[final] ).
cnf(c_0_37,negated_conjecture,
environment(sk3),
prove_t6_51,
[final] ).
cnf(c_0_40,hypothesis,
( ~ environment(X2)
| ~ environment(X3)
| ~ greater_or_equal(X1,appear(efficient_producers,X2))
| ~ in_environment(X3,sk1(X1,X2))
| cardinality_at_time(efficient_producers,X1) != zero
| greater(zero,growth_rate(first_movers,sk1(X1,X2))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[final] ).
cnf(c_0_41,negated_conjecture,
greater_or_equal(sk4,appear(efficient_producers,sk3)),
prove_t6_53,
[final] ).
cnf(c_0_42,negated_conjecture,
cardinality_at_time(efficient_producers,sk4) = zero,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[final] ).
cnf(c_0_43,plain,
( cardinality_at_time(efficient_producers,X2) != zero
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| in_environment(X1,sk1(X2,X1)) ),
c_0_39,
[final] ).
cnf(c_0_45,negated_conjecture,
in_environment(sk3,sk1(sk4,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_41]),c_0_42]),c_0_37])]),
[final] ).
cnf(c_0_47,negated_conjecture,
greater(zero,growth_rate(first_movers,sk1(sk4,sk3))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_49,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(cardinality_at_time(sk2(X2,X1),X2),zero)
| decreases(number_of_organizations(X1,X2)) ),
c_0_46,
[final] ).
cnf(c_0_52,hypothesis,
( ~ greater(cardinality_at_time(X2,X3),zero)
| ~ subpopulation(X2,X1,X3)
| ~ environment(X1)
| X2 = first_movers
| X2 = efficient_producers ),
c_0_48,
[final] ).
cnf(c_0_53,negated_conjecture,
( greater(cardinality_at_time(sk2(sk1(sk4,sk3),sk3),sk1(sk4,sk3)),zero)
| decreases(number_of_organizations(sk3,sk1(sk4,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_54,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(sk2(X2,X1),X1,X2)
| decreases(number_of_organizations(X1,X2)) ),
c_0_50,
[final] ).
cnf(c_0_56,negated_conjecture,
( ~ greater(resilience(first_movers),resilience(X1))
| greater(zero,growth_rate(X1,sk1(sk4,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_58,negated_conjecture,
( greater(cardinality_at_time(sk2(sk4,sk3),sk4),zero)
| decreases(number_of_organizations(sk3,sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_36]),c_0_37])]),
[final] ).
cnf(c_0_66,negated_conjecture,
( decreases(number_of_organizations(sk3,sk1(sk4,sk3)))
| subpopulation(sk2(sk1(sk4,sk3),sk3),sk3,sk1(sk4,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_67,plain,
( ~ greater(zero,growth_rate(sk2(X2,X1),X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| decreases(number_of_organizations(X1,X2)) ),
c_0_55,
[final] ).
cnf(c_0_69,plain,
( ~ greater(zero,growth_rate(X1,X2))
| cardinality_at_time(X1,X2) != zero ),
c_0_57,
[final] ).
cnf(c_0_71,negated_conjecture,
( decreases(number_of_organizations(sk3,sk4))
| subpopulation(sk2(sk4,sk3),sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_36]),c_0_37])]),
[final] ).
cnf(c_0_72,plain,
( ~ subpopulation(X3,X1,X2)
| number_of_organizations(X1,X2) != zero
| ~ in_environment(X1,X2)
| ~ environment(X1)
| cardinality_at_time(X3,X2) = zero ),
c_0_59,
[final] ).
cnf(c_0_73,hypothesis,
( ~ decreases(number_of_organizations(X1,X2))
| ~ decreases(resources(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
c_0_60,
[final] ).
cnf(c_0_74,hypothesis,
( ~ greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| decreases(resources(X1,X2)) ),
c_0_61,
[final] ).
cnf(c_0_77,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(first_movers,X1,X2) ),
c_0_62,
[final] ).
cnf(c_0_78,plain,
( ~ in_environment(X1,X2)
| ~ environment(X1)
| subpopulation(efficient_producers,X1,X2) ),
c_0_63,
[final] ).
cnf(c_0_84,plain,
( cardinality_at_time(efficient_producers,X2) != zero
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| greater(X2,sk1(X2,X1)) ),
c_0_64,
[final] ).
cnf(c_0_85,negated_conjecture,
( decreases(number_of_organizations(sk3,sk1(sk4,sk3)))
| sk2(sk1(sk4,sk3),sk3) = first_movers
| sk2(sk1(sk4,sk3),sk3) = efficient_producers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_37])]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ~ environment(X1)
| ~ greater(resilience(first_movers),resilience(sk2(sk1(sk4,sk3),X1)))
| ~ in_environment(X1,sk1(sk4,sk3))
| decreases(number_of_organizations(X1,sk1(sk4,sk3))) ),
inference(spm,[status(thm)],[c_0_67,c_0_56]),
[final] ).
cnf(c_0_87,negated_conjecture,
( ~ greater(resilience(X2),resilience(X1))
| ~ greater(resilience(first_movers),resilience(X2))
| greater(zero,growth_rate(X1,sk1(sk4,sk3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_88,negated_conjecture,
( ~ greater(resilience(first_movers),resilience(X1))
| cardinality_at_time(X1,sk1(sk4,sk3)) != zero ),
inference(spm,[status(thm)],[c_0_69,c_0_56]),
[final] ).
cnf(c_0_89,negated_conjecture,
( decreases(number_of_organizations(sk3,sk4))
| sk2(sk4,sk3) = first_movers
| sk2(sk4,sk3) = efficient_producers ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_37])]),
[final] ).
cnf(c_0_90,negated_conjecture,
( number_of_organizations(sk3,sk1(sk4,sk3)) != zero
| decreases(number_of_organizations(sk3,sk1(sk4,sk3)))
| cardinality_at_time(sk2(sk1(sk4,sk3),sk3),sk1(sk4,sk3)) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_66]),c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_91,plain,
( ~ environment(X2)
| ~ greater_or_equal(X1,appear(efficient_producers,X2))
| cardinality_at_time(efficient_producers,X1) != zero
| cardinality_at_time(efficient_producers,sk1(X1,X2)) != zero ),
inference(spm,[status(thm)],[c_0_69,c_0_30]),
[final] ).
cnf(c_0_92,hypothesis,
( ~ environment(X1)
| ~ greater(equilibrium(X1),X2)
| ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ decreases(number_of_organizations(X1,X2)) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]),
[final] ).
cnf(c_0_93,hypothesis,
( ~ greater(number_of_organizations(X1,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(resources(X1,X2))
| greater(equilibrium(X1),X2) ),
c_0_75,
[final] ).
cnf(c_0_94,negated_conjecture,
( number_of_organizations(sk3,sk4) != zero
| decreases(number_of_organizations(sk3,sk4))
| cardinality_at_time(sk2(sk4,sk3),sk4) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_71]),c_0_36]),c_0_37])]),
[final] ).
cnf(c_0_95,negated_conjecture,
( greater(cardinality_at_time(efficient_producers,sk1(sk4,sk3)),zero)
| cardinality_at_time(efficient_producers,sk1(sk4,sk3)) = zero ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_45]),c_0_37])]),
[final] ).
cnf(c_0_96,plain,
( cardinality_at_time(efficient_producers,X2) != zero
| ~ greater_or_equal(X2,appear(efficient_producers,X1))
| ~ environment(X1)
| greater(sk1(X2,X1),appear(efficient_producers,X1)) ),
c_0_76,
[final] ).
cnf(c_0_97,plain,
( ~ environment(X2)
| ~ in_environment(X2,X1)
| number_of_organizations(X2,X1) != zero
| cardinality_at_time(first_movers,X1) = zero ),
inference(spm,[status(thm)],[c_0_72,c_0_77]),
[final] ).
cnf(c_0_98,plain,
( ~ environment(X2)
| ~ in_environment(X2,X1)
| number_of_organizations(X2,X1) != zero
| cardinality_at_time(efficient_producers,X1) = zero ),
inference(spm,[status(thm)],[c_0_72,c_0_78]),
[final] ).
cnf(c_0_99,hypothesis,
( ~ greater_or_equal(X2,appear(an_organisation,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(number_of_organizations(X1,X2),zero) ),
c_0_79,
[final] ).
cnf(c_0_100,plain,
( ~ greater_or_equal(X2,appear(an_organisation,X1))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| greater(appear(an_organisation,X1),X2) ),
c_0_80,
[final] ).
cnf(c_0_101,plain,
( ~ greater(appear(an_organisation,X1),X2)
| ~ in_environment(X1,X2)
| ~ environment(X1)
| number_of_organizations(X1,X2) = zero ),
c_0_81,
[final] ).
cnf(c_0_102,hypothesis,
( ~ constant(resources(X1,X2))
| ~ in_environment(X1,X2)
| ~ environment(X1)
| constant(number_of_organizations(X1,X2)) ),
c_0_82,
[final] ).
cnf(c_0_103,plain,
( ~ decreases(X1)
| ~ constant(X1) ),
c_0_83,
[final] ).
cnf(c_0_104,negated_conjecture,
cardinality_at_time(first_movers,sk1(sk4,sk3)) != zero,
inference(spm,[status(thm)],[c_0_69,c_0_47]),
[final] ).
cnf(c_0_105,negated_conjecture,
~ greater(zero,zero),
inference(rw,[status(thm)],[c_0_38,c_0_42]),
[final] ).
cnf(c_0_106,negated_conjecture,
greater(sk4,sk1(sk4,sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_41]),c_0_42]),c_0_37])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT037-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:25:52 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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/benchmark/theBenchmark.p
% 0.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1066280 completed with status 1
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.10/0.45 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1066285 completed with status 1
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45 % Presaturation interreduction done
% 0.10/0.45
% 0.10/0.45 % No proof found!
% 0.10/0.45 % SZS status Satisfiable
% 0.10/0.45 % SZS output start Saturation
% See solution above
% 0.10/0.45 % Parsed axioms : 27
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 27
% 0.10/0.45 % Removed in clause preprocessing : 0
% 0.10/0.45 % Initial clauses in saturation : 27
% 0.10/0.45 % Processed clauses : 84
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 0
% 0.10/0.45 % ...remaining for further processing : 84
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 4
% 0.10/0.45 % Backward-rewritten : 2
% 0.10/0.45 % Generated clauses : 29
% 0.10/0.45 % ...of the previous two non-redundant : 30
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 29
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 23
% 0.10/0.45 % ...of those cached : 18
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 51
% 0.10/0.45 % Positive orientable unit clauses : 8
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 2
% 0.10/0.45 % Non-unit-clauses : 41
% 0.10/0.45 % Current number of unprocessed clauses: 0
% 0.10/0.45 % ...number of literals in the above : 0
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 33
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 365
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 48
% 0.10/0.45 % Non-unit clause-clause subsumptions : 4
% 0.10/0.45 % Unit Clause-clause subsumption calls : 6
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 3
% 0.10/0.45 % BW rewrite match successes : 2
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 2776
% 0.10/0.45 % Search garbage collected termcells : 98
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.005 s
% 0.10/0.45 % System time : 0.004 s
% 0.10/0.45 % Total time : 0.009 s
% 0.10/0.45 % Maximum resident set size: 3404 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.020 s
% 0.10/0.45 % System time : 0.015 s
% 0.10/0.45 % Total time : 0.035 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------