/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
Input TRS:
    1: f(x,f(s(s(y)),f(z,w))) -> f(s(x),f(y,f(s(z),w)))
    2: L(f(s(s(y)),f(z,w))) -> L(f(s(0()),f(y,f(s(z),w))))
    3: f(x,f(s(s(y)),nil())) -> f(s(x),f(y,f(s(0()),nil())))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #L(f(s(s(y)),f(z,w))) -> #L(f(s(0()),f(y,f(s(z),w))))
   #2: #L(f(s(s(y)),f(z,w))) -> #f(s(0()),f(y,f(s(z),w)))
   #3: #L(f(s(s(y)),f(z,w))) -> #f(y,f(s(z),w))
   #4: #L(f(s(s(y)),f(z,w))) -> #f(s(z),w)
   #5: #f(x,f(s(s(y)),nil())) -> #f(s(x),f(y,f(s(0()),nil())))
   #6: #f(x,f(s(s(y)),nil())) -> #f(y,f(s(0()),nil()))
   #7: #f(x,f(s(s(y)),nil())) -> #f(s(0()),nil())
   #8: #f(x,f(s(s(y)),f(z,w))) -> #f(s(x),f(y,f(s(z),w)))
   #9: #f(x,f(s(s(y)),f(z,w))) -> #f(y,f(s(z),w))
   #10: #f(x,f(s(s(y)),f(z,w))) -> #f(s(z),w)
Number of SCCs: 2, DPs: 5
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      s 	w: max(x1 + 8, 0)
      #L 	w: max(x1 + 13, 0)
      f 	w: max(x1 + x2 - 6, 0)
      0 	w: 3
      nil	w: 5
      #f 	w: max(x2 - 1, 0)
      L 	w: 0
    USABLE RULES: { 1 3 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 4
  SCC { #5 #8..10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #L 	w: 0
      f 	w: x1 + x2
      0 	w: 0
      nil	w: 1
      #f 	w: x2
      L 	w: 0
    USABLE RULES: { 1 3 }
    Removed DPs: #5 #8..10
Number of SCCs: 0, DPs: 0