% SZS status Satisfiable for abelian_groups.trs
9.32 (total time)

AC-COMPLETE TRS: 
f(one(),x) -> x
f(one(),f(x,x1)) -> f(x,x1)
f(i(x),x) -> one()
f(i(x),f(x,x1)) -> f(one(),x1)
i(one()) -> one()
i(i(x)) -> x
f(i(f(x,x1)),x1) -> i(x)
f(i(f(x,x1)),f(x1,x2)) -> f(i(x),x2)
i(f(i(x1),x)) -> f(i(x),x1)
f(i(x),i(x1)) -> i(f(x,x1))
f(i(x),f(i(x1),x2)) -> f(i(f(x,x1)),x2)


STATISTICS 
General
 number of iterations:    8 
 number of nodes:         147 
 number of processes:     1 
 time for orient:         6.54
 time for rewrite:        0.86
 time for deduce:         1.90

Selection
 strategy: (el(min(e(sum(smax)) + c(sum(smax)))), (data(smax), ( -el(#), ?)))
 time for selection:      0.00

Termination Checks (external with callaprove)
 termination checks:      9 (yes: 8, timeouts: 0)
 time limit for check:    3.00
 termination time:        6.52

Critical pair criterion (primality) 
 redundant CPs in total:  385
 for successful process:  341

Indexing
 techniques: code tree (rewriting) discrimination tree (overlaps)
 variants:                0.05
 encompassments:          0.26
 overlaps:                0.00
 maintenance:             0.00
Total time: 9.337508