TSTP Solution File: NLP026-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP026-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 18:43:46 EDT 2023
% Result : Satisfiable 15.68s 2.42s
% Output : Saturation 15.68s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_48,negated_conjecture,
actual_world(skc64),
clause1,
[final] ).
cnf(c_0_50,negated_conjecture,
( ssSkP3(X1,X2)
| member(X2,skf31(X2,X1),X1) ),
clause8,
[final] ).
cnf(c_0_56,negated_conjecture,
( group(X1,skf24(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP2(X4,X3,X1) ),
clause22,
[final] ).
cnf(c_0_58,negated_conjecture,
( three(X1,skf24(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP2(X4,X3,X1) ),
clause21,
[final] ).
cnf(c_0_59,negated_conjecture,
( ssSkP0(X2,X4,skf24(X1,X4,X2),X1)
| ~ member(X1,X2,X3)
| ~ ssSkP2(X4,X3,X1) ),
clause28,
[final] ).
cnf(c_0_60,negated_conjecture,
( ssSkP3(X4,X1)
| member(X1,skf32(X1,X2),X2)
| ~ group(X1,X2)
| ~ three(X1,X2)
| ~ ssSkP1(skf31(X1,X3),X2,X1) ),
clause41,
[final] ).
cnf(c_0_61,negated_conjecture,
( ssSkP1(X1,X2,X3)
| member(X3,skf22(X1,X3,X2),X2) ),
clause11,
[final] ).
cnf(c_0_66,negated_conjecture,
( member(X1,skf22(skf31(X1,X2),X1,X3),X3)
| member(X1,skf32(X1,X3),X3)
| ssSkP3(X4,X1)
| ~ three(X1,X3)
| ~ group(X1,X3) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]),
[final] ).
cnf(c_0_69,negated_conjecture,
( agent(X1,skf15(X1,X2,X6,X7),X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
clause31,
[final] ).
cnf(c_0_72,negated_conjecture,
( sit(X1,skf15(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
clause27,
[final] ).
cnf(c_0_74,negated_conjecture,
( present(X1,skf15(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
clause26,
[final] ).
cnf(c_0_75,negated_conjecture,
( event(X1,skf15(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
clause25,
[final] ).
cnf(c_0_82,negated_conjecture,
( at(X1,skf15(X1,X2,X4,X5),X5)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
clause32,
[final] ).
cnf(c_0_83,negated_conjecture,
( ssSkP1(X3,X6,X1)
| ~ event(X1,X2)
| ~ agent(X1,X2,skf22(X3,X1,X4))
| ~ present(X1,X2)
| ~ sit(X1,X2)
| ~ with(X1,X2,X3)
| ~ at(X1,X2,X5)
| ~ table(X1,X5) ),
clause46,
[final] ).
cnf(c_0_89,negated_conjecture,
( with(X1,skf15(X1,X2,X4,X6),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
clause33,
[final] ).
cnf(c_0_99,negated_conjecture,
( guy(X1,X2)
| ~ member(X1,X2,skf24(X1,X3,X4))
| ~ member(X1,X5,X6)
| ~ ssSkP2(X7,X6,X1) ),
clause37,
[final] ).
cnf(c_0_101,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,skf24(X1,X3,X4))
| ~ member(X1,X5,X6)
| ~ ssSkP2(X7,X6,X1) ),
clause38,
[final] ).
cnf(c_0_102,negated_conjecture,
( ssSkP3(X5,X1)
| ~ young(X1,skf32(X1,X2))
| ~ guy(X1,skf32(X1,X2))
| ~ group(X1,X3)
| ~ three(X1,X3)
| ~ ssSkP1(skf31(X1,X4),X3,X1) ),
clause43,
[final] ).
cnf(c_0_106,negated_conjecture,
( member(X1,skf22(skf31(X1,X2),X1,X3),X3)
| ssSkP3(X4,X1)
| ~ guy(X1,skf32(X1,X5))
| ~ young(X1,skf32(X1,X5))
| ~ three(X1,X3)
| ~ group(X1,X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_61]),
[final] ).
cnf(c_0_121,negated_conjecture,
( group(X1,skf29(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP3(X3,X1) ),
clause15,
[final] ).
cnf(c_0_158,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf26(X3,X1,X2),X2) ),
clause12,
[final] ).
cnf(c_0_160,negated_conjecture,
( ssSkP2(X4,X6,X1)
| ~ young(X1,skf27(X1,X2))
| ~ guy(X1,skf27(X1,X2))
| ~ group(X1,X3)
| ~ three(X1,X3)
| ~ ssSkP0(skf26(X1,X4,X5),X4,X3,X1) ),
clause44,
[final] ).
cnf(c_0_161,negated_conjecture,
( ssSkP0(X1,X2,X3,X4)
| member(X4,skf17(X3,X4,X5,X6),X3) ),
clause13,
[final] ).
cnf(c_0_163,negated_conjecture,
ssSkC0,
inference(spm,[status(thm)],[c_0_138,c_0_156]),
[final] ).
cnf(c_0_164,negated_conjecture,
( ssSkP2(X3,X5,X1)
| member(X1,skf27(X1,X2),X2)
| ~ group(X1,X2)
| ~ three(X1,X2)
| ~ ssSkP0(skf26(X1,X3,X4),X3,X2,X1) ),
clause42,
[final] ).
cnf(c_0_167,negated_conjecture,
( member(X1,skf17(X2,X1,X3,X4),X2)
| ssSkP2(X5,X6,X1)
| ~ guy(X1,skf27(X1,X7))
| ~ young(X1,skf27(X1,X7))
| ~ three(X1,X2)
| ~ group(X1,X2) ),
inference(spm,[status(thm)],[c_0_160,c_0_161]),
[final] ).
cnf(c_0_168,negated_conjecture,
group(skc5,skc6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_162,c_0_163])]),
[final] ).
cnf(c_0_169,negated_conjecture,
( member(X1,skf17(X2,X1,X3,X4),X2)
| member(X1,skf27(X1,X2),X2)
| ssSkP2(X5,X6,X1)
| ~ three(X1,X2)
| ~ group(X1,X2) ),
inference(spm,[status(thm)],[c_0_164,c_0_161]),
[final] ).
cnf(c_0_170,negated_conjecture,
( member(X1,skf26(X1,X2,X3),X3)
| ~ hamburger(X1,skf14(X1,X4))
| ~ table(X1,X2)
| ~ group(X1,X3)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_163])]),
[final] ).
cnf(c_0_171,negated_conjecture,
actual_world(skc5),
clause2,
[final] ).
cnf(c_0_172,negated_conjecture,
( member(X1,skf26(X1,X2,X3),X3)
| member(X1,skf14(X1,X3),X3)
| ~ table(X1,X2)
| ~ group(X1,X3)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_163])]),
[final] ).
cnf(c_0_175,negated_conjecture,
( member(skc5,skf17(skc6,skc5,X1,X2),skc6)
| ssSkP2(X3,X4,skc5)
| ~ guy(skc5,skf27(skc5,X5))
| ~ young(skc5,skf27(skc5,X5))
| ~ three(skc5,skc6) ),
inference(spm,[status(thm)],[c_0_167,c_0_168]),
[final] ).
cnf(c_0_176,negated_conjecture,
( member(skc5,skf22(skf31(skc5,X1),skc5,skc6),skc6)
| ssSkP3(X2,skc5)
| ~ guy(skc5,skf32(skc5,X3))
| ~ young(skc5,skf32(skc5,X3))
| ~ three(skc5,skc6) ),
inference(spm,[status(thm)],[c_0_106,c_0_168]),
[final] ).
cnf(c_0_177,negated_conjecture,
( member(skc5,skf17(skc6,skc5,X1,X2),skc6)
| member(skc5,skf27(skc5,skc6),skc6)
| ssSkP2(X3,X4,skc5)
| ~ three(skc5,skc6) ),
inference(spm,[status(thm)],[c_0_169,c_0_168]),
[final] ).
cnf(c_0_178,negated_conjecture,
( member(skc5,skf22(skf31(skc5,X1),skc5,skc6),skc6)
| member(skc5,skf32(skc5,skc6),skc6)
| ssSkP3(X2,skc5)
| ~ three(skc5,skc6) ),
inference(spm,[status(thm)],[c_0_66,c_0_168]),
[final] ).
cnf(c_0_179,negated_conjecture,
( member(X1,skf14(X1,X2),X2)
| ~ ssSkP2(X3,X2,X1)
| ~ table(X1,X3)
| ~ group(X1,X2)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_159,c_0_163])]),
[final] ).
cnf(c_0_180,negated_conjecture,
( member(skc5,skf26(skc5,X1,skc6),skc6)
| ~ hamburger(skc5,skf14(skc5,X2))
| ~ table(skc5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_168]),c_0_171])]),
[final] ).
cnf(c_0_181,negated_conjecture,
( member(skc5,skf26(skc5,X1,skc6),skc6)
| member(skc5,skf14(skc5,skc6),skc6)
| ~ table(skc5,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_168]),c_0_171])]),
[final] ).
cnf(c_0_182,negated_conjecture,
( hamburger(skc5,X1)
| ~ member(skc5,X1,skc6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_163])]),
[final] ).
cnf(c_0_183,negated_conjecture,
( ~ hamburger(X1,skf14(X1,X2))
| ~ ssSkP2(X3,X4,X1)
| ~ table(X1,X3)
| ~ group(X1,X4)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_163])]),
[final] ).
cnf(c_0_184,negated_conjecture,
( at(X1,skf15(X1,X2,X3,X4),X4)
| member(X1,skf17(X5,X1,X6,X7),X5)
| ~ member(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_82,c_0_161]),
[final] ).
cnf(c_0_185,negated_conjecture,
( agent(X1,skf15(X1,X2,X3,X4),X2)
| member(X1,skf17(X5,X1,X6,X7),X5)
| ~ member(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_69,c_0_161]),
[final] ).
cnf(c_0_186,negated_conjecture,
( with(X1,skf15(X1,X2,X3,X4),X3)
| member(X1,skf17(X5,X1,X6,X7),X5)
| ~ member(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_89,c_0_161]),
[final] ).
cnf(c_0_187,negated_conjecture,
( event(X1,skf15(X1,X2,X3,X4))
| member(X1,skf17(X5,X1,X6,X7),X5)
| ~ member(X1,X8,X5) ),
inference(spm,[status(thm)],[c_0_75,c_0_161]),
[final] ).
cnf(c_0_188,negated_conjecture,
( present(X1,skf15(X1,X2,X3,X4))
| member(X1,skf17(X5,X1,X6,X7),X5)
| ~ member(X1,X8,X5) ),
inference(spm,[status(thm)],[c_0_74,c_0_161]),
[final] ).
cnf(c_0_189,negated_conjecture,
( sit(X1,skf15(X1,X2,X3,X4))
| member(X1,skf17(X5,X1,X6,X7),X5)
| ~ member(X1,X8,X5) ),
inference(spm,[status(thm)],[c_0_72,c_0_161]),
[final] ).
cnf(c_0_190,negated_conjecture,
( ssSkP0(X3,X4,X5,X1)
| ~ with(X1,X2,X3)
| ~ at(X1,X2,X4)
| ~ sit(X1,X2)
| ~ present(X1,X2)
| ~ agent(X1,X2,skf17(X5,X1,X3,X4))
| ~ event(X1,X2) ),
clause45,
[final] ).
cnf(c_0_191,negated_conjecture,
( at(X1,skf18(X1,X5,X6),skf19(X1,X6,X5))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause36,
[final] ).
cnf(c_0_192,negated_conjecture,
( agent(X1,skf18(X1,X2,X5),X2)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause24,
[final] ).
cnf(c_0_193,negated_conjecture,
( with(X1,skf18(X1,X2,X4),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause23,
[final] ).
cnf(c_0_194,negated_conjecture,
( event(X1,skf18(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause20,
[final] ).
cnf(c_0_195,negated_conjecture,
( present(X1,skf18(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause19,
[final] ).
cnf(c_0_196,negated_conjecture,
( sit(X1,skf18(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause18,
[final] ).
cnf(c_0_197,negated_conjecture,
( guy(X1,X2)
| ~ member(X1,X2,skf29(X1,X3))
| ~ member(X1,X4,X5)
| ~ ssSkP3(X5,X1) ),
clause35,
[final] ).
cnf(c_0_198,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,skf29(X1,X3))
| ~ member(X1,X4,X5)
| ~ ssSkP3(X5,X1) ),
clause34,
[final] ).
cnf(c_0_199,negated_conjecture,
( table(X1,skf19(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause17,
[final] ).
cnf(c_0_200,negated_conjecture,
( ssSkP1(X2,skf29(X1,X2),X1)
| ~ member(X1,X2,X3)
| ~ ssSkP3(X3,X1) ),
clause16,
[final] ).
cnf(c_0_201,negated_conjecture,
( three(X1,skf29(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP3(X3,X1) ),
clause14,
[final] ).
cnf(c_0_202,negated_conjecture,
ssSkP3(skc6,skc5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_163])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP026-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Oct 2 11:29:37 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/tmp/tmp.MocWG9n6Cd/E---3.1_3301.p
% 15.68/2.42 # Version: 3.1pre001
% 15.68/2.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.68/2.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.68/2.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.68/2.42 # Starting new_bool_3 with 300s (1) cores
% 15.68/2.42 # Starting new_bool_1 with 300s (1) cores
% 15.68/2.42 # Starting sh5l with 300s (1) cores
% 15.68/2.42 # new_bool_3 with pid 3379 completed with status 1
% 15.68/2.42 # Result found by new_bool_3
% 15.68/2.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.68/2.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.68/2.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.68/2.42 # Starting new_bool_3 with 300s (1) cores
% 15.68/2.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.68/2.42 # Search class: FGHNF-FFMS32-SFFFFFNN
% 15.68/2.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 15.68/2.42 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 15.68/2.42 # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 3385 completed with status 1
% 15.68/2.42 # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 15.68/2.42 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.68/2.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.68/2.42 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.68/2.42 # Starting new_bool_3 with 300s (1) cores
% 15.68/2.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.68/2.42 # Search class: FGHNF-FFMS32-SFFFFFNN
% 15.68/2.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 15.68/2.42 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 15.68/2.42 # Preprocessing time : 0.002 s
% 15.68/2.42 # Presaturation interreduction done
% 15.68/2.42
% 15.68/2.42 # No proof found!
% 15.68/2.42 # SZS status Satisfiable
% 15.68/2.42 # SZS output start Saturation
% See solution above
% 15.68/2.42 # Parsed axioms : 46
% 15.68/2.42 # Removed by relevancy pruning/SinE : 0
% 15.68/2.42 # Initial clauses : 46
% 15.68/2.42 # Removed in clause preprocessing : 0
% 15.68/2.42 # Initial clauses in saturation : 46
% 15.68/2.42 # Processed clauses : 7618
% 15.68/2.42 # ...of these trivial : 0
% 15.68/2.42 # ...subsumed : 4157
% 15.68/2.42 # ...remaining for further processing : 3461
% 15.68/2.42 # Other redundant clauses eliminated : 0
% 15.68/2.42 # Clauses deleted for lack of memory : 0
% 15.68/2.42 # Backward-subsumed : 2944
% 15.68/2.42 # Backward-rewritten : 412
% 15.68/2.42 # Generated clauses : 27703
% 15.68/2.42 # ...of the previous two non-redundant : 27644
% 15.68/2.42 # ...aggressively subsumed : 0
% 15.68/2.42 # Contextual simplify-reflections : 308
% 15.68/2.42 # Paramodulations : 27573
% 15.68/2.42 # Factorizations : 130
% 15.68/2.42 # NegExts : 0
% 15.68/2.42 # Equation resolutions : 0
% 15.68/2.42 # Total rewrite steps : 528
% 15.68/2.42 # Propositional unsat checks : 0
% 15.68/2.42 # Propositional check models : 0
% 15.68/2.42 # Propositional check unsatisfiable : 0
% 15.68/2.42 # Propositional clauses : 0
% 15.68/2.42 # Propositional clauses after purity: 0
% 15.68/2.42 # Propositional unsat core size : 0
% 15.68/2.42 # Propositional preprocessing time : 0.000
% 15.68/2.42 # Propositional encoding time : 0.000
% 15.68/2.42 # Propositional solver time : 0.000
% 15.68/2.42 # Success case prop preproc time : 0.000
% 15.68/2.42 # Success case prop encoding time : 0.000
% 15.68/2.42 # Success case prop solver time : 0.000
% 15.68/2.42 # Current number of processed clauses : 59
% 15.68/2.42 # Positive orientable unit clauses : 5
% 15.68/2.42 # Positive unorientable unit clauses: 0
% 15.68/2.42 # Negative unit clauses : 0
% 15.68/2.42 # Non-unit-clauses : 54
% 15.68/2.42 # Current number of unprocessed clauses: 0
% 15.68/2.42 # ...number of literals in the above : 0
% 15.68/2.42 # Current number of archived formulas : 0
% 15.68/2.42 # Current number of archived clauses : 3402
% 15.68/2.42 # Clause-clause subsumption calls (NU) : 4198925
% 15.68/2.42 # Rec. Clause-clause subsumption calls : 44829
% 15.68/2.42 # Non-unit clause-clause subsumptions : 7409
% 15.68/2.42 # Unit Clause-clause subsumption calls : 94
% 15.68/2.42 # Rewrite failures with RHS unbound : 0
% 15.68/2.42 # BW rewrite match attempts : 1
% 15.68/2.42 # BW rewrite match successes : 1
% 15.68/2.42 # Condensation attempts : 0
% 15.68/2.42 # Condensation successes : 0
% 15.68/2.42 # Termbank termtop insertions : 1619610
% 15.68/2.42
% 15.68/2.42 # -------------------------------------------------
% 15.68/2.42 # User time : 1.923 s
% 15.68/2.42 # System time : 0.016 s
% 15.68/2.42 # Total time : 1.939 s
% 15.68/2.42 # Maximum resident set size: 1808 pages
% 15.68/2.42
% 15.68/2.42 # -------------------------------------------------
% 15.68/2.42 # User time : 1.924 s
% 15.68/2.42 # System time : 0.019 s
% 15.68/2.42 # Total time : 1.944 s
% 15.68/2.42 # Maximum resident set size: 1728 pages
% 15.68/2.42 % E---3.1 exiting
%------------------------------------------------------------------------------