%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET159+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:13:46 PM UTC 2026
% Result : Theorem 27.57s 14.68s
% Output : CNFRefutation 27.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 95 ( 46 ~; 38 |; 7 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI09,conjecture,
! [X1,X2,X6] : equal_set(union(union(X1,X2),X6),union(X1,union(X2,X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI09) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X6] : equal_set(union(union(X1,X2),X6),union(X1,union(X2,X6))),
inference(assume_negation,[status(cth)],[thI09]) ).
fof(c_0_5,negated_conjecture,
~ equal_set(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X13,X14] :
( ( equal_set(X13,X14)
| ~ subset(X14,X13)
| ~ subset(X13,X14) )
& ( ~ equal_set(X13,X14)
| subset(X14,X13) )
& ( ~ equal_set(X13,X14)
| subset(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
cnf(c_0_7,negated_conjecture,
~ equal_set(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X7,X8,X9,X10,X11] :
( ( subset(X10,X11)
| ~ member(esk1_2(X10,X11),X11) )
& ( subset(X10,X11)
| member(esk1_2(X10,X11),X10) )
& ( member(X9,X8)
| ~ member(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)],[subset])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ subset(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0)))
| ~ subset(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ subset(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0))
| ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_13,plain,
! [X20,X21,X22] :
( ( member(X20,union(X21,X22))
| ~ member(X20,X22) )
& ( member(X20,union(X21,X22))
| ~ member(X20,X21) )
& ( member(X20,X22)
| member(X20,X21)
| ~ member(X20,union(X21,X22)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0))
| ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0))
| member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk5_0,esk6_0))
| ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk4_0,union(esk5_0,esk6_0)))
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0))
| member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk5_0,esk6_0))
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0))
| member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk4_0,esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| ~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(union(esk4_0,esk5_0),esk6_0))
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),esk6_0)
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),union(esk4_0,esk5_0))
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),esk4_0)
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(esk1_2(union(union(esk4_0,esk5_0),esk6_0),union(esk4_0,union(esk5_0,esk6_0))),esk5_0)
| member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_34,negated_conjecture,
~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_35,negated_conjecture,
member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk4_0,union(esk5_0,esk6_0))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),esk4_0),
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_37,negated_conjecture,
member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),union(esk5_0,esk6_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_35]),c_0_36]) ).
cnf(c_0_38,negated_conjecture,
~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),esk6_0),
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_39,negated_conjecture,
~ member(esk1_2(union(esk4_0,union(esk5_0,esk6_0)),union(union(esk4_0,esk5_0),esk6_0)),esk5_0),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET159+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.57 % Computer : n006.cluster.edu
% 0.11/10.57 % Model : x86_64 x86_64
% 0.11/10.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.57 % Memory : 8046.5625MB
% 0.11/10.57 % OS : Linux 6.8.0-71-generic
% 0.11/10.57 % CPULimit : 300
% 0.11/10.57 % WCLimit : 300
% 0.11/10.57 % DateTime : Mon Sep 21 04:57:26 UTC 2026
% 0.11/10.57 % CPUTime :
% 0.11/10.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/10.61 Running first-order theorem proving
% 0.16/10.61 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
% 27.57/14.68 % Version: 3.5.1
% 27.57/14.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.57/14.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.57/14.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.57/14.68 % Starting new_bool_3 with 300s (1) cores
% 27.57/14.68 % Starting new_bool_1 with 300s (1) cores
% 27.57/14.68 % Starting sh5l with 300s (1) cores
% 27.57/14.68 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2049261 completed with status 0
% 27.57/14.68 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 27.57/14.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.57/14.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.57/14.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.57/14.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.57/14.68 % No SInE strategy applied
% 27.57/14.68 % Search class: FGHSF-FFMF21-SFFFFFNN
% 27.57/14.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 27.57/14.68 % Starting SubtermCWHack with 136s (1) cores
% 27.57/14.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 27.57/14.68 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 27.57/14.68 % Starting new_bool_3 with 136s (1) cores
% 27.57/14.68 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 27.57/14.68 % G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with pid 2049271 completed with status 0
% 27.57/14.68 % Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N
% 27.57/14.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.57/14.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.57/14.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.57/14.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.57/14.68 % No SInE strategy applied
% 27.57/14.68 % Search class: FGHSF-FFMF21-SFFFFFNN
% 27.57/14.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 27.57/14.68 % Starting SubtermCWHack with 136s (1) cores
% 27.57/14.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 27.57/14.68 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 27.57/14.68 % Starting new_bool_3 with 136s (1) cores
% 27.57/14.68 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 27.57/14.68 % Preprocessing time : 0.001 s
% 27.57/14.68 % Presaturation interreduction done
% 27.57/14.68
% 27.57/14.68 % Proof found!
% 27.57/14.68 % SZS status Theorem
% 27.57/14.68 % SZS output start CNFRefutation
% See solution above
% 27.57/14.68 % Parsed axioms : 12
% 27.57/14.68 % Removed by relevancy pruning/SinE : 0
% 27.57/14.68 % Initial clauses : 30
% 27.57/14.68 % Removed in clause preprocessing : 0
% 27.57/14.68 % Initial clauses in saturation : 30
% 27.57/14.68 % Processed clauses : 13984
% 27.57/14.68 % ...of these trivial : 831
% 27.57/14.68 % ...subsumed : 10945
% 27.57/14.68 % ...remaining for further processing : 2208
% 27.57/14.68 % Other redundant clauses eliminated : 42
% 27.57/14.68 % Clauses deleted for lack of memory : 0
% 27.57/14.68 % Backward-subsumed : 27
% 27.57/14.68 % Backward-rewritten : 40
% 27.57/14.68 % Generated clauses : 417008
% 27.57/14.68 % ...of the previous two non-redundant : 346376
% 27.57/14.68 % ...aggressively subsumed : 0
% 27.57/14.68 % Contextual simplify-reflections : 6
% 27.57/14.68 % Paramodulations : 416817
% 27.57/14.68 % Factorizations : 149
% 27.57/14.68 % NegExts : 0
% 27.57/14.68 % Equation resolutions : 42
% 27.57/14.68 % Disequality decompositions : 0
% 27.57/14.68 % Total rewrite steps : 71438
% 27.57/14.68 % ...of those cached : 66151
% 27.57/14.68 % Propositional unsat checks : 0
% 27.57/14.68 % Propositional check models : 0
% 27.57/14.68 % Propositional check unsatisfiable : 0
% 27.57/14.68 % Propositional clauses : 0
% 27.57/14.68 % Propositional clauses after purity: 0
% 27.57/14.68 % Propositional unsat core size : 0
% 27.57/14.68 % Propositional preprocessing time : 0.000
% 27.57/14.68 % Propositional encoding time : 0.000
% 27.57/14.68 % Propositional solver time : 0.000
% 27.57/14.68 % Success case prop preproc time : 0.000
% 27.57/14.68 % Success case prop encoding time : 0.000
% 27.57/14.68 % Success case prop solver time : 0.000
% 27.57/14.68 % Current number of processed clauses : 2108
% 27.57/14.68 % Positive orientable unit clauses : 563
% 27.57/14.68 % Positive unorientable unit clauses: 0
% 27.57/14.68 % Negative unit clauses : 7
% 27.57/14.68 % Non-unit-clauses : 1538
% 27.57/14.68 % Current number of unprocessed clauses: 332361
% 27.57/14.68 % ...number of literals in the above : 817290
% 27.57/14.68 % Current number of archived formulas : 0
% 27.57/14.68 % Current number of archived clauses : 97
% 27.57/14.68 % Clause-clause subsumption calls (NU) : 1159679
% 27.57/14.68 % Rec. Clause-clause subsumption calls : 823321
% 27.57/14.68 % Non-unit clause-clause subsumptions : 10617
% 27.57/14.68 % Unit Clause-clause subsumption calls : 25618
% 27.57/14.68 % Rewrite failures with RHS unbound : 0
% 27.57/14.68 % BW rewrite match attempts : 6355
% 27.57/14.68 % BW rewrite match successes : 22
% 27.57/14.68 % Condensation attempts : 0
% 27.57/14.68 % Condensation successes : 0
% 27.57/14.68 % Termbank termtop insertions : 6226452
% 27.57/14.68 % Search garbage collected termcells : 452
% 27.57/14.68
% 27.57/14.68 % -------------------------------------------------
% 27.57/14.68 % User time : 3.732 s
% 27.57/14.68 % System time : 0.175 s
% 27.57/14.68 % Total time : 3.907 s
% 27.57/14.68 % Maximum resident set size: 3648 pages
% 27.57/14.68
% 27.57/14.68 % -------------------------------------------------
% 27.57/14.68 % User time : 18.615 s
% 27.57/14.68 % System time : 1.040 s
% 27.57/14.68 % Total time : 19.655 s
% 27.57/14.68 % Maximum resident set size: 4864 pages
% 27.57/14.68 % E exiting
%------------------------------------------------------------------------------