% SZS status Satisfiable for binarith.trs
2.69 (total time)

AC-COMPLETE TRS: 
z(zero()) -> zero()
p(zero(),x) -> x
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 
General
 number of iterations:    7 
 number of nodes:         224 
 number of processes:     5 
 time for orient:         0.58
 time for rewrite:        1.50
 time for deduce:         0.25

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

Critical pair criterion (primality) 
 redundant CPs in total:  38
 for successful process:  9

Indexing
 techniques: code tree (rewriting) discrimination tree (overlaps)
 variants:                0.09
 encompassments:          0.31
 overlaps:                0.00
 maintenance:             0.00
    One: 0.000000
    Two: 0.000000
Total time: 2.722395