%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET004^4 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 4.03s 0.97s
% Output : CNFRefutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 114 ( 10 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 405 ( 27 ~; 26 |; 10 &; 334 @)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 87 ( 36 ^; 51 !; 0 ?; 87 :)
% 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_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_43,type,
intersection: $i > $i > $i ).
thf(decl_48,type,
esk1_2: $i > $i > $i ).
thf(decl_51,type,
esk4_0: $i ).
thf(decl_52,type,
esk5_0: $i ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',mlocal_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',mimplies_def) ).
thf(mequiv_def,axiom,
( mequiv
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
<=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',mequiv_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X7: $i > mworld > $o,X3: mworld] :
! [X8: $i] : ( X7 @ X8 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',mforall_di_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',mand_def) ).
thf(subset_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X49: $i] :
( mforall_di
@ ^ [X50: $i] :
( mequiv @ ( subset @ X49 @ X50 )
@ ( mforall_di
@ ^ [X8: $i] : ( mimplies @ ( member @ X8 @ X49 ) @ ( member @ X8 @ X50 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',subset_0) ).
thf(intersection_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X8: $i] :
( mforall_di
@ ^ [X54: $i] :
( mforall_di
@ ^ [X55: $i] : ( mequiv @ ( member @ X8 @ ( intersection @ X54 @ X55 ) ) @ ( mand @ ( member @ X8 @ X54 ) @ ( member @ X8 @ X55 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',intersection_0) ).
thf(thI06,conjecture,
( mlocal
@ ( mforall_di
@ ^ [X66: $i] :
( mforall_di
@ ^ [X67: $i] : ( equal_set @ ( intersection @ X66 @ X67 ) @ ( intersection @ X67 @ X66 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',thI06) ).
thf(equal_set_0,axiom,
( mlocal
@ ( mforall_di
@ ^ [X51: $i] :
( mforall_di
@ ^ [X52: $i] : ( mequiv @ ( equal_set @ X51 @ X52 ) @ ( mand @ ( subset @ X51 @ X52 ) @ ( subset @ X52 @ X51 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p',equal_set_0) ).
thf(c_0_9,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_10,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_11,plain,
( mequiv
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
<=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv_def]) ).
thf(c_0_12,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X8: $i] : ( Z0 @ X8 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_13,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_14,plain,
! [X130: $i,X129: $i] :
( ( subset @ X130 @ X129 @ mactual )
<=> ! [X128: $i] :
( ( member @ X128 @ X130 @ mactual )
=> ( member @ X128 @ X129 @ 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_9]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_15,plain,
! [X137: $i,X136: $i,X135: $i] :
( ( member @ X137 @ ( intersection @ X136 @ X135 ) @ mactual )
<=> ( ( member @ X137 @ X136 @ mactual )
& ( member @ X137 @ X135 @ 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)],[intersection_0]),c_0_9]),c_0_13]),c_0_11]),c_0_12]) ).
thf(c_0_16,negated_conjecture,
~ ( mlocal
@ ( mforall_di
@ ^ [X66: $i] :
( mforall_di
@ ^ [X67: $i] : ( equal_set @ ( intersection @ X66 @ X67 ) @ ( intersection @ X67 @ X66 ) ) ) ) ),
inference(assume_negation,[status(cth)],[thI06]) ).
thf(c_0_17,plain,
! [X218: $i,X219: $i,X220: $i,X221: $i,X222: $i] :
( ( ~ ( subset @ X218 @ X219 @ mactual )
| ~ ( member @ X220 @ X218 @ mactual )
| ( member @ X220 @ X219 @ mactual ) )
& ( ( member @ ( esk1_2 @ X221 @ X222 ) @ X221 @ mactual )
| ( subset @ X221 @ X222 @ mactual ) )
& ( ~ ( member @ ( esk1_2 @ X221 @ X222 ) @ X222 @ mactual )
| ( subset @ X221 @ X222 @ 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_14])])])])])])]) ).
thf(c_0_18,plain,
! [X228: $i,X229: $i,X230: $i] :
( ( ( member @ X228 @ X229 @ mactual )
| ~ ( member @ X228 @ ( intersection @ X229 @ X230 ) @ mactual ) )
& ( ( member @ X228 @ X230 @ mactual )
| ~ ( member @ X228 @ ( intersection @ X229 @ X230 ) @ mactual ) )
& ( ~ ( member @ X228 @ X229 @ mactual )
| ~ ( member @ X228 @ X230 @ mactual )
| ( member @ X228 @ ( intersection @ X229 @ X230 ) @ mactual ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
thf(c_0_19,negated_conjecture,
~ ! [X157: $i,X156: $i] : ( equal_set @ ( intersection @ X157 @ X156 ) @ ( intersection @ X156 @ X157 ) @ mactual ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_16]),c_0_9]),c_0_12]) ).
thf(c_0_20,plain,
! [X132: $i,X131: $i] :
( ( equal_set @ X132 @ X131 @ mactual )
<=> ( ( subset @ X132 @ X131 @ mactual )
& ( subset @ X131 @ X132 @ 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_9]),c_0_13]),c_0_11]),c_0_12]) ).
thf(c_0_21,plain,
! [X8: $i,X10: $i] :
( ( subset @ X8 @ X10 @ mactual )
| ~ ( member @ ( esk1_2 @ X8 @ X10 ) @ X10 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_22,plain,
! [X8: $i,X10: $i,X11: $i] :
( ( member @ X8 @ ( intersection @ X10 @ X11 ) @ mactual )
| ~ ( member @ X8 @ X10 @ mactual )
| ~ ( member @ X8 @ X11 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
! [X8: $i,X10: $i,X11: $i] :
( ( member @ X8 @ X10 @ mactual )
| ~ ( member @ X8 @ ( intersection @ X10 @ X11 ) @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,plain,
! [X8: $i,X10: $i] :
( ( member @ ( esk1_2 @ X8 @ X10 ) @ X8 @ mactual )
| ( subset @ X8 @ X10 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_25,negated_conjecture,
~ ( equal_set @ ( intersection @ esk4_0 @ esk5_0 ) @ ( intersection @ esk5_0 @ esk4_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_26,plain,
! [X224: $i,X225: $i] :
( ( ( subset @ X224 @ X225 @ mactual )
| ~ ( equal_set @ X224 @ X225 @ mactual ) )
& ( ( subset @ X225 @ X224 @ mactual )
| ~ ( equal_set @ X224 @ X225 @ mactual ) )
& ( ~ ( subset @ X224 @ X225 @ mactual )
| ~ ( subset @ X225 @ X224 @ mactual )
| ( equal_set @ X224 @ X225 @ 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_27,plain,
! [X8: $i,X11: $i,X10: $i] :
( ( subset @ X8 @ ( intersection @ X10 @ X11 ) @ mactual )
| ~ ( member @ ( esk1_2 @ X8 @ ( intersection @ X10 @ X11 ) ) @ X11 @ mactual )
| ~ ( member @ ( esk1_2 @ X8 @ ( intersection @ X10 @ X11 ) ) @ X10 @ mactual ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_28,plain,
! [X8: $i,X10: $i,X11: $i] :
( ( member @ ( esk1_2 @ ( intersection @ X8 @ X10 ) @ X11 ) @ X8 @ mactual )
| ( subset @ ( intersection @ X8 @ X10 ) @ X11 @ mactual ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_29,plain,
! [X8: $i,X11: $i,X10: $i] :
( ( member @ X8 @ X10 @ mactual )
| ~ ( member @ X8 @ ( intersection @ X11 @ X10 ) @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_30,negated_conjecture,
~ ( equal_set @ ( intersection @ esk4_0 @ esk5_0 ) @ ( intersection @ esk5_0 @ esk4_0 ) @ mactual ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X10: $i,X8: $i] :
( ( equal_set @ X8 @ X10 @ mactual )
| ~ ( subset @ X8 @ X10 @ mactual )
| ~ ( subset @ X10 @ X8 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,plain,
! [X8: $i,X10: $i,X11: $i] :
( ( subset @ ( intersection @ X8 @ X10 ) @ ( intersection @ X11 @ X8 ) @ mactual )
| ~ ( member @ ( esk1_2 @ ( intersection @ X8 @ X10 ) @ ( intersection @ X11 @ X8 ) ) @ X11 @ mactual ) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_33,plain,
! [X8: $i,X10: $i,X11: $i] :
( ( member @ ( esk1_2 @ ( intersection @ X8 @ X10 ) @ X11 ) @ X10 @ mactual )
| ( subset @ ( intersection @ X8 @ X10 ) @ X11 @ mactual ) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
thf(c_0_34,negated_conjecture,
( ~ ( subset @ ( intersection @ esk5_0 @ esk4_0 ) @ ( intersection @ esk4_0 @ esk5_0 ) @ mactual )
| ~ ( subset @ ( intersection @ esk4_0 @ esk5_0 ) @ ( intersection @ esk5_0 @ esk4_0 ) @ mactual ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,plain,
! [X10: $i,X8: $i] : ( subset @ ( intersection @ X8 @ X10 ) @ ( intersection @ X10 @ X8 ) @ mactual ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET004^4 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.27 % Computer : n002.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8046.5625MB
% 0.08/0.27 % OS : Linux 6.8.0-71-generic
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Tue Sep 29 13:37:07 UTC 2026
% 0.24/0.27 % CPUTime :
% 0.24/0.27 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.32 Running higher-order theorem proving
% 0.24/0.34 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.W4cDRMrlS6/E---3.1_1282424.p
% 4.03/0.97 % Version: 3.5.1-ho
% 4.03/0.97 % Preprocessing class: HSMSSMSSMLLNHSN.
% 4.03/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.03/0.97 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 4.03/0.97 % Starting post_as_ho3 with 300s (1) cores
% 4.03/0.97 % Starting new_ho_12 with 300s (1) cores
% 4.03/0.97 % Starting new_bool_2 with 300s (1) cores
% 4.03/0.97 % new_bool_2 with pid 1282440 completed with status 9
% 4.03/0.97 % new_ho_10_cnf2 with pid 1282437 completed with status 0
% 4.03/0.97 % Result found by new_ho_10_cnf2
% 4.03/0.97 % Preprocessing class: HSMSSMSSMLLNHSN.
% 4.03/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.03/0.97 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 4.03/0.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.03/0.97 % No SInE strategy applied
% 4.03/0.97 % Search class: HGHNS-FFMF21-SHSSMFNN
% 4.03/0.97 % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 4.03/0.97 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.03/0.97 % Starting SubtermCWHack with 136s (1) cores
% 4.03/0.97 % Starting new_ho_10_cnf2 with 151s (1) cores
% 4.03/0.97 % Starting ehoh_best8_lambda with 136s (1) cores
% 4.03/0.97 % Starting ho_unfolding_6 with 136s (1) cores
% 4.03/0.97 % Starting sh4l with 136s (1) cores
% 4.03/0.97 % new_ho_10_cnf2 with pid 1282446 completed with status 0
% 4.03/0.97 % Result found by new_ho_10_cnf2
% 4.03/0.97 % Preprocessing class: HSMSSMSSMLLNHSN.
% 4.03/0.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.03/0.97 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 4.03/0.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.03/0.97 % No SInE strategy applied
% 4.03/0.97 % Search class: HGHNS-FFMF21-SHSSMFNN
% 4.03/0.97 % partial match(1): HGUNS-FFMF21-SHSSMFNN
% 4.03/0.97 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.03/0.97 % Starting SubtermCWHack with 136s (1) cores
% 4.03/0.97 % Starting new_ho_10_cnf2 with 151s (1) cores
% 4.03/0.97 % Preprocessing time : 0.003 s
% 4.03/0.97 % Presaturation interreduction done
% 4.03/0.97
% 4.03/0.97 % Proof found!
% 4.03/0.97 % SZS status Theorem
% 4.03/0.97 % SZS output start CNFRefutation
% See solution above
% 4.03/0.97 % Parsed axioms : 71
% 4.03/0.97 % Removed by relevancy pruning/SinE : 0
% 4.03/0.97 % Initial clauses : 79
% 4.03/0.97 % Removed in clause preprocessing : 26
% 4.03/0.97 % Initial clauses in saturation : 53
% 4.03/0.97 % Processed clauses : 877
% 4.03/0.97 % ...of these trivial : 20
% 4.03/0.97 % ...subsumed : 61
% 4.03/0.97 % ...remaining for further processing : 796
% 4.03/0.97 % Other redundant clauses eliminated : 0
% 4.03/0.97 % Clauses deleted for lack of memory : 0
% 4.03/0.97 % Backward-subsumed : 0
% 4.03/0.97 % Backward-rewritten : 6
% 4.03/0.97 % Generated clauses : 16432
% 4.03/0.97 % ...of the previous two non-redundant : 12814
% 4.03/0.97 % ...aggressively subsumed : 0
% 4.03/0.97 % Contextual simplify-reflections : 0
% 4.03/0.97 % Paramodulations : 16420
% 4.03/0.97 % Factorizations : 12
% 4.03/0.97 % NegExts : 0
% 4.03/0.97 % Equation resolutions : 0
% 4.03/0.97 % Disequality decompositions : 0
% 4.03/0.97 % Total rewrite steps : 3682
% 4.03/0.97 % ...of those cached : 2396
% 4.03/0.97 % Propositional unsat checks : 0
% 4.03/0.97 % Propositional check models : 0
% 4.03/0.97 % Propositional check unsatisfiable : 0
% 4.03/0.97 % Propositional clauses : 0
% 4.03/0.97 % Propositional clauses after purity: 0
% 4.03/0.97 % Propositional unsat core size : 0
% 4.03/0.97 % Propositional preprocessing time : 0.000
% 4.03/0.97 % Propositional encoding time : 0.000
% 4.03/0.97 % Propositional solver time : 0.000
% 4.03/0.97 % Success case prop preproc time : 0.000
% 4.03/0.97 % Success case prop encoding time : 0.000
% 4.03/0.97 % Success case prop solver time : 0.000
% 4.03/0.97 % Current number of processed clauses : 737
% 4.03/0.97 % Positive orientable unit clauses : 167
% 4.03/0.97 % Positive unorientable unit clauses: 0
% 4.03/0.97 % Negative unit clauses : 98
% 4.03/0.97 % Non-unit-clauses : 472
% 4.03/0.97 % Current number of unprocessed clauses: 11947
% 4.03/0.97 % ...number of literals in the above : 28547
% 4.03/0.97 % Current number of archived formulas : 0
% 4.03/0.97 % Current number of archived clauses : 59
% 4.03/0.97 % Clause-clause subsumption calls (NU) : 26528
% 4.03/0.97 % Rec. Clause-clause subsumption calls : 23201
% 4.03/0.97 % Non-unit clause-clause subsumptions : 26
% 4.03/0.97 % Unit Clause-clause subsumption calls : 5821
% 4.03/0.97 % Rewrite failures with RHS unbound : 0
% 4.03/0.97 % BW rewrite match attempts : 521
% 4.03/0.97 % BW rewrite match successes : 5
% 4.03/0.97 % Condensation attempts : 877
% 4.03/0.97 % Condensation successes : 7
% 4.03/0.97 % Termbank termtop insertions : 234509
% 4.03/0.97 % Search garbage collected termcells : 4327
% 4.03/0.97
% 4.03/0.97 % -------------------------------------------------
% 4.03/0.97 % User time : 0.528 s
% 4.03/0.97 % System time : 0.032 s
% 4.03/0.97 % Total time : 0.561 s
% 4.03/0.97 % Maximum resident set size: 4004 pages
% 4.03/0.97
% 4.03/0.97 % -------------------------------------------------
% 4.03/0.97 % User time : 2.794 s
% 4.03/0.97 % System time : 0.211 s
% 4.03/0.97 % Total time : 3.005 s
% 4.03/0.97 % Maximum resident set size: 4864 pages
% 4.03/0.97 % E exiting
%------------------------------------------------------------------------------