%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP775+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 12:45:07 PM UTC 2026
% Result : Theorem 2.66s 0.86s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 17 unt; 0 def)
% Number of atoms : 131 ( 72 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 113 ( 41 ~; 54 |; 13 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X11,X12] :
( d(X11,X12)
<=> ( product(X12,product(X11,X12)) = X12
& product(X11,product(X12,X11)) = X11 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos01,axiom,
! [X1,X2,X3] : product(product(X3,X2),X1) = product(X3,product(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos01) ).
fof(sos02,axiom,
! [X3] : product(X3,X3) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos02) ).
fof(sos05,axiom,
! [X8,X9] :
( d(X8,X9)
<=> ? [X10] :
( l(X10,X9)
& r(X8,X10) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos05) ).
fof(sos03,axiom,
! [X4,X5] :
( l(X4,X5)
<=> ( product(X5,X4) = X5
& product(X4,X5) = X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos03) ).
fof(sos04,axiom,
! [X6,X7] :
( r(X6,X7)
<=> ( product(X7,X6) = X6
& product(X6,X7) = X7 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos04) ).
fof(c_0_6,negated_conjecture,
~ ! [X11,X12] :
( d(X11,X12)
<=> ( product(X12,product(X11,X12)) = X12
& product(X11,product(X12,X11)) = X11 ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X13,X14,X15] : product(product(X15,X14),X13) = product(X15,product(X14,X13)),
inference(variable_rename,[status(thm)],[sos01]) ).
fof(c_0_8,plain,
! [X16] : product(X16,X16) = X16,
inference(variable_rename,[status(thm)],[sos02]) ).
fof(c_0_9,plain,
! [X21,X22,X24,X25,X26] :
( ( d(X24,X25)
| ~ l(X26,X25)
| ~ r(X24,X26) )
& ( ~ d(X21,X22)
| l(esk1_2(X21,X22),X22) )
& ( ~ d(X21,X22)
| r(X21,esk1_2(X21,X22)) ) ),
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)],[sos05])])])])])])]) ).
fof(c_0_10,negated_conjecture,
( ( d(esk2_0,esk3_0)
| product(esk3_0,product(esk2_0,esk3_0)) = esk3_0 )
& ( d(esk2_0,esk3_0)
| product(esk2_0,product(esk3_0,esk2_0)) = esk2_0 )
& ( product(esk3_0,product(esk2_0,esk3_0)) != esk3_0
| product(esk2_0,product(esk3_0,esk2_0)) != esk2_0
| ~ d(esk2_0,esk3_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_11,plain,
! [X17,X18] :
( ( l(X17,X18)
| product(X18,X17) != X18
| product(X17,X18) != X17 )
& ( ~ l(X17,X18)
| product(X18,X17) = X18 )
& ( ~ l(X17,X18)
| product(X17,X18) = X17 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos03])])])]) ).
cnf(c_0_12,plain,
product(product(X1,X2),X3) = product(X1,product(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
product(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X19,X20] :
( ( r(X19,X20)
| product(X20,X19) != X19
| product(X19,X20) != X20 )
& ( ~ r(X19,X20)
| product(X20,X19) = X19 )
& ( ~ r(X19,X20)
| product(X19,X20) = X20 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos04])])])]) ).
cnf(c_0_15,plain,
( ~ d(X1,X2)
| r(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( d(esk2_0,esk3_0)
| product(esk3_0,product(esk2_0,esk3_0)) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( product(X2,X1) != X2
| product(X1,X2) != X1
| l(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ d(X1,X2)
| l(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( d(esk2_0,esk3_0)
| product(esk2_0,product(esk3_0,esk2_0)) = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
product(X1,product(X1,X2)) = product(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
( ~ r(X1,X2)
| product(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( r(esk2_0,esk1_2(esk2_0,esk3_0))
| product(esk3_0,product(esk2_0,esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( product(X1,product(X2,X3)) != X1
| product(X2,product(X3,X1)) != product(X2,X3)
| l(X1,product(X2,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_24,plain,
( ~ l(X1,X2)
| product(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( l(esk1_2(esk2_0,esk3_0),esk3_0)
| product(esk2_0,product(esk3_0,esk2_0)) = esk2_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
product(X1,product(X2,product(X1,product(X2,X3)))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_12]),c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( product(esk3_0,product(esk2_0,esk3_0)) = esk3_0
| product(esk2_0,esk1_2(esk2_0,esk3_0)) = esk1_2(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ l(X2,X1)
| product(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( l(esk1_2(esk2_0,esk3_0),esk3_0)
| product(esk3_0,product(esk2_0,esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_30,plain,
( product(X1,product(X2,X1)) != X1
| l(X1,product(X2,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_31,plain,
product(X1,product(X2,product(X1,X2))) = product(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_32,plain,
( ~ r(X2,X1)
| product(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,negated_conjecture,
( r(esk2_0,esk1_2(esk2_0,esk3_0))
| product(esk2_0,product(esk3_0,esk2_0)) = esk2_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_34,negated_conjecture,
( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
| product(esk1_2(esk2_0,esk3_0),esk3_0) = esk1_2(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( product(esk3_0,product(esk2_0,esk3_0)) = esk3_0
| product(X1,product(esk2_0,product(X1,esk1_2(esk2_0,esk3_0)))) = product(X1,esk1_2(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( product(esk3_0,esk1_2(esk2_0,esk3_0)) = esk3_0
| product(esk3_0,product(esk2_0,esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ l(X2,X3)
| ~ r(X1,X2)
| d(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,plain,
l(product(X1,product(X2,X1)),product(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_12]),c_0_13])]) ).
cnf(c_0_39,negated_conjecture,
( product(esk1_2(esk2_0,esk3_0),esk2_0) = esk2_0
| product(esk2_0,product(esk3_0,esk2_0)) = esk2_0 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
| product(esk1_2(esk2_0,esk3_0),product(esk3_0,X1)) = product(esk1_2(esk2_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
product(esk3_0,product(esk2_0,esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( ~ r(X1,product(X3,product(X2,X3)))
| d(X1,product(X2,X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( product(X2,X1) != X1
| product(X1,X2) != X2
| r(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
| product(esk1_2(esk2_0,esk3_0),product(esk2_0,X1)) = product(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
| product(esk1_2(esk2_0,esk3_0),product(esk2_0,esk3_0)) = product(esk1_2(esk2_0,esk3_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( ~ r(X1,product(X3,product(X2,product(X3,X4))))
| d(X1,product(X2,product(X3,X4))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_26]),c_0_12]),c_0_13]) ).
cnf(c_0_47,plain,
( product(X1,product(X2,X1)) != X1
| r(product(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_20]),c_0_12]) ).
cnf(c_0_48,negated_conjecture,
( product(esk2_0,product(esk3_0,esk2_0)) = esk2_0
| product(esk1_2(esk2_0,esk3_0),esk3_0) = product(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( ~ r(X1,product(X3,X2))
| d(X1,product(X2,product(X3,X2))) ),
inference(spm,[status(thm)],[c_0_46,c_0_31]) ).
cnf(c_0_50,plain,
r(product(X1,product(X2,X1)),product(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_20]),c_0_12]),c_0_13])]) ).
cnf(c_0_51,negated_conjecture,
( product(esk3_0,product(esk2_0,esk3_0)) != esk3_0
| product(esk2_0,product(esk3_0,esk2_0)) != esk2_0
| ~ d(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_52,negated_conjecture,
( esk1_2(esk2_0,esk3_0) = product(esk2_0,esk3_0)
| product(esk2_0,product(esk3_0,esk2_0)) = esk2_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_48]) ).
cnf(c_0_53,plain,
d(product(X1,product(X2,X1)),product(X2,product(X1,X2))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ d(esk2_0,esk3_0)
| product(esk2_0,product(esk3_0,esk2_0)) != esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_41])]) ).
cnf(c_0_55,negated_conjecture,
product(esk2_0,product(esk3_0,esk2_0)) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_52]),c_0_12])]) ).
cnf(c_0_56,negated_conjecture,
d(product(esk2_0,product(esk3_0,esk2_0)),esk3_0),
inference(spm,[status(thm)],[c_0_53,c_0_41]) ).
cnf(c_0_57,negated_conjecture,
~ d(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_55]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP775+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:37:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.66/0.86 % Version: 3.5.1
% 2.66/0.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.66/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.66/0.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.66/0.86 % Starting new_bool_3 with 300s (1) cores
% 2.66/0.86 % Starting new_bool_1 with 300s (1) cores
% 2.66/0.86 % Starting sh5l with 300s (1) cores
% 2.66/0.86 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3549236 completed with status 0
% 2.66/0.86 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.66/0.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.66/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.66/0.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.66/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.66/0.86 % No SInE strategy applied
% 2.66/0.86 % Search class: FGHSS-FFSF22-SFFFFFNN
% 2.66/0.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.66/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.66/0.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.66/0.86 % Starting G----_0010_evo with 136s (1) cores
% 2.66/0.86 % Starting new_bool_3 with 136s (1) cores
% 2.66/0.86 % Starting new_bool_1 with 136s (1) cores
% 2.66/0.86 % new_bool_3 with pid 3549246 completed with status 0
% 2.66/0.86 % Result found by new_bool_3
% 2.66/0.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.66/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.66/0.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.66/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.66/0.86 % No SInE strategy applied
% 2.66/0.86 % Search class: FGHSS-FFSF22-SFFFFFNN
% 2.66/0.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.66/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.66/0.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.66/0.86 % Starting G----_0010_evo with 136s (1) cores
% 2.66/0.86 % Starting new_bool_3 with 136s (1) cores
% 2.66/0.86 % Preprocessing time : 0.001 s
% 2.66/0.86 % Presaturation interreduction done
% 2.66/0.86
% 2.66/0.86 % Proof found!
% 2.66/0.86 % SZS status Theorem
% 2.66/0.86 % SZS output start CNFRefutation
% See solution above
% 2.66/0.86 % Parsed axioms : 6
% 2.66/0.86 % Removed by relevancy pruning/SinE : 0
% 2.66/0.86 % Initial clauses : 14
% 2.66/0.86 % Removed in clause preprocessing : 0
% 2.66/0.86 % Initial clauses in saturation : 14
% 2.66/0.86 % Processed clauses : 1639
% 2.66/0.86 % ...of these trivial : 161
% 2.66/0.86 % ...subsumed : 999
% 2.66/0.86 % ...remaining for further processing : 478
% 2.66/0.86 % Other redundant clauses eliminated : 0
% 2.66/0.86 % Clauses deleted for lack of memory : 0
% 2.66/0.86 % Backward-subsumed : 8
% 2.66/0.86 % Backward-rewritten : 247
% 2.66/0.86 % Generated clauses : 13836
% 2.66/0.86 % ...of the previous two non-redundant : 10780
% 2.66/0.86 % ...aggressively subsumed : 0
% 2.66/0.86 % Contextual simplify-reflections : 7
% 2.66/0.86 % Paramodulations : 13836
% 2.66/0.86 % Factorizations : 0
% 2.66/0.86 % NegExts : 0
% 2.66/0.86 % Equation resolutions : 0
% 2.66/0.86 % Disequality decompositions : 0
% 2.66/0.86 % Total rewrite steps : 25784
% 2.66/0.86 % ...of those cached : 24007
% 2.66/0.86 % Propositional unsat checks : 0
% 2.66/0.86 % Propositional check models : 0
% 2.66/0.86 % Propositional check unsatisfiable : 0
% 2.66/0.86 % Propositional clauses : 0
% 2.66/0.86 % Propositional clauses after purity: 0
% 2.66/0.86 % Propositional unsat core size : 0
% 2.66/0.86 % Propositional preprocessing time : 0.000
% 2.66/0.86 % Propositional encoding time : 0.000
% 2.66/0.86 % Propositional solver time : 0.000
% 2.66/0.86 % Success case prop preproc time : 0.000
% 2.66/0.86 % Success case prop encoding time : 0.000
% 2.66/0.86 % Success case prop solver time : 0.000
% 2.66/0.86 % Current number of processed clauses : 209
% 2.66/0.86 % Positive orientable unit clauses : 92
% 2.66/0.86 % Positive unorientable unit clauses: 0
% 2.66/0.86 % Negative unit clauses : 1
% 2.66/0.86 % Non-unit-clauses : 116
% 2.66/0.86 % Current number of unprocessed clauses: 8910
% 2.66/0.86 % ...number of literals in the above : 21410
% 2.66/0.86 % Current number of archived formulas : 0
% 2.66/0.86 % Current number of archived clauses : 269
% 2.66/0.86 % Clause-clause subsumption calls (NU) : 9203
% 2.66/0.86 % Rec. Clause-clause subsumption calls : 7929
% 2.66/0.86 % Non-unit clause-clause subsumptions : 1011
% 2.66/0.86 % Unit Clause-clause subsumption calls : 1542
% 2.66/0.86 % Rewrite failures with RHS unbound : 0
% 2.66/0.86 % BW rewrite match attempts : 145
% 2.66/0.86 % BW rewrite match successes : 17
% 2.66/0.86 % Condensation attempts : 0
% 2.66/0.86 % Condensation successes : 0
% 2.66/0.86 % Termbank termtop insertions : 286457
% 2.66/0.86 % Search garbage collected termcells : 196
% 2.66/0.86
% 2.66/0.86 % -------------------------------------------------
% 2.66/0.86 % User time : 0.304 s
% 2.66/0.86 % System time : 0.019 s
% 2.66/0.86 % Total time : 0.324 s
% 2.66/0.86 % Maximum resident set size: 3636 pages
% 2.66/0.86
% 2.66/0.86 % -------------------------------------------------
% 2.66/0.86 % User time : 1.488 s
% 2.66/0.86 % System time : 0.079 s
% 2.66/0.86 % Total time : 1.568 s
% 2.66/0.86 % Maximum resident set size: 4864 pages
% 2.66/0.86 % E exiting
%------------------------------------------------------------------------------