TSTP Solution File: SYN495-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN495-1 : TPTP v8.1.2. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 20:16:46 EDT 2023
% Result : Satisfiable 0.21s 0.52s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_66)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_63,negated_conjecture,
( hskp16
| hskp5
| hskp6 ),
clause20,
[final] ).
cnf(c_0_67,negated_conjecture,
ndr1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]),
[final] ).
cnf(c_0_68,negated_conjecture,
( c0_1(a66)
| ~ hskp1 ),
clause46,
[final] ).
cnf(c_0_69,negated_conjecture,
( hskp11
| hskp1
| hskp12 ),
clause18,
[final] ).
cnf(c_0_70,negated_conjecture,
( c1_1(a66)
| ~ hskp1 ),
clause47,
[final] ).
cnf(c_0_72,negated_conjecture,
( c3_1(a69)
| ~ hskp2 ),
clause45,
[final] ).
cnf(c_0_73,negated_conjecture,
( hskp13
| hskp2
| hskp14 ),
clause19,
[final] ).
cnf(c_0_74,negated_conjecture,
( c3_1(X1)
| hskp9
| hskp10
| ~ c0_1(X1)
| ~ c1_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]),
[final] ).
cnf(c_0_75,negated_conjecture,
( c0_1(a66)
| hskp11
| hskp12 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]),
[final] ).
cnf(c_0_76,negated_conjecture,
( c1_1(a66)
| hskp11
| hskp12 ),
inference(spm,[status(thm)],[c_0_70,c_0_69]),
[final] ).
cnf(c_0_78,negated_conjecture,
( c0_1(X1)
| c1_1(X1)
| hskp7
| hskp12
| ~ c3_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_67])]),
[final] ).
cnf(c_0_79,negated_conjecture,
( c3_1(a69)
| hskp13
| hskp14 ),
inference(spm,[status(thm)],[c_0_72,c_0_73]),
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ c3_1(a66)
| ~ hskp1 ),
clause70,
[final] ).
cnf(c_0_82,negated_conjecture,
( c0_1(X1)
| hskp3
| hskp15
| ~ c1_1(X1)
| ~ c3_1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_67])]),
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ c0_1(a69)
| ~ hskp2 ),
clause68,
[final] ).
cnf(c_0_87,negated_conjecture,
( c2_1(a63)
| ~ hskp9 ),
clause33,
[final] ).
cnf(c_0_88,negated_conjecture,
( hskp9
| hskp10
| hskp11
| hskp12 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_69]),
[final] ).
cnf(c_0_89,negated_conjecture,
( c2_1(a74)
| ~ hskp16 ),
clause21,
[final] ).
cnf(c_0_90,negated_conjecture,
( c0_1(a69)
| hskp3
| hskp13
| hskp14
| hskp15
| ~ c1_1(a69) ),
inference(spm,[status(thm)],[c_0_82,c_0_79]),
[final] ).
cnf(c_0_91,negated_conjecture,
( c1_1(a69)
| hskp7
| hskp12
| hskp13
| hskp14 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_73]),
[final] ).
cnf(c_0_92,negated_conjecture,
( c0_1(X1)
| c1_1(X1)
| c1_1(X2)
| hskp4
| ~ c0_1(X2)
| ~ c3_1(X1)
| ~ c2_1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_67])]),
[final] ).
cnf(c_0_93,negated_conjecture,
( c1_1(X1)
| c3_1(X1)
| c2_1(X1)
| hskp0
| hskp8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_67])]),
[final] ).
cnf(c_0_94,negated_conjecture,
( c3_1(a74)
| ~ hskp16 ),
clause22,
[final] ).
cnf(c_0_95,negated_conjecture,
( c3_1(a63)
| ~ hskp9 ),
clause34,
[final] ).
cnf(c_0_96,negated_conjecture,
( c2_1(a63)
| hskp10
| hskp11
| hskp12 ),
inference(spm,[status(thm)],[c_0_87,c_0_88]),
[final] ).
cnf(c_0_97,negated_conjecture,
( c2_1(a74)
| hskp5
| hskp6 ),
inference(spm,[status(thm)],[c_0_89,c_0_63]),
[final] ).
cnf(c_0_99,negated_conjecture,
( c0_1(X1)
| c1_1(X2)
| c1_1(X1)
| c3_1(X2)
| hskp0
| hskp4
| hskp8
| ~ c0_1(X2)
| ~ c3_1(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]),
[final] ).
cnf(c_0_100,negated_conjecture,
( c3_1(a74)
| hskp5
| hskp6 ),
inference(spm,[status(thm)],[c_0_94,c_0_63]),
[final] ).
cnf(c_0_101,negated_conjecture,
( c3_1(a63)
| hskp10
| hskp11
| hskp12 ),
inference(spm,[status(thm)],[c_0_95,c_0_88]),
[final] ).
cnf(c_0_102,negated_conjecture,
( c0_1(X1)
| c1_1(a63)
| c1_1(X1)
| hskp4
| hskp10
| hskp11
| hskp12
| ~ c0_1(a63)
| ~ c3_1(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_96]),
[final] ).
cnf(c_0_103,negated_conjecture,
( c0_1(X1)
| c1_1(a74)
| c1_1(X1)
| hskp4
| hskp5
| hskp6
| ~ c0_1(a74)
| ~ c3_1(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_97]),
[final] ).
cnf(c_0_104,negated_conjecture,
( c0_1(a71)
| ~ hskp3 ),
clause43,
[final] ).
cnf(c_0_105,negated_conjecture,
( hskp3
| hskp7
| hskp12
| hskp13
| hskp14
| hskp15 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_98]),c_0_73]),
[final] ).
cnf(c_0_106,negated_conjecture,
( c3_1(a71)
| ~ hskp3 ),
clause44,
[final] ).
cnf(c_0_107,negated_conjecture,
( ~ c2_1(a64)
| ~ hskp10 ),
clause58,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ c3_1(a64)
| ~ hskp10 ),
clause57,
[final] ).
cnf(c_0_109,negated_conjecture,
( c0_1(a74)
| c1_1(a74)
| c1_1(X1)
| c3_1(X1)
| hskp0
| hskp4
| hskp5
| hskp6
| hskp8
| ~ c0_1(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]),
[final] ).
cnf(c_0_110,negated_conjecture,
( c0_1(a63)
| c1_1(a63)
| c1_1(X1)
| c3_1(X1)
| hskp0
| hskp4
| hskp8
| hskp10
| hskp11
| hskp12
| ~ c0_1(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_101]),
[final] ).
cnf(c_0_111,negated_conjecture,
( c0_1(a69)
| c1_1(a69)
| c1_1(X1)
| c3_1(X1)
| hskp0
| hskp4
| hskp8
| hskp13
| hskp14
| ~ c0_1(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_79]),
[final] ).
cnf(c_0_112,negated_conjecture,
( c0_1(a74)
| c1_1(a74)
| c1_1(a63)
| hskp4
| hskp5
| hskp6
| hskp10
| hskp11
| hskp12
| ~ c0_1(a63) ),
inference(spm,[status(thm)],[c_0_102,c_0_100]),
[final] ).
cnf(c_0_113,negated_conjecture,
( c0_1(a69)
| c1_1(a69)
| c1_1(a63)
| hskp4
| hskp10
| hskp11
| hskp12
| hskp13
| hskp14
| ~ c0_1(a63) ),
inference(spm,[status(thm)],[c_0_102,c_0_79]),
[final] ).
cnf(c_0_114,negated_conjecture,
( c0_1(a63)
| c1_1(a63)
| c1_1(a74)
| hskp4
| hskp5
| hskp6
| hskp10
| hskp11
| hskp12
| ~ c0_1(a74) ),
inference(spm,[status(thm)],[c_0_103,c_0_101]),
[final] ).
cnf(c_0_115,negated_conjecture,
( c0_1(a69)
| c1_1(a69)
| c1_1(a74)
| hskp4
| hskp5
| hskp6
| hskp13
| hskp14
| ~ c0_1(a74) ),
inference(spm,[status(thm)],[c_0_103,c_0_79]),
[final] ).
cnf(c_0_116,negated_conjecture,
( c0_1(a71)
| hskp7
| hskp12
| hskp13
| hskp14
| hskp15 ),
inference(spm,[status(thm)],[c_0_104,c_0_105]),
[final] ).
cnf(c_0_117,negated_conjecture,
( c3_1(a71)
| hskp7
| hskp12
| hskp13
| hskp14
| hskp15 ),
inference(spm,[status(thm)],[c_0_106,c_0_105]),
[final] ).
cnf(c_0_118,negated_conjecture,
( c0_1(a63)
| hskp3
| hskp10
| hskp11
| hskp12
| hskp15
| ~ c1_1(a63) ),
inference(spm,[status(thm)],[c_0_82,c_0_101]),
[final] ).
cnf(c_0_119,negated_conjecture,
( c0_1(a63)
| c1_1(a63)
| hskp7
| hskp10
| hskp11
| hskp12 ),
inference(spm,[status(thm)],[c_0_78,c_0_101]),
[final] ).
cnf(c_0_120,negated_conjecture,
( c0_1(a74)
| c1_1(a74)
| hskp5
| hskp6
| hskp7
| hskp12 ),
inference(spm,[status(thm)],[c_0_78,c_0_100]),
[final] ).
cnf(c_0_121,negated_conjecture,
( c1_1(a64)
| hskp0
| hskp8
| ~ hskp10 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_93]),c_0_108]),
[final] ).
cnf(c_0_122,negated_conjecture,
( c0_1(a74)
| hskp3
| hskp5
| hskp6
| hskp15
| ~ c1_1(a74) ),
inference(spm,[status(thm)],[c_0_82,c_0_100]),
[final] ).
cnf(c_0_123,negated_conjecture,
( c0_1(a73)
| ~ hskp4 ),
clause42,
[final] ).
cnf(c_0_124,negated_conjecture,
( c0_1(a76)
| ~ hskp6 ),
clause38,
[final] ).
cnf(c_0_125,negated_conjecture,
( c0_1(a62)
| ~ hskp8 ),
clause36,
[final] ).
cnf(c_0_126,negated_conjecture,
( c0_1(a64)
| ~ hskp10 ),
clause32,
[final] ).
cnf(c_0_127,negated_conjecture,
( c0_1(a68)
| ~ hskp13 ),
clause29,
[final] ).
cnf(c_0_128,negated_conjecture,
( c0_1(a72)
| ~ hskp15 ),
clause25,
[final] ).
cnf(c_0_129,negated_conjecture,
( c1_1(a61)
| ~ hskp0 ),
clause49,
[final] ).
cnf(c_0_130,negated_conjecture,
( c1_1(a73)
| ~ hskp4 ),
clause41,
[final] ).
cnf(c_0_131,negated_conjecture,
( c1_1(a76)
| ~ hskp6 ),
clause39,
[final] ).
cnf(c_0_132,negated_conjecture,
( c1_1(a67)
| ~ hskp12 ),
clause30,
[final] ).
cnf(c_0_133,negated_conjecture,
( c1_1(a70)
| ~ hskp14 ),
clause27,
[final] ).
cnf(c_0_134,negated_conjecture,
( c1_1(a72)
| ~ hskp15 ),
clause23,
[final] ).
cnf(c_0_135,negated_conjecture,
( c3_1(a61)
| ~ hskp0 ),
clause48,
[final] ).
cnf(c_0_136,negated_conjecture,
( c3_1(a77)
| ~ hskp7 ),
clause37,
[final] ).
cnf(c_0_137,negated_conjecture,
( c3_1(a62)
| ~ hskp8 ),
clause35,
[final] ).
cnf(c_0_138,negated_conjecture,
( c3_1(a70)
| ~ hskp14 ),
clause26,
[final] ).
cnf(c_0_139,negated_conjecture,
( c3_1(a72)
| ~ hskp15 ),
clause24,
[final] ).
cnf(c_0_140,negated_conjecture,
( ~ c2_1(a61)
| ~ hskp0 ),
clause71,
[final] ).
cnf(c_0_141,negated_conjecture,
( ~ c2_1(a69)
| ~ hskp2 ),
clause69,
[final] ).
cnf(c_0_142,negated_conjecture,
( ~ c1_1(a71)
| ~ hskp3 ),
clause67,
[final] ).
cnf(c_0_143,negated_conjecture,
( ~ c2_1(a73)
| ~ hskp4 ),
clause66,
[final] ).
cnf(c_0_144,negated_conjecture,
( c2_1(a75)
| ~ hskp5 ),
clause40,
[final] ).
cnf(c_0_145,negated_conjecture,
( ~ c0_1(a75)
| ~ hskp5 ),
clause64,
[final] ).
cnf(c_0_146,negated_conjecture,
( ~ c1_1(a75)
| ~ hskp5 ),
clause65,
[final] ).
cnf(c_0_147,negated_conjecture,
( ~ c2_1(a76)
| ~ hskp6 ),
clause63,
[final] ).
cnf(c_0_148,negated_conjecture,
( ~ c0_1(a77)
| ~ hskp7 ),
clause62,
[final] ).
cnf(c_0_149,negated_conjecture,
( ~ c2_1(a77)
| ~ hskp7 ),
clause61,
[final] ).
cnf(c_0_150,negated_conjecture,
( ~ c1_1(a62)
| ~ hskp8 ),
clause60,
[final] ).
cnf(c_0_151,negated_conjecture,
( ~ c1_1(a63)
| ~ hskp9 ),
clause59,
[final] ).
cnf(c_0_152,negated_conjecture,
( c2_1(a65)
| ~ hskp11 ),
clause31,
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ c0_1(a65)
| ~ hskp11 ),
clause56,
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ c1_1(a65)
| ~ hskp11 ),
clause55,
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ c3_1(a67)
| ~ hskp12 ),
clause53,
[final] ).
cnf(c_0_156,negated_conjecture,
( c2_1(a68)
| ~ hskp13 ),
clause28,
[final] ).
cnf(c_0_157,negated_conjecture,
( ~ c2_1(a67)
| ~ hskp12 ),
clause54,
[final] ).
cnf(c_0_158,negated_conjecture,
( ~ c1_1(a68)
| ~ hskp13 ),
clause52,
[final] ).
cnf(c_0_159,negated_conjecture,
( ~ c0_1(a70)
| ~ hskp14 ),
clause51,
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ c1_1(a74)
| ~ hskp16 ),
clause50,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN495-1 : TPTP v8.1.2. Released v2.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.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:33:33 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.oiwOdCVB52/E---3.1_16639.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 16752 completed with status 1
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHNF-FFMS00-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 16761 completed with status 1
% 0.21/0.52 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.21/0.52 # Preprocessing class: FSMSSLSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHNF-FFMS00-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52
% 0.21/0.52 # No proof found!
% 0.21/0.52 # SZS status Satisfiable
% 0.21/0.52 # SZS output start Saturation
% See solution above
% 0.21/0.52 # Parsed axioms : 76
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 76
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 76
% 0.21/0.52 # Processed clauses : 140
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 27
% 0.21/0.52 # ...remaining for further processing : 113
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 3
% 0.21/0.52 # Backward-rewritten : 22
% 0.21/0.52 # Generated clauses : 70
% 0.21/0.52 # ...of the previous two non-redundant : 69
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 7
% 0.21/0.52 # Paramodulations : 70
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 22
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 88
% 0.21/0.52 # Positive orientable unit clauses : 1
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 87
% 0.21/0.52 # Current number of unprocessed clauses: 0
% 0.21/0.52 # ...number of literals in the above : 0
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 25
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 5214
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 519
% 0.21/0.52 # Non-unit clause-clause subsumptions : 37
% 0.21/0.52 # Unit Clause-clause subsumption calls : 4
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 1
% 0.21/0.52 # BW rewrite match successes : 1
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 2311
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.013 s
% 0.21/0.52 # Maximum resident set size: 1848 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.012 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.017 s
% 0.21/0.52 # Maximum resident set size: 1720 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------