%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU292+1 : 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 : n013.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:35 PM UTC 2026
% Result : Theorem 0.14s 0.61s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 21 unt; 0 def)
% Number of atoms : 154 ( 48 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 152 ( 49 ~; 51 |; 32 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 73 ( 2 sgn 48 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_funct_1,axiom,
? [X1] :
( function(X1)
& empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_funct_1) ).
fof(t21_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ! [X5] :
( ( function(X5)
& relation(X5) )
=> ( in(X3,X1)
=> ( apply(relation_composition(X4,X5),X3) = apply(X5,apply(X4,X3))
| X2 = empty_set ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t21_funct_2) ).
fof(rc1_partfun1,axiom,
? [X1] :
( empty(X1)
& one_to_one(X1)
& function(X1)
& relation(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_partfun1) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( X2 = empty_set
=> ( ( quasi_total(X3,X1,X2)
<=> X3 = empty_set )
| X1 = empty_set ) )
& ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_funct_2) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_relset_1) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k4_relset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(t23_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
fof(c_0_10,plain,
! [X91] :
( X91 = empty_set
| ~ empty(X91) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_11,plain,
( function(esk10_0)
& empty(esk10_0)
& relation(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
cnf(c_0_12,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
empty(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( relation_of2_as_subset(X4,X1,X2)
& quasi_total(X4,X1,X2)
& function(X4) )
=> ! [X5] :
( ( function(X5)
& relation(X5) )
=> ( in(X3,X1)
=> ( apply(relation_composition(X4,X5),X3) = apply(X5,apply(X4,X3))
| X2 = empty_set ) ) ) ),
inference(assume_negation,[status(cth)],[t21_funct_2]) ).
cnf(c_0_15,plain,
empty_set = esk10_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
( empty(esk6_0)
& one_to_one(esk6_0)
& function(esk6_0)
& relation(esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_partfun1])]) ).
fof(c_0_17,negated_conjecture,
( apply(relation_composition(esk21_0,esk22_0),esk20_0) != apply(esk22_0,apply(esk21_0,esk20_0))
& esk19_0 != empty_set
& in(esk20_0,esk18_0)
& function(esk22_0)
& relation(esk22_0)
& relation_of2_as_subset(esk21_0,esk18_0,esk19_0)
& quasi_total(esk21_0,esk18_0,esk19_0)
& function(esk21_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_18,plain,
! [X14,X15,X16] :
( ( ~ relation_of2_as_subset(X16,X14,X15)
| X15 != empty_set
| X14 = empty_set
| quasi_total(X16,X14,X15)
| X16 != empty_set )
& ( ~ relation_of2_as_subset(X16,X14,X15)
| X15 != empty_set
| X14 = empty_set
| X16 = empty_set
| ~ quasi_total(X16,X14,X15) )
& ( ~ relation_of2_as_subset(X16,X14,X15)
| X14 != empty_set
| quasi_total(X16,X14,X15)
| X14 != relation_dom_as_subset(X14,X15,X16) )
& ( ~ relation_of2_as_subset(X16,X14,X15)
| X14 != empty_set
| X14 = relation_dom_as_subset(X14,X15,X16)
| ~ quasi_total(X16,X14,X15) )
& ( ~ relation_of2_as_subset(X16,X14,X15)
| X15 = empty_set
| quasi_total(X16,X14,X15)
| X14 != relation_dom_as_subset(X14,X15,X16) )
& ( ~ relation_of2_as_subset(X16,X14,X15)
| X15 = empty_set
| X14 = relation_dom_as_subset(X14,X15,X16)
| ~ quasi_total(X16,X14,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])])]) ).
cnf(c_0_19,plain,
( ~ empty(X1)
| X1 = esk10_0 ),
inference(rw,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_20,plain,
empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk19_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| ~ quasi_total(X1,X2,X3)
| X3 = empty_set
| X2 = relation_dom_as_subset(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
esk10_0 = esk6_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
esk19_0 != esk10_0,
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_25,plain,
! [X67,X68,X69] :
( ( relation_of2_as_subset(X69,X67,X68)
| ~ relation_of2(X69,X67,X68) )
& ( relation_of2(X69,X67,X68)
| ~ relation_of2_as_subset(X69,X67,X68) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
fof(c_0_26,plain,
! [X22,X23,X24] :
( element(X24,powerset(cartesian_product2(X22,X23)))
| ~ relation_of2_as_subset(X24,X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
fof(c_0_27,plain,
! [X64,X65,X66] :
( relation_dom_as_subset(X64,X65,X66) = relation_dom(X66)
| ~ relation_of2(X66,X64,X65) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])])]) ).
cnf(c_0_28,plain,
( ~ relation_of2_as_subset(X3,X1,X2)
| ~ quasi_total(X3,X1,X2)
| X2 = esk6_0
| relation_dom_as_subset(X1,X2,X3) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
quasi_total(esk21_0,esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
relation_of2_as_subset(esk21_0,esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
esk19_0 != esk6_0,
inference(rw,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_32,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X10,X11,X12] :
( relation(X12)
| ~ element(X12,powerset(cartesian_product2(X10,X11))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
cnf(c_0_34,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
( ~ relation_of2(X1,X2,X3)
| relation_dom_as_subset(X2,X3,X1) = relation_dom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
relation_dom_as_subset(esk18_0,esk19_0,esk21_0) = esk18_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
relation_of2(esk21_0,esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
fof(c_0_38,plain,
! [X78,X79,X80] :
( apply(relation_composition(X79,X80),X78) = apply(X80,apply(X79,X78))
| ~ in(X78,relation_dom(X79))
| ~ function(X80)
| ~ relation(X80)
| ~ function(X79)
| ~ relation(X79) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])])]) ).
cnf(c_0_39,plain,
( ~ element(X1,powerset(cartesian_product2(X2,X3)))
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,negated_conjecture,
element(esk21_0,powerset(cartesian_product2(esk18_0,esk19_0))),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
in(esk20_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_42,negated_conjecture,
esk18_0 = relation_dom(esk21_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
apply(relation_composition(esk21_0,esk22_0),esk20_0) != apply(esk22_0,apply(esk21_0,esk20_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_44,plain,
( ~ in(X3,relation_dom(X1))
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
relation(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_46,negated_conjecture,
relation(esk21_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
function(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_48,negated_conjecture,
function(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_49,negated_conjecture,
in(esk20_0,relation_dom(esk21_0)),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_47]),c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU292+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.53 % Computer : n013.cluster.edu
% 0.10/0.53 % Model : x86_64 x86_64
% 0.10/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.53 % Memory : 8046.5625MB
% 0.10/0.53 % OS : Linux 6.8.0-71-generic
% 0.10/0.53 % CPULimit : 300
% 0.10/0.53 % WCLimit : 300
% 0.10/0.53 % DateTime : Mon Sep 21 06:08:07 UTC 2026
% 0.10/0.53 % CPUTime :
% 0.10/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.56 Running first-order theorem proving
% 0.14/0.57 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
% 0.14/0.61 % Version: 3.5.1
% 0.14/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.61 % Starting sh5l with 300s (1) cores
% 0.14/0.61 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 96201 completed with status 0
% 0.14/0.61 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.61 % No SInE strategy applied
% 0.14/0.61 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.61 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.14/0.61 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.61 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.61 % G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 96211 completed with status 0
% 0.14/0.61 % Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.61 % No SInE strategy applied
% 0.14/0.61 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.61 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.14/0.61 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.61 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.61 % Preprocessing time : 0.002 s
% 0.14/0.61 % Presaturation interreduction done
% 0.14/0.61
% 0.14/0.61 % Proof found!
% 0.14/0.61 % SZS status Theorem
% 0.14/0.61 % SZS output start CNFRefutation
% See solution above
% 0.14/0.61 % Parsed axioms : 56
% 0.14/0.61 % Removed by relevancy pruning/SinE : 0
% 0.14/0.61 % Initial clauses : 99
% 0.14/0.61 % Removed in clause preprocessing : 9
% 0.14/0.61 % Initial clauses in saturation : 90
% 0.14/0.61 % Processed clauses : 292
% 0.14/0.61 % ...of these trivial : 5
% 0.14/0.61 % ...subsumed : 32
% 0.14/0.61 % ...remaining for further processing : 255
% 0.14/0.61 % Other redundant clauses eliminated : 6
% 0.14/0.61 % Clauses deleted for lack of memory : 0
% 0.14/0.61 % Backward-subsumed : 2
% 0.14/0.61 % Backward-rewritten : 28
% 0.14/0.61 % Generated clauses : 235
% 0.14/0.61 % ...of the previous two non-redundant : 198
% 0.14/0.61 % ...aggressively subsumed : 0
% 0.14/0.61 % Contextual simplify-reflections : 3
% 0.14/0.61 % Paramodulations : 228
% 0.14/0.61 % Factorizations : 0
% 0.14/0.61 % NegExts : 0
% 0.14/0.61 % Equation resolutions : 6
% 0.14/0.61 % Disequality decompositions : 0
% 0.14/0.61 % Total rewrite steps : 132
% 0.14/0.61 % ...of those cached : 100
% 0.14/0.61 % Propositional unsat checks : 0
% 0.14/0.61 % Propositional check models : 0
% 0.14/0.61 % Propositional check unsatisfiable : 0
% 0.14/0.61 % Propositional clauses : 0
% 0.14/0.61 % Propositional clauses after purity: 0
% 0.14/0.61 % Propositional unsat core size : 0
% 0.14/0.61 % Propositional preprocessing time : 0.000
% 0.14/0.61 % Propositional encoding time : 0.000
% 0.14/0.61 % Propositional solver time : 0.000
% 0.14/0.61 % Success case prop preproc time : 0.000
% 0.14/0.61 % Success case prop encoding time : 0.000
% 0.14/0.61 % Success case prop solver time : 0.000
% 0.14/0.61 % Current number of processed clauses : 133
% 0.14/0.61 % Positive orientable unit clauses : 50
% 0.14/0.61 % Positive unorientable unit clauses: 0
% 0.14/0.61 % Negative unit clauses : 14
% 0.14/0.61 % Non-unit-clauses : 69
% 0.14/0.61 % Current number of unprocessed clauses: 74
% 0.14/0.61 % ...number of literals in the above : 198
% 0.14/0.61 % Current number of archived formulas : 0
% 0.14/0.61 % Current number of archived clauses : 118
% 0.14/0.61 % Clause-clause subsumption calls (NU) : 835
% 0.14/0.61 % Rec. Clause-clause subsumption calls : 712
% 0.14/0.61 % Non-unit clause-clause subsumptions : 21
% 0.14/0.61 % Unit Clause-clause subsumption calls : 170
% 0.14/0.61 % Rewrite failures with RHS unbound : 0
% 0.14/0.61 % BW rewrite match attempts : 7
% 0.14/0.61 % BW rewrite match successes : 6
% 0.14/0.61 % Condensation attempts : 0
% 0.14/0.61 % Condensation successes : 0
% 0.14/0.61 % Termbank termtop insertions : 7146
% 0.14/0.61 % Search garbage collected termcells : 779
% 0.14/0.61
% 0.14/0.61 % -------------------------------------------------
% 0.14/0.61 % User time : 0.016 s
% 0.14/0.61 % System time : 0.007 s
% 0.14/0.61 % Total time : 0.023 s
% 0.14/0.61 % Maximum resident set size: 3680 pages
% 0.14/0.61
% 0.14/0.61 % -------------------------------------------------
% 0.14/0.61 % User time : 0.078 s
% 0.14/0.61 % System time : 0.023 s
% 0.14/0.61 % Total time : 0.100 s
% 0.14/0.61 % Maximum resident set size: 4864 pages
% 0.14/0.61 % E exiting
%------------------------------------------------------------------------------