%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET641+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:14:51 PM UTC 2026
% Result : Theorem 0.06s 0.34s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 234 ( 89 ~; 90 |; 18 &)
% ( 7 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 2 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p14,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p14) ).
fof(p5,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5) ).
fof(p18,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p18) ).
fof(prove_relset_1_3,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,cross_product(X2,X3))
=> ilf_type(X1,relation_type(X2,X3)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_3) ).
fof(p12,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ilf_type(X2,set_type)
& ~ empty(X2) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p12) ).
fof(p10,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X1,power_set(X2))
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p10) ).
fof(p7,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ilf_type(X2,subset_type(X1))
<=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) )
& ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
fof(c_0_8,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( empty(X1)
<=> ! [X2] :
( ilf_type(X2,set_type)
=> ~ member(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[p14]) ).
fof(c_0_9,plain,
! [X17,X18,X19] :
( ( ~ ilf_type(X17,set_type)
| ~ ilf_type(X18,set_type)
| subset(X17,X18)
| ~ member(esk5_2(X17,X18),X18) )
& ( ~ ilf_type(X17,set_type)
| ~ ilf_type(X18,set_type)
| subset(X17,X18)
| member(esk5_2(X17,X18),X17) )
& ( ~ ilf_type(X17,set_type)
| ~ ilf_type(X18,set_type)
| subset(X17,X18)
| ilf_type(esk5_2(X17,X18),set_type) )
& ( ~ ilf_type(X17,set_type)
| ~ ilf_type(X18,set_type)
| member(X19,X18)
| ~ member(X19,X17)
| ~ ilf_type(X19,set_type)
| ~ subset(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p5])])])])])]) ).
fof(c_0_10,plain,
! [X9] : ilf_type(X9,set_type),
inference(variable_rename,[status(thm)],[p18]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( subset(X1,cross_product(X2,X3))
=> ilf_type(X1,relation_type(X2,X3)) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_3]) ).
fof(c_0_12,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ilf_type(X2,set_type)
& ~ empty(X2) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[p12]) ).
fof(c_0_13,plain,
! [X31,X32] :
( ( ~ ilf_type(X31,set_type)
| empty(X31)
| member(esk7_1(X31),X31) )
& ( ~ ilf_type(X31,set_type)
| empty(X31)
| ilf_type(esk7_1(X31),set_type) )
& ( ~ ilf_type(X31,set_type)
| ~ member(X32,X31)
| ~ ilf_type(X32,set_type)
| ~ empty(X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
fof(c_0_14,plain,
! [X38,X39,X40] :
( ( ~ ilf_type(X38,set_type)
| ~ ilf_type(X39,set_type)
| member(X38,power_set(X39))
| ~ member(esk9_2(X38,X39),X39) )
& ( ~ ilf_type(X38,set_type)
| ~ ilf_type(X39,set_type)
| member(X38,power_set(X39))
| member(esk9_2(X38,X39),X38) )
& ( ~ ilf_type(X38,set_type)
| ~ ilf_type(X39,set_type)
| member(X38,power_set(X39))
| ilf_type(esk9_2(X38,X39),set_type) )
& ( ~ ilf_type(X38,set_type)
| ~ ilf_type(X39,set_type)
| member(X40,X39)
| ~ member(X40,X38)
| ~ ilf_type(X40,set_type)
| ~ member(X38,power_set(X39)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p10])])])])])]) ).
cnf(c_0_15,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X3,set_type)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
( ~ ilf_type(esk1_0,relation_type(esk2_0,esk3_0))
& subset(esk1_0,cross_product(esk2_0,esk3_0))
& ilf_type(esk3_0,set_type)
& ilf_type(esk2_0,set_type)
& ilf_type(esk1_0,set_type) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_18,plain,
! [X24,X25] :
( ( ~ ilf_type(X24,set_type)
| ~ ilf_type(X25,set_type)
| ilf_type(X25,subset_type(X24))
| ~ ilf_type(X25,member_type(power_set(X24))) )
& ( ~ ilf_type(X24,set_type)
| ~ ilf_type(X25,set_type)
| ilf_type(X25,member_type(power_set(X24)))
| ~ ilf_type(X25,subset_type(X24)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p7])])])])]) ).
fof(c_0_19,plain,
! [X34,X35] :
( ( ~ ilf_type(X34,set_type)
| ~ ilf_type(X35,set_type)
| empty(X35)
| ilf_type(X34,member_type(X35))
| ~ member(X34,X35) )
& ( ~ ilf_type(X34,set_type)
| ~ ilf_type(X35,set_type)
| empty(X35)
| member(X34,X35)
| ~ ilf_type(X34,member_type(X35)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_20,plain,
( ~ ilf_type(X1,set_type)
| ~ member(X2,X1)
| ~ ilf_type(X2,set_type)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(esk9_2(X1,X2),X2)
| member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( ~ member(X1,X3)
| ~ subset(X3,X2)
| member(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
subset(esk1_0,cross_product(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X1,member_type(power_set(X2)))
| ilf_type(X1,subset_type(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X1,X2)
| empty(X2)
| ilf_type(X1,member_type(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ member(X2,X1)
| ~ empty(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16]),c_0_16])]) ).
cnf(c_0_27,plain,
( ~ member(esk9_2(X1,X2),X2)
| member(X1,power_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_16]),c_0_16])]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,cross_product(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| member(X1,power_set(X2))
| member(esk9_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_30,plain,
! [X10,X11,X12,X13] :
( ( ~ ilf_type(X10,set_type)
| ~ ilf_type(X11,set_type)
| ilf_type(X13,subset_type(cross_product(X10,X11)))
| ~ ilf_type(X13,relation_type(X10,X11)) )
& ( ~ ilf_type(X10,set_type)
| ~ ilf_type(X11,set_type)
| ilf_type(X12,relation_type(X10,X11))
| ~ ilf_type(X12,subset_type(cross_product(X10,X11))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])])]) ).
cnf(c_0_31,plain,
( ~ ilf_type(X1,member_type(power_set(X2)))
| ilf_type(X1,subset_type(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_16]),c_0_16])]) ).
cnf(c_0_32,plain,
( ~ member(X1,X2)
| ilf_type(X1,member_type(X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_16]),c_0_16])]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(esk9_2(X1,cross_product(esk2_0,esk3_0)),esk1_0)
| member(X1,power_set(cross_product(esk2_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( member(X1,power_set(X2))
| member(esk9_2(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_16]),c_0_16])]) ).
cnf(c_0_35,plain,
( ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
| ilf_type(X1,relation_type(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ member(X1,power_set(X2))
| ilf_type(X1,subset_type(X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
member(esk1_0,power_set(cross_product(esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( ~ ilf_type(X1,subset_type(cross_product(X2,X3)))
| ilf_type(X1,relation_type(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_16]),c_0_16])]) ).
cnf(c_0_39,negated_conjecture,
ilf_type(esk1_0,subset_type(cross_product(esk2_0,esk3_0))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
~ ilf_type(esk1_0,relation_type(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET641+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 05:30:22 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.06/0.34 % Version: 3.5.1
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.34 % Starting sh5l with 300s (1) cores
% 0.06/0.34 % new_bool_3 with pid 1645557 completed with status 0
% 0.06/0.34 % Result found by new_bool_3
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.34 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.06/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.34 % SubtermCWHack with pid 1645561 completed with status 0
% 0.06/0.34 % Result found by SubtermCWHack
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.34 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.06/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.34 % Preprocessing time : 0.001 s
% 0.06/0.34
% 0.06/0.34 % Proof found!
% 0.06/0.34 % SZS status Theorem
% 0.06/0.34 % SZS output start CNFRefutation
% See solution above
% 0.06/0.34 % Parsed axioms : 19
% 0.06/0.34 % Removed by relevancy pruning/SinE : 2
% 0.06/0.34 % Initial clauses : 38
% 0.06/0.34 % Removed in clause preprocessing : 0
% 0.06/0.34 % Initial clauses in saturation : 38
% 0.06/0.34 % Processed clauses : 99
% 0.06/0.34 % ...of these trivial : 8
% 0.06/0.34 % ...subsumed : 16
% 0.06/0.34 % ...remaining for further processing : 75
% 0.06/0.34 % Other redundant clauses eliminated : 1
% 0.06/0.34 % Clauses deleted for lack of memory : 0
% 0.06/0.34 % Backward-subsumed : 0
% 0.06/0.34 % Backward-rewritten : 3
% 0.06/0.34 % Generated clauses : 126
% 0.06/0.34 % ...of the previous two non-redundant : 107
% 0.06/0.34 % ...aggressively subsumed : 0
% 0.06/0.34 % Contextual simplify-reflections : 1
% 0.06/0.34 % Paramodulations : 125
% 0.06/0.34 % Factorizations : 0
% 0.06/0.34 % NegExts : 0
% 0.06/0.34 % Equation resolutions : 1
% 0.06/0.34 % Disequality decompositions : 0
% 0.06/0.34 % Total rewrite steps : 74
% 0.06/0.34 % ...of those cached : 54
% 0.06/0.34 % Propositional unsat checks : 0
% 0.06/0.34 % Propositional check models : 0
% 0.06/0.34 % Propositional check unsatisfiable : 0
% 0.06/0.34 % Propositional clauses : 0
% 0.06/0.34 % Propositional clauses after purity: 0
% 0.06/0.34 % Propositional unsat core size : 0
% 0.06/0.34 % Propositional preprocessing time : 0.000
% 0.06/0.34 % Propositional encoding time : 0.000
% 0.06/0.34 % Propositional solver time : 0.000
% 0.06/0.34 % Success case prop preproc time : 0.000
% 0.06/0.34 % Success case prop encoding time : 0.000
% 0.06/0.34 % Success case prop solver time : 0.000
% 0.06/0.34 % Current number of processed clauses : 72
% 0.06/0.34 % Positive orientable unit clauses : 17
% 0.06/0.34 % Positive unorientable unit clauses: 0
% 0.06/0.34 % Negative unit clauses : 2
% 0.06/0.34 % Non-unit-clauses : 53
% 0.06/0.34 % Current number of unprocessed clauses: 40
% 0.06/0.34 % ...number of literals in the above : 92
% 0.06/0.34 % Current number of archived formulas : 0
% 0.06/0.34 % Current number of archived clauses : 3
% 0.06/0.34 % Clause-clause subsumption calls (NU) : 144
% 0.06/0.34 % Rec. Clause-clause subsumption calls : 127
% 0.06/0.34 % Non-unit clause-clause subsumptions : 13
% 0.06/0.34 % Unit Clause-clause subsumption calls : 33
% 0.06/0.34 % Rewrite failures with RHS unbound : 0
% 0.06/0.34 % BW rewrite match attempts : 16
% 0.06/0.34 % BW rewrite match successes : 3
% 0.06/0.34 % Condensation attempts : 0
% 0.06/0.34 % Condensation successes : 0
% 0.06/0.34 % Termbank termtop insertions : 4962
% 0.06/0.34 % Search garbage collected termcells : 825
% 0.06/0.34
% 0.06/0.34 % -------------------------------------------------
% 0.06/0.34 % User time : 0.006 s
% 0.06/0.34 % System time : 0.001 s
% 0.06/0.34 % Total time : 0.008 s
% 0.06/0.34 % Maximum resident set size: 3656 pages
% 0.06/0.34
% 0.06/0.34 % -------------------------------------------------
% 0.06/0.34 % User time : 0.006 s
% 0.06/0.34 % System time : 0.005 s
% 0.06/0.34 % Total time : 0.011 s
% 0.06/0.34 % Maximum resident set size: 4864 pages
% 0.06/0.34 % E exiting
%------------------------------------------------------------------------------