TSTP Solution File: SEU192+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU192+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:30:49 EDT 2023
% Result : Theorem 11.90s 1.96s
% Output : CNFRefutation 11.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 157 ( 16 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 197 ( 79 ~; 88 |; 16 &)
% ( 6 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 6 sgn; 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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.xr74aUU9DH/E---3.1_24806.p',d4_relat_1) ).
fof(t86_relat_1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_dom(relation_dom_restriction(X3,X2)))
<=> ( in(X1,X2)
& in(X1,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xr74aUU9DH/E---3.1_24806.p',t86_relat_1) ).
fof(d11_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( relation(X3)
=> ( X3 = relation_dom_restriction(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ( in(X4,X2)
& in(ordered_pair(X4,X5),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xr74aUU9DH/E---3.1_24806.p',d11_relat_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.xr74aUU9DH/E---3.1_24806.p',dt_k7_relat_1) ).
fof(t20_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xr74aUU9DH/E---3.1_24806.p',t20_relat_1) ).
fof(c_0_5,plain,
! [X64,X65,X66,X68,X69,X70,X72] :
( ( ~ in(X66,X65)
| in(ordered_pair(X66,esk13_3(X64,X65,X66)),X64)
| X65 != relation_dom(X64)
| ~ relation(X64) )
& ( ~ in(ordered_pair(X68,X69),X64)
| in(X68,X65)
| X65 != relation_dom(X64)
| ~ relation(X64) )
& ( ~ in(esk14_2(X64,X70),X70)
| ~ in(ordered_pair(esk14_2(X64,X70),X72),X64)
| X70 = relation_dom(X64)
| ~ relation(X64) )
& ( in(esk14_2(X64,X70),X70)
| in(ordered_pair(esk14_2(X64,X70),esk15_2(X64,X70)),X64)
| X70 = relation_dom(X64)
| ~ relation(X64) ) ),
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])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_dom(relation_dom_restriction(X3,X2)))
<=> ( in(X1,X2)
& in(X1,relation_dom(X3)) ) ) ),
inference(assume_negation,[status(cth)],[t86_relat_1]) ).
cnf(c_0_7,plain,
( in(ordered_pair(X1,esk13_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
( relation(esk3_0)
& ( ~ in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0)))
| ~ in(esk1_0,esk2_0)
| ~ in(esk1_0,relation_dom(esk3_0)) )
& ( in(esk1_0,esk2_0)
| in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0))) )
& ( in(esk1_0,relation_dom(esk3_0))
| in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0))) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X148,X149,X150,X151,X152,X153,X154] :
( ( in(X151,X149)
| ~ in(ordered_pair(X151,X152),X150)
| X150 != relation_dom_restriction(X148,X149)
| ~ relation(X150)
| ~ relation(X148) )
& ( in(ordered_pair(X151,X152),X148)
| ~ in(ordered_pair(X151,X152),X150)
| X150 != relation_dom_restriction(X148,X149)
| ~ relation(X150)
| ~ relation(X148) )
& ( ~ in(X153,X149)
| ~ in(ordered_pair(X153,X154),X148)
| in(ordered_pair(X153,X154),X150)
| X150 != relation_dom_restriction(X148,X149)
| ~ relation(X150)
| ~ relation(X148) )
& ( ~ in(ordered_pair(esk24_3(X148,X149,X150),esk25_3(X148,X149,X150)),X150)
| ~ in(esk24_3(X148,X149,X150),X149)
| ~ in(ordered_pair(esk24_3(X148,X149,X150),esk25_3(X148,X149,X150)),X148)
| X150 = relation_dom_restriction(X148,X149)
| ~ relation(X150)
| ~ relation(X148) )
& ( in(esk24_3(X148,X149,X150),X149)
| in(ordered_pair(esk24_3(X148,X149,X150),esk25_3(X148,X149,X150)),X150)
| X150 = relation_dom_restriction(X148,X149)
| ~ relation(X150)
| ~ relation(X148) )
& ( in(ordered_pair(esk24_3(X148,X149,X150),esk25_3(X148,X149,X150)),X148)
| in(ordered_pair(esk24_3(X148,X149,X150),esk25_3(X148,X149,X150)),X150)
| X150 = relation_dom_restriction(X148,X149)
| ~ relation(X150)
| ~ relation(X148) ) ),
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)],[d11_relat_1])])])])])]) ).
fof(c_0_10,plain,
! [X157,X158] :
( ~ relation(X157)
| relation(relation_dom_restriction(X157,X158)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
cnf(c_0_11,plain,
( in(ordered_pair(X1,esk13_3(X2,relation_dom(X2),X1)),X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( in(esk1_0,relation_dom(esk3_0))
| in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(ordered_pair(X1,X2),X3)
| ~ in(ordered_pair(X1,X2),X4)
| X4 != relation_dom_restriction(X3,X5)
| ~ relation(X4)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( in(ordered_pair(esk1_0,esk13_3(relation_dom_restriction(esk3_0,esk2_0),relation_dom(relation_dom_restriction(esk3_0,esk2_0)),esk1_0)),relation_dom_restriction(esk3_0,esk2_0))
| in(esk1_0,relation_dom(esk3_0))
| ~ relation(relation_dom_restriction(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,lemma,
! [X108,X109,X110] :
( ( in(X108,relation_dom(X110))
| ~ in(ordered_pair(X108,X109),X110)
| ~ relation(X110) )
& ( in(X109,relation_rng(X110))
| ~ in(ordered_pair(X108,X109),X110)
| ~ relation(X110) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])]) ).
cnf(c_0_18,plain,
( in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| ~ in(ordered_pair(X1,X2),relation_dom_restriction(X3,X4)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( in(ordered_pair(esk1_0,esk13_3(relation_dom_restriction(esk3_0,esk2_0),relation_dom(relation_dom_restriction(esk3_0,esk2_0)),esk1_0)),relation_dom_restriction(esk3_0,esk2_0))
| in(esk1_0,relation_dom(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16])]) ).
cnf(c_0_20,negated_conjecture,
( in(esk1_0,esk2_0)
| in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,lemma,
( in(X1,relation_dom(X2))
| ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( in(ordered_pair(esk1_0,esk13_3(relation_dom_restriction(esk3_0,esk2_0),relation_dom(relation_dom_restriction(esk3_0,esk2_0)),esk1_0)),esk3_0)
| in(esk1_0,relation_dom(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]) ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ in(ordered_pair(X1,X3),X4)
| X4 != relation_dom_restriction(X5,X2)
| ~ relation(X4)
| ~ relation(X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( in(ordered_pair(esk1_0,esk13_3(relation_dom_restriction(esk3_0,esk2_0),relation_dom(relation_dom_restriction(esk3_0,esk2_0)),esk1_0)),relation_dom_restriction(esk3_0,esk2_0))
| in(esk1_0,esk2_0)
| ~ relation(relation_dom_restriction(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_25,plain,
( in(ordered_pair(X1,X3),X5)
| ~ in(X1,X2)
| ~ in(ordered_pair(X1,X3),X4)
| X5 != relation_dom_restriction(X4,X2)
| ~ relation(X5)
| ~ relation(X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,lemma,
in(esk1_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16])]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ relation(X3)
| ~ in(ordered_pair(X1,X4),relation_dom_restriction(X3,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_23]),c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( in(ordered_pair(esk1_0,esk13_3(relation_dom_restriction(esk3_0,esk2_0),relation_dom(relation_dom_restriction(esk3_0,esk2_0)),esk1_0)),relation_dom_restriction(esk3_0,esk2_0))
| in(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_16])]) ).
cnf(c_0_29,plain,
( in(ordered_pair(X1,X2),relation_dom_restriction(X3,X4))
| ~ relation(X3)
| ~ in(ordered_pair(X1,X2),X3)
| ~ in(X1,X4) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_14]) ).
cnf(c_0_30,lemma,
in(ordered_pair(esk1_0,esk13_3(esk3_0,relation_dom(esk3_0),esk1_0)),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_16])]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0)))
| ~ in(esk1_0,esk2_0)
| ~ in(esk1_0,relation_dom(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
in(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16])]) ).
cnf(c_0_33,lemma,
( in(ordered_pair(esk1_0,esk13_3(esk3_0,relation_dom(esk3_0),esk1_0)),relation_dom_restriction(esk3_0,X1))
| ~ in(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_16])]) ).
cnf(c_0_34,negated_conjecture,
( ~ in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0)))
| ~ in(esk1_0,relation_dom(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
in(ordered_pair(esk1_0,esk13_3(esk3_0,relation_dom(esk3_0),esk1_0)),relation_dom_restriction(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ in(esk1_0,relation_dom(relation_dom_restriction(esk3_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_26])]) ).
cnf(c_0_37,lemma,
~ relation(relation_dom_restriction(esk3_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_35]),c_0_36]) ).
cnf(c_0_38,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU192+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n004.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 08:42:15 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.44 Running first-order model finding
% 0.16/0.44 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.xr74aUU9DH/E---3.1_24806.p
% 11.90/1.96 # Version: 3.1pre001
% 11.90/1.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.90/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.90/1.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.90/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.90/1.96 # Starting new_bool_1 with 300s (1) cores
% 11.90/1.96 # Starting sh5l with 300s (1) cores
% 11.90/1.96 # sh5l with pid 24894 completed with status 0
% 11.90/1.96 # Result found by sh5l
% 11.90/1.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.90/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.90/1.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.90/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.90/1.96 # Starting new_bool_1 with 300s (1) cores
% 11.90/1.96 # Starting sh5l with 300s (1) cores
% 11.90/1.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.90/1.96 # Search class: FGHSM-FSLM32-SFFFFFNN
% 11.90/1.96 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 11.90/1.96 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 11.90/1.96 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 24897 completed with status 0
% 11.90/1.96 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.90/1.96 # Preprocessing class: FSLSSMSSSSSNFFN.
% 11.90/1.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.90/1.96 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.90/1.96 # Starting new_bool_3 with 300s (1) cores
% 11.90/1.96 # Starting new_bool_1 with 300s (1) cores
% 11.90/1.96 # Starting sh5l with 300s (1) cores
% 11.90/1.96 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.90/1.96 # Search class: FGHSM-FSLM32-SFFFFFNN
% 11.90/1.96 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 11.90/1.96 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 11.90/1.96 # Preprocessing time : 0.003 s
% 11.90/1.96
% 11.90/1.96 # Proof found!
% 11.90/1.96 # SZS status Theorem
% 11.90/1.96 # SZS output start CNFRefutation
% See solution above
% 11.90/1.96 # Parsed axioms : 180
% 11.90/1.96 # Removed by relevancy pruning/SinE : 28
% 11.90/1.96 # Initial clauses : 270
% 11.90/1.96 # Removed in clause preprocessing : 0
% 11.90/1.96 # Initial clauses in saturation : 270
% 11.90/1.96 # Processed clauses : 6760
% 11.90/1.96 # ...of these trivial : 149
% 11.90/1.96 # ...subsumed : 3075
% 11.90/1.96 # ...remaining for further processing : 3536
% 11.90/1.96 # Other redundant clauses eliminated : 67
% 11.90/1.96 # Clauses deleted for lack of memory : 0
% 11.90/1.96 # Backward-subsumed : 754
% 11.90/1.96 # Backward-rewritten : 289
% 11.90/1.96 # Generated clauses : 75228
% 11.90/1.96 # ...of the previous two non-redundant : 71940
% 11.90/1.96 # ...aggressively subsumed : 0
% 11.90/1.96 # Contextual simplify-reflections : 48
% 11.90/1.96 # Paramodulations : 75124
% 11.90/1.96 # Factorizations : 18
% 11.90/1.96 # NegExts : 0
% 11.90/1.96 # Equation resolutions : 72
% 11.90/1.96 # Total rewrite steps : 13118
% 11.90/1.96 # Propositional unsat checks : 0
% 11.90/1.96 # Propositional check models : 0
% 11.90/1.96 # Propositional check unsatisfiable : 0
% 11.90/1.96 # Propositional clauses : 0
% 11.90/1.96 # Propositional clauses after purity: 0
% 11.90/1.96 # Propositional unsat core size : 0
% 11.90/1.96 # Propositional preprocessing time : 0.000
% 11.90/1.96 # Propositional encoding time : 0.000
% 11.90/1.96 # Propositional solver time : 0.000
% 11.90/1.96 # Success case prop preproc time : 0.000
% 11.90/1.96 # Success case prop encoding time : 0.000
% 11.90/1.96 # Success case prop solver time : 0.000
% 11.90/1.96 # Current number of processed clauses : 2430
% 11.90/1.96 # Positive orientable unit clauses : 340
% 11.90/1.96 # Positive unorientable unit clauses: 8
% 11.90/1.96 # Negative unit clauses : 225
% 11.90/1.96 # Non-unit-clauses : 1857
% 11.90/1.96 # Current number of unprocessed clauses: 65346
% 11.90/1.96 # ...number of literals in the above : 169785
% 11.90/1.96 # Current number of archived formulas : 0
% 11.90/1.96 # Current number of archived clauses : 1062
% 11.90/1.96 # Clause-clause subsumption calls (NU) : 953206
% 11.90/1.96 # Rec. Clause-clause subsumption calls : 852700
% 11.90/1.96 # Non-unit clause-clause subsumptions : 2245
% 11.90/1.96 # Unit Clause-clause subsumption calls : 107061
% 11.90/1.96 # Rewrite failures with RHS unbound : 0
% 11.90/1.96 # BW rewrite match attempts : 359
% 11.90/1.96 # BW rewrite match successes : 101
% 11.90/1.96 # Condensation attempts : 0
% 11.90/1.96 # Condensation successes : 0
% 11.90/1.96 # Termbank termtop insertions : 1062570
% 11.90/1.96
% 11.90/1.96 # -------------------------------------------------
% 11.90/1.96 # User time : 1.229 s
% 11.90/1.96 # System time : 0.049 s
% 11.90/1.96 # Total time : 1.278 s
% 11.90/1.96 # Maximum resident set size: 2700 pages
% 11.90/1.96
% 11.90/1.96 # -------------------------------------------------
% 11.90/1.96 # User time : 1.234 s
% 11.90/1.96 # System time : 0.050 s
% 11.90/1.96 # Total time : 1.284 s
% 11.90/1.96 # Maximum resident set size: 1852 pages
% 11.90/1.96 % E---3.1 exiting
%------------------------------------------------------------------------------