% SZS status Success for sum.trs
1.44 (total time)

S-CONVERGENT TRS: 
sum(L(x)) -> x
sum(N(L(0()),L(x))) -> x
sum(N(L(s(x)),L(y))) -> s(sum(N(L(x),L(y))))
sum(N(L(x),N(y,z))) -> sum(N(L(sum(N(y,z))),L(x)))


STATISTICS 
Theory
 convergent system S:     none 

General
 number of iterations:    5 
 number of nodes:         4 
 number of processes:     3 
 time for orient:         0.15
 time for rewrite:        0.01
 time for S-rewrite:      0.00
 time for deduce:         1.22

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:      8 (yes: 8, timeouts: 0)
 time limit for check:    2.50
 termination time:        0.14

Critical pair criterion (primality) 
 redundant CPs in total:  104
 for successful process:  84
 time to check:      0.96

Indexing
 techniques: code tree (rewriting) discrimination tree (overlaps)
 variants:                0.00
 encompassments:          0.06
 overlaps:                0.00
 maintenance:             0.00
    One: 0.000019
    Two: 0.150878
Total time: 1.454826