%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP131-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:35:13 PM UTC 2026
% Result : Satisfiable 0.09s 0.43s
% Output : Saturation 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_54ERROR: Could not build tree for root c_0_80ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_64,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP0(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2)
| member(X1,skf6(X1,X6),X6) ),
c_0_54,
[final] ).
cnf(c_0_65,negated_conjecture,
( ~ ssSkC0
| down(skc12,skc14,skc15) ),
c_0_55,
[final] ).
cnf(c_0_66,negated_conjecture,
actual_world(skc12),
clause2,
[final] ).
cnf(c_0_67,negated_conjecture,
( ~ ssSkC0
| event(skc12,skc14) ),
c_0_56,
[final] ).
cnf(c_0_68,negated_conjecture,
( ~ ssSkC0
| present(skc12,skc14) ),
c_0_57,
[final] ).
cnf(c_0_69,negated_conjecture,
( ~ ssSkC0
| barrel(skc12,skc14) ),
c_0_58,
[final] ).
cnf(c_0_70,negated_conjecture,
( ~ ssSkC0
| lonely(skc12,skc15) ),
c_0_59,
[final] ).
cnf(c_0_71,negated_conjecture,
( ~ ssSkC0
| street(skc12,skc15) ),
c_0_60,
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf6(X1,X6))
| ~ young(X1,skf6(X1,X6))
| ~ street(X1,X5)
| ~ lonely(X1,X5)
| ~ down(X1,X3,X5)
| ~ barrel(X1,X3)
| ~ present(X1,X3)
| ~ event(X1,X3)
| ~ of(X1,X4,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X3,X2)
| ~ agent(X1,X3,X2)
| ~ old(X1,X2)
| ~ dirty(X1,X2)
| ~ white(X1,X2)
| ~ chevy(X1,X2)
| ~ city(X1,X2) ),
c_0_61,
[final] ).
cnf(c_0_78,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,X1,skc13)
| young(skc12,X1) ),
c_0_62,
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ ssSkC0
| ~ member(skc12,X1,skc13)
| fellow(skc12,X1) ),
c_0_63,
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ ssSkC0
| ~ city(skc12,X3)
| ~ chevy(skc12,X3)
| ~ white(skc12,X3)
| ~ dirty(skc12,X3)
| ~ old(skc12,X3)
| ~ placename(skc12,X2)
| ~ hollywood_placename(skc12,X2)
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP0(X1,skc12)
| ~ agent(skc12,skc14,X3)
| ~ in(skc12,skc14,X3)
| ~ of(skc12,X2,X3)
| member(skc12,skf6(skc12,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_69]),c_0_70]),c_0_71]),
[final] ).
cnf(c_0_81,negated_conjecture,
( ~ ssSkC0
| of(skc12,skc16,skc15) ),
c_0_72,
[final] ).
cnf(c_0_82,negated_conjecture,
( ~ ssSkC0
| city(skc12,skc15) ),
c_0_73,
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ ssSkC0
| placename(skc12,skc16) ),
c_0_74,
[final] ).
cnf(c_0_84,negated_conjecture,
( ~ ssSkC0
| hollywood_placename(skc12,skc16) ),
c_0_75,
[final] ).
cnf(c_0_85,negated_conjecture,
( ~ ssSkC0
| in(skc12,skc14,skc15) ),
c_0_76,
[final] ).
cnf(c_0_89,negated_conjecture,
( ~ ssSkC0
| ~ city(skc12,X5)
| ~ chevy(skc12,X5)
| ~ white(skc12,X5)
| ~ dirty(skc12,X5)
| ~ old(skc12,X5)
| ~ placename(skc12,X4)
| ~ hollywood_placename(skc12,X4)
| ~ event(skc12,X2)
| ~ present(skc12,X2)
| ~ barrel(skc12,X2)
| ~ lonely(skc12,X3)
| ~ street(skc12,X3)
| ~ group(skc12,X6)
| ~ two(skc12,X6)
| ~ ssSkP0(X6,skc12)
| ~ agent(skc12,X2,X5)
| ~ in(skc12,X2,X5)
| ~ of(skc12,X4,X5)
| ~ down(skc12,X2,X3)
| ~ member(skc12,skf6(skc12,X1),skc13) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_66])]),c_0_79]),
[final] ).
cnf(c_0_91,negated_conjecture,
( ~ ssSkC0
| group(skc12,skc13) ),
c_0_86,
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ ssSkC0
| two(skc12,skc13) ),
c_0_87,
[final] ).
cnf(c_0_93,negated_conjecture,
( ~ ssSkC0
| ssSkP0(skc13,skc12) ),
c_0_88,
[final] ).
cnf(c_0_100,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf13(X1,X6))
| ~ young(X1,skf13(X1,X6))
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ssSkC0 ),
c_0_95,
[final] ).
cnf(c_0_101,negated_conjecture,
( ~ member(skc32,X1,skc33)
| young(skc32,X1)
| ssSkC0 ),
c_0_96,
[final] ).
cnf(c_0_102,negated_conjecture,
actual_world(skc32),
clause1,
[final] ).
cnf(c_0_103,negated_conjecture,
( ~ member(skc32,X1,skc33)
| fellow(skc32,X1)
| ssSkC0 ),
c_0_97,
[final] ).
cnf(c_0_104,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| member(X1,skf13(X1,X6),X6)
| ssSkC0 ),
c_0_98,
[final] ).
cnf(c_0_105,negated_conjecture,
( down(skc32,skc34,skc35)
| ssSkC0 ),
clause36,
[final] ).
cnf(c_0_106,negated_conjecture,
( event(skc32,skc34)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_107,negated_conjecture,
( present(skc32,skc34)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_108,negated_conjecture,
( barrel(skc32,skc34)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_109,negated_conjecture,
( lonely(skc32,skc35)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_110,negated_conjecture,
( street(skc32,skc35)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ ssSkC0
| ~ chevy(skc12,skc15)
| ~ white(skc12,skc15)
| ~ dirty(skc12,skc15)
| ~ old(skc12,skc15)
| ~ group(skc12,X1)
| ~ two(skc12,X1)
| ~ ssSkP0(X1,skc12)
| ~ agent(skc12,skc14,skc15) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_81]),c_0_82]),c_0_83]),c_0_84]),c_0_85]),
[final] ).
cnf(c_0_121,negated_conjecture,
( ~ city(skc32,X3)
| ~ chevy(skc32,X5)
| ~ white(skc32,X5)
| ~ dirty(skc32,X5)
| ~ old(skc32,X5)
| ~ placename(skc32,X4)
| ~ hollywood_placename(skc32,X4)
| ~ event(skc32,X2)
| ~ present(skc32,X2)
| ~ barrel(skc32,X2)
| ~ lonely(skc32,X3)
| ~ street(skc32,X3)
| ~ group(skc32,X6)
| ~ two(skc32,X6)
| ~ ssSkP0(X6,skc32)
| ~ agent(skc32,X2,X5)
| ~ in(skc32,X2,X3)
| ~ of(skc32,X4,X3)
| ~ down(skc32,X2,X3)
| ~ member(skc32,skf13(skc32,X1),skc33)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]),c_0_103]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ~ city(skc32,skc35)
| ~ chevy(skc32,X3)
| ~ white(skc32,X3)
| ~ dirty(skc32,X3)
| ~ old(skc32,X3)
| ~ placename(skc32,X2)
| ~ hollywood_placename(skc32,X2)
| ~ group(skc32,X1)
| ~ two(skc32,X1)
| ~ ssSkP0(X1,skc32)
| ~ agent(skc32,skc34,X3)
| ~ in(skc32,skc34,skc35)
| ~ of(skc32,X2,skc35)
| ssSkC0
| member(skc32,skf13(skc32,X1),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_102])]),c_0_106]),c_0_107]),c_0_108]),c_0_109]),c_0_110]),
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf11(X1,X3),X2)
| ~ in(X1,X2,skf11(X1,X3))
| ssSkP0(X5,X1) ),
c_0_111,
[final] ).
cnf(c_0_124,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| be(X1,skf8(X1,X2),X2,skf7(X2,X1)) ),
c_0_112,
[final] ).
cnf(c_0_125,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| in(X1,skf7(X2,X1),X2) ),
c_0_113,
[final] ).
cnf(c_0_126,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| state(X1,skf8(X1,X4)) ),
c_0_114,
[final] ).
cnf(c_0_127,negated_conjecture,
( member(X2,skf11(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause42,
[final] ).
cnf(c_0_128,negated_conjecture,
( frontseat(X2,skf11(X2,X3))
| ssSkP0(X1,X2) ),
clause41,
[final] ).
cnf(c_0_129,negated_conjecture,
( ~ ssSkC0
| agent(skc12,skc14,skc17) ),
c_0_115,
[final] ).
cnf(c_0_130,negated_conjecture,
( of(skc32,skc37,skc36)
| ssSkC0 ),
clause35,
[final] ).
cnf(c_0_131,negated_conjecture,
( in(skc32,skc34,skc36)
| ssSkC0 ),
clause34,
[final] ).
cnf(c_0_132,negated_conjecture,
( agent(skc32,skc34,skc36)
| ssSkC0 ),
clause33,
[final] ).
cnf(c_0_133,negated_conjecture,
( ~ ssSkC0
| old(skc12,skc17) ),
c_0_116,
[final] ).
cnf(c_0_134,negated_conjecture,
( ~ ssSkC0
| dirty(skc12,skc17) ),
c_0_117,
[final] ).
cnf(c_0_135,negated_conjecture,
( ~ ssSkC0
| white(skc12,skc17) ),
c_0_118,
[final] ).
cnf(c_0_136,negated_conjecture,
( ~ ssSkC0
| chevy(skc12,skc17) ),
c_0_119,
[final] ).
cnf(c_0_137,negated_conjecture,
( ssSkP0(skc33,skc32)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_138,negated_conjecture,
( two(skc32,skc33)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_139,negated_conjecture,
( group(skc32,skc33)
| ssSkC0 ),
clause15,
[final] ).
cnf(c_0_140,negated_conjecture,
( hollywood_placename(skc32,skc37)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_141,negated_conjecture,
( placename(skc32,skc37)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_142,negated_conjecture,
( old(skc32,skc36)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_143,negated_conjecture,
( dirty(skc32,skc36)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_144,negated_conjecture,
( white(skc32,skc36)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_145,negated_conjecture,
( chevy(skc32,skc36)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_146,negated_conjecture,
( city(skc32,skc36)
| ssSkC0 ),
clause3,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP131-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n012.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:42:23 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % new_bool_3 with pid 1330047 completed with status 1
% 0.09/0.43 % Result found by new_bool_3
% 0.09/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 1330055 completed with status 1
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % No proof found!
% 0.09/0.43 % SZS status Satisfiable
% 0.09/0.43 % SZS output start Saturation
% See solution above
% 0.09/0.43 % Parsed axioms : 54
% 0.09/0.43 % Removed by relevancy pruning/SinE : 0
% 0.09/0.43 % Initial clauses : 54
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 54
% 0.09/0.43 % Processed clauses : 67
% 0.09/0.43 % ...of these trivial : 2
% 0.09/0.43 % ...subsumed : 0
% 0.09/0.43 % ...remaining for further processing : 65
% 0.09/0.43 % Other redundant clauses eliminated : 0
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 6
% 0.09/0.43 % Backward-rewritten : 0
% 0.09/0.43 % Generated clauses : 18
% 0.09/0.43 % ...of the previous two non-redundant : 13
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 28
% 0.09/0.43 % Paramodulations : 18
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 0
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 8
% 0.09/0.43 % ...of those cached : 6
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 59
% 0.09/0.43 % Positive orientable unit clauses : 2
% 0.09/0.43 % Positive unorientable unit clauses: 0
% 0.09/0.43 % Negative unit clauses : 0
% 0.09/0.43 % Non-unit-clauses : 57
% 0.09/0.43 % Current number of unprocessed clauses: 0
% 0.09/0.43 % ...number of literals in the above : 0
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 6
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 3579
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 442
% 0.09/0.43 % Non-unit clause-clause subsumptions : 34
% 0.09/0.43 % Unit Clause-clause subsumption calls : 0
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 0
% 0.09/0.43 % BW rewrite match successes : 0
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 4357
% 0.09/0.43 % Search garbage collected termcells : 225
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.009 s
% 0.09/0.43 % System time : 0.003 s
% 0.09/0.43 % Total time : 0.012 s
% 0.09/0.43 % Maximum resident set size: 3696 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.010 s
% 0.09/0.43 % System time : 0.008 s
% 0.09/0.43 % Total time : 0.019 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------