% SZS status Success for binarith.trs
3.04 (total time)

S-CONVERGENT TRS: 
z(zero()) -> zero()
p(z(x),z(y)) -> z(p(x,y))
p(z(x),o(y)) -> o(p(x,y))
p(o(x),o(y)) -> z(p(o(zero()),p(x,y)))


STATISTICS 
Theory
 convergent system S:     ACU 

General
 number of iterations:    6 
 number of nodes:         185 
 number of processes:     5 
 time for orient:         0.85
 time for rewrite:        1.24
 time for S-rewrite:      0.07
 time for deduce:         0.61

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

Termination Checks (external with callmuterm )
 termination checks:      15 (yes: 13, timeouts: 0)
 time limit for check:    2.50
 termination time:        0.67

Critical pair criterion (primality) 
 redundant CPs in total:  56
 for successful process:  0
 time to check:      0.19

Indexing
 techniques: code tree (rewriting) discrimination tree (overlaps)
 variants:                0.07
 encompassments:          0.48
 overlaps:                0.00
 maintenance:             0.00
    One: 0.000028
    Two: 0.845573
Total time: 3.058901