TSTP Solution File: NLP026-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NLP026-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 : Sat May 4 08:44:53 EDT 2024
% Result : Satisfiable 14.88s 2.38s
% Output : Saturation 14.88s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_49,negated_conjecture,
actual_world(skc64),
clause1,
[final] ).
cnf(c_0_53,negated_conjecture,
( ssSkP3(X1,X2)
| member(X2,skf31(X2,X1),X1) ),
clause8,
[final] ).
cnf(c_0_63,negated_conjecture,
( group(X1,skf24(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP2(X4,X3,X1) ),
c_0_57,
[final] ).
cnf(c_0_65,negated_conjecture,
( three(X1,skf24(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP2(X4,X3,X1) ),
c_0_60,
[final] ).
cnf(c_0_66,negated_conjecture,
( ssSkP0(X2,X4,skf24(X1,X4,X2),X1)
| ~ member(X1,X2,X3)
| ~ ssSkP2(X4,X3,X1) ),
c_0_61,
[final] ).
cnf(c_0_67,negated_conjecture,
( ssSkP3(X4,X1)
| member(X1,skf32(X1,X2),X2)
| ~ group(X1,X2)
| ~ three(X1,X2)
| ~ ssSkP1(skf31(X1,X3),X2,X1) ),
c_0_62,
[final] ).
cnf(c_0_68,negated_conjecture,
( ssSkP1(X1,X2,X3)
| member(X3,skf22(X1,X3,X2),X2) ),
clause11,
[final] ).
cnf(c_0_74,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_67,c_0_68]),
[final] ).
cnf(c_0_80,negated_conjecture,
( agent(X1,skf15(X1,X2,X6,X7),X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_72,
[final] ).
cnf(c_0_83,negated_conjecture,
( sit(X1,skf15(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_77,
[final] ).
cnf(c_0_85,negated_conjecture,
( present(X1,skf15(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_78,
[final] ).
cnf(c_0_86,negated_conjecture,
( event(X1,skf15(X1,X6,X7,X8))
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_79,
[final] ).
cnf(c_0_95,negated_conjecture,
( at(X1,skf15(X1,X2,X4,X5),X5)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_87,
[final] ).
cnf(c_0_97,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) ),
c_0_88,
[final] ).
cnf(c_0_103,negated_conjecture,
( with(X1,skf15(X1,X2,X4,X6),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X4,X5,X3,X1) ),
c_0_96,
[final] ).
cnf(c_0_116,negated_conjecture,
( guy(X1,X2)
| ~ member(X1,X2,skf24(X1,X3,X4))
| ~ member(X1,X5,X6)
| ~ ssSkP2(X7,X6,X1) ),
c_0_112,
[final] ).
cnf(c_0_118,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,skf24(X1,X3,X4))
| ~ member(X1,X5,X6)
| ~ ssSkP2(X7,X6,X1) ),
c_0_114,
[final] ).
cnf(c_0_119,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) ),
c_0_115,
[final] ).
cnf(c_0_123,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_119,c_0_68]),
[final] ).
cnf(c_0_139,negated_conjecture,
( group(X1,skf29(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP3(X3,X1) ),
c_0_137,
[final] ).
cnf(c_0_181,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf26(X3,X1,X2),X2) ),
clause12,
[final] ).
cnf(c_0_183,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) ),
c_0_176,
[final] ).
cnf(c_0_184,negated_conjecture,
( ssSkP0(X1,X2,X3,X4)
| member(X4,skf17(X3,X4,X5,X6),X3) ),
clause13,
[final] ).
cnf(c_0_186,negated_conjecture,
ssSkC0,
inference(spm,[status(thm)],[c_0_156,c_0_178]),
[final] ).
cnf(c_0_187,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) ),
c_0_179,
[final] ).
cnf(c_0_192,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_183,c_0_184]),
[final] ).
cnf(c_0_193,negated_conjecture,
group(skc5,skc6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_186])]),
[final] ).
cnf(c_0_194,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_187,c_0_184]),
[final] ).
cnf(c_0_195,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_188,c_0_186])]),
[final] ).
cnf(c_0_196,negated_conjecture,
actual_world(skc5),
clause2,
[final] ).
cnf(c_0_197,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_189,c_0_186])]),
[final] ).
cnf(c_0_212,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_192,c_0_193]),
[final] ).
cnf(c_0_213,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_123,c_0_193]),
[final] ).
cnf(c_0_214,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_194,c_0_193]),
[final] ).
cnf(c_0_215,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_74,c_0_193]),
[final] ).
cnf(c_0_216,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_182,c_0_186])]),
[final] ).
cnf(c_0_217,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_195,c_0_193]),c_0_196])]),
[final] ).
cnf(c_0_218,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_197,c_0_193]),c_0_196])]),
[final] ).
cnf(c_0_219,negated_conjecture,
( hamburger(skc5,X1)
| ~ member(skc5,X1,skc6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_186])]),
[final] ).
cnf(c_0_220,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_180,c_0_186])]),
[final] ).
cnf(c_0_221,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_95,c_0_184]),
[final] ).
cnf(c_0_222,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_80,c_0_184]),
[final] ).
cnf(c_0_223,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_103,c_0_184]),
[final] ).
cnf(c_0_224,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_86,c_0_184]),
[final] ).
cnf(c_0_225,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_85,c_0_184]),
[final] ).
cnf(c_0_226,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_83,c_0_184]),
[final] ).
cnf(c_0_227,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) ),
c_0_199,
[final] ).
cnf(c_0_228,negated_conjecture,
( at(X1,skf18(X1,X5,X6),skf19(X1,X6,X5))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_200,
[final] ).
cnf(c_0_229,negated_conjecture,
( agent(X1,skf18(X1,X2,X5),X2)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_201,
[final] ).
cnf(c_0_230,negated_conjecture,
( with(X1,skf18(X1,X2,X4),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_202,
[final] ).
cnf(c_0_231,negated_conjecture,
( event(X1,skf18(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_203,
[final] ).
cnf(c_0_232,negated_conjecture,
( present(X1,skf18(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_204,
[final] ).
cnf(c_0_233,negated_conjecture,
( sit(X1,skf18(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_205,
[final] ).
cnf(c_0_234,negated_conjecture,
( guy(X1,X2)
| ~ member(X1,X2,skf29(X1,X3))
| ~ member(X1,X4,X5)
| ~ ssSkP3(X5,X1) ),
c_0_206,
[final] ).
cnf(c_0_235,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,skf29(X1,X3))
| ~ member(X1,X4,X5)
| ~ ssSkP3(X5,X1) ),
c_0_207,
[final] ).
cnf(c_0_236,negated_conjecture,
( table(X1,skf19(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
c_0_208,
[final] ).
cnf(c_0_237,negated_conjecture,
( ssSkP1(X2,skf29(X1,X2),X1)
| ~ member(X1,X2,X3)
| ~ ssSkP3(X3,X1) ),
c_0_209,
[final] ).
cnf(c_0_238,negated_conjecture,
( three(X1,skf29(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP3(X3,X1) ),
c_0_210,
[final] ).
cnf(c_0_239,negated_conjecture,
ssSkP3(skc6,skc5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_211,c_0_186])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP026-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 08:53:48 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 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/tmp/tmp.LVI4CW9A9l/E---3.1_23639.p
% 14.88/2.38 # Version: 3.1.0
% 14.88/2.38 # Preprocessing class: FSLSSMSSSSSNFFN.
% 14.88/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.88/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 14.88/2.38 # Starting new_bool_3 with 300s (1) cores
% 14.88/2.38 # Starting new_bool_1 with 300s (1) cores
% 14.88/2.38 # Starting sh5l with 300s (1) cores
% 14.88/2.38 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23716 completed with status 1
% 14.88/2.38 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 14.88/2.38 # Preprocessing class: FSLSSMSSSSSNFFN.
% 14.88/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.88/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 14.88/2.38 # No SInE strategy applied
% 14.88/2.38 # Search class: FGHNF-FFMS32-SFFFFFNN
% 14.88/2.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 14.88/2.38 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 811s (1) cores
% 14.88/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 14.88/2.38 # Starting G-E--_107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 136s (1) cores
% 14.88/2.38 # Starting new_bool_3 with 136s (1) cores
% 14.88/2.38 # Starting new_bool_1 with 136s (1) cores
% 14.88/2.38 # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 23721 completed with status 1
% 14.88/2.38 # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 14.88/2.38 # Preprocessing class: FSLSSMSSSSSNFFN.
% 14.88/2.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.88/2.38 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 14.88/2.38 # No SInE strategy applied
% 14.88/2.38 # Search class: FGHNF-FFMS32-SFFFFFNN
% 14.88/2.38 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 14.88/2.38 # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S071I with 811s (1) cores
% 14.88/2.38 # Preprocessing time : 0.001 s
% 14.88/2.38 # Presaturation interreduction done
% 14.88/2.38
% 14.88/2.38 # No proof found!
% 14.88/2.38 # SZS status Satisfiable
% 14.88/2.38 # SZS output start Saturation
% See solution above
% 14.88/2.38 # Parsed axioms : 46
% 14.88/2.38 # Removed by relevancy pruning/SinE : 0
% 14.88/2.38 # Initial clauses : 46
% 14.88/2.38 # Removed in clause preprocessing : 0
% 14.88/2.38 # Initial clauses in saturation : 46
% 14.88/2.38 # Processed clauses : 7627
% 14.88/2.38 # ...of these trivial : 0
% 14.88/2.38 # ...subsumed : 4168
% 14.88/2.38 # ...remaining for further processing : 3459
% 14.88/2.38 # Other redundant clauses eliminated : 0
% 14.88/2.38 # Clauses deleted for lack of memory : 0
% 14.88/2.38 # Backward-subsumed : 2945
% 14.88/2.38 # Backward-rewritten : 409
% 14.88/2.38 # Generated clauses : 27696
% 14.88/2.38 # ...of the previous two non-redundant : 27637
% 14.88/2.38 # ...aggressively subsumed : 0
% 14.88/2.38 # Contextual simplify-reflections : 307
% 14.88/2.38 # Paramodulations : 27566
% 14.88/2.38 # Factorizations : 130
% 14.88/2.38 # NegExts : 0
% 14.88/2.38 # Equation resolutions : 0
% 14.88/2.38 # Disequality decompositions : 0
% 14.88/2.38 # Total rewrite steps : 525
% 14.88/2.38 # ...of those cached : 522
% 14.88/2.38 # Propositional unsat checks : 0
% 14.88/2.38 # Propositional check models : 0
% 14.88/2.38 # Propositional check unsatisfiable : 0
% 14.88/2.38 # Propositional clauses : 0
% 14.88/2.38 # Propositional clauses after purity: 0
% 14.88/2.38 # Propositional unsat core size : 0
% 14.88/2.38 # Propositional preprocessing time : 0.000
% 14.88/2.38 # Propositional encoding time : 0.000
% 14.88/2.38 # Propositional solver time : 0.000
% 14.88/2.38 # Success case prop preproc time : 0.000
% 14.88/2.38 # Success case prop encoding time : 0.000
% 14.88/2.38 # Success case prop solver time : 0.000
% 14.88/2.38 # Current number of processed clauses : 59
% 14.88/2.38 # Positive orientable unit clauses : 5
% 14.88/2.38 # Positive unorientable unit clauses: 0
% 14.88/2.38 # Negative unit clauses : 0
% 14.88/2.38 # Non-unit-clauses : 54
% 14.88/2.38 # Current number of unprocessed clauses: 0
% 14.88/2.38 # ...number of literals in the above : 0
% 14.88/2.38 # Current number of archived formulas : 0
% 14.88/2.38 # Current number of archived clauses : 3400
% 14.88/2.38 # Clause-clause subsumption calls (NU) : 4196829
% 14.88/2.38 # Rec. Clause-clause subsumption calls : 44829
% 14.88/2.38 # Non-unit clause-clause subsumptions : 7420
% 14.88/2.38 # Unit Clause-clause subsumption calls : 94
% 14.88/2.38 # Rewrite failures with RHS unbound : 0
% 14.88/2.38 # BW rewrite match attempts : 1
% 14.88/2.38 # BW rewrite match successes : 1
% 14.88/2.38 # Condensation attempts : 0
% 14.88/2.38 # Condensation successes : 0
% 14.88/2.38 # Termbank termtop insertions : 1619799
% 14.88/2.38 # Search garbage collected termcells : 185
% 14.88/2.38
% 14.88/2.38 # -------------------------------------------------
% 14.88/2.38 # User time : 1.877 s
% 14.88/2.38 # System time : 0.013 s
% 14.88/2.38 # Total time : 1.890 s
% 14.88/2.38 # Maximum resident set size: 1796 pages
% 14.88/2.38
% 14.88/2.38 # -------------------------------------------------
% 14.88/2.38 # User time : 9.399 s
% 14.88/2.38 # System time : 0.080 s
% 14.88/2.38 # Total time : 9.479 s
% 14.88/2.38 # Maximum resident set size: 1744 pages
% 14.88/2.38 % E---3.1 exiting
%------------------------------------------------------------------------------