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

AC-COMPLETE TRS: 
p(zero(),x) -> x
p(i(x),x) -> zero()
i(zero()) -> zero()
i(i(x)) -> x
p(i(p(x,x1)),x1) -> i(x)
i(p(i(x1),x)) -> p(i(x),x1)
p(i(x),i(x1)) -> i(p(x,x1))


STATISTICS 
General
 number of iterations:    8 
 number of nodes:         101 
 number of processes:     1 
 time for orient:         0.33
 time for rewrite:        0.66
 time for deduce:         0.53

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

Termination Checks (external with callmuterm )
 termination checks:      9 (yes: 8, timeouts: 0)
 time limit for check:    2.50
 termination time:        0.30

Critical pair criterion (primality) 
 redundant CPs in total:  82
 for successful process:  78

Indexing
 techniques: code tree (rewriting) discrimination tree (overlaps)
 variants:                0.03
 encompassments:          0.12
 overlaps:                0.00
 maintenance:             0.00
    One: 0.000000
    Two: 0.000000
Total time: 1.615132