MAYBE
Input TRS:
      1: a() -> b()
      2: d() ->= c(a(),d())
Number of strict rules: 1
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #d() ->? #a()
     #2: #d() ->? #d()
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.