%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET002^4 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 : Wed Sep 30 08:21:50 AM UTC 2026
% Result : Theorem 1.90s 0.59s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 113 ( 12 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 362 ( 24 ~; 26 |; 9 &; 295 @)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 83 ( 40 ^; 43 !; 0 ?; 83 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_24,type,
mactual: mworld ).
thf(decl_25,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_27,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_29,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_37,type,
equal_set: $i > $i > mworld > $o ).
thf(decl_38,type,
member: $i > $i > mworld > $o ).
thf(decl_39,type,
subset: $i > $i > mworld > $o ).
thf(decl_46,type,
union: $i > $i > $i ).
thf(decl_49,type,
esk2_2: $i > $i > $i ).
thf(decl_52,type,
esk5_0: $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',mlocal_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',mimplies_def) ).
thf(mequiv_def,axiom,
( mequiv
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
<=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',mequiv_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X6: $i > mworld > $o,X3: mworld] :
! [X7: $i] : ( X6 @ X7 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',mforall_di_def) ).
thf(mor_def,axiom,
( mor
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
| ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',mor_def) ).
thf(thI14,conjecture,
( mlocal
@ ( mforall_di
@ ^ [X65: $i] : ( equal_set @ ( union @ X65 @ X65 ) @ X65 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',thI14) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',mand_def) ).
thf(subset_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X48: $i] :
( mforall_di
@ ^ [X49: $i] :
( mequiv @ ( subset @ X48 @ X49 )
@ ( mforall_di
@ ^ [X7: $i] : ( mimplies @ ( member @ X7 @ X48 ) @ ( member @ X7 @ X49 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',subset_0) ).
thf(union_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X7: $i] :
( mforall_di
@ ^ [X55: $i] :
( mforall_di
@ ^ [X56: $i] : ( mequiv @ ( member @ X7 @ ( union @ X55 @ X56 ) ) @ ( mor @ ( member @ X7 @ X55 ) @ ( member @ X7 @ X56 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',union_0) ).
thf(equal_set_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X50: $i] :
( mforall_di
@ ^ [X51: $i] : ( mequiv @ ( equal_set @ X50 @ X51 ) @ ( mand @ ( subset @ X50 @ X51 ) @ ( subset @ X51 @ X50 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3rYtJAAP5V/E---3.1_355708.p',equal_set_0) ).
thf(c_0_10,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_11,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_12,plain,
( mequiv
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv_def]) ).
thf(c_0_13,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_14,plain,
( mor
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor_def]) ).
thf(c_0_15,negated_conjecture,
~ ( mlocal
@ ( mforall_di
@ ^ [X65: $i] : ( equal_set @ ( union @ X65 @ X65 ) @ X65 ) ) ),
inference(assume_negation,[status(cth)],[thI14]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_17,plain,
! [X126: $i,X125: $i] :
( ( subset @ X126 @ X125 @ mactual )
<=> ! [X124: $i] :
( ( member @ X124 @ X126 @ mactual )
=> ( member @ X124 @ X125 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_0]),c_0_10]),c_0_11]),c_0_12]),c_0_13]) ).
thf(c_0_18,plain,
! [X136: $i,X135: $i,X134: $i] :
( ( member @ X136 @ ( union @ X135 @ X134 ) @ mactual )
<=> ( ( member @ X136 @ X135 @ mactual )
| ( member @ X136 @ X134 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[union_0]),c_0_10]),c_0_14]),c_0_12]),c_0_13]) ).
thf(c_0_19,negated_conjecture,
~ ! [X152: $i] : ( equal_set @ ( union @ X152 @ X152 ) @ X152 @ mactual ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_15]),c_0_10]),c_0_13]) ).
thf(c_0_20,plain,
! [X128: $i,X127: $i] :
( ( equal_set @ X128 @ X127 @ mactual )
<=> ( ( subset @ X128 @ X127 @ mactual )
& ( subset @ X127 @ X128 @ mactual ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[equal_set_0]),c_0_10]),c_0_16]),c_0_12]),c_0_13]) ).
thf(c_0_21,plain,
! [X211: $i,X212: $i,X213: $i,X214: $i,X215: $i] :
( ( ~ ( subset @ X211 @ X212 @ mactual )
| ~ ( member @ X213 @ X211 @ mactual )
| ( member @ X213 @ X212 @ mactual ) )
& ( ( member @ ( esk2_2 @ X214 @ X215 ) @ X214 @ mactual )
| ( subset @ X214 @ X215 @ mactual ) )
& ( ~ ( member @ ( esk2_2 @ X214 @ X215 ) @ X215 @ mactual )
| ( subset @ X214 @ X215 @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_17])])])])])])]) ).
thf(c_0_22,plain,
! [X224: $i,X225: $i,X226: $i] :
( ( ~ ( member @ X224 @ ( union @ X225 @ X226 ) @ mactual )
| ( member @ X224 @ X225 @ mactual )
| ( member @ X224 @ X226 @ mactual ) )
& ( ~ ( member @ X224 @ X225 @ mactual )
| ( member @ X224 @ ( union @ X225 @ X226 ) @ mactual ) )
& ( ~ ( member @ X224 @ X226 @ mactual )
| ( member @ X224 @ ( union @ X225 @ X226 ) @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
thf(c_0_23,negated_conjecture,
~ ( equal_set @ ( union @ esk5_0 @ esk5_0 ) @ esk5_0 @ mactual ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
thf(c_0_24,plain,
! [X217: $i,X218: $i] :
( ( ( subset @ X217 @ X218 @ mactual )
| ~ ( equal_set @ X217 @ X218 @ mactual ) )
& ( ( subset @ X218 @ X217 @ mactual )
| ~ ( equal_set @ X217 @ X218 @ mactual ) )
& ( ~ ( subset @ X217 @ X218 @ mactual )
| ~ ( subset @ X218 @ X217 @ mactual )
| ( equal_set @ X217 @ X218 @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
thf(c_0_25,plain,
! [X7: $i,X9: $i] :
( ( subset @ X7 @ X9 @ mactual )
| ~ ( member @ ( esk2_2 @ X7 @ X9 ) @ X9 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_26,plain,
! [X7: $i,X10: $i,X9: $i] :
( ( member @ X7 @ ( union @ X10 @ X9 ) @ mactual )
| ~ ( member @ X7 @ X9 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,plain,
! [X7: $i,X9: $i,X10: $i] :
( ( member @ X7 @ X9 @ mactual )
| ( member @ X7 @ X10 @ mactual )
| ~ ( member @ X7 @ ( union @ X9 @ X10 ) @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,negated_conjecture,
~ ( equal_set @ ( union @ esk5_0 @ esk5_0 ) @ esk5_0 @ mactual ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,plain,
! [X9: $i,X7: $i] :
( ( equal_set @ X7 @ X9 @ mactual )
| ~ ( subset @ X7 @ X9 @ mactual )
| ~ ( subset @ X9 @ X7 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,plain,
! [X7: $i,X9: $i,X10: $i] :
( ( subset @ X7 @ ( union @ X9 @ X10 ) @ mactual )
| ~ ( member @ ( esk2_2 @ X7 @ ( union @ X9 @ X10 ) ) @ X10 @ mactual ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_31,plain,
! [X7: $i,X9: $i] :
( ( member @ ( esk2_2 @ X7 @ X9 ) @ X7 @ mactual )
| ( subset @ X7 @ X9 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_32,plain,
! [X7: $i,X9: $i] :
( ( member @ X7 @ X9 @ mactual )
| ~ ( member @ X7 @ ( union @ X9 @ X9 ) @ mactual ) ),
inference(ef,[status(thm)],[c_0_27]) ).
thf(c_0_33,negated_conjecture,
( ~ ( subset @ esk5_0 @ ( union @ esk5_0 @ esk5_0 ) @ mactual )
| ~ ( subset @ ( union @ esk5_0 @ esk5_0 ) @ esk5_0 @ mactual ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_34,plain,
! [X9: $i,X7: $i] : ( subset @ X7 @ ( union @ X9 @ X7 ) @ mactual ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,plain,
! [X7: $i,X9: $i] :
( ( member @ ( esk2_2 @ ( union @ X7 @ X7 ) @ X9 ) @ X7 @ mactual )
| ( subset @ ( union @ X7 @ X7 ) @ X9 @ mactual ) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
thf(c_0_36,negated_conjecture,
~ ( subset @ ( union @ esk5_0 @ esk5_0 ) @ esk5_0 @ mactual ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
thf(c_0_37,plain,
! [X7: $i] : ( subset @ ( union @ X7 @ X7 ) @ X7 @ mactual ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET002^4 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n016.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 13:40:34 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.24 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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.3rYtJAAP5V/E---3.1_355708.p
% 1.90/0.59 % Version: 3.5.1-ho
% 1.90/0.59 % Preprocessing class: HSMSSMSSMLLNHSN.
% 1.90/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.90/0.59 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.90/0.59 % Starting post_as_ho3 with 300s (1) cores
% 1.90/0.59 % Starting new_ho_12 with 300s (1) cores
% 1.90/0.59 % Starting new_bool_2 with 300s (1) cores
% 1.90/0.59 % new_ho_10_cnf2 with pid 355721 completed with status 0
% 1.90/0.59 % Result found by new_ho_10_cnf2
% 1.90/0.59 % Preprocessing class: HSMSSMSSMLLNHSN.
% 1.90/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.90/0.59 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.90/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.90/0.59 % No SInE strategy applied
% 1.90/0.59 % Search class: HGHNS-FFMF21-SHSSMFNN
% 1.90/0.59 % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 1.90/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.90/0.59 % Starting SubtermCWHack with 136s (1) cores
% 1.90/0.59 % Starting new_ho_10_cnf2 with 151s (1) cores
% 1.90/0.59 % Starting ehoh_best8_lambda with 136s (1) cores
% 1.90/0.59 % Starting ho_unfolding_6 with 136s (1) cores
% 1.90/0.59 % Starting sh4l with 136s (1) cores
% 1.90/0.59 % ho_unfolding_6 with pid 355731 completed with status 0
% 1.90/0.59 % Result found by ho_unfolding_6
% 1.90/0.59 % Preprocessing class: HSMSSMSSMLLNHSN.
% 1.90/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.90/0.59 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 1.90/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.90/0.59 % No SInE strategy applied
% 1.90/0.59 % Search class: HGHNS-FFMF21-SHSSMFNN
% 1.90/0.59 % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 1.90/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.90/0.59 % Starting SubtermCWHack with 136s (1) cores
% 1.90/0.59 % Starting new_ho_10_cnf2 with 151s (1) cores
% 1.90/0.59 % Starting ehoh_best8_lambda with 136s (1) cores
% 1.90/0.59 % Starting ho_unfolding_6 with 136s (1) cores
% 1.90/0.59 % Preprocessing time : 0.002 s
% 1.90/0.59
% 1.90/0.59 % Proof found!
% 1.90/0.59 % SZS status Theorem
% 1.90/0.59 % SZS output start CNFRefutation
% See solution above
% 1.90/0.59 % Parsed axioms : 70
% 1.90/0.59 % Removed by relevancy pruning/SinE : 0
% 1.90/0.59 % Initial clauses : 78
% 1.90/0.59 % Removed in clause preprocessing : 26
% 1.90/0.59 % Initial clauses in saturation : 52
% 1.90/0.59 % Processed clauses : 1148
% 1.90/0.59 % ...of these trivial : 4
% 1.90/0.59 % ...subsumed : 397
% 1.90/0.59 % ...remaining for further processing : 747
% 1.90/0.59 % Other redundant clauses eliminated : 0
% 1.90/0.59 % Clauses deleted for lack of memory : 0
% 1.90/0.59 % Backward-subsumed : 0
% 1.90/0.59 % Backward-rewritten : 2
% 1.90/0.59 % Generated clauses : 13056
% 1.90/0.59 % ...of the previous two non-redundant : 10228
% 1.90/0.59 % ...aggressively subsumed : 0
% 1.90/0.59 % Contextual simplify-reflections : 0
% 1.90/0.59 % Paramodulations : 13040
% 1.90/0.59 % Factorizations : 16
% 1.90/0.59 % NegExts : 0
% 1.90/0.59 % Equation resolutions : 0
% 1.90/0.59 % Disequality decompositions : 0
% 1.90/0.59 % Total rewrite steps : 2785
% 1.90/0.59 % ...of those cached : 1213
% 1.90/0.59 % Propositional unsat checks : 0
% 1.90/0.59 % Propositional check models : 0
% 1.90/0.59 % Propositional check unsatisfiable : 0
% 1.90/0.59 % Propositional clauses : 0
% 1.90/0.59 % Propositional clauses after purity: 0
% 1.90/0.59 % Propositional unsat core size : 0
% 1.90/0.59 % Propositional preprocessing time : 0.000
% 1.90/0.59 % Propositional encoding time : 0.000
% 1.90/0.59 % Propositional solver time : 0.000
% 1.90/0.59 % Success case prop preproc time : 0.000
% 1.90/0.59 % Success case prop encoding time : 0.000
% 1.90/0.59 % Success case prop solver time : 0.000
% 1.90/0.59 % Current number of processed clauses : 745
% 1.90/0.59 % Positive orientable unit clauses : 173
% 1.90/0.59 % Positive unorientable unit clauses: 0
% 1.90/0.59 % Negative unit clauses : 254
% 1.90/0.59 % Non-unit-clauses : 318
% 1.90/0.59 % Current number of unprocessed clauses: 9132
% 1.90/0.59 % ...number of literals in the above : 18768
% 1.90/0.59 % Current number of archived formulas : 0
% 1.90/0.59 % Current number of archived clauses : 2
% 1.90/0.59 % Clause-clause subsumption calls (NU) : 10855
% 1.90/0.59 % Rec. Clause-clause subsumption calls : 9509
% 1.90/0.59 % Non-unit clause-clause subsumptions : 80
% 1.90/0.59 % Unit Clause-clause subsumption calls : 11744
% 1.90/0.59 % Rewrite failures with RHS unbound : 0
% 1.90/0.59 % BW rewrite match attempts : 411
% 1.90/0.59 % BW rewrite match successes : 2
% 1.90/0.59 % Condensation attempts : 1148
% 1.90/0.59 % Condensation successes : 4
% 1.90/0.59 % Termbank termtop insertions : 252624
% 1.90/0.59 % Search garbage collected termcells : 4270
% 1.90/0.59
% 1.90/0.59 % -------------------------------------------------
% 1.90/0.59 % User time : 0.239 s
% 1.90/0.59 % System time : 0.029 s
% 1.90/0.59 % Total time : 0.268 s
% 1.90/0.59 % Maximum resident set size: 4260 pages
% 1.90/0.59
% 1.90/0.59 % -------------------------------------------------
% 1.90/0.59 % User time : 1.153 s
% 1.90/0.59 % System time : 0.100 s
% 1.90/0.59 % Total time : 1.253 s
% 1.90/0.59 % Maximum resident set size: 4864 pages
% 1.90/0.59 % E exiting
%------------------------------------------------------------------------------