TSTP Solution File: NLP022-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP022-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:41:26 EDT 2023
% Result : Satisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause43)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_73,axiom,
( transport(X1)
| ~ vehicle(X1) ),
clause17,
[final] ).
cnf(c_0_74,axiom,
( vehicle(X1)
| ~ car(X1) ),
clause18,
[final] ).
cnf(c_0_75,axiom,
( instrumentality(X1)
| ~ transport(X1) ),
clause16,
[final] ).
cnf(c_0_76,plain,
( transport(X1)
| ~ car(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]),
[final] ).
cnf(c_0_77,plain,
( instrumentality(X1)
| ~ car(X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]),
[final] ).
cnf(c_0_78,negated_conjecture,
car(skc11),
clause52,
[final] ).
cnf(c_0_79,axiom,
( artifact(X1)
| ~ instrumentality(X1) ),
clause15,
[final] ).
cnf(c_0_80,axiom,
( instrumentality(X1)
| ~ furniture(X1) ),
clause22,
[final] ).
cnf(c_0_81,axiom,
( partof(X1,X2)
| ~ nonhuman(X1)
| ~ nonhuman(X2)
| ~ have(X3,X2,X1) ),
clause47,
[final] ).
cnf(c_0_82,axiom,
( have(skf1(X1,X2),X2,X1)
| ~ of(X1,X2) ),
clause41,
[final] ).
cnf(c_0_83,axiom,
( ~ entity(X1)
| ~ eventuality(X1) ),
clause34,
[final] ).
cnf(c_0_84,axiom,
( eventuality(X1)
| ~ event(X1) ),
clause13,
[final] ).
cnf(c_0_85,negated_conjecture,
instrumentality(skc11),
inference(spm,[status(thm)],[c_0_77,c_0_78]),
[final] ).
cnf(c_0_86,axiom,
( ~ object(X1)
| ~ organism(X1) ),
clause39,
[final] ).
cnf(c_0_87,axiom,
( organism(X1)
| ~ human(X1) ),
clause26,
[final] ).
cnf(c_0_88,axiom,
( object(X1)
| ~ artifact(X1) ),
clause14,
[final] ).
cnf(c_0_89,axiom,
( artifact(X1)
| ~ way(X1) ),
clause20,
[final] ).
cnf(c_0_90,axiom,
( object(X1)
| ~ location(X1) ),
clause10,
[final] ).
cnf(c_0_91,axiom,
( location(X1)
| ~ city(X1) ),
clause11,
[final] ).
cnf(c_0_92,axiom,
( ~ location(X1)
| ~ artifact(X1) ),
clause36,
[final] ).
cnf(c_0_93,plain,
( artifact(X1)
| ~ furniture(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]),
[final] ).
cnf(c_0_94,axiom,
( X3 = X2
| ~ partof(X1,X2)
| ~ partof(X1,X3) ),
clause43,
[final] ).
cnf(c_0_95,plain,
( partof(X1,X2)
| ~ of(X1,X2)
| ~ nonhuman(X2)
| ~ nonhuman(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]),
[final] ).
cnf(c_0_96,plain,
( ~ entity(X1)
| ~ event(X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]),
[final] ).
cnf(c_0_97,axiom,
event(skf1(X1,X2)),
clause1,
[final] ).
cnf(c_0_98,axiom,
( entity(X1)
| ~ organism(X1) ),
clause25,
[final] ).
cnf(c_0_99,negated_conjecture,
event(skc12),
clause50,
[final] ).
cnf(c_0_100,negated_conjecture,
artifact(skc11),
inference(spm,[status(thm)],[c_0_79,c_0_85]),
[final] ).
cnf(c_0_101,plain,
( ~ object(X1)
| ~ human(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]),
[final] ).
cnf(c_0_102,plain,
( object(X1)
| ~ way(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]),
[final] ).
cnf(c_0_103,axiom,
( ~ transport(X1)
| ~ furniture(X1) ),
clause38,
[final] ).
cnf(c_0_104,plain,
( object(X1)
| ~ city(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_105,negated_conjecture,
city(skc13),
clause49,
[final] ).
cnf(c_0_106,plain,
( ~ artifact(X1)
| ~ city(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_91]),
[final] ).
cnf(c_0_107,axiom,
( ~ instrumentality(X1)
| ~ way(X1) ),
clause37,
[final] ).
cnf(c_0_108,axiom,
( nonhuman(X1)
| ~ front(X1) ),
clause24,
[final] ).
cnf(c_0_109,negated_conjecture,
front(skc9),
clause58,
[final] ).
cnf(c_0_110,axiom,
( entity(X1)
| ~ object(X1) ),
clause9,
[final] ).
cnf(c_0_111,plain,
( object(X1)
| ~ furniture(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_93]),
[final] ).
cnf(c_0_112,plain,
( X1 = X2
| ~ partof(X3,X1)
| ~ of(X3,X2)
| ~ nonhuman(X2)
| ~ nonhuman(X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]),
[final] ).
cnf(c_0_113,axiom,
( of(X2,X3)
| ~ have(X1,X2,X3)
| ~ event(X1) ),
clause44,
[final] ).
cnf(c_0_114,axiom,
( owner(X1)
| ~ human(X1)
| ~ have(X2,X1,X3) ),
clause42,
[final] ).
cnf(c_0_115,axiom,
( ~ female(X1)
| ~ male(X1) ),
clause31,
[final] ).
cnf(c_0_116,axiom,
( male(X1)
| ~ man(X1) ),
clause8,
[final] ).
cnf(c_0_117,plain,
~ entity(skf1(X1,X2)),
inference(spm,[status(thm)],[c_0_96,c_0_97]),
[final] ).
cnf(c_0_118,plain,
( entity(X1)
| ~ human(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_87]),
[final] ).
cnf(c_0_119,negated_conjecture,
~ entity(skc12),
inference(spm,[status(thm)],[c_0_96,c_0_99]),
[final] ).
cnf(c_0_120,negated_conjecture,
object(skc11),
inference(spm,[status(thm)],[c_0_88,c_0_100]),
[final] ).
cnf(c_0_121,axiom,
( entity(X1)
| ~ nonhuman(X1) ),
clause2,
[final] ).
cnf(c_0_122,plain,
( ~ way(X1)
| ~ human(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]),
[final] ).
cnf(c_0_123,negated_conjecture,
way(skc10),
clause66,
[final] ).
cnf(c_0_124,plain,
( ~ furniture(X1)
| ~ car(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_76]),
[final] ).
cnf(c_0_125,negated_conjecture,
object(skc13),
inference(spm,[status(thm)],[c_0_104,c_0_105]),
[final] ).
cnf(c_0_126,negated_conjecture,
~ artifact(skc13),
inference(spm,[status(thm)],[c_0_106,c_0_105]),
[final] ).
cnf(c_0_127,plain,
( ~ furniture(X1)
| ~ way(X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_80]),
[final] ).
cnf(c_0_128,negated_conjecture,
furniture(skc9),
clause57,
[final] ).
cnf(c_0_129,axiom,
( ~ nonhuman(X1)
| ~ human(X1) ),
clause29,
[final] ).
cnf(c_0_130,negated_conjecture,
nonhuman(skc9),
inference(spm,[status(thm)],[c_0_108,c_0_109]),
[final] ).
cnf(c_0_131,plain,
( entity(X1)
| ~ furniture(X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]),
[final] ).
cnf(c_0_132,plain,
( entity(X1)
| ~ way(X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_102]),
[final] ).
cnf(c_0_133,axiom,
( human(X1)
| ~ man(X1) ),
clause27,
[final] ).
cnf(c_0_134,negated_conjecture,
man(skc8),
clause60,
[final] ).
cnf(c_0_135,negated_conjecture,
man(skc7),
clause63,
[final] ).
cnf(c_0_136,plain,
( X1 = X2
| ~ of(X3,X2)
| ~ of(X3,X1)
| ~ nonhuman(X2)
| ~ nonhuman(X3)
| ~ nonhuman(X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_95]),
[final] ).
cnf(c_0_137,plain,
( of(X1,X2)
| ~ of(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_82]),c_0_97])]),
[final] ).
cnf(c_0_138,plain,
( owner(X1)
| ~ of(X2,X1)
| ~ human(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_82]),
[final] ).
cnf(c_0_139,axiom,
( have(X3,X1,X2)
| ~ owner(X1)
| ~ of(X1,X2) ),
clause46,
[final] ).
cnf(c_0_140,axiom,
( of(X1,X3)
| ~ human(X1)
| ~ have(X2,X1,X3) ),
clause45,
[final] ).
cnf(c_0_141,plain,
( ~ furniture(X1)
| ~ human(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_111]),
[final] ).
cnf(c_0_142,axiom,
( human(X1)
| ~ owner(X1)
| ~ of(X1,X2) ),
clause40,
[final] ).
cnf(c_0_143,axiom,
( proposition(X1)
| ~ drs(X1) ),
clause3,
[final] ).
cnf(c_0_144,axiom,
( human(X1)
| ~ male(X1) ),
clause7,
[final] ).
cnf(c_0_145,axiom,
( human(X1)
| ~ female(X1) ),
clause6,
[final] ).
cnf(c_0_146,plain,
( ~ man(X1)
| ~ female(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]),
[final] ).
cnf(c_0_147,axiom,
( furniture(X1)
| ~ seat(X1) ),
clause23,
[final] ).
cnf(c_0_148,axiom,
( way(X1)
| ~ street(X1) ),
clause21,
[final] ).
cnf(c_0_149,axiom,
( car(X1)
| ~ chevy(X1) ),
clause19,
[final] ).
cnf(c_0_150,axiom,
( female(X1)
| ~ woman(X1) ),
clause5,
[final] ).
cnf(c_0_151,axiom,
( drs(X1)
| ~ proposition(X1) ),
clause4,
[final] ).
cnf(c_0_152,axiom,
( city(X1)
| ~ hollywood(X1) ),
clause12,
[final] ).
cnf(c_0_153,axiom,
( man(X1)
| ~ fellow(X1) ),
clause28,
[final] ).
cnf(c_0_154,axiom,
( ~ new(X1)
| ~ old(X1) ),
clause35,
[final] ).
cnf(c_0_155,axiom,
( ~ eventuality(X1)
| ~ abstraction(X1) ),
clause32,
[final] ).
cnf(c_0_156,axiom,
( ~ woman(X1)
| ~ man(X1) ),
clause30,
[final] ).
cnf(c_0_157,axiom,
( ~ entity(X1)
| ~ abstraction(X1) ),
clause33,
[final] ).
cnf(c_0_158,plain,
~ human(skf1(X1,X2)),
inference(spm,[status(thm)],[c_0_117,c_0_118]),
[final] ).
cnf(c_0_159,negated_conjecture,
~ human(skc12),
inference(spm,[status(thm)],[c_0_119,c_0_118]),
[final] ).
cnf(c_0_160,negated_conjecture,
~ human(skc11),
inference(spm,[status(thm)],[c_0_101,c_0_120]),
[final] ).
cnf(c_0_161,plain,
~ nonhuman(skf1(X1,X2)),
inference(spm,[status(thm)],[c_0_117,c_0_121]),
[final] ).
cnf(c_0_162,negated_conjecture,
~ way(skc11),
inference(spm,[status(thm)],[c_0_107,c_0_85]),
[final] ).
cnf(c_0_163,negated_conjecture,
~ human(skc10),
inference(spm,[status(thm)],[c_0_122,c_0_123]),
[final] ).
cnf(c_0_164,negated_conjecture,
~ furniture(skc11),
inference(spm,[status(thm)],[c_0_124,c_0_78]),
[final] ).
cnf(c_0_165,negated_conjecture,
~ human(skc13),
inference(spm,[status(thm)],[c_0_101,c_0_125]),
[final] ).
cnf(c_0_166,negated_conjecture,
~ furniture(skc13),
inference(spm,[status(thm)],[c_0_126,c_0_93]),
[final] ).
cnf(c_0_167,negated_conjecture,
~ way(skc9),
inference(spm,[status(thm)],[c_0_127,c_0_128]),
[final] ).
cnf(c_0_168,negated_conjecture,
~ way(skc13),
inference(spm,[status(thm)],[c_0_126,c_0_89]),
[final] ).
cnf(c_0_169,negated_conjecture,
~ nonhuman(skc12),
inference(spm,[status(thm)],[c_0_119,c_0_121]),
[final] ).
cnf(c_0_170,negated_conjecture,
~ human(skc9),
inference(spm,[status(thm)],[c_0_129,c_0_130]),
[final] ).
cnf(c_0_171,negated_conjecture,
skc8 != skc7,
clause73,
[final] ).
cnf(c_0_172,negated_conjecture,
entity(skc9),
inference(spm,[status(thm)],[c_0_131,c_0_128]),
[final] ).
cnf(c_0_173,negated_conjecture,
entity(skc11),
inference(spm,[status(thm)],[c_0_110,c_0_120]),
[final] ).
cnf(c_0_174,negated_conjecture,
entity(skc10),
inference(spm,[status(thm)],[c_0_132,c_0_123]),
[final] ).
cnf(c_0_175,negated_conjecture,
entity(skc13),
inference(spm,[status(thm)],[c_0_110,c_0_125]),
[final] ).
cnf(c_0_176,negated_conjecture,
human(skc8),
inference(spm,[status(thm)],[c_0_133,c_0_134]),
[final] ).
cnf(c_0_177,negated_conjecture,
human(skc7),
inference(spm,[status(thm)],[c_0_133,c_0_135]),
[final] ).
cnf(c_0_178,negated_conjecture,
barrel(skc12,skc11),
clause70,
[final] ).
cnf(c_0_179,negated_conjecture,
down(skc12,skc10),
clause69,
[final] ).
cnf(c_0_180,negated_conjecture,
in(skc7,skc9),
clause72,
[final] ).
cnf(c_0_181,negated_conjecture,
in(skc8,skc9),
clause71,
[final] ).
cnf(c_0_182,negated_conjecture,
in(skc12,skc13),
clause68,
[final] ).
cnf(c_0_183,negated_conjecture,
lonely(skc10),
clause65,
[final] ).
cnf(c_0_184,negated_conjecture,
young(skc7),
clause64,
[final] ).
cnf(c_0_185,negated_conjecture,
young(skc8),
clause59,
[final] ).
cnf(c_0_186,negated_conjecture,
dirty(skc11),
clause54,
[final] ).
cnf(c_0_187,negated_conjecture,
white(skc11),
clause53,
[final] ).
cnf(c_0_188,negated_conjecture,
old(skc11),
clause55,
[final] ).
cnf(c_0_189,negated_conjecture,
fellow(skc7),
clause62,
[final] ).
cnf(c_0_190,negated_conjecture,
fellow(skc8),
clause61,
[final] ).
cnf(c_0_191,negated_conjecture,
seat(skc9),
clause56,
[final] ).
cnf(c_0_192,negated_conjecture,
street(skc10),
clause67,
[final] ).
cnf(c_0_193,negated_conjecture,
chevy(skc11),
clause51,
[final] ).
cnf(c_0_194,negated_conjecture,
hollywood(skc13),
clause48,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NLP022-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.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 11:09:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.EnpUUnrLpU/E---3.1_16706.p
% 0.20/0.51 # Version: 3.1pre001
% 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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16784 completed with status 1
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.20/0.51 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 16788 completed with status 1
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 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 # No SInE strategy applied
% 0.20/0.51 # Search class: FHHSF-FFMM22-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 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 : 73
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 73
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 73
% 0.20/0.51 # Processed clauses : 198
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 3
% 0.20/0.51 # ...remaining for further processing : 195
% 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 : 0
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 59
% 0.20/0.51 # ...of the previous two non-redundant : 52
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 59
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 7
% 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 : 122
% 0.20/0.51 # Positive orientable unit clauses : 37
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 17
% 0.20/0.51 # Non-unit-clauses : 68
% 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 : 73
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1995
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 1540
% 0.20/0.51 # Non-unit clause-clause subsumptions : 2
% 0.20/0.51 # Unit Clause-clause subsumption calls : 261
% 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 : 1763
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.007 s
% 0.20/0.51 # System time : 0.005 s
% 0.20/0.51 # Total time : 0.012 s
% 0.20/0.51 # Maximum resident set size: 1712 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.041 s
% 0.20/0.51 # System time : 0.016 s
% 0.20/0.51 # Total time : 0.057 s
% 0.20/0.51 # Maximum resident set size: 1716 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------