TSTP Solution File: SEU262+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU262+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 19:31:12 EDT 2023
% Result : Theorem 278.77s 36.19s
% Output : CNFRefutation 278.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 5 unt; 0 def)
% Number of atoms : 159 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 175 ( 67 ~; 74 |; 16 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 126 ( 10 sgn; 69 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_subset_1,lemma,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',l3_subset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',dt_m2_relset_1) ).
fof(t12_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',t12_relset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',cc1_relset_1) ).
fof(l55_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',l55_zfmisc_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',d4_relat_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',t3_subset) ).
fof(l71_subset_1,lemma,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',l71_subset_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',d5_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TzdolhnsHB/E---3.1_18894.p',d3_tarski) ).
fof(c_0_10,lemma,
! [X134,X135,X136] :
( ~ element(X135,powerset(X134))
| ~ in(X136,X135)
| in(X136,X134) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l3_subset_1])])]) ).
fof(c_0_11,plain,
! [X53,X54,X55] :
( ~ relation_of2_as_subset(X55,X53,X54)
| element(X55,powerset(cartesian_product2(X53,X54))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
inference(assume_negation,[status(cth)],[t12_relset_1]) ).
cnf(c_0_13,lemma,
( in(X3,X2)
| ~ element(X1,powerset(X2))
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
( relation_of2_as_subset(esk3_0,esk1_0,esk2_0)
& ( ~ subset(relation_dom(esk3_0),esk1_0)
| ~ subset(relation_rng(esk3_0),esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X154,X155,X156] :
( ~ element(X156,powerset(cartesian_product2(X154,X155)))
| relation(X156) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_17,lemma,
! [X178,X179,X180,X181] :
( ( in(X178,X180)
| ~ in(ordered_pair(X178,X179),cartesian_product2(X180,X181)) )
& ( in(X179,X181)
| ~ in(ordered_pair(X178,X179),cartesian_product2(X180,X181)) )
& ( ~ in(X178,X180)
| ~ in(X179,X181)
| in(ordered_pair(X178,X179),cartesian_product2(X180,X181)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])]) ).
cnf(c_0_18,lemma,
( in(X1,cartesian_product2(X2,X3))
| ~ relation_of2_as_subset(X4,X2,X3)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
relation_of2_as_subset(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,lemma,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( in(X1,cartesian_product2(esk1_0,esk2_0))
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_23,plain,
! [X41,X42,X43,X45,X46,X47,X49] :
( ( ~ in(X43,X42)
| in(ordered_pair(X43,esk8_3(X41,X42,X43)),X41)
| X42 != relation_dom(X41)
| ~ relation(X41) )
& ( ~ in(ordered_pair(X45,X46),X41)
| in(X45,X42)
| X42 != relation_dom(X41)
| ~ relation(X41) )
& ( ~ in(esk9_2(X41,X47),X47)
| ~ in(ordered_pair(esk9_2(X41,X47),X49),X41)
| X47 = relation_dom(X41)
| ~ relation(X41) )
& ( in(esk9_2(X41,X47),X47)
| in(ordered_pair(esk9_2(X41,X47),esk10_2(X41,X47)),X41)
| X47 = relation_dom(X41)
| ~ relation(X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_relat_1])])])])])]) ).
cnf(c_0_24,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_25,lemma,
( in(X1,esk1_0)
| ~ in(ordered_pair(X1,X2),esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( in(ordered_pair(X1,esk8_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
relation(esk3_0),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
fof(c_0_28,plain,
! [X142,X143] :
( ( ~ element(X142,powerset(X143))
| subset(X142,X143) )
& ( ~ subset(X142,X143)
| element(X142,powerset(X143)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_29,lemma,
! [X137,X138] :
( ( in(esk32_2(X137,X138),X137)
| element(X137,powerset(X138)) )
& ( ~ in(esk32_2(X137,X138),X138)
| element(X137,powerset(X138)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])]) ).
cnf(c_0_30,lemma,
( in(X1,X2)
| ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_31,plain,
! [X22,X23,X24,X26,X27,X28,X30] :
( ( ~ in(X24,X23)
| in(ordered_pair(esk5_3(X22,X23,X24),X24),X22)
| X23 != relation_rng(X22)
| ~ relation(X22) )
& ( ~ in(ordered_pair(X27,X26),X22)
| in(X26,X23)
| X23 != relation_rng(X22)
| ~ relation(X22) )
& ( ~ in(esk6_2(X22,X28),X28)
| ~ in(ordered_pair(X30,esk6_2(X22,X28)),X22)
| X28 = relation_rng(X22)
| ~ relation(X22) )
& ( in(esk6_2(X22,X28),X28)
| in(ordered_pair(esk7_2(X22,X28),esk6_2(X22,X28)),X22)
| X28 = relation_rng(X22)
| ~ relation(X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_relat_1])])])])])]) ).
cnf(c_0_32,lemma,
( in(X1,esk1_0)
| X2 != relation_dom(esk3_0)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,lemma,
( in(esk32_2(X1,X2),X1)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,lemma,
( in(X1,esk2_0)
| ~ in(ordered_pair(X2,X1),esk3_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_36,plain,
( in(ordered_pair(esk5_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,lemma,
( in(X1,esk1_0)
| ~ in(X1,relation_dom(esk3_0)) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_38,lemma,
( subset(X1,X2)
| in(esk32_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,lemma,
( in(X1,esk2_0)
| X2 != relation_rng(esk3_0)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27])]) ).
fof(c_0_40,plain,
! [X12,X13,X14,X15,X16] :
( ( ~ subset(X12,X13)
| ~ in(X14,X12)
| in(X14,X13) )
& ( in(esk4_2(X15,X16),X15)
| subset(X15,X16) )
& ( ~ in(esk4_2(X15,X16),X16)
| subset(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).
cnf(c_0_41,lemma,
( element(X1,powerset(X2))
| ~ in(esk32_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,lemma,
( subset(relation_dom(esk3_0),X1)
| in(esk32_2(relation_dom(esk3_0),X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,lemma,
( in(X1,esk2_0)
| ~ in(X1,relation_rng(esk3_0)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( ~ subset(relation_dom(esk3_0),esk1_0)
| ~ subset(relation_rng(esk3_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,lemma,
subset(relation_dom(esk3_0),esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33]) ).
cnf(c_0_47,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,lemma,
( subset(relation_rng(esk3_0),X1)
| in(esk4_2(relation_rng(esk3_0),X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
~ subset(relation_rng(esk3_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_50,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SEU262+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n031.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 08:43:13 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.TzdolhnsHB/E---3.1_18894.p
% 278.77/36.19 # Version: 3.1pre001
% 278.77/36.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 278.77/36.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 278.77/36.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 278.77/36.19 # Starting new_bool_3 with 300s (1) cores
% 278.77/36.19 # Starting new_bool_1 with 300s (1) cores
% 278.77/36.19 # Starting sh5l with 300s (1) cores
% 278.77/36.19 # new_bool_1 with pid 18973 completed with status 0
% 278.77/36.19 # Result found by new_bool_1
% 278.77/36.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 278.77/36.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 278.77/36.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 278.77/36.19 # Starting new_bool_3 with 300s (1) cores
% 278.77/36.19 # Starting new_bool_1 with 300s (1) cores
% 278.77/36.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 278.77/36.19 # Search class: FGHSM-FFLM32-SFFFFFNN
% 278.77/36.19 # partial match(1): FGHSM-FFMM32-SFFFFFNN
% 278.77/36.19 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 278.77/36.19 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 278.77/36.19 # G-E--_301_C18_F1_URBAN_S0Y with pid 18976 completed with status 0
% 278.77/36.19 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 278.77/36.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 278.77/36.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 278.77/36.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 278.77/36.19 # Starting new_bool_3 with 300s (1) cores
% 278.77/36.19 # Starting new_bool_1 with 300s (1) cores
% 278.77/36.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 278.77/36.19 # Search class: FGHSM-FFLM32-SFFFFFNN
% 278.77/36.19 # partial match(1): FGHSM-FFMM32-SFFFFFNN
% 278.77/36.19 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 278.77/36.19 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 278.77/36.19 # Preprocessing time : 0.004 s
% 278.77/36.19
% 278.77/36.19 # Proof found!
% 278.77/36.19 # SZS status Theorem
% 278.77/36.19 # SZS output start CNFRefutation
% See solution above
% 278.77/36.19 # Parsed axioms : 328
% 278.77/36.19 # Removed by relevancy pruning/SinE : 243
% 278.77/36.19 # Initial clauses : 154
% 278.77/36.19 # Removed in clause preprocessing : 2
% 278.77/36.19 # Initial clauses in saturation : 152
% 278.77/36.19 # Processed clauses : 27407
% 278.77/36.19 # ...of these trivial : 187
% 278.77/36.19 # ...subsumed : 19536
% 278.77/36.19 # ...remaining for further processing : 7684
% 278.77/36.19 # Other redundant clauses eliminated : 48
% 278.77/36.19 # Clauses deleted for lack of memory : 0
% 278.77/36.19 # Backward-subsumed : 384
% 278.77/36.19 # Backward-rewritten : 52
% 278.77/36.19 # Generated clauses : 1390523
% 278.77/36.19 # ...of the previous two non-redundant : 1355424
% 278.77/36.19 # ...aggressively subsumed : 0
% 278.77/36.19 # Contextual simplify-reflections : 1028
% 278.77/36.19 # Paramodulations : 1389647
% 278.77/36.19 # Factorizations : 298
% 278.77/36.19 # NegExts : 0
% 278.77/36.19 # Equation resolutions : 573
% 278.77/36.19 # Total rewrite steps : 355383
% 278.77/36.19 # Propositional unsat checks : 0
% 278.77/36.19 # Propositional check models : 0
% 278.77/36.19 # Propositional check unsatisfiable : 0
% 278.77/36.19 # Propositional clauses : 0
% 278.77/36.19 # Propositional clauses after purity: 0
% 278.77/36.19 # Propositional unsat core size : 0
% 278.77/36.19 # Propositional preprocessing time : 0.000
% 278.77/36.19 # Propositional encoding time : 0.000
% 278.77/36.19 # Propositional solver time : 0.000
% 278.77/36.19 # Success case prop preproc time : 0.000
% 278.77/36.19 # Success case prop encoding time : 0.000
% 278.77/36.19 # Success case prop solver time : 0.000
% 278.77/36.19 # Current number of processed clauses : 7241
% 278.77/36.19 # Positive orientable unit clauses : 339
% 278.77/36.19 # Positive unorientable unit clauses: 2
% 278.77/36.19 # Negative unit clauses : 68
% 278.77/36.19 # Non-unit-clauses : 6832
% 278.77/36.19 # Current number of unprocessed clauses: 1326989
% 278.77/36.19 # ...number of literals in the above : 6544523
% 278.77/36.19 # Current number of archived formulas : 0
% 278.77/36.19 # Current number of archived clauses : 441
% 278.77/36.19 # Clause-clause subsumption calls (NU) : 3763444
% 278.77/36.19 # Rec. Clause-clause subsumption calls : 1054098
% 278.77/36.19 # Non-unit clause-clause subsumptions : 16044
% 278.77/36.19 # Unit Clause-clause subsumption calls : 41287
% 278.77/36.19 # Rewrite failures with RHS unbound : 0
% 278.77/36.19 # BW rewrite match attempts : 3511
% 278.77/36.19 # BW rewrite match successes : 26
% 278.77/36.19 # Condensation attempts : 0
% 278.77/36.19 # Condensation successes : 0
% 278.77/36.19 # Termbank termtop insertions : 27078670
% 278.77/36.19
% 278.77/36.19 # -------------------------------------------------
% 278.77/36.19 # User time : 33.649 s
% 278.77/36.19 # System time : 0.941 s
% 278.77/36.19 # Total time : 34.590 s
% 278.77/36.19 # Maximum resident set size: 2552 pages
% 278.77/36.19
% 278.77/36.19 # -------------------------------------------------
% 278.77/36.19 # User time : 33.658 s
% 278.77/36.19 # System time : 0.944 s
% 278.77/36.19 # Total time : 34.602 s
% 278.77/36.19 # Maximum resident set size: 2040 pages
% 278.77/36.19 % E---3.1 exiting
%------------------------------------------------------------------------------