%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU408+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:29:17 PM UTC 2026
% Result : Theorem 0.28s 11.04s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 16 unt; 0 def)
% Number of atoms : 157 ( 20 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 172 ( 56 ~; 44 |; 54 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 71 ( 5 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_latsum_1,conjecture,
! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(X1)
& v4_orders_2(X1)
& v3_orders_2(X1)
& v2_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& v1_lattice3(X2)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_latsum_1) ).
fof(t37_zfmisc_1,axiom,
! [X1,X2] :
( r1_tarski(k1_tarski(X1),X2)
<=> r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t37_zfmisc_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
=> k2_xboole_0(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t12_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k2_xboole_0) ).
fof(t8_setwiseo,axiom,
! [X1,X2,X3] :
( r1_tarski(k2_xboole_0(X1,k1_tarski(X2)),X3)
<=> ( r1_tarski(X1,X3)
& r2_hidden(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+33.ax',t8_setwiseo) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : r1_tarski(X1,k2_xboole_0(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t7_xboole_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( l1_orders_2(X3)
& v1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2)))
& u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X2)
& l1_orders_2(X1) )
=> ( l1_orders_2(k1_latsum_1(X1,X2))
& v1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_latsum_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(X1)
& v4_orders_2(X1)
& v3_orders_2(X1)
& v2_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& v1_lattice3(X2)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(assume_negation,[status(cth)],[t11_latsum_1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( l1_orders_2(X1)
& v1_lattice3(X1)
& v4_orders_2(X1)
& v3_orders_2(X1)
& v2_orders_2(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( l1_orders_2(X2)
& v1_lattice3(X2)
& v4_orders_2(X2)
& v3_orders_2(X2)
& v2_orders_2(X2)
& ~ v3_struct_0(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X1284,X1285] :
( ( r1_tarski(k1_tarski(X1284),X1285)
| ~ r2_hidden(X1284,X1285) )
& ( r2_hidden(X1284,X1285)
| ~ r1_tarski(k1_tarski(X1284),X1285) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_zfmisc_1])])]) ).
fof(c_0_12,negated_conjecture,
( ~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0)))
& r2_hidden(esk3_0,u1_struct_0(esk2_0))
& l1_orders_2(esk2_0)
& v1_lattice3(esk2_0)
& v4_orders_2(esk2_0)
& v3_orders_2(esk2_0)
& v2_orders_2(esk2_0)
& ~ v3_struct_0(esk2_0)
& l1_orders_2(esk1_0)
& v1_lattice3(esk1_0)
& v4_orders_2(esk1_0)
& v3_orders_2(esk1_0)
& v2_orders_2(esk1_0)
& ~ v3_struct_0(esk1_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_13,plain,
! [X208,X209] :
( k2_xboole_0(X208,X209) = X209
| ~ r1_tarski(X208,X209) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
cnf(c_0_14,plain,
( ~ r2_hidden(X1,X2)
| r1_tarski(k1_tarski(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X182,X183] : k2_xboole_0(X182,X183) = k2_xboole_0(X183,X182),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_17,plain,
! [X307,X308,X309] :
( ( r1_tarski(k2_xboole_0(X307,k1_tarski(X308)),X309)
| ~ r1_tarski(X307,X309)
| ~ r2_hidden(X308,X309) )
& ( ~ r1_tarski(k2_xboole_0(X307,k1_tarski(X308)),X309)
| r1_tarski(X307,X309) )
& ( ~ r1_tarski(k2_xboole_0(X307,k1_tarski(X308)),X309)
| r2_hidden(X308,X309) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_setwiseo])])])]) ).
cnf(c_0_18,plain,
( ~ r1_tarski(X1,X2)
| k2_xboole_0(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
r1_tarski(k1_tarski(esk3_0),u1_struct_0(esk2_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ r1_tarski(k2_xboole_0(X3,k1_tarski(X1)),X2)
| r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
k2_xboole_0(u1_struct_0(esk2_0),k1_tarski(esk3_0)) = u1_struct_0(esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
fof(c_0_23,plain,
! [X194,X195] : r1_tarski(X194,k2_xboole_0(X194,X195)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_24,plain,
! [X104,X105] :
( m1_subset_1(X104,X105)
| ~ r2_hidden(X104,X105) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ r1_tarski(u1_struct_0(esk2_0),X1)
| r2_hidden(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
r1_tarski(X1,k2_xboole_0(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_27,plain,
! [X59,X60,X61] :
( ( ~ l1_orders_2(X59)
| ~ l1_orders_2(X60)
| ~ l1_orders_2(X61)
| ~ v1_orders_2(X61)
| X61 = k1_latsum_1(X59,X60)
| u1_orders_2(X61) != k2_xboole_0(k2_xboole_0(u1_orders_2(X59),u1_orders_2(X60)),k7_relset_1(u1_struct_0(X59),u1_struct_0(X59),u1_struct_0(X60),u1_struct_0(X60),u1_orders_2(X59),u1_orders_2(X60)))
| u1_struct_0(X61) != k2_xboole_0(u1_struct_0(X59),u1_struct_0(X60)) )
& ( ~ l1_orders_2(X59)
| ~ l1_orders_2(X60)
| ~ l1_orders_2(X61)
| ~ v1_orders_2(X61)
| X61 != k1_latsum_1(X59,X60)
| u1_orders_2(X61) = k2_xboole_0(k2_xboole_0(u1_orders_2(X59),u1_orders_2(X60)),k7_relset_1(u1_struct_0(X59),u1_struct_0(X59),u1_struct_0(X60),u1_struct_0(X60),u1_orders_2(X59),u1_orders_2(X60))) )
& ( ~ l1_orders_2(X59)
| ~ l1_orders_2(X60)
| ~ l1_orders_2(X61)
| ~ v1_orders_2(X61)
| X61 != k1_latsum_1(X59,X60)
| u1_struct_0(X61) = k2_xboole_0(u1_struct_0(X59),u1_struct_0(X60)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])])]) ).
fof(c_0_28,plain,
! [X57,X58] :
( ( ~ l1_orders_2(X58)
| ~ l1_orders_2(X57)
| l1_orders_2(k1_latsum_1(X57,X58)) )
& ( ~ l1_orders_2(X58)
| ~ l1_orders_2(X57)
| v1_orders_2(k1_latsum_1(X57,X58)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])])]) ).
cnf(c_0_29,plain,
( ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk2_0),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X1)
| ~ v1_orders_2(X1)
| X1 != k1_latsum_1(X2,X3)
| u1_struct_0(X1) = k2_xboole_0(u1_struct_0(X2),u1_struct_0(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| l1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( ~ l1_orders_2(X2)
| ~ l1_orders_2(X1)
| v1_orders_2(k1_latsum_1(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
m1_subset_1(esk3_0,k2_xboole_0(u1_struct_0(esk2_0),X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,plain,
( ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
m1_subset_1(esk3_0,k2_xboole_0(X1,u1_struct_0(esk2_0))),
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_38,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU408+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 % Computer : n015.cluster.edu
% 0.18/0.48 % Model : x86_64 x86_64
% 0.18/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48 % Memory : 8046.5625MB
% 0.18/0.48 % OS : Linux 6.8.0-71-generic
% 0.18/0.48 % CPULimit : 300
% 0.18/0.48 % WCLimit : 300
% 0.18/0.48 % DateTime : Mon Sep 21 06:24:54 UTC 2026
% 0.18/0.49 % CPUTime :
% 0.18/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.57 Running first-order theorem proving
% 0.22/0.57 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
% 0.28/11.04 % Version: 3.5.1
% 0.28/11.04 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.28/11.04 % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.28/11.04 % Starting new_bool_3 with 888s (3) cores
% 0.28/11.04 % Starting new_bool_1 with 888s (3) cores
% 0.28/11.04 % Starting sh5l with 296s (1) cores
% 0.28/11.04 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 296s (1) cores
% 0.28/11.04 % new_bool_1 with pid 759546 completed with status 0
% 0.28/11.04 % Result found by new_bool_1
% 0.28/11.04 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.28/11.04 % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.28/11.04 % Starting new_bool_3 with 888s (3) cores
% 0.28/11.04 % Starting new_bool_1 with 888s (3) cores
% 0.28/11.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/11.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/11.04 % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.28/11.04 % Scheduled 13 strats onto 3 cores with 888 seconds (888 total)
% 0.28/11.04 % Starting SubtermCWHack with 80s (1) cores
% 0.28/11.04 % Starting new_bool_1 with 89s (1) cores
% 0.28/11.04 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 67s (1) cores
% 0.28/11.04 % new_bool_1 with pid 759550 completed with status 0
% 0.28/11.04 % Result found by new_bool_1
% 0.28/11.04 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.28/11.04 % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.28/11.04 % Starting new_bool_3 with 888s (3) cores
% 0.28/11.04 % Starting new_bool_1 with 888s (3) cores
% 0.28/11.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/11.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/11.04 % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.28/11.04 % Scheduled 13 strats onto 3 cores with 888 seconds (888 total)
% 0.28/11.04 % Starting SubtermCWHack with 80s (1) cores
% 0.28/11.04 % Starting new_bool_1 with 89s (1) cores
% 0.28/11.04 % Preprocessing time : 0.176 s
% 0.28/11.04 % Presaturation interreduction done
% 0.28/11.04
% 0.28/11.04 % Proof found!
% 0.28/11.04 % SZS status Theorem
% 0.28/11.04 % SZS output start CNFRefutation
% See solution above
% 0.28/11.04 % Parsed axioms : 66047
% 0.28/11.04 % Removed by relevancy pruning/SinE : 64472
% 0.28/11.04 % Initial clauses : 3249
% 0.28/11.04 % Removed in clause preprocessing : 64
% 0.28/11.04 % Initial clauses in saturation : 3185
% 0.28/11.04 % Processed clauses : 16484
% 0.28/11.04 % ...of these trivial : 246
% 0.28/11.04 % ...subsumed : 7850
% 0.28/11.04 % ...remaining for further processing : 8388
% 0.28/11.04 % Other redundant clauses eliminated : 985
% 0.28/11.04 % Clauses deleted for lack of memory : 0
% 0.28/11.04 % Backward-subsumed : 45
% 0.28/11.04 % Backward-rewritten : 205
% 0.28/11.04 % Generated clauses : 63626
% 0.28/11.04 % ...of the previous two non-redundant : 56885
% 0.28/11.04 % ...aggressively subsumed : 0
% 0.28/11.04 % Contextual simplify-reflections : 221
% 0.28/11.04 % Paramodulations : 62634
% 0.28/11.04 % Factorizations : 7
% 0.28/11.04 % NegExts : 0
% 0.28/11.04 % Equation resolutions : 1000
% 0.28/11.04 % Disequality decompositions : 0
% 0.28/11.04 % Total rewrite steps : 15375
% 0.28/11.04 % ...of those cached : 12786
% 0.28/11.04 % Propositional unsat checks : 1
% 0.28/11.04 % Propositional check models : 1
% 0.28/11.04 % Propositional check unsatisfiable : 0
% 0.28/11.04 % Propositional clauses : 0
% 0.28/11.04 % Propositional clauses after purity: 0
% 0.28/11.04 % Propositional unsat core size : 0
% 0.28/11.04 % Propositional preprocessing time : 0.000
% 0.28/11.04 % Propositional encoding time : 0.059
% 0.28/11.04 % Propositional solver time : 0.028
% 0.28/11.04 % Success case prop preproc time : 0.000
% 0.28/11.04 % Success case prop encoding time : 0.000
% 0.28/11.04 % Success case prop solver time : 0.000
% 0.28/11.04 % Current number of processed clauses : 5077
% 0.28/11.04 % Positive orientable unit clauses : 1142
% 0.28/11.04 % Positive unorientable unit clauses: 7
% 0.28/11.04 % Negative unit clauses : 1535
% 0.28/11.04 % Non-unit-clauses : 2393
% 0.28/11.04 % Current number of unprocessed clauses: 46181
% 0.28/11.04 % ...number of literals in the above : 131137
% 0.28/11.04 % Current number of archived formulas : 0
% 0.28/11.04 % Current number of archived clauses : 3087
% 0.28/11.04 % Clause-clause subsumption calls (NU) : 4101019
% 0.28/11.04 % Rec. Clause-clause subsumption calls : 621370
% 0.28/11.04 % Non-unit clause-clause subsumptions : 1105
% 0.28/11.04 % Unit Clause-clause subsumption calls : 289198
% 0.28/11.04 % Rewrite failures with RHS unbound : 0
% 0.28/11.04 % BW rewrite match attempts : 490
% 0.28/11.04 % BW rewrite match successes : 363
% 0.28/11.04 % Condensation attempts : 0
% 0.28/11.04 % Condensation successes : 0
% 0.28/11.04 % Termbank termtop insertions : 3358057
% 0.28/11.04 % Search garbage collected termcells : 762507
% 0.28/11.04
% 0.28/11.04 % -------------------------------------------------
% 0.28/11.04 % User time : 5.184 s
% 0.28/11.04 % System time : 0.369 s
% 0.28/11.04 % Total time : 5.553 s
% 0.28/11.04 % Maximum resident set size: 138908 pages
% 0.28/11.04
% 0.28/11.04 % -------------------------------------------------
% 0.28/11.04 % User time : 19.142 s
% 0.28/11.04 % System time : 1.119 s
% 0.28/11.04 % Total time : 20.261 s
% 0.28/11.04 % Maximum resident set size: 112384 pages
% 0.28/11.04 % E exiting
%------------------------------------------------------------------------------