%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET934+1 : TPTP v9.3.1. Released v3.2.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:15:48 PM UTC 2026
% Result : Theorem 22.45s 3.72s
% Output : CNFRefutation 22.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 58 ( 19 unt; 0 def)
% Number of atoms : 148 ( 23 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 147 ( 57 ~; 72 |; 11 &)
% ( 5 <=>; 2 =>; 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 : 157 ( 13 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
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(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(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_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(idempotence_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(t81_zfmisc_1,conjecture,
! [X1,X2] : subset(set_union2(powerset(X1),powerset(X2)),powerset(set_union2(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t81_zfmisc_1) ).
fof(c_0_8,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( X14 = powerset(X13)
| subset(esk1_2(X13,X14),X13)
| in(esk1_2(X13,X14),X14) )
& ( X14 = powerset(X13)
| ~ subset(esk1_2(X13,X14),X13)
| ~ in(esk1_2(X13,X14),X14) )
& ( X10 != powerset(X9)
| in(X12,X10)
| ~ subset(X12,X9) )
& ( X10 != powerset(X9)
| subset(X11,X9)
| ~ in(X11,X10) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_9,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( X23 = set_union2(X21,X22)
| in(esk2_3(X21,X22,X23),X22)
| in(esk2_3(X21,X22,X23),X21)
| in(esk2_3(X21,X22,X23),X23) )
& ( X23 = set_union2(X21,X22)
| ~ in(esk2_3(X21,X22,X23),X23)
| ~ in(esk2_3(X21,X22,X23),X22) )
& ( X23 = set_union2(X21,X22)
| ~ in(esk2_3(X21,X22,X23),X23)
| ~ in(esk2_3(X21,X22,X23),X21) )
& ( X18 != set_union2(X16,X17)
| in(X20,X18)
| ~ in(X20,X17) )
& ( X18 != set_union2(X16,X17)
| in(X20,X18)
| ~ in(X20,X16) )
& ( X18 != set_union2(X16,X17)
| in(X19,X17)
| in(X19,X16)
| ~ in(X19,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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_xboole_0])])])])])])]) ).
fof(c_0_10,plain,
! [X25,X26,X27,X28,X29] :
( ( subset(X28,X29)
| ~ in(esk3_2(X28,X29),X29) )
& ( subset(X28,X29)
| in(esk3_2(X28,X29),X28) )
& ( in(X27,X26)
| ~ in(X27,X25)
| ~ subset(X25,X26) ) ),
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])])])])])])]) ).
cnf(c_0_11,plain,
( X3 != powerset(X2)
| ~ subset(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X39,X40,X41] :
( subset(X39,X41)
| ~ subset(X40,X41)
| ~ subset(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_13,plain,
! [X42,X43] : subset(X42,set_union2(X42,X43)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_14,plain,
( X3 != set_union2(X4,X2)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( X2 != set_union2(X3,X4)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ subset(X1,X2)
| in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( X2 != powerset(X3)
| ~ in(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_22,plain,
( X3 != set_union2(X2,X4)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ in(X1,X3)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ~ in(X1,set_union2(X3,X2))
| in(X1,X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( ~ subset(esk3_2(X1,powerset(X2)),X2)
| subset(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_27,plain,
( ~ subset(X1,X2)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
( ~ in(X1,powerset(X2))
| subset(X1,X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( ~ in(X1,X2)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( ~ in(esk3_2(X1,set_union2(X2,X3)),X3)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_32,plain,
( in(esk3_2(set_union2(X1,X2),X3),X1)
| in(esk3_2(set_union2(X1,X2),X3),X2)
| subset(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
( ~ subset(esk3_2(X1,powerset(set_union2(X2,X3))),X2)
| subset(X1,powerset(set_union2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( subset(powerset(X1),X2)
| subset(esk3_2(powerset(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_35,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_36,plain,
( ~ in(esk3_2(X1,set_union2(X2,X3)),X2)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_37,plain,
( in(esk3_2(set_union2(X1,X2),set_union2(X3,X1)),X2)
| subset(set_union2(X1,X2),set_union2(X3,X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,plain,
subset(powerset(X1),powerset(set_union2(X1,X2))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( ~ subset(X1,X3)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_41,plain,
( ~ subset(X4,X2)
| ~ subset(X1,X4)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_42,plain,
subset(set_union2(X1,X2),set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_43,plain,
! [X35] : set_union2(X35,X35) = X35,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k2_xboole_0])]) ).
cnf(c_0_44,plain,
( ~ in(X1,powerset(X2))
| in(X1,powerset(set_union2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ subset(esk3_2(X1,powerset(set_union2(X2,X3))),X3)
| subset(X1,powerset(set_union2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_46,plain,
( in(esk3_2(set_union2(powerset(X1),X2),X3),X2)
| subset(set_union2(powerset(X1),X2),X3)
| subset(esk3_2(set_union2(powerset(X1),X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
fof(c_0_47,negated_conjecture,
~ ! [X1,X2] : subset(set_union2(powerset(X1),powerset(X2)),powerset(set_union2(X1,X2))),
inference(assume_negation,[status(cth)],[t81_zfmisc_1]) ).
cnf(c_0_48,plain,
( ~ subset(set_union2(X2,X1),X3)
| subset(set_union2(X1,X2),set_union2(X3,X4)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
set_union2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
( ~ in(esk3_2(X1,powerset(set_union2(X2,X3))),powerset(X2))
| subset(X1,powerset(set_union2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_44]) ).
cnf(c_0_51,plain,
( in(esk3_2(set_union2(powerset(X1),X2),powerset(set_union2(X3,X1))),X2)
| subset(set_union2(powerset(X1),X2),powerset(set_union2(X3,X1))) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_52,negated_conjecture,
~ subset(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])]) ).
cnf(c_0_53,plain,
( ~ subset(set_union2(X2,X1),X3)
| subset(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
subset(set_union2(powerset(X1),powerset(X2)),powerset(set_union2(X2,X1))),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
~ subset(set_union2(powerset(esk6_0),powerset(esk7_0)),powerset(set_union2(esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_56,plain,
subset(set_union2(powerset(X1),powerset(X2)),powerset(set_union2(X1,X2))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET934+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:44:48 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 22.45/3.72 % Version: 3.5.1
% 22.45/3.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 22.45/3.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.45/3.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 22.45/3.72 % Starting new_bool_3 with 300s (1) cores
% 22.45/3.72 % Starting new_bool_1 with 300s (1) cores
% 22.45/3.72 % Starting sh5l with 300s (1) cores
% 22.45/3.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2128392 completed with status 0
% 22.45/3.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 22.45/3.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 22.45/3.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.45/3.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 22.45/3.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.45/3.72 % No SInE strategy applied
% 22.45/3.72 % Search class: FGHSM-FFMF32-SFFFFFNN
% 22.45/3.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 22.45/3.72 % Starting SubtermCWHack with 136s (1) cores
% 22.45/3.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 22.45/3.72 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 22.45/3.72 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 22.45/3.72 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 22.45/3.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2128399 completed with status 0
% 22.45/3.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 22.45/3.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 22.45/3.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.45/3.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 22.45/3.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 22.45/3.72 % No SInE strategy applied
% 22.45/3.72 % Search class: FGHSM-FFMF32-SFFFFFNN
% 22.45/3.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 22.45/3.72 % Starting SubtermCWHack with 136s (1) cores
% 22.45/3.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 22.45/3.72 % Preprocessing time : 0.002 s
% 22.45/3.72 % Presaturation interreduction done
% 22.45/3.72
% 22.45/3.72 % Proof found!
% 22.45/3.72 % SZS status Theorem
% 22.45/3.72 % SZS output start CNFRefutation
% See solution above
% 22.45/3.72 % Parsed axioms : 14
% 22.45/3.72 % Removed by relevancy pruning/SinE : 0
% 22.45/3.72 % Initial clauses : 24
% 22.45/3.72 % Removed in clause preprocessing : 0
% 22.45/3.72 % Initial clauses in saturation : 24
% 22.45/3.72 % Processed clauses : 15803
% 22.45/3.72 % ...of these trivial : 820
% 22.45/3.72 % ...subsumed : 12694
% 22.45/3.72 % ...remaining for further processing : 2289
% 22.45/3.72 % Other redundant clauses eliminated : 5
% 22.45/3.72 % Clauses deleted for lack of memory : 0
% 22.45/3.72 % Backward-subsumed : 15
% 22.45/3.72 % Backward-rewritten : 1
% 22.45/3.72 % Generated clauses : 181109
% 22.45/3.72 % ...of the previous two non-redundant : 174795
% 22.45/3.72 % ...aggressively subsumed : 0
% 22.45/3.72 % Contextual simplify-reflections : 2
% 22.45/3.72 % Paramodulations : 180104
% 22.45/3.72 % Factorizations : 1000
% 22.45/3.72 % NegExts : 0
% 22.45/3.72 % Equation resolutions : 5
% 22.45/3.72 % Disequality decompositions : 0
% 22.45/3.72 % Total rewrite steps : 8053
% 22.45/3.72 % ...of those cached : 6807
% 22.45/3.72 % Propositional unsat checks : 0
% 22.45/3.72 % Propositional check models : 0
% 22.45/3.72 % Propositional check unsatisfiable : 0
% 22.45/3.72 % Propositional clauses : 0
% 22.45/3.72 % Propositional clauses after purity: 0
% 22.45/3.72 % Propositional unsat core size : 0
% 22.45/3.72 % Propositional preprocessing time : 0.000
% 22.45/3.72 % Propositional encoding time : 0.000
% 22.45/3.72 % Propositional solver time : 0.000
% 22.45/3.72 % Success case prop preproc time : 0.000
% 22.45/3.72 % Success case prop encoding time : 0.000
% 22.45/3.72 % Success case prop solver time : 0.000
% 22.45/3.72 % Current number of processed clauses : 2244
% 22.45/3.72 % Positive orientable unit clauses : 236
% 22.45/3.72 % Positive unorientable unit clauses: 1
% 22.45/3.72 % Negative unit clauses : 831
% 22.45/3.72 % Non-unit-clauses : 1176
% 22.45/3.72 % Current number of unprocessed clauses: 159026
% 22.45/3.72 % ...number of literals in the above : 420941
% 22.45/3.72 % Current number of archived formulas : 0
% 22.45/3.72 % Current number of archived clauses : 40
% 22.45/3.72 % Clause-clause subsumption calls (NU) : 218640
% 22.45/3.72 % Rec. Clause-clause subsumption calls : 166742
% 22.45/3.72 % Non-unit clause-clause subsumptions : 3798
% 22.45/3.72 % Unit Clause-clause subsumption calls : 72978
% 22.45/3.72 % Rewrite failures with RHS unbound : 0
% 22.45/3.72 % BW rewrite match attempts : 3281
% 22.45/3.72 % BW rewrite match successes : 13
% 22.45/3.72 % Condensation attempts : 0
% 22.45/3.72 % Condensation successes : 0
% 22.45/3.72 % Termbank termtop insertions : 3098683
% 22.45/3.72 % Search garbage collected termcells : 429
% 22.45/3.72
% 22.45/3.72 % -------------------------------------------------
% 22.45/3.72 % User time : 3.037 s
% 22.45/3.72 % System time : 0.135 s
% 22.45/3.72 % Total time : 3.172 s
% 22.45/3.72 % Maximum resident set size: 3640 pages
% 22.45/3.72
% 22.45/3.72 % -------------------------------------------------
% 22.45/3.72 % User time : 15.083 s
% 22.45/3.72 % System time : 0.693 s
% 22.45/3.72 % Total time : 15.776 s
% 22.45/3.72 % Maximum resident set size: 4864 pages
% 22.45/3.72 % E exiting
%------------------------------------------------------------------------------