%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU135+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:23:55 PM UTC 2026
% Result : Theorem 6.10s 1.32s
% Output : CNFRefutation 6.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 20 unt; 0 def)
% Number of atoms : 142 ( 30 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 157 ( 63 ~; 64 |; 19 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 112 ( 8 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_xboole_1,conjecture,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_xboole_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t8_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X3,X2)
& subset(X1,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
| in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(assume_negation,[status(cth)],[t39_xboole_1]) ).
fof(c_0_11,negated_conjecture,
set_union2(esk9_0,set_difference(esk10_0,esk9_0)) != set_union2(esk9_0,esk10_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_12,plain,
! [X11,X12] :
( ( X11 = X12
| ~ subset(X12,X11)
| ~ subset(X11,X12) )
& ( X11 != X12
| subset(X12,X11) )
& ( X11 != X12
| subset(X11,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_13,negated_conjecture,
set_union2(esk9_0,set_difference(esk10_0,esk9_0)) != set_union2(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,lemma,
! [X117,X118,X119] :
( subset(set_union2(X117,X119),X118)
| ~ subset(X119,X118)
| ~ subset(X117,X118) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
fof(c_0_16,lemma,
! [X113,X114] : subset(X113,set_union2(X113,X114)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(set_union2(esk9_0,esk10_0),set_union2(esk9_0,set_difference(esk10_0,esk9_0)))
| ~ subset(set_union2(esk9_0,set_difference(esk10_0,esk9_0)),set_union2(esk9_0,esk10_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,lemma,
( ~ subset(X3,X2)
| ~ subset(X1,X2)
| subset(set_union2(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,lemma,
! [X73,X74,X75] :
( subset(X73,X75)
| ~ subset(X74,X75)
| ~ subset(X73,X74) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_21,lemma,
! [X89,X90] : subset(set_difference(X89,X90),X89),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_22,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_23,negated_conjecture,
( ~ subset(set_difference(esk10_0,esk9_0),set_union2(esk9_0,esk10_0))
| ~ subset(set_union2(esk9_0,esk10_0),set_union2(esk9_0,set_difference(esk10_0,esk9_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_24,lemma,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,lemma,
( ~ subset(esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0)))
| ~ subset(set_difference(esk10_0,esk9_0),set_union2(esk9_0,esk10_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_19])]) ).
cnf(c_0_28,lemma,
( ~ subset(X1,X3)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,lemma,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
fof(c_0_30,plain,
! [X26,X27,X28,X29,X30] :
( ( subset(X29,X30)
| ~ in(esk3_2(X29,X30),X30) )
& ( subset(X29,X30)
| in(esk3_2(X29,X30),X29) )
& ( in(X28,X27)
| ~ in(X28,X26)
| ~ subset(X26,X27) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_31,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( X24 = set_union2(X22,X23)
| in(esk2_3(X22,X23,X24),X23)
| in(esk2_3(X22,X23,X24),X22)
| in(esk2_3(X22,X23,X24),X24) )
& ( X24 = set_union2(X22,X23)
| ~ in(esk2_3(X22,X23,X24),X24)
| ~ in(esk2_3(X22,X23,X24),X23) )
& ( X24 = set_union2(X22,X23)
| ~ in(esk2_3(X22,X23,X24),X24)
| ~ in(esk2_3(X22,X23,X24),X22) )
& ( X19 != set_union2(X17,X18)
| in(X21,X19)
| ~ in(X21,X18) )
& ( X19 != set_union2(X17,X18)
| in(X21,X19)
| ~ in(X21,X17) )
& ( X19 != set_union2(X17,X18)
| in(X20,X18)
| in(X20,X17)
| ~ in(X20,X19) ) ),
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)],[d2_xboole_0])])])])])])]) ).
fof(c_0_32,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
cnf(c_0_33,lemma,
~ subset(esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_34,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( X3 != set_union2(X4,X2)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,plain,
! [X41,X42,X43,X44,X45,X46,X47,X48] :
( ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X48)
| ~ in(esk5_3(X46,X47,X48),X47) )
& ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X48)
| in(esk5_3(X46,X47,X48),X46) )
& ( X48 = set_difference(X46,X47)
| in(esk5_3(X46,X47,X48),X47)
| ~ in(esk5_3(X46,X47,X48),X46)
| ~ in(esk5_3(X46,X47,X48),X48) )
& ( X43 != set_difference(X41,X42)
| in(X45,X43)
| in(X45,X42)
| ~ in(X45,X41) )
& ( X43 != set_difference(X41,X42)
| ~ in(X44,X43)
| ~ in(X44,X42) )
& ( X43 != set_difference(X41,X42)
| ~ in(X44,X43)
| in(X44,X41) ) ),
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_32])])])])])])]) ).
cnf(c_0_37,plain,
( X3 != set_union2(X2,X4)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,lemma,
~ in(esk3_2(esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),set_union2(esk9_0,set_difference(esk10_0,esk9_0))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( ~ in(X1,X3)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( ~ in(X1,X2)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_43,lemma,
~ in(esk3_2(esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),set_difference(esk10_0,esk9_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_45,lemma,
in(esk3_2(esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),esk10_0),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_46,lemma,
~ in(esk3_2(esk10_0,set_union2(esk9_0,set_difference(esk10_0,esk9_0))),esk9_0),
inference(spm,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_47,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU135+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:53:02 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 6.10/1.32 % Version: 3.5.1
% 6.10/1.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 6.10/1.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.10/1.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.10/1.32 % Starting new_bool_3 with 300s (1) cores
% 6.10/1.32 % Starting new_bool_1 with 300s (1) cores
% 6.10/1.32 % Starting sh5l with 300s (1) cores
% 6.10/1.32 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2144869 completed with status 0
% 6.10/1.32 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.10/1.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 6.10/1.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.10/1.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.10/1.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.10/1.32 % No SInE strategy applied
% 6.10/1.32 % Search class: FGHSM-FFMF32-SFFFFFNN
% 6.10/1.32 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.10/1.32 % Starting SubtermCWHack with 136s (1) cores
% 6.10/1.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.10/1.32 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 6.10/1.32 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.10/1.32 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 6.10/1.32 % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with pid 2144880 completed with status 0
% 6.10/1.32 % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A
% 6.10/1.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 6.10/1.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.10/1.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.10/1.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.10/1.32 % No SInE strategy applied
% 6.10/1.32 % Search class: FGHSM-FFMF32-SFFFFFNN
% 6.10/1.32 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.10/1.32 % Starting SubtermCWHack with 136s (1) cores
% 6.10/1.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.10/1.32 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 6.10/1.32 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.10/1.32 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 6.10/1.32 % Preprocessing time : 0.002 s
% 6.10/1.32 % Presaturation interreduction done
% 6.10/1.32
% 6.10/1.32 % Proof found!
% 6.10/1.32 % SZS status Theorem
% 6.10/1.32 % SZS output start CNFRefutation
% See solution above
% 6.10/1.32 % Parsed axioms : 48
% 6.10/1.32 % Removed by relevancy pruning/SinE : 0
% 6.10/1.32 % Initial clauses : 75
% 6.10/1.32 % Removed in clause preprocessing : 4
% 6.10/1.32 % Initial clauses in saturation : 71
% 6.10/1.32 % Processed clauses : 9201
% 6.10/1.32 % ...of these trivial : 186
% 6.10/1.32 % ...subsumed : 8174
% 6.10/1.32 % ...remaining for further processing : 841
% 6.10/1.32 % Other redundant clauses eliminated : 1660
% 6.10/1.32 % Clauses deleted for lack of memory : 0
% 6.10/1.32 % Backward-subsumed : 77
% 6.10/1.32 % Backward-rewritten : 5
% 6.10/1.32 % Generated clauses : 114667
% 6.10/1.32 % ...of the previous two non-redundant : 103358
% 6.10/1.32 % ...aggressively subsumed : 0
% 6.10/1.32 % Contextual simplify-reflections : 3
% 6.10/1.32 % Paramodulations : 113002
% 6.10/1.32 % Factorizations : 0
% 6.10/1.32 % NegExts : 0
% 6.10/1.32 % Equation resolutions : 1665
% 6.10/1.32 % Disequality decompositions : 0
% 6.10/1.32 % Total rewrite steps : 45111
% 6.10/1.32 % ...of those cached : 44889
% 6.10/1.32 % Propositional unsat checks : 0
% 6.10/1.32 % Propositional check models : 0
% 6.10/1.32 % Propositional check unsatisfiable : 0
% 6.10/1.32 % Propositional clauses : 0
% 6.10/1.32 % Propositional clauses after purity: 0
% 6.10/1.32 % Propositional unsat core size : 0
% 6.10/1.32 % Propositional preprocessing time : 0.000
% 6.10/1.32 % Propositional encoding time : 0.000
% 6.10/1.32 % Propositional solver time : 0.000
% 6.10/1.32 % Success case prop preproc time : 0.000
% 6.10/1.32 % Success case prop encoding time : 0.000
% 6.10/1.32 % Success case prop solver time : 0.000
% 6.10/1.32 % Current number of processed clauses : 680
% 6.10/1.32 % Positive orientable unit clauses : 66
% 6.10/1.32 % Positive unorientable unit clauses: 2
% 6.10/1.32 % Negative unit clauses : 166
% 6.10/1.32 % Non-unit-clauses : 446
% 6.10/1.32 % Current number of unprocessed clauses: 93076
% 6.10/1.32 % ...number of literals in the above : 365778
% 6.10/1.32 % Current number of archived formulas : 0
% 6.10/1.32 % Current number of archived clauses : 149
% 6.10/1.32 % Clause-clause subsumption calls (NU) : 86563
% 6.10/1.32 % Rec. Clause-clause subsumption calls : 44117
% 6.10/1.32 % Non-unit clause-clause subsumptions : 2551
% 6.10/1.32 % Unit Clause-clause subsumption calls : 5754
% 6.10/1.32 % Rewrite failures with RHS unbound : 0
% 6.10/1.32 % BW rewrite match attempts : 55
% 6.10/1.32 % BW rewrite match successes : 33
% 6.10/1.32 % Condensation attempts : 0
% 6.10/1.32 % Condensation successes : 0
% 6.10/1.32 % Termbank termtop insertions : 1447717
% 6.10/1.32 % Search garbage collected termcells : 1052
% 6.10/1.32
% 6.10/1.32 % -------------------------------------------------
% 6.10/1.32 % User time : 0.837 s
% 6.10/1.32 % System time : 0.033 s
% 6.10/1.32 % Total time : 0.870 s
% 6.10/1.32 % Maximum resident set size: 3668 pages
% 6.10/1.32
% 6.10/1.32 % -------------------------------------------------
% 6.10/1.32 % User time : 4.150 s
% 6.10/1.32 % System time : 0.184 s
% 6.10/1.32 % Total time : 4.334 s
% 6.10/1.32 % Maximum resident set size: 4864 pages
% 6.10/1.32 % E exiting
%------------------------------------------------------------------------------