%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU182+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 : n012.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:09 PM UTC 2026
% Result : Theorem 2.33s 0.79s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 191 ( 39 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 267 ( 116 ~; 122 |; 14 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 2 con; 0-5 aty)
% Number of variables : 130 ( 5 sgn 48 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
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(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
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(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t44_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> subset(relation_dom(relation_composition(X1,X2)),relation_dom(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_relat_1) ).
fof(c_0_7,plain,
! [X17,X18,X19,X21,X22,X23,X25] :
( ( ~ relation(X17)
| X23 = relation_dom(X17)
| in(ordered_pair(esk3_2(X17,X23),esk4_2(X17,X23)),X17)
| in(esk3_2(X17,X23),X23) )
& ( ~ relation(X17)
| X23 = relation_dom(X17)
| ~ in(ordered_pair(esk3_2(X17,X23),X25),X17)
| ~ in(esk3_2(X17,X23),X23) )
& ( ~ relation(X17)
| X18 != relation_dom(X17)
| in(X21,X18)
| ~ in(ordered_pair(X21,X22),X17) )
& ( ~ relation(X17)
| X18 != relation_dom(X17)
| in(ordered_pair(X19,esk2_3(X17,X18,X19)),X17)
| ~ in(X19,X18) ) ),
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)],[d4_relat_1])])])])])])]) ).
fof(c_0_8,plain,
! [X27,X28] : ordered_pair(X27,X28) = unordered_pair(unordered_pair(X27,X28),singleton(X27)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,plain,
! [X29,X30,X31,X32,X33,X35,X36,X37,X40] :
( ( ~ relation(X29)
| ~ relation(X30)
| ~ relation(X31)
| X31 = relation_composition(X29,X30)
| in(ordered_pair(esk6_3(X29,X30,X31),esk7_3(X29,X30,X31)),X31)
| in(ordered_pair(esk8_3(X29,X30,X31),esk7_3(X29,X30,X31)),X30) )
& ( ~ relation(X29)
| ~ relation(X30)
| ~ relation(X31)
| X31 = relation_composition(X29,X30)
| in(ordered_pair(esk6_3(X29,X30,X31),esk7_3(X29,X30,X31)),X31)
| in(ordered_pair(esk6_3(X29,X30,X31),esk8_3(X29,X30,X31)),X29) )
& ( ~ relation(X29)
| ~ relation(X30)
| ~ relation(X31)
| X31 = relation_composition(X29,X30)
| ~ in(ordered_pair(X40,esk7_3(X29,X30,X31)),X30)
| ~ in(ordered_pair(esk6_3(X29,X30,X31),X40),X29)
| ~ in(ordered_pair(esk6_3(X29,X30,X31),esk7_3(X29,X30,X31)),X31) )
& ( ~ relation(X29)
| ~ relation(X30)
| ~ relation(X31)
| X31 != relation_composition(X29,X30)
| in(ordered_pair(X35,X36),X31)
| ~ in(ordered_pair(X37,X36),X30)
| ~ in(ordered_pair(X35,X37),X29) )
& ( ~ relation(X29)
| ~ relation(X30)
| ~ relation(X31)
| X31 != relation_composition(X29,X30)
| ~ in(ordered_pair(X32,X33),X31)
| in(ordered_pair(esk5_5(X29,X30,X31,X32,X33),X33),X30) )
& ( ~ relation(X29)
| ~ relation(X30)
| ~ relation(X31)
| X31 != relation_composition(X29,X30)
| ~ in(ordered_pair(X32,X33),X31)
| in(ordered_pair(X32,esk5_5(X29,X30,X31,X32,X33)),X29) ) ),
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])])])])])])]) ).
cnf(c_0_10,plain,
( ~ relation(X3)
| X4 != relation_dom(X3)
| ~ in(ordered_pair(X1,X2),X3)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_13,plain,
( ~ relation(X2)
| ~ relation(X3)
| ~ relation(X4)
| X4 != relation_composition(X2,X3)
| ~ in(ordered_pair(X1,X5),X4)
| in(ordered_pair(X1,esk5_5(X2,X3,X4,X1,X5)),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ relation(X3)
| X4 != relation_dom(X3)
| in(X1,X4) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4)
| ~ relation(X2)
| ~ relation(X3)
| ~ relation(X4)
| X4 != relation_composition(X2,X3)
| in(unordered_pair(unordered_pair(X1,esk5_5(X2,X3,X4,X1,X5)),singleton(X1)),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]) ).
cnf(c_0_17,plain,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X4)),X3)
| ~ relation(X3)
| X2 != relation_dom(X3)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X1)),X4)
| ~ relation(X2)
| ~ relation(X3)
| ~ relation(X4)
| X4 != relation_composition(X2,X3)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk5_5(X2,X3,X4,X1,X5))),X2) ),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
( ~ relation(X3)
| X2 != relation_dom(X3)
| ~ in(X1,X2)
| in(ordered_pair(X1,esk2_3(X3,X2,X1)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( ~ in(unordered_pair(unordered_pair(X1,X6),singleton(X1)),X3)
| ~ relation(X5)
| ~ relation(X3)
| ~ relation(X4)
| X2 != relation_dom(X4)
| X3 != relation_composition(X4,X5)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_dom(X3)
| in(unordered_pair(unordered_pair(X1,esk2_3(X3,X2,X1)),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_22,plain,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X6)),X3)
| ~ relation(X5)
| ~ relation(X3)
| ~ relation(X4)
| X2 != relation_dom(X4)
| X3 != relation_composition(X4,X5)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_23,plain,
( ~ in(X1,X3)
| ~ relation(X2)
| X3 != relation_dom(X2)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk2_3(X2,X3,X1))),X2) ),
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_24,plain,
! [X42,X43] :
( relation(relation_composition(X42,X43))
| ~ relation(X43)
| ~ relation(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])])]) ).
cnf(c_0_25,plain,
( ~ in(X1,X6)
| ~ relation(X5)
| ~ relation(X3)
| ~ relation(X4)
| X6 != relation_dom(X3)
| X2 != relation_dom(X4)
| X3 != relation_composition(X4,X5)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ relation(X2)
| ~ relation(X1)
| relation(relation_composition(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( ~ in(X1,X3)
| ~ relation(X5)
| ~ relation(X4)
| X2 != relation_dom(X4)
| X3 != relation_dom(relation_composition(X4,X5))
| in(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]) ).
fof(c_0_28,plain,
! [X11,X12,X13,X14,X15] :
( ( subset(X14,X15)
| ~ in(esk1_2(X14,X15),X15) )
& ( subset(X14,X15)
| in(esk1_2(X14,X15),X14) )
& ( in(X13,X12)
| ~ in(X13,X11)
| ~ subset(X11,X12) ) ),
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_29,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> subset(relation_dom(relation_composition(X1,X2)),relation_dom(X1)) ) ),
inference(assume_negation,[status(cth)],[t44_relat_1]) ).
cnf(c_0_30,plain,
( ~ in(X1,relation_dom(relation_composition(X3,X4)))
| ~ relation(X4)
| ~ relation(X3)
| X2 != relation_dom(X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,negated_conjecture,
( ~ subset(relation_dom(relation_composition(esk15_0,esk16_0)),relation_dom(esk15_0))
& relation(esk16_0)
& relation(esk15_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
cnf(c_0_33,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( ~ relation(X2)
| ~ relation(X1)
| X4 != relation_dom(X1)
| in(esk1_2(relation_dom(relation_composition(X1,X2)),X3),X4)
| subset(relation_dom(relation_composition(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
~ subset(relation_dom(relation_composition(esk15_0,esk16_0)),relation_dom(esk15_0)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,plain,
( ~ relation(X2)
| ~ relation(X1)
| X3 != relation_dom(X1)
| subset(relation_dom(relation_composition(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
relation(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU182+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n012.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:55:37 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 2.33/0.79 % Version: 3.5.1
% 2.33/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.33/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.33/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.33/0.79 % Starting new_bool_3 with 300s (1) cores
% 2.33/0.79 % Starting new_bool_1 with 300s (1) cores
% 2.33/0.79 % Starting sh5l with 300s (1) cores
% 2.33/0.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1693534 completed with status 0
% 2.33/0.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.33/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.33/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.33/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.33/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.33/0.79 % No SInE strategy applied
% 2.33/0.79 % Search class: FGHSM-FFMM32-MFFFFFNN
% 2.33/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.33/0.79 % Starting SubtermCWHack with 136s (1) cores
% 2.33/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.33/0.79 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 2.33/0.79 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 2.33/0.79 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 2.33/0.79 % G-E--_300_C18_F1_URBAN_S0Y with pid 1693543 completed with status 0
% 2.33/0.79 % Result found by G-E--_300_C18_F1_URBAN_S0Y
% 2.33/0.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.33/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.33/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.33/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.33/0.79 % No SInE strategy applied
% 2.33/0.79 % Search class: FGHSM-FFMM32-MFFFFFNN
% 2.33/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.33/0.79 % Starting SubtermCWHack with 136s (1) cores
% 2.33/0.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.33/0.79 % Starting G-E--_300_C18_F1_URBAN_S0Y with 369s (1) cores
% 2.33/0.79 % Preprocessing time : 0.002 s
% 2.33/0.79
% 2.33/0.79 % Proof found!
% 2.33/0.79 % SZS status Theorem
% 2.33/0.79 % SZS output start CNFRefutation
% See solution above
% 2.33/0.79 % Parsed axioms : 35
% 2.33/0.79 % Removed by relevancy pruning/SinE : 0
% 2.33/0.79 % Initial clauses : 51
% 2.33/0.79 % Removed in clause preprocessing : 8
% 2.33/0.79 % Initial clauses in saturation : 43
% 2.33/0.79 % Processed clauses : 966
% 2.33/0.79 % ...of these trivial : 7
% 2.33/0.79 % ...subsumed : 276
% 2.33/0.79 % ...remaining for further processing : 683
% 2.33/0.79 % Other redundant clauses eliminated : 0
% 2.33/0.79 % Clauses deleted for lack of memory : 0
% 2.33/0.79 % Backward-subsumed : 28
% 2.33/0.79 % Backward-rewritten : 16
% 2.33/0.79 % Generated clauses : 7394
% 2.33/0.79 % ...of the previous two non-redundant : 7213
% 2.33/0.79 % ...aggressively subsumed : 0
% 2.33/0.79 % Contextual simplify-reflections : 23
% 2.33/0.79 % Paramodulations : 7253
% 2.33/0.79 % Factorizations : 60
% 2.33/0.79 % NegExts : 0
% 2.33/0.79 % Equation resolutions : 79
% 2.33/0.79 % Disequality decompositions : 0
% 2.33/0.79 % Total rewrite steps : 867
% 2.33/0.79 % ...of those cached : 822
% 2.33/0.79 % Propositional unsat checks : 0
% 2.33/0.79 % Propositional check models : 0
% 2.33/0.79 % Propositional check unsatisfiable : 0
% 2.33/0.79 % Propositional clauses : 0
% 2.33/0.79 % Propositional clauses after purity: 0
% 2.33/0.79 % Propositional unsat core size : 0
% 2.33/0.79 % Propositional preprocessing time : 0.000
% 2.33/0.79 % Propositional encoding time : 0.000
% 2.33/0.79 % Propositional solver time : 0.000
% 2.33/0.79 % Success case prop preproc time : 0.000
% 2.33/0.79 % Success case prop encoding time : 0.000
% 2.33/0.79 % Success case prop solver time : 0.000
% 2.33/0.79 % Current number of processed clauses : 637
% 2.33/0.79 % Positive orientable unit clauses : 16
% 2.33/0.79 % Positive unorientable unit clauses: 1
% 2.33/0.79 % Negative unit clauses : 13
% 2.33/0.79 % Non-unit-clauses : 607
% 2.33/0.79 % Current number of unprocessed clauses: 6198
% 2.33/0.79 % ...number of literals in the above : 40206
% 2.33/0.79 % Current number of archived formulas : 0
% 2.33/0.79 % Current number of archived clauses : 47
% 2.33/0.79 % Clause-clause subsumption calls (NU) : 95291
% 2.33/0.79 % Rec. Clause-clause subsumption calls : 14002
% 2.33/0.79 % Non-unit clause-clause subsumptions : 274
% 2.33/0.79 % Unit Clause-clause subsumption calls : 962
% 2.33/0.79 % Rewrite failures with RHS unbound : 0
% 2.33/0.79 % BW rewrite match attempts : 14
% 2.33/0.79 % BW rewrite match successes : 11
% 2.33/0.79 % Condensation attempts : 0
% 2.33/0.79 % Condensation successes : 0
% 2.33/0.79 % Termbank termtop insertions : 284898
% 2.33/0.79 % Search garbage collected termcells : 754
% 2.33/0.79
% 2.33/0.79 % -------------------------------------------------
% 2.33/0.79 % User time : 0.347 s
% 2.33/0.79 % System time : 0.018 s
% 2.33/0.79 % Total time : 0.365 s
% 2.33/0.79 % Maximum resident set size: 3608 pages
% 2.33/0.79
% 2.33/0.79 % -------------------------------------------------
% 2.33/0.79 % User time : 1.753 s
% 2.33/0.79 % System time : 0.068 s
% 2.33/0.79 % Total time : 1.821 s
% 2.33/0.79 % Maximum resident set size: 4864 pages
% 2.33/0.79 % E exiting
%------------------------------------------------------------------------------