%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP720+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:41:02 PM UTC 2026
% Result : Theorem 89.73s 18.43s
% Output : CNFRefutation 89.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 60 unt; 0 def)
% Number of atoms : 60 ( 59 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 122 ( 0 sgn 29 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f04,axiom,
! [X2,X1] : ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f05,axiom,
! [X2,X1] : mult(X1,X2) = mult(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f06,axiom,
! [X3,X4,X2,X1] : ld(mult(X1,X2),mult(X1,mult(X2,mult(X4,X3)))) = mult(ld(mult(X1,X2),mult(X1,mult(X2,X4))),ld(mult(X1,X2),mult(X1,mult(X2,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f03,axiom,
! [X2,X1] : mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f01,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f02,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(goals,conjecture,
! [X5,X6] :
? [X7] : mult(mult(X5,X5),mult(X6,X6)) = mult(X7,X7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_7,plain,
! [X12,X13] : ld(X13,mult(X13,X12)) = X12,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_8,plain,
! [X14,X15] : mult(X15,X14) = mult(X14,X15),
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_9,plain,
! [X16,X17,X18,X19] : ld(mult(X19,X18),mult(X19,mult(X18,mult(X17,X16)))) = mult(ld(mult(X19,X18),mult(X19,mult(X18,X17))),ld(mult(X19,X18),mult(X19,mult(X18,X16)))),
inference(variable_rename,[status(thm)],[f06]) ).
cnf(c_0_10,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
mult(X1,X2) = mult(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X4)))) = mult(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,X4)))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
ld(X1,mult(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X10,X11] : mult(X11,ld(X11,X10)) = X10,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_15,plain,
! [X8] : mult(X8,unit) = X8,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_16,plain,
ld(mult(X1,X1),mult(X1,mult(X1,mult(X1,X2)))) = mult(X1,ld(mult(X1,X1),mult(X1,mult(X1,X2)))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
ld(mult(X1,X1),mult(X1,mult(X1,X2))) = mult(X1,ld(mult(X1,X1),mult(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_21,plain,
mult(X1,ld(mult(X1,X1),X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]) ).
cnf(c_0_22,plain,
ld(ld(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_23,plain,
ld(mult(X1,X1),X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_10,c_0_21]) ).
fof(c_0_24,plain,
! [X9] : mult(unit,X9) = X9,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_25,plain,
ld(ld(X1,unit),X1) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
mult(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,X4))) = ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,ld(X2,X4))))),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_28,plain,
mult(ld(X1,unit),mult(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,plain,
ld(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
fof(c_0_30,negated_conjecture,
~ ! [X5,X6] :
? [X7] : mult(mult(X5,X5),mult(X6,X6)) = mult(X7,X7),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_31,plain,
mult(ld(X1,unit),mult(X1,X2)) = mult(X1,mult(ld(X1,unit),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_27,c_0_28]),c_0_11]),c_0_17]),c_0_29]),c_0_11]),c_0_17]),c_0_29]),c_0_11]),c_0_17]),c_0_17]),c_0_29]) ).
fof(c_0_32,negated_conjecture,
! [X25] : mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)) != mult(X25,X25),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])]) ).
cnf(c_0_33,plain,
ld(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X4))))) = ld(mult(X1,X2),mult(X1,mult(X2,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_34,plain,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X1)))) = mult(X1,ld(mult(X1,X2),mult(X1,mult(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_13]),c_0_11]) ).
cnf(c_0_35,plain,
ld(X1,mult(X2,mult(ld(X2,X1),mult(X3,ld(ld(X2,X1),X4))))) = mult(ld(X1,mult(X2,mult(ld(X2,X1),X3))),ld(X1,mult(X2,X4))),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_36,plain,
mult(ld(X1,unit),ld(X1,unit)) = ld(X1,ld(X1,unit)),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_37,plain,
mult(X1,mult(ld(X1,unit),ld(X1,X2))) = mult(ld(X1,unit),X2),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_38,negated_conjecture,
mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)) != mult(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
ld(ld(mult(X1,X2),mult(X1,mult(X2,X3))),ld(mult(X1,X2),mult(X1,mult(X2,X4)))) = ld(mult(X1,X2),mult(X1,mult(X2,ld(X3,X4)))),
inference(spm,[status(thm)],[c_0_33,c_0_17]) ).
cnf(c_0_40,plain,
ld(mult(X1,X2),mult(X1,mult(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_18]),c_0_20]),c_0_18]) ).
cnf(c_0_41,plain,
ld(X1,mult(X2,ld(ld(X2,X1),unit))) = mult(ld(X1,X2),ld(X1,X2)),
inference(rw,[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_17]),c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_42,plain,
ld(X1,mult(ld(X1,unit),X2)) = mult(ld(X1,unit),ld(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
ld(mult(X1,X2),mult(X1,mult(X2,mult(X3,X3)))) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(spm,[status(thm)],[c_0_38,c_0_12]) ).
cnf(c_0_44,plain,
ld(ld(mult(X1,X2),mult(X1,mult(X2,X3))),X1) = ld(mult(X1,X2),mult(X1,mult(X2,ld(X3,X1)))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
mult(X1,mult(ld(X1,X2),ld(X1,X2))) = mult(X2,ld(ld(X2,X1),unit)),
inference(spm,[status(thm)],[c_0_17,c_0_41]) ).
cnf(c_0_46,plain,
ld(ld(X1,unit),mult(X1,X2)) = mult(X1,ld(ld(X1,unit),X2)),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_47,negated_conjecture,
mult(X1,mult(ld(X1,unit),mult(X2,X2))) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_11]),c_0_17]),c_0_29]) ).
cnf(c_0_48,plain,
ld(ld(ld(X1,X2),unit),X2) = ld(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_17]),c_0_10]),c_0_17]),c_0_17]) ).
cnf(c_0_49,plain,
mult(X1,ld(ld(X1,unit),ld(X1,X2))) = ld(ld(X1,unit),X2),
inference(spm,[status(thm)],[c_0_46,c_0_17]) ).
cnf(c_0_50,negated_conjecture,
mult(X1,mult(X2,ld(ld(X2,ld(X1,unit)),unit))) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_51,plain,
ld(ld(X1,mult(X2,X2)),X2) = ld(ld(X1,X2),unit),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_52,plain,
ld(ld(X1,unit),ld(X1,X2)) = ld(X1,ld(ld(X1,unit),X2)),
inference(spm,[status(thm)],[c_0_10,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
mult(ld(X1,unit),mult(X2,ld(ld(X2,X1),unit))) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_18]),c_0_22]) ).
cnf(c_0_54,plain,
ld(ld(X1,ld(ld(X1,unit),X2)),ld(X1,X2)) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_22,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
mult(ld(ld(X1,X2),unit),ld(ld(X1,unit),X2)) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_22]),c_0_11]),c_0_17]) ).
cnf(c_0_56,negated_conjecture,
mult(X1,ld(ld(X1,mult(X2,X2)),unit)) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_48]),c_0_22]),c_0_22]),c_0_11]) ).
cnf(c_0_57,plain,
mult(mult(X1,X2),ld(ld(mult(X1,X2),X1),unit)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_45,c_0_10]) ).
cnf(c_0_58,negated_conjecture,
mult(mult(X1,X1),mult(X2,X2)) != mult(mult(esk1_0,esk1_0),mult(esk2_0,esk2_0)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP720+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:36:31 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 89.73/18.43 % Version: 3.5.1
% 89.73/18.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 89.73/18.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.73/18.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 89.73/18.43 % Starting new_bool_3 with 300s (1) cores
% 89.73/18.43 % Starting new_bool_1 with 300s (1) cores
% 89.73/18.43 % Starting sh5l with 300s (1) cores
% 89.73/18.43 % new_bool_1 with pid 2561997 completed with status 9
% 89.73/18.43 % new_bool_3 with pid 2561996 completed with status 9
% 89.73/18.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2561995 completed with status 0
% 89.73/18.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 89.73/18.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 89.73/18.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.73/18.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 89.73/18.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 89.73/18.43 % No SInE strategy applied
% 89.73/18.43 % Search class: FUUPM-FFSF22-MFFFFFNN
% 89.73/18.43 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 89.73/18.43 % Starting SubtermCWHack with 136s (1) cores
% 89.73/18.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 89.73/18.43 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 89.73/18.43 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 89.73/18.43 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 89.73/18.43 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 2562004 completed with status 0
% 89.73/18.43 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 89.73/18.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 89.73/18.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.73/18.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 89.73/18.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 89.73/18.43 % No SInE strategy applied
% 89.73/18.43 % Search class: FUUPM-FFSF22-MFFFFFNN
% 89.73/18.43 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 89.73/18.43 % Starting SubtermCWHack with 136s (1) cores
% 89.73/18.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 89.73/18.43 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 89.73/18.43 % Preprocessing time : 0.001 s
% 89.73/18.43 % Presaturation interreduction done
% 89.73/18.43
% 89.73/18.43 % Proof found!
% 89.73/18.43 % SZS status Theorem
% 89.73/18.43 % SZS output start CNFRefutation
% See solution above
% 89.73/18.43 % Parsed axioms : 8
% 89.73/18.43 % Removed by relevancy pruning/SinE : 0
% 89.73/18.43 % Initial clauses : 8
% 89.73/18.43 % Removed in clause preprocessing : 0
% 89.73/18.43 % Initial clauses in saturation : 8
% 89.73/18.43 % Processed clauses : 10781
% 89.73/18.43 % ...of these trivial : 652
% 89.73/18.43 % ...subsumed : 9495
% 89.73/18.43 % ...remaining for further processing : 634
% 89.73/18.43 % Other redundant clauses eliminated : 0
% 89.73/18.43 % Clauses deleted for lack of memory : 0
% 89.73/18.43 % Backward-subsumed : 2
% 89.73/18.43 % Backward-rewritten : 100
% 89.73/18.43 % Generated clauses : 243229
% 89.73/18.43 % ...of the previous two non-redundant : 224492
% 89.73/18.43 % ...aggressively subsumed : 0
% 89.73/18.43 % Contextual simplify-reflections : 0
% 89.73/18.43 % Paramodulations : 243228
% 89.73/18.43 % Factorizations : 0
% 89.73/18.43 % NegExts : 0
% 89.73/18.43 % Equation resolutions : 1
% 89.73/18.43 % Disequality decompositions : 0
% 89.73/18.43 % Total rewrite steps : 1316490
% 89.73/18.43 % ...of those cached : 1292346
% 89.73/18.43 % Propositional unsat checks : 0
% 89.73/18.43 % Propositional check models : 0
% 89.73/18.43 % Propositional check unsatisfiable : 0
% 89.73/18.43 % Propositional clauses : 0
% 89.73/18.43 % Propositional clauses after purity: 0
% 89.73/18.43 % Propositional unsat core size : 0
% 89.73/18.43 % Propositional preprocessing time : 0.000
% 89.73/18.43 % Propositional encoding time : 0.000
% 89.73/18.43 % Propositional solver time : 0.000
% 89.73/18.43 % Success case prop preproc time : 0.000
% 89.73/18.43 % Success case prop encoding time : 0.000
% 89.73/18.43 % Success case prop solver time : 0.000
% 89.73/18.43 % Current number of processed clauses : 524
% 89.73/18.43 % Positive orientable unit clauses : 312
% 89.73/18.43 % Positive unorientable unit clauses: 5
% 89.73/18.43 % Negative unit clauses : 207
% 89.73/18.43 % Non-unit-clauses : 0
% 89.73/18.43 % Current number of unprocessed clauses: 212574
% 89.73/18.43 % ...number of literals in the above : 212574
% 89.73/18.43 % Current number of archived formulas : 0
% 89.73/18.43 % Current number of archived clauses : 110
% 89.73/18.43 % Clause-clause subsumption calls (NU) : 0
% 89.73/18.43 % Rec. Clause-clause subsumption calls : 0
% 89.73/18.43 % Non-unit clause-clause subsumptions : 0
% 89.73/18.43 % Unit Clause-clause subsumption calls : 13010
% 89.73/18.43 % Rewrite failures with RHS unbound : 0
% 89.73/18.43 % BW rewrite match attempts : 6199
% 89.73/18.43 % BW rewrite match successes : 134
% 89.73/18.43 % Condensation attempts : 0
% 89.73/18.43 % Condensation successes : 0
% 89.73/18.43 % Termbank termtop insertions : 53484101
% 89.73/18.43 % Search garbage collected termcells : 20
% 89.73/18.43
% 89.73/18.43 % -------------------------------------------------
% 89.73/18.43 % User time : 17.586 s
% 89.73/18.43 % System time : 0.260 s
% 89.73/18.43 % Total time : 17.846 s
% 89.73/18.43 % Maximum resident set size: 3380 pages
% 89.73/18.43
% 89.73/18.43 % -------------------------------------------------
% 89.73/18.43 % User time : 87.885 s
% 89.73/18.43 % System time : 1.733 s
% 89.73/18.43 % Total time : 89.619 s
% 89.73/18.43 % Maximum resident set size: 4864 pages
% 89.73/18.43 % E exiting
%------------------------------------------------------------------------------