%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP753-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 : 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 12:41:11 PM UTC 2026
% Result : Unsatisfiable 51.50s 10.72s
% Output : CNFRefutation 51.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 7
% Syntax : Number of clauses : 54 ( 54 unt; 0 nHn; 4 RR)
% Number of literals : 54 ( 53 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 161 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f05,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f06,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(goals,negated_conjecture,
mult(mult(a,mult(a,a)),mult(b,c)) != mult(mult(a,b),mult(mult(a,a),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
f05 ).
cnf(c_0_8,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_9,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
f06 ).
cnf(c_0_11,plain,
mult(mult(rd(X1,X1),X2),X3) = mult(X1,mult(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
rd(mult(mult(X1,X2),X3),mult(X2,ld(X3,X3))) = mult(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_14,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_15,plain,
rd(mult(X1,mult(X2,ld(X1,X3))),X3) = mult(rd(X1,X1),X2),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_16,plain,
rd(mult(X1,X2),mult(X3,ld(X2,X2))) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
ld(mult(X1,X2),mult(mult(X1,X3),X2)) = mult(X3,ld(X2,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,plain,
rd(mult(X1,mult(X2,X3)),mult(X1,X3)) = mult(rd(X1,X1),X2),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,plain,
rd(X1,mult(X2,ld(X3,X3))) = mult(rd(rd(X1,X3),X2),X3),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_20,plain,
mult(ld(X1,X2),ld(X3,X3)) = ld(mult(X1,X3),mult(X2,X3)),
inference(spm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_21,plain,
mult(rd(mult(X1,X2),mult(X1,X3)),X3) = mult(rd(mult(X1,X3),mult(X1,X3)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_19]),c_0_9]) ).
cnf(c_0_22,plain,
mult(mult(X1,X2),ld(mult(X3,X2),mult(X4,X2))) = mult(mult(X1,ld(X3,X4)),X2),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_23,plain,
mult(mult(rd(X1,X2),X3),X2) = mult(X1,mult(X3,ld(X2,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_24,plain,
mult(rd(mult(X1,X2),mult(X1,X2)),mult(X3,X2)) = mult(X1,mult(X3,ld(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_11]),c_0_14]) ).
cnf(c_0_25,plain,
rd(mult(mult(X1,X2),mult(X3,mult(X4,ld(X2,X2)))),mult(mult(X1,X4),X2)) = mult(rd(mult(X1,X2),mult(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_26,plain,
mult(mult(X1,mult(X2,X3)),mult(mult(X4,ld(X2,X2)),X3)) = mult(mult(X1,mult(X4,X3)),mult(X2,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_22]) ).
cnf(c_0_27,plain,
mult(mult(X1,mult(X2,ld(X1,X3))),mult(X1,X3)) = mult(mult(X1,X3),mult(mult(X2,ld(X1,X1)),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]) ).
cnf(c_0_28,plain,
rd(mult(mult(X1,X2),mult(mult(X3,X4),X2)),mult(mult(X1,X4),X2)) = mult(rd(mult(X1,X2),mult(X1,X2)),mult(X3,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_29,plain,
mult(mult(X1,mult(mult(X2,X3),X4)),mult(mult(mult(X5,ld(X2,X2)),X3),X4)) = mult(mult(X1,mult(mult(X5,X3),X4)),mult(mult(X2,X3),X4)),
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_30,plain,
mult(mult(X1,mult(X1,X2)),mult(mult(X3,ld(X1,X1)),mult(X1,X2))) = mult(mult(X1,mult(X3,X2)),mult(X1,mult(X1,X2))),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_31,plain,
mult(mult(mult(X1,X2),mult(mult(X3,X4),X2)),mult(X5,ld(mult(mult(X1,X4),X2),mult(mult(X1,X4),X2)))) = mult(mult(mult(X1,X2),mult(mult(X3,X2),ld(mult(X1,X2),X5))),mult(mult(X1,X4),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_11]) ).
cnf(c_0_32,plain,
mult(mult(mult(X1,mult(X2,X3)),mult(mult(X4,ld(X2,X2)),mult(X1,X3))),mult(X1,mult(X1,X3))) = mult(mult(mult(X1,mult(X4,X3)),mult(X2,mult(X1,X3))),mult(X1,mult(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_30]),c_0_26]) ).
cnf(c_0_33,plain,
mult(mult(mult(X1,X2),mult(mult(X3,X4),X2)),mult(mult(X5,ld(mult(X1,X4),mult(X1,X4))),X2)) = mult(mult(mult(X1,X2),mult(mult(X3,ld(X1,X5)),X2)),mult(mult(X1,X4),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_22]),c_0_22]) ).
cnf(c_0_34,plain,
mult(mult(X1,mult(X2,X3)),mult(mult(X4,ld(X2,X2)),mult(X1,X3))) = mult(mult(X1,mult(X4,X3)),mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_32]),c_0_9]) ).
cnf(c_0_35,plain,
mult(mult(mult(X1,mult(X1,X2)),mult(mult(X3,ld(X1,X4)),mult(X1,X2))),mult(X1,mult(X1,X2))) = mult(mult(mult(X1,mult(X3,X2)),mult(X4,mult(X1,X2))),mult(X1,mult(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_8]),c_0_8]),c_0_26]),c_0_8]) ).
cnf(c_0_36,plain,
mult(mult(mult(X1,mult(X1,X2)),mult(mult(X3,X4),mult(X1,X2))),mult(X1,mult(X1,X2))) = mult(mult(mult(X1,mult(X3,X2)),mult(mult(X1,X4),mult(X1,X2))),mult(X1,mult(X1,X2))),
inference(spm,[status(thm)],[c_0_35,c_0_14]) ).
cnf(c_0_37,plain,
mult(mult(X1,mult(X1,X2)),mult(mult(X3,X4),mult(X1,X2))) = mult(mult(X1,mult(X3,X2)),mult(mult(X1,X4),mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_36]),c_0_9]) ).
cnf(c_0_38,plain,
mult(mult(X1,mult(mult(X2,X3),X4)),mult(mult(mult(X5,ld(X2,X2)),X3),mult(X1,X4))) = mult(mult(X1,mult(mult(X5,X3),X4)),mult(mult(X2,X3),mult(X1,X4))),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_39,plain,
mult(mult(mult(X1,mult(X1,X2)),mult(mult(X3,mult(X3,X2)),mult(X1,X2))),mult(mult(X4,X5),mult(mult(X1,mult(X3,X2)),mult(X1,X2)))) = mult(mult(mult(X1,mult(X3,X2)),mult(X4,mult(X1,X2))),mult(mult(mult(X1,mult(X3,X2)),X5),mult(mult(X1,mult(X3,X2)),mult(X1,X2)))),
inference(spm,[status(thm)],[c_0_37,c_0_37]) ).
cnf(c_0_40,plain,
mult(mult(mult(X1,mult(X1,X2)),mult(mult(X3,mult(X1,X2)),mult(X1,X2))),mult(mult(X1,mult(X1,X2)),mult(mult(X1,mult(X1,X2)),mult(X1,X2)))) = mult(mult(mult(X1,mult(X3,X2)),mult(X1,mult(X1,X2))),mult(mult(mult(X1,mult(X1,X2)),mult(X1,X2)),mult(mult(X1,mult(X1,X2)),mult(X1,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34]) ).
cnf(c_0_41,plain,
mult(mult(mult(X1,mult(X2,X3)),mult(mult(X1,mult(X1,X3)),mult(X1,X3))),mult(mult(X1,mult(X1,X3)),mult(mult(X1,mult(X1,X3)),mult(X1,X3)))) = mult(mult(mult(X1,mult(X2,X3)),mult(X1,mult(X1,X3))),mult(mult(mult(X1,mult(X1,X3)),mult(X1,X3)),mult(mult(X1,mult(X1,X3)),mult(X1,X3)))),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_42,plain,
mult(mult(mult(X1,X2),mult(mult(X1,mult(X1,X3)),mult(X1,X3))),mult(mult(X1,mult(X1,X3)),mult(mult(X1,mult(X1,X3)),mult(X1,X3)))) = mult(mult(mult(X1,X2),mult(X1,mult(X1,X3))),mult(mult(mult(X1,mult(X1,X3)),mult(X1,X3)),mult(mult(X1,mult(X1,X3)),mult(X1,X3)))),
inference(spm,[status(thm)],[c_0_41,c_0_13]) ).
cnf(c_0_43,plain,
mult(mult(mult(X1,X2),mult(mult(X1,X3),X3)),mult(mult(X1,X3),mult(mult(X1,X3),X3))) = mult(mult(mult(X1,X2),mult(X1,X3)),mult(mult(mult(X1,X3),X3),mult(mult(X1,X3),X3))),
inference(spm,[status(thm)],[c_0_42,c_0_8]) ).
cnf(c_0_44,plain,
mult(mult(X1,mult(mult(X2,X3),X3)),mult(mult(X2,X3),mult(mult(X2,X3),X3))) = mult(mult(X1,mult(X2,X3)),mult(mult(mult(X2,X3),X3),mult(mult(X2,X3),X3))),
inference(spm,[status(thm)],[c_0_43,c_0_8]) ).
cnf(c_0_45,plain,
mult(mult(X1,mult(X2,X3)),mult(X2,mult(X2,X3))) = mult(mult(X1,X2),mult(mult(X2,X3),mult(X2,X3))),
inference(spm,[status(thm)],[c_0_44,c_0_13]) ).
cnf(c_0_46,plain,
mult(mult(X1,X2),mult(X3,X2)) = mult(mult(X1,X3),mult(X2,X2)),
inference(spm,[status(thm)],[c_0_45,c_0_8]) ).
cnf(c_0_47,plain,
mult(mult(X1,mult(X1,X1)),mult(mult(X2,X1),mult(X3,X1))) = mult(mult(X1,mult(X2,X1)),mult(mult(X1,X3),mult(X1,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_46]) ).
cnf(c_0_48,plain,
mult(mult(X1,mult(X1,X1)),mult(X2,mult(X3,X1))) = mult(mult(X1,X2),mult(mult(X1,X3),mult(X1,X1))),
inference(spm,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_49,negated_conjecture,
mult(mult(a,mult(a,a)),mult(b,c)) != mult(mult(a,b),mult(mult(a,a),c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_50,plain,
mult(mult(X1,mult(X1,X1)),mult(X2,mult(X3,X1))) = mult(mult(X1,X2),mult(mult(X1,X1),mult(X3,X1))),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
mult(mult(a,mult(a,a)),mult(b,c)) != mult(mult(a,b),mult(mult(a,a),c)),
c_0_49 ).
cnf(c_0_52,plain,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
inference(spm,[status(thm)],[c_0_50,c_0_13]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP753-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Sun Sep 20 20:37:39 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.02/0.32 Running first-order theorem proving
% 0.02/0.32 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
% 51.50/10.72 % Version: 3.5.1
% 51.50/10.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 51.50/10.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.50/10.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.50/10.72 % Starting new_bool_3 with 300s (1) cores
% 51.50/10.72 % Starting new_bool_1 with 300s (1) cores
% 51.50/10.72 % Starting sh5l with 300s (1) cores
% 51.50/10.72 % new_bool_3 with pid 823370 completed with status 9
% 51.50/10.72 % new_bool_1 with pid 823371 completed with status 9
% 51.50/10.72 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 823369 completed with status 0
% 51.50/10.72 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 51.50/10.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 51.50/10.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.50/10.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.50/10.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 51.50/10.72 % No SInE strategy applied
% 51.50/10.72 % Search class: FUUPM-FFSF22-MFFFFFNN
% 51.50/10.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 51.50/10.72 % Starting SubtermCWHack with 136s (1) cores
% 51.50/10.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 51.50/10.72 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 51.50/10.72 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 51.50/10.72 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 51.50/10.72 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 823374 completed with status 0
% 51.50/10.72 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 51.50/10.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 51.50/10.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.50/10.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.50/10.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 51.50/10.72 % No SInE strategy applied
% 51.50/10.72 % Search class: FUUPM-FFSF22-MFFFFFNN
% 51.50/10.72 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 51.50/10.72 % Starting SubtermCWHack with 136s (1) cores
% 51.50/10.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 51.50/10.72 % Preprocessing time : 0.002 s
% 51.50/10.72
% 51.50/10.72 % Proof found!
% 51.50/10.72 % SZS status Unsatisfiable
% 51.50/10.72 % SZS output start CNFRefutation
% See solution above
% 51.50/10.72 % Parsed axioms : 7
% 51.50/10.72 % Removed by relevancy pruning/SinE : 0
% 51.50/10.72 % Initial clauses : 7
% 51.50/10.72 % Removed in clause preprocessing : 0
% 51.50/10.72 % Initial clauses in saturation : 7
% 51.50/10.72 % Processed clauses : 865
% 51.50/10.72 % ...of these trivial : 173
% 51.50/10.72 % ...subsumed : 140
% 51.50/10.72 % ...remaining for further processing : 552
% 51.50/10.72 % Other redundant clauses eliminated : 0
% 51.50/10.72 % Clauses deleted for lack of memory : 0
% 51.50/10.72 % Backward-subsumed : 8
% 51.50/10.72 % Backward-rewritten : 98
% 51.50/10.72 % Generated clauses : 295423
% 51.50/10.72 % ...of the previous two non-redundant : 267917
% 51.50/10.72 % ...aggressively subsumed : 0
% 51.50/10.72 % Contextual simplify-reflections : 0
% 51.50/10.72 % Paramodulations : 295423
% 51.50/10.72 % Factorizations : 0
% 51.50/10.72 % NegExts : 0
% 51.50/10.72 % Equation resolutions : 0
% 51.50/10.72 % Disequality decompositions : 0
% 51.50/10.72 % Total rewrite steps : 270271
% 51.50/10.72 % ...of those cached : 190955
% 51.50/10.72 % Propositional unsat checks : 0
% 51.50/10.72 % Propositional check models : 0
% 51.50/10.72 % Propositional check unsatisfiable : 0
% 51.50/10.72 % Propositional clauses : 0
% 51.50/10.72 % Propositional clauses after purity: 0
% 51.50/10.72 % Propositional unsat core size : 0
% 51.50/10.72 % Propositional preprocessing time : 0.000
% 51.50/10.72 % Propositional encoding time : 0.000
% 51.50/10.72 % Propositional solver time : 0.000
% 51.50/10.72 % Success case prop preproc time : 0.000
% 51.50/10.72 % Success case prop encoding time : 0.000
% 51.50/10.72 % Success case prop solver time : 0.000
% 51.50/10.72 % Current number of processed clauses : 446
% 51.50/10.72 % Positive orientable unit clauses : 412
% 51.50/10.72 % Positive unorientable unit clauses: 34
% 51.50/10.72 % Negative unit clauses : 0
% 51.50/10.72 % Non-unit-clauses : 0
% 51.50/10.72 % Current number of unprocessed clauses: 266649
% 51.50/10.72 % ...number of literals in the above : 266649
% 51.50/10.72 % Current number of archived formulas : 0
% 51.50/10.72 % Current number of archived clauses : 106
% 51.50/10.72 % Clause-clause subsumption calls (NU) : 0
% 51.50/10.72 % Rec. Clause-clause subsumption calls : 0
% 51.50/10.72 % Non-unit clause-clause subsumptions : 0
% 51.50/10.72 % Unit Clause-clause subsumption calls : 1810
% 51.50/10.72 % Rewrite failures with RHS unbound : 0
% 51.50/10.72 % BW rewrite match attempts : 5171
% 51.50/10.72 % BW rewrite match successes : 280
% 51.50/10.72 % Condensation attempts : 0
% 51.50/10.72 % Condensation successes : 0
% 51.50/10.72 % Termbank termtop insertions : 16572910
% 51.50/10.72 % Search garbage collected termcells : 2
% 51.50/10.72
% 51.50/10.72 % -------------------------------------------------
% 51.50/10.72 % User time : 9.898 s
% 51.50/10.72 % System time : 0.313 s
% 51.50/10.72 % Total time : 10.211 s
% 51.50/10.72 % Maximum resident set size: 3376 pages
% 51.50/10.72
% 51.50/10.72 % -------------------------------------------------
% 51.50/10.72 % User time : 49.607 s
% 51.50/10.72 % System time : 1.846 s
% 51.50/10.72 % Total time : 51.453 s
% 51.50/10.72 % Maximum resident set size: 4608 pages
% 51.50/10.72 % E exiting
%------------------------------------------------------------------------------