TSTP Solution File: NLP031-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP031-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:56:11 EDT 2024
% Result : Satisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_41)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_39,negated_conjecture,
( ssSkP1(X3,X5,X1)
| member(X1,skf20(X1,X2),X2)
| ~ group(X1,X2)
| ~ ssSkP0(X3,skf19(X1,X3,X4),X2,X1) ),
c_0_38,
[final] ).
cnf(c_0_40,negated_conjecture,
( ssSkP0(X1,X2,X3,X4)
| member(X4,skf15(X3,X4,X5,X6),X3) ),
clause16,
[final] ).
cnf(c_0_42,negated_conjecture,
( member(X1,skf15(X2,X1,X3,X4),X2)
| member(X1,skf20(X1,X2),X2)
| ssSkP1(X5,X6,X1)
| ~ group(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]),
[final] ).
cnf(c_0_43,negated_conjecture,
( ssSkC0
| group(skc50,skc51) ),
clause3,
[final] ).
cnf(c_0_48,negated_conjecture,
( ssSkC0
| ~ three(X1,X2)
| ~ group(X1,X2)
| ~ young(X1,skf29(X1,X3))
| ~ guy(X1,skf29(X1,X3))
| ~ ssSkP1(X4,X2,X1)
| ~ table(X1,X4)
| ~ actual_world(X1) ),
c_0_41,
[final] ).
cnf(c_0_49,negated_conjecture,
( ssSkP1(X1,X2,X3)
| member(X3,skf19(X3,X1,X2),X2) ),
clause15,
[final] ).
cnf(c_0_50,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| member(skc50,skf20(skc50,skc51),skc51)
| ssSkP1(X3,X4,skc50)
| ssSkC0 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]),
[final] ).
cnf(c_0_51,negated_conjecture,
actual_world(skc50),
clause1,
[final] ).
cnf(c_0_52,negated_conjecture,
( ssSkP2(X5,X1)
| member(X1,skf27(X1,X2),X2)
| ~ group(X1,X2)
| ~ ssSkP0(X3,skf26(X1,X4),X2,X1)
| ~ table(X1,X3) ),
c_0_44,
[final] ).
cnf(c_0_53,negated_conjecture,
( ssSkP2(X6,X1)
| ~ group(X1,X2)
| ~ hamburger(X1,skf27(X1,X3))
| ~ ssSkP0(X4,skf26(X1,X5),X2,X1)
| ~ table(X1,X4) ),
c_0_45,
[final] ).
cnf(c_0_54,negated_conjecture,
( ssSkC0
| member(X1,skf29(X1,X2),X2)
| ~ three(X1,X2)
| ~ group(X1,X2)
| ~ ssSkP1(X3,X2,X1)
| ~ table(X1,X3)
| ~ actual_world(X1) ),
c_0_46,
[final] ).
cnf(c_0_61,negated_conjecture,
( ssSkP1(X4,X6,X1)
| ~ hamburger(X1,skf20(X1,X2))
| ~ group(X1,X3)
| ~ ssSkP0(X4,skf19(X1,X4,X5),X3,X1) ),
c_0_47,
[final] ).
cnf(c_0_62,negated_conjecture,
( member(X1,skf19(X1,X2,X3),X3)
| ssSkC0
| ~ young(X1,skf29(X1,X4))
| ~ guy(X1,skf29(X1,X4))
| ~ table(X1,X2)
| ~ three(X1,X3)
| ~ group(X1,X3)
| ~ actual_world(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]),
[final] ).
cnf(c_0_63,negated_conjecture,
( ssSkC0
| three(skc50,skc51) ),
clause4,
[final] ).
cnf(c_0_65,negated_conjecture,
( member(X1,skf15(X2,X1,X3,X4),X2)
| member(X1,skf27(X1,X2),X2)
| ssSkP2(X5,X1)
| ~ table(X1,X6)
| ~ group(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_40]),
[final] ).
cnf(c_0_66,negated_conjecture,
( member(X1,skf15(X2,X1,X3,X4),X2)
| ssSkP2(X5,X1)
| ~ hamburger(X1,skf27(X1,X6))
| ~ table(X1,X7)
| ~ group(X1,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_40]),
[final] ).
cnf(c_0_67,negated_conjecture,
( member(X1,skf19(X1,X2,X3),X3)
| member(X1,skf29(X1,X3),X3)
| ssSkC0
| ~ table(X1,X2)
| ~ three(X1,X3)
| ~ group(X1,X3)
| ~ actual_world(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_49]),
[final] ).
cnf(c_0_68,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| member(skc50,skf20(skc50,skc51),skc51)
| member(skc50,skf29(skc50,X3),X3)
| ssSkC0
| ~ table(skc50,X4)
| ~ three(skc50,X3)
| ~ group(skc50,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_50]),c_0_51])]),
[final] ).
cnf(c_0_69,negated_conjecture,
( with(X1,skf13(X1,X2,X6,X7),X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_55,
[final] ).
cnf(c_0_70,negated_conjecture,
( at(X1,skf13(X1,X2,X4,X6),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_56,
[final] ).
cnf(c_0_71,negated_conjecture,
( agent(X1,skf13(X1,X2,X4,X5),X5)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_57,
[final] ).
cnf(c_0_72,negated_conjecture,
( sit(X1,skf13(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_58,
[final] ).
cnf(c_0_73,negated_conjecture,
( present(X1,skf13(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_59,
[final] ).
cnf(c_0_74,negated_conjecture,
( event(X1,skf13(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_60,
[final] ).
cnf(c_0_75,negated_conjecture,
( member(X1,skf15(X2,X1,X3,X4),X2)
| ssSkP1(X5,X6,X1)
| ~ hamburger(X1,skf20(X1,X7))
| ~ group(X1,X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_40]),
[final] ).
cnf(c_0_94,negated_conjecture,
( member(skc50,skf19(skc50,X1,skc51),skc51)
| ssSkC0
| ~ young(skc50,skf29(skc50,X2))
| ~ guy(skc50,skf29(skc50,X2))
| ~ table(skc50,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_43]),c_0_51])]),c_0_63]),
[final] ).
cnf(c_0_95,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| member(skc50,skf20(skc50,skc51),skc51)
| ssSkC0
| ~ young(skc50,skf29(skc50,X3))
| ~ guy(skc50,skf29(skc50,X3))
| ~ table(skc50,X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_43]),c_0_63]),
[final] ).
cnf(c_0_96,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| member(skc50,skf27(skc50,skc51),skc51)
| ssSkP2(X3,skc50)
| ssSkC0
| ~ table(skc50,X4) ),
inference(spm,[status(thm)],[c_0_65,c_0_43]),
[final] ).
cnf(c_0_97,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| ssSkP2(X3,skc50)
| ssSkC0
| ~ hamburger(skc50,skf27(skc50,X4))
| ~ table(skc50,X5) ),
inference(spm,[status(thm)],[c_0_66,c_0_43]),
[final] ).
cnf(c_0_98,negated_conjecture,
( member(skc50,skf19(skc50,X1,skc51),skc51)
| member(skc50,skf29(skc50,skc51),skc51)
| ssSkC0
| ~ table(skc50,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_43]),c_0_51])]),c_0_63]),
[final] ).
cnf(c_0_99,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| member(skc50,skf29(skc50,skc51),skc51)
| member(skc50,skf20(skc50,skc51),skc51)
| ssSkC0
| ~ table(skc50,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_43]),c_0_63]),
[final] ).
cnf(c_0_100,negated_conjecture,
( with(X1,skf13(X1,X2,X3,X4),X2)
| member(X1,skf15(X5,X1,X6,X7),X5)
| ~ member(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_69,c_0_40]),
[final] ).
cnf(c_0_101,negated_conjecture,
( at(X1,skf13(X1,X2,X3,X4),X3)
| member(X1,skf15(X5,X1,X6,X7),X5)
| ~ member(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_70,c_0_40]),
[final] ).
cnf(c_0_102,negated_conjecture,
( agent(X1,skf13(X1,X2,X3,X4),X4)
| member(X1,skf15(X5,X1,X6,X7),X5)
| ~ member(X1,X2,X5) ),
inference(spm,[status(thm)],[c_0_71,c_0_40]),
[final] ).
cnf(c_0_103,negated_conjecture,
( sit(X1,skf13(X1,X2,X3,X4))
| member(X1,skf15(X5,X1,X6,X7),X5)
| ~ member(X1,X8,X5) ),
inference(spm,[status(thm)],[c_0_72,c_0_40]),
[final] ).
cnf(c_0_104,negated_conjecture,
( present(X1,skf13(X1,X2,X3,X4))
| member(X1,skf15(X5,X1,X6,X7),X5)
| ~ member(X1,X8,X5) ),
inference(spm,[status(thm)],[c_0_73,c_0_40]),
[final] ).
cnf(c_0_105,negated_conjecture,
( event(X1,skf13(X1,X2,X3,X4))
| member(X1,skf15(X5,X1,X6,X7),X5)
| ~ member(X1,X8,X5) ),
inference(spm,[status(thm)],[c_0_74,c_0_40]),
[final] ).
cnf(c_0_106,negated_conjecture,
( member(skc50,skf15(skc51,skc50,X1,X2),skc51)
| ssSkP1(X3,X4,skc50)
| ssSkC0
| ~ hamburger(skc50,skf20(skc50,X5)) ),
inference(spm,[status(thm)],[c_0_75,c_0_43]),
[final] ).
cnf(c_0_107,negated_conjecture,
( ssSkP0(X4,X5,X3,X1)
| ~ with(X1,X2,skf15(X3,X1,X4,X5))
| ~ at(X1,X2,X4)
| ~ sit(X1,X2)
| ~ present(X1,X2)
| ~ agent(X1,X2,X5)
| ~ event(X1,X2) ),
c_0_76,
[final] ).
cnf(c_0_108,negated_conjecture,
( ~ young(X1,skf12(X1,X2))
| ~ guy(X1,skf12(X1,X2))
| ~ group(X1,X3)
| ~ three(X1,X3)
| ~ ssSkP2(X3,X1)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_77,
[final] ).
cnf(c_0_109,negated_conjecture,
( hamburger(X1,X2)
| ~ member(X1,X2,skf17(X1,X3,X4))
| ~ member(X1,X5,X6)
| ~ ssSkP1(X7,X6,X1) ),
c_0_78,
[final] ).
cnf(c_0_110,negated_conjecture,
( ssSkP0(X4,X2,skf17(X1,X2,X4),X1)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_79,
[final] ).
cnf(c_0_111,negated_conjecture,
( hamburger(X1,X2)
| ~ member(X1,X2,skf22(X1,X3))
| ~ member(X1,X4,X5)
| ~ ssSkP2(X5,X1) ),
c_0_80,
[final] ).
cnf(c_0_112,negated_conjecture,
( member(X1,skf12(X1,X2),X2)
| ~ group(X1,X2)
| ~ three(X1,X2)
| ~ ssSkP2(X2,X1)
| ~ actual_world(X1)
| ~ ssSkC0 ),
c_0_81,
[final] ).
cnf(c_0_113,negated_conjecture,
( ssSkP0(skf23(X1,X2),X2,skf22(X1,X2),X1)
| ~ member(X1,X2,X3)
| ~ ssSkP2(X3,X1) ),
c_0_82,
[final] ).
cnf(c_0_114,negated_conjecture,
( group(X1,skf17(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_83,
[final] ).
cnf(c_0_115,negated_conjecture,
( table(X1,skf23(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP2(X3,X1) ),
c_0_84,
[final] ).
cnf(c_0_116,negated_conjecture,
( group(X1,skf22(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP2(X3,X1) ),
c_0_85,
[final] ).
cnf(c_0_117,negated_conjecture,
( ssSkP2(X1,X2)
| member(X2,skf26(X2,X1),X1) ),
clause10,
[final] ).
cnf(c_0_118,negated_conjecture,
( young(skc5,X1)
| ~ member(skc5,X1,skc6)
| ~ ssSkC0 ),
c_0_86,
[final] ).
cnf(c_0_119,negated_conjecture,
( guy(skc5,X1)
| ~ member(skc5,X1,skc6)
| ~ ssSkC0 ),
c_0_87,
[final] ).
cnf(c_0_120,negated_conjecture,
( ssSkC0
| young(skc50,X1)
| ~ member(skc50,X1,skc51) ),
c_0_88,
[final] ).
cnf(c_0_121,negated_conjecture,
( ssSkC0
| guy(skc50,X1)
| ~ member(skc50,X1,skc51) ),
c_0_89,
[final] ).
cnf(c_0_122,negated_conjecture,
( ssSkP1(skc7,skc6,skc5)
| ~ ssSkC0 ),
c_0_90,
[final] ).
cnf(c_0_123,negated_conjecture,
( table(skc5,skc7)
| ~ ssSkC0 ),
c_0_91,
[final] ).
cnf(c_0_124,negated_conjecture,
( three(skc5,skc6)
| ~ ssSkC0 ),
c_0_92,
[final] ).
cnf(c_0_125,negated_conjecture,
( group(skc5,skc6)
| ~ ssSkC0 ),
c_0_93,
[final] ).
cnf(c_0_126,negated_conjecture,
( ssSkC0
| ssSkP2(skc51,skc50) ),
clause5,
[final] ).
cnf(c_0_127,negated_conjecture,
actual_world(skc5),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NLP031-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 21:52:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_1 with pid 25617 completed with status 1
% 0.20/0.51 # Result found by new_bool_1
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNF-FFMS32-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.20/0.51 # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 25623 completed with status 1
% 0.20/0.51 # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNF-FFMS32-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # No proof found!
% 0.20/0.51 # SZS status Satisfiable
% 0.20/0.51 # SZS output start Saturation
% See solution above
% 0.20/0.51 # Parsed axioms : 38
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 38
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 38
% 0.20/0.51 # Processed clauses : 98
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 98
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 24
% 0.20/0.51 # ...of the previous two non-redundant : 22
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 4
% 0.20/0.51 # Paramodulations : 24
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 6
% 0.20/0.51 # ...of those cached : 5
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 59
% 0.20/0.51 # Positive orientable unit clauses : 2
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 57
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 39
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 973
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 261
% 0.20/0.51 # Non-unit clause-clause subsumptions : 5
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 2957
% 0.20/0.51 # Search garbage collected termcells : 154
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.012 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.012 s
% 0.20/0.51 # Maximum resident set size: 1852 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.013 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.016 s
% 0.20/0.51 # Maximum resident set size: 1732 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------