%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU214+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:24:17 PM UTC 2026
% Result : Theorem 200.52s 29.95s
% Output : CNFRefutation 200.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 196 ( 31 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 262 ( 102 ~; 103 |; 32 &)
% ( 7 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-5 aty)
% Number of variables : 74 ( 0 sgn 43 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2,X3] :
( ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) )
& ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
fof(t22_funct_1,conjecture,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X1,relation_dom(relation_composition(X3,X2)))
=> apply(relation_composition(X3,X2),X1) = apply(X2,apply(X3,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t22_funct_1) ).
fof(fc1_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2)
& function(X1)
& relation(X1) )
=> ( function(relation_composition(X1,X2))
& relation(relation_composition(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_funct_1) ).
fof(d8_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( relation(X3)
=> ( X3 = relation_composition(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ? [X6] :
( in(ordered_pair(X6,X5),X2)
& in(ordered_pair(X4,X6),X1) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_relat_1) ).
fof(dt_k5_relat_1,axiom,
! [X1,X2] :
( ( relation(X2)
& relation(X1) )
=> relation(relation_composition(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_relat_1) ).
fof(t8_funct_1,lemma,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( X2 = apply(X3,X1)
& in(X1,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_funct_1) ).
fof(c_0_6,plain,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2,X3] :
( ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) )
& ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d4_funct_1]) ).
fof(c_0_7,plain,
! [X10,X11,X12] :
( ( ~ function(X10)
| ~ relation(X10)
| in(X11,relation_dom(X10))
| X12 = apply(X10,X11)
| X12 != empty_set )
& ( ~ function(X10)
| ~ relation(X10)
| in(X11,relation_dom(X10))
| X12 = empty_set
| X12 != apply(X10,X11) )
& ( ~ function(X10)
| ~ relation(X10)
| ~ in(X11,relation_dom(X10))
| X12 = apply(X10,X11)
| ~ in(ordered_pair(X11,X12),X10) )
& ( ~ function(X10)
| ~ relation(X10)
| ~ in(X11,relation_dom(X10))
| in(ordered_pair(X11,X12),X10)
| X12 != apply(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X1,relation_dom(relation_composition(X3,X2)))
=> apply(relation_composition(X3,X2),X1) = apply(X2,apply(X3,X1)) ) ) ),
inference(assume_negation,[status(cth)],[t22_funct_1]) ).
cnf(c_0_9,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X2))
| X1 != apply(X2,X3)
| in(ordered_pair(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,negated_conjecture,
( apply(relation_composition(esk3_0,esk2_0),esk1_0) != apply(esk2_0,apply(esk3_0,esk1_0))
& in(esk1_0,relation_dom(relation_composition(esk3_0,esk2_0)))
& function(esk3_0)
& relation(esk3_0)
& function(esk2_0)
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_11,plain,
( ~ in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| in(ordered_pair(X1,apply(X2,X1)),X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,relation_dom(relation_composition(esk3_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X77,X78] :
( ( ~ function(X78)
| ~ relation(X78)
| ~ function(X77)
| ~ relation(X77)
| function(relation_composition(X77,X78)) )
& ( ~ function(X78)
| ~ relation(X78)
| ~ function(X77)
| ~ relation(X77)
| relation(relation_composition(X77,X78)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_funct_1])])])]) ).
fof(c_0_14,plain,
! [X19,X20,X21,X22,X23,X25,X26,X27,X30] :
( ( ~ relation(X19)
| ~ relation(X20)
| ~ relation(X21)
| X21 = relation_composition(X19,X20)
| in(ordered_pair(esk5_3(X19,X20,X21),esk6_3(X19,X20,X21)),X21)
| in(ordered_pair(esk7_3(X19,X20,X21),esk6_3(X19,X20,X21)),X20) )
& ( ~ relation(X19)
| ~ relation(X20)
| ~ relation(X21)
| X21 = relation_composition(X19,X20)
| in(ordered_pair(esk5_3(X19,X20,X21),esk6_3(X19,X20,X21)),X21)
| in(ordered_pair(esk5_3(X19,X20,X21),esk7_3(X19,X20,X21)),X19) )
& ( ~ relation(X19)
| ~ relation(X20)
| ~ relation(X21)
| X21 = relation_composition(X19,X20)
| ~ in(ordered_pair(X30,esk6_3(X19,X20,X21)),X20)
| ~ in(ordered_pair(esk5_3(X19,X20,X21),X30),X19)
| ~ in(ordered_pair(esk5_3(X19,X20,X21),esk6_3(X19,X20,X21)),X21) )
& ( ~ relation(X19)
| ~ relation(X20)
| ~ relation(X21)
| X21 != relation_composition(X19,X20)
| in(ordered_pair(X25,X26),X21)
| ~ in(ordered_pair(X27,X26),X20)
| ~ in(ordered_pair(X25,X27),X19) )
& ( ~ relation(X19)
| ~ relation(X20)
| ~ relation(X21)
| X21 != relation_composition(X19,X20)
| ~ in(ordered_pair(X22,X23),X21)
| in(ordered_pair(esk4_5(X19,X20,X21,X22,X23),X23),X20) )
& ( ~ relation(X19)
| ~ relation(X20)
| ~ relation(X21)
| X21 != relation_composition(X19,X20)
| ~ in(ordered_pair(X22,X23),X21)
| in(ordered_pair(X22,esk4_5(X19,X20,X21,X22,X23)),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)],[d8_relat_1])])])])])])]) ).
fof(c_0_15,plain,
! [X32,X33] :
( relation(relation_composition(X32,X33))
| ~ relation(X33)
| ~ relation(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ function(relation_composition(esk3_0,esk2_0))
| ~ relation(relation_composition(esk3_0,esk2_0))
| in(ordered_pair(esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0)),relation_composition(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| function(relation_composition(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( ~ relation(X2)
| ~ relation(X3)
| ~ relation(X4)
| X4 != relation_composition(X2,X3)
| ~ in(ordered_pair(X1,X5),X4)
| in(ordered_pair(X1,esk4_5(X2,X3,X4,X1,X5)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ relation(X2)
| ~ relation(X1)
| relation(relation_composition(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ~ relation(relation_composition(esk3_0,esk2_0))
| in(ordered_pair(esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0)),relation_composition(esk3_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
fof(c_0_25,lemma,
! [X16,X17,X18] :
( ( ~ function(X18)
| ~ relation(X18)
| in(ordered_pair(X16,X17),X18)
| X17 != apply(X18,X16)
| ~ in(X16,relation_dom(X18)) )
& ( ~ function(X18)
| ~ relation(X18)
| ~ in(ordered_pair(X16,X17),X18)
| X17 = apply(X18,X16) )
& ( ~ function(X18)
| ~ relation(X18)
| ~ in(ordered_pair(X16,X17),X18)
| in(X16,relation_dom(X18)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_funct_1])])])]) ).
cnf(c_0_26,plain,
( ~ in(ordered_pair(X1,X4),relation_composition(X2,X3))
| ~ relation(X2)
| ~ relation(X3)
| in(ordered_pair(X1,esk4_5(X2,X3,relation_composition(X2,X3),X1,X4)),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
in(ordered_pair(esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0)),relation_composition(esk3_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_18]),c_0_19])]) ).
cnf(c_0_28,plain,
( ~ relation(X1)
| ~ relation(X2)
| ~ relation(X3)
| X3 != relation_composition(X1,X2)
| ~ in(ordered_pair(X4,X5),X3)
| in(ordered_pair(esk4_5(X1,X2,X3,X4,X5),X5),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,lemma,
( ~ function(X2)
| ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2)
| X1 = apply(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
in(ordered_pair(esk1_0,esk4_5(esk3_0,esk2_0,relation_composition(esk3_0,esk2_0),esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0))),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]),c_0_19])]) ).
cnf(c_0_31,plain,
( ~ in(ordered_pair(X3,X4),relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2)
| in(ordered_pair(esk4_5(X1,X2,relation_composition(X1,X2),X3,X4),X4),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_23]) ).
cnf(c_0_32,lemma,
esk4_5(esk3_0,esk2_0,relation_composition(esk3_0,esk2_0),esk1_0,apply(relation_composition(esk3_0,esk2_0),esk1_0)) = apply(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19]),c_0_21])]) ).
cnf(c_0_33,negated_conjecture,
in(ordered_pair(apply(esk3_0,esk1_0),apply(relation_composition(esk3_0,esk2_0),esk1_0)),esk2_0),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_18]),c_0_19])]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
apply(relation_composition(esk3_0,esk2_0),esk1_0) != apply(esk2_0,apply(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_33]),c_0_18]),c_0_20])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU214+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n020.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 05:59:47 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.52 Running first-order theorem proving
% 0.17/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 200.52/29.95 % Version: 3.5.1
% 200.52/29.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 200.52/29.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.52/29.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 200.52/29.95 % Starting new_bool_3 with 300s (1) cores
% 200.52/29.95 % Starting new_bool_1 with 300s (1) cores
% 200.52/29.95 % Starting sh5l with 300s (1) cores
% 200.52/29.95 % new_bool_1 with pid 2159052 completed with status 0
% 200.52/29.95 % Result found by new_bool_1
% 200.52/29.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 200.52/29.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.52/29.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 200.52/29.95 % Starting new_bool_3 with 300s (1) cores
% 200.52/29.95 % Starting new_bool_1 with 300s (1) cores
% 200.52/29.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 200.52/29.95 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 200.52/29.95 % Search class: FGHSM-FFMM31-SFFFFFNN
% 200.52/29.95 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 200.52/29.95 % Starting SubtermCWHack with 28s (1) cores
% 200.52/29.95 % SubtermCWHack with pid 2159055 completed with status 8
% 200.52/29.95 % Starting new_bool_1 with 31s (1) cores
% 200.52/29.95 % new_bool_1 with pid 2159474 completed with status 0
% 200.52/29.95 % Result found by new_bool_1
% 200.52/29.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 200.52/29.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 200.52/29.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 200.52/29.95 % Starting new_bool_3 with 300s (1) cores
% 200.52/29.95 % Starting new_bool_1 with 300s (1) cores
% 200.52/29.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 200.52/29.95 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 200.52/29.95 % Search class: FGHSM-FFMM31-SFFFFFNN
% 200.52/29.95 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 200.52/29.95 % Starting SubtermCWHack with 28s (1) cores
% 200.52/29.95 % SubtermCWHack with pid 2159055 completed with status 8
% 200.52/29.95 % Starting new_bool_1 with 31s (1) cores
% 200.52/29.95 % Preprocessing time : 0.005 s
% 200.52/29.95 % Presaturation interreduction done
% 200.52/29.95
% 200.52/29.95 % Proof found!
% 200.52/29.95 % SZS status Theorem
% 200.52/29.95 % SZS output start CNFRefutation
% See solution above
% 200.52/29.95 % Parsed axioms : 218
% 200.52/29.95 % Removed by relevancy pruning/SinE : 154
% 200.52/29.95 % Initial clauses : 125
% 200.52/29.95 % Removed in clause preprocessing : 2
% 200.52/29.95 % Initial clauses in saturation : 123
% 200.52/29.95 % Processed clauses : 1798
% 200.52/29.95 % ...of these trivial : 7
% 200.52/29.95 % ...subsumed : 1263
% 200.52/29.95 % ...remaining for further processing : 528
% 200.52/29.95 % Other redundant clauses eliminated : 83
% 200.52/29.95 % Clauses deleted for lack of memory : 0
% 200.52/29.95 % Backward-subsumed : 33
% 200.52/29.95 % Backward-rewritten : 12
% 200.52/29.95 % Generated clauses : 6595
% 200.52/29.95 % ...of the previous two non-redundant : 5972
% 200.52/29.95 % ...aggressively subsumed : 0
% 200.52/29.95 % Contextual simplify-reflections : 7
% 200.52/29.95 % Paramodulations : 6506
% 200.52/29.95 % Factorizations : 4
% 200.52/29.95 % NegExts : 0
% 200.52/29.95 % Equation resolutions : 85
% 200.52/29.95 % Disequality decompositions : 0
% 200.52/29.95 % Total rewrite steps : 1795
% 200.52/29.95 % ...of those cached : 1727
% 200.52/29.95 % Propositional unsat checks : 0
% 200.52/29.95 % Propositional check models : 0
% 200.52/29.95 % Propositional check unsatisfiable : 0
% 200.52/29.95 % Propositional clauses : 0
% 200.52/29.95 % Propositional clauses after purity: 0
% 200.52/29.95 % Propositional unsat core size : 0
% 200.52/29.95 % Propositional preprocessing time : 0.000
% 200.52/29.95 % Propositional encoding time : 0.000
% 200.52/29.95 % Propositional solver time : 0.000
% 200.52/29.95 % Success case prop preproc time : 0.000
% 200.52/29.95 % Success case prop encoding time : 0.000
% 200.52/29.95 % Success case prop solver time : 0.000
% 200.52/29.95 % Current number of processed clauses : 357
% 200.52/29.95 % Positive orientable unit clauses : 52
% 200.52/29.95 % Positive unorientable unit clauses: 0
% 200.52/29.95 % Negative unit clauses : 26
% 200.52/29.95 % Non-unit-clauses : 279
% 200.52/29.95 % Current number of unprocessed clauses: 4346
% 200.52/29.95 % ...number of literals in the above : 21071
% 200.52/29.95 % Current number of archived formulas : 0
% 200.52/29.95 % Current number of archived clauses : 155
% 200.52/29.95 % Clause-clause subsumption calls (NU) : 12891
% 200.52/29.95 % Rec. Clause-clause subsumption calls : 8551
% 200.52/29.95 % Non-unit clause-clause subsumptions : 581
% 200.52/29.95 % Unit Clause-clause subsumption calls : 179
% 200.52/29.95 % Rewrite failures with RHS unbound : 0
% 200.52/29.95 % BW rewrite match attempts : 15
% 200.52/29.95 % BW rewrite match successes : 8
% 200.52/29.95 % Condensation attempts : 0
% 200.52/29.95 % Condensation successes : 0
% 200.52/29.95 % Termbank termtop insertions : 89573
% 200.52/29.95 % Search garbage collected termcells : 3120
% 200.52/29.95
% 200.52/29.95 % -------------------------------------------------
% 200.52/29.95 % User time : 27.251 s
% 200.52/29.95 % System time : 1.222 s
% 200.52/29.95 % Total time : 28.473 s
% 200.52/29.95 % Maximum resident set size: 4108 pages
% 200.52/29.95
% 200.52/29.95 % -------------------------------------------------
% 200.52/29.95 % User time : 27.262 s
% 200.52/29.95 % System time : 1.231 s
% 200.52/29.95 % Total time : 28.493 s
% 200.52/29.95 % Maximum resident set size: 4864 pages
% 200.52/29.95 % E exiting
%------------------------------------------------------------------------------