% SZS status Success for A95_finite_comm_monoid.trs
0.95 (total time)

STATISTICS: 
General
 number of iterations:    4 
 number of nodes:         4 
 number of processes:     3 
 time for orient:         0.94
 time for rewrite:        0.00
 time for deduce:         0.00

Isomorphism Check: none (detected automatically)

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

Process Killing
 killed 0 exceeding best by: 401%
 required time:               0.00

Termination Checks  (internal)
 strategy: dp; acdg?; sccs?; ({ur?; matrix -ib 2 -ob 3 -dp -dim 1 -ur[2]}restore || acrpo -af || ackbo -af -ib 2 -ob 3 -sc -nt || {ur?; matrix -ib 2 -ob 3 -dp -dim 2 -ur[2]}restore)*
 termination checks:      7 (yes: 7, timeouts: 0)
 time limit for check:    1.50
 termination time:        0.94

Deduction 
 critical pair criterion:   primality 
 redundant CPs in total:    0
 for successful process:    0
 required time:             0.00
 small lemmata propagation: 5

Indexing
 techniques: code tree (rewriting) discrimination tree (overlaps)
 variants:                0.00
 encompassments:          0.00
 overlaps:                0.00
 maintenance:             0.00
    One: 0.000579
    Two: 0.000000

COMPLETE SYSTEM:
pAC(x,zero()) -> x
pAC(pAC(pAC(a(),a()),a()),b()) -> pAC(pAC(pAC(pAC(a(),a()),b()),b()),b())
pAC(pAC(pAC(pAC(a(),a()),a()),a()),b()) -> pAC(pAC(pAC(a(),a()),b()),b())