%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU170+1 : 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 : n001.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:24:06 PM UTC 2026
% Result : Theorem 2.37s 0.85s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 6 unt; 0 def)
% Number of atoms : 162 ( 17 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 179 ( 69 ~; 69 |; 24 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 113 ( 2 sgn 59 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(t43_subset_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t43_subset_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_subset_1) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_subset_1) ).
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(t3_xboole_0,axiom,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] :
( in(X3,X2)
& in(X3,X1) ) )
& ~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& ~ disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(l3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_subset_1) ).
fof(c_0_8,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]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
inference(assume_negation,[status(cth)],[t43_subset_1]) ).
fof(c_0_10,plain,
! [X13,X14,X15,X16,X17,X18,X19,X20] :
( ( X20 = set_difference(X18,X19)
| in(esk2_3(X18,X19,X20),X20)
| ~ in(esk2_3(X18,X19,X20),X19) )
& ( X20 = set_difference(X18,X19)
| in(esk2_3(X18,X19,X20),X20)
| in(esk2_3(X18,X19,X20),X18) )
& ( X20 = set_difference(X18,X19)
| in(esk2_3(X18,X19,X20),X19)
| ~ in(esk2_3(X18,X19,X20),X18)
| ~ in(esk2_3(X18,X19,X20),X20) )
& ( X15 != set_difference(X13,X14)
| in(X17,X15)
| in(X17,X14)
| ~ in(X17,X13) )
& ( X15 != set_difference(X13,X14)
| ~ in(X16,X15)
| ~ in(X16,X14) )
& ( X15 != set_difference(X13,X14)
| ~ in(X16,X15)
| in(X16,X13) ) ),
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_8])])])])])])]) ).
fof(c_0_11,plain,
! [X22,X23] :
( subset_complement(X22,X23) = set_difference(X22,X23)
| ~ element(X23,powerset(X22)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
fof(c_0_12,plain,
! [X29,X30] :
( subset_complement(X29,subset_complement(X29,X30)) = X30
| ~ element(X30,powerset(X29)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])])]) ).
fof(c_0_13,plain,
! [X24,X25] :
( element(subset_complement(X24,X25),powerset(X24))
| ~ element(X25,powerset(X24)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])])]) ).
fof(c_0_14,plain,
! [X7,X8,X9,X10,X11] :
( ( subset(X10,X11)
| ~ in(esk1_2(X10,X11),X11) )
& ( subset(X10,X11)
| in(esk1_2(X10,X11),X10) )
& ( in(X9,X8)
| ~ in(X9,X7)
| ~ subset(X7,X8) ) ),
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_15,negated_conjecture,
( ( subset(esk10_0,subset_complement(esk9_0,esk11_0))
| disjoint(esk10_0,esk11_0) )
& ( ~ subset(esk10_0,subset_complement(esk9_0,esk11_0))
| ~ disjoint(esk10_0,esk11_0) )
& element(esk11_0,powerset(esk9_0))
& element(esk10_0,powerset(esk9_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_16,plain,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] :
( in(X3,X2)
& in(X3,X1) ) )
& ~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& ~ disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
cnf(c_0_17,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,X1) = set_difference(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,subset_complement(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ element(X1,powerset(X2))
| element(subset_complement(X2,X1),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( subset(esk10_0,subset_complement(esk9_0,esk11_0))
| disjoint(esk10_0,esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X44,X45,X47,X48,X49] :
( ( ~ disjoint(X47,X48)
| ~ in(X49,X48)
| ~ in(X49,X47) )
& ( disjoint(X44,X45)
| in(esk8_2(X44,X45),X45) )
& ( disjoint(X44,X45)
| in(esk8_2(X44,X45),X44) ) ),
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_16])])])])])])]) ).
fof(c_0_24,plain,
! [X31,X32,X33] :
( in(X33,X31)
| ~ in(X33,X32)
| ~ element(X32,powerset(X31)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l3_subset_1])])])]) ).
cnf(c_0_25,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ element(X2,powerset(X1))
| set_difference(X1,subset_complement(X1,X2)) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(X1,esk10_0)
| in(X1,subset_complement(esk9_0,esk11_0))
| disjoint(esk10_0,esk11_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( disjoint(X1,X2)
| in(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( X4 != set_difference(X2,X3)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( ~ in(X3,X1)
| ~ element(X1,powerset(X2))
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
element(esk10_0,powerset(esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,plain,
( ~ in(X3,X1)
| ~ in(X3,subset_complement(X2,X1))
| ~ element(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( in(esk8_2(esk10_0,X1),subset_complement(esk9_0,esk11_0))
| disjoint(esk10_0,X1)
| disjoint(esk10_0,esk11_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
element(esk11_0,powerset(esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
( ~ in(X1,X2)
| in(X1,X3)
| in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( ~ in(X1,esk10_0)
| in(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( ~ in(esk8_2(esk10_0,X1),esk11_0)
| disjoint(esk10_0,X1)
| disjoint(esk10_0,esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,plain,
( disjoint(X1,X2)
| in(esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( ~ in(X1,esk10_0)
| in(X1,X2)
| in(X1,set_difference(esk9_0,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,negated_conjecture,
( ~ subset(esk10_0,subset_complement(esk9_0,esk11_0))
| ~ disjoint(esk10_0,esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,plain,
( ~ disjoint(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_43,negated_conjecture,
disjoint(esk10_0,esk11_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,negated_conjecture,
( in(esk1_2(esk10_0,X1),X2)
| in(esk1_2(esk10_0,X1),set_difference(esk9_0,X2))
| subset(esk10_0,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( ~ subset(esk10_0,set_difference(esk9_0,esk11_0))
| ~ disjoint(esk10_0,esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_18]),c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
( ~ in(X1,esk10_0)
| ~ in(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( in(esk1_2(esk10_0,set_difference(esk9_0,X1)),X1)
| subset(esk10_0,set_difference(esk9_0,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ subset(esk10_0,set_difference(esk9_0,esk11_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_43])]) ).
cnf(c_0_50,negated_conjecture,
~ in(esk1_2(esk10_0,set_difference(esk9_0,esk11_0)),esk10_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_40]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU170+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 06:00:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 2.37/0.85 % Version: 3.5.1
% 2.37/0.85 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.37/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.37/0.85 % Starting new_bool_3 with 300s (1) cores
% 2.37/0.85 % Starting new_bool_1 with 300s (1) cores
% 2.37/0.85 % Starting sh5l with 300s (1) cores
% 2.37/0.85 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2339140 completed with status 0
% 2.37/0.85 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.37/0.85 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.37/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.37/0.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.37/0.85 % No SInE strategy applied
% 2.37/0.85 % Search class: FGHSM-FFMS31-SFFFFFNN
% 2.37/0.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.37/0.85 % Starting SubtermCWHack with 136s (1) cores
% 2.37/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.37/0.85 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2.37/0.85 % Starting new_bool_3 with 136s (1) cores
% 2.37/0.85 % Starting new_bool_1 with 136s (1) cores
% 2.37/0.85 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2339148 completed with status 0
% 2.37/0.85 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 2.37/0.85 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.37/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.37/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.37/0.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.37/0.85 % No SInE strategy applied
% 2.37/0.85 % Search class: FGHSM-FFMS31-SFFFFFNN
% 2.37/0.85 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.37/0.85 % Starting SubtermCWHack with 136s (1) cores
% 2.37/0.85 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.37/0.85 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2.37/0.85 % Preprocessing time : 0.003 s
% 2.37/0.85
% 2.37/0.85 % Proof found!
% 2.37/0.85 % SZS status Theorem
% 2.37/0.85 % SZS output start CNFRefutation
% See solution above
% 2.37/0.85 % Parsed axioms : 27
% 2.37/0.85 % Removed by relevancy pruning/SinE : 0
% 2.37/0.85 % Initial clauses : 41
% 2.37/0.85 % Removed in clause preprocessing : 4
% 2.37/0.85 % Initial clauses in saturation : 37
% 2.37/0.85 % Processed clauses : 1048
% 2.37/0.85 % ...of these trivial : 6
% 2.37/0.85 % ...subsumed : 504
% 2.37/0.85 % ...remaining for further processing : 538
% 2.37/0.85 % Other redundant clauses eliminated : 15
% 2.37/0.85 % Clauses deleted for lack of memory : 0
% 2.37/0.85 % Backward-subsumed : 27
% 2.37/0.85 % Backward-rewritten : 41
% 2.37/0.85 % Generated clauses : 7953
% 2.37/0.85 % ...of the previous two non-redundant : 7391
% 2.37/0.85 % ...aggressively subsumed : 0
% 2.37/0.85 % Contextual simplify-reflections : 8
% 2.37/0.85 % Paramodulations : 7828
% 2.37/0.85 % Factorizations : 100
% 2.37/0.85 % NegExts : 0
% 2.37/0.85 % Equation resolutions : 25
% 2.37/0.85 % Disequality decompositions : 0
% 2.37/0.85 % Total rewrite steps : 1432
% 2.37/0.85 % ...of those cached : 1321
% 2.37/0.85 % Propositional unsat checks : 0
% 2.37/0.85 % Propositional check models : 0
% 2.37/0.85 % Propositional check unsatisfiable : 0
% 2.37/0.85 % Propositional clauses : 0
% 2.37/0.85 % Propositional clauses after purity: 0
% 2.37/0.85 % Propositional unsat core size : 0
% 2.37/0.85 % Propositional preprocessing time : 0.000
% 2.37/0.85 % Propositional encoding time : 0.000
% 2.37/0.85 % Propositional solver time : 0.000
% 2.37/0.85 % Success case prop preproc time : 0.000
% 2.37/0.85 % Success case prop encoding time : 0.000
% 2.37/0.85 % Success case prop solver time : 0.000
% 2.37/0.85 % Current number of processed clauses : 470
% 2.37/0.85 % Positive orientable unit clauses : 59
% 2.37/0.85 % Positive unorientable unit clauses: 0
% 2.37/0.85 % Negative unit clauses : 27
% 2.37/0.85 % Non-unit-clauses : 384
% 2.37/0.85 % Current number of unprocessed clauses: 6210
% 2.37/0.85 % ...number of literals in the above : 20305
% 2.37/0.85 % Current number of archived formulas : 0
% 2.37/0.85 % Current number of archived clauses : 68
% 2.37/0.85 % Clause-clause subsumption calls (NU) : 20672
% 2.37/0.85 % Rec. Clause-clause subsumption calls : 13222
% 2.37/0.85 % Non-unit clause-clause subsumptions : 330
% 2.37/0.85 % Unit Clause-clause subsumption calls : 461
% 2.37/0.85 % Rewrite failures with RHS unbound : 0
% 2.37/0.85 % BW rewrite match attempts : 104
% 2.37/0.85 % BW rewrite match successes : 5
% 2.37/0.85 % Condensation attempts : 0
% 2.37/0.85 % Condensation successes : 0
% 2.37/0.85 % Termbank termtop insertions : 139350
% 2.37/0.85 % Search garbage collected termcells : 531
% 2.37/0.85
% 2.37/0.85 % -------------------------------------------------
% 2.37/0.85 % User time : 0.343 s
% 2.37/0.85 % System time : 0.018 s
% 2.37/0.85 % Total time : 0.362 s
% 2.37/0.85 % Maximum resident set size: 3648 pages
% 2.37/0.85
% 2.37/0.85 % -------------------------------------------------
% 2.37/0.85 % User time : 1.714 s
% 2.37/0.85 % System time : 0.074 s
% 2.37/0.85 % Total time : 1.788 s
% 2.37/0.85 % Maximum resident set size: 4608 pages
% 2.37/0.85 % E exiting
%------------------------------------------------------------------------------