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


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


YES
Input TRS:
    1: sort(nil()) -> nil()
    2: sort(cons(x,y)) -> insert(x,sort(y))
    3: insert(x,nil()) -> cons(x,nil())
    4: insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v)
    5: choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w))
    6: choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w))
    7: choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z)
Number of strict rules: 7
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #sort(cons(x,y)) -> #insert(x,sort(y))
   #2: #sort(cons(x,y)) -> #sort(y)
   #3: #choose(x,cons(v,w),0(),s(z)) -> #insert(x,w)
   #4: #choose(x,cons(v,w),s(y),s(z)) -> #choose(x,cons(v,w),y,z)
   #5: #insert(x,cons(v,w)) -> #choose(x,cons(v,w),x,v)
Number of SCCs: 2, DPs: 4
  SCC { #2 }
POLO(Sum)... succeeded.
      #insert	w: 0
      s 	w: 0
      insert	w: 0
      #choose	w: 0
      #sort	w: x1
      0 	w: 0
      nil	w: 0
      sort	w: 0
      choose	w: 0
      cons	w: x2 + 1
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 3
  SCC { #3..5 }
POLO(Sum)... succeeded.
      #insert	w: x1 + x2 + 2
      s 	w: 1
      insert	w: 0
      #choose	w: x1 + x2
      #sort	w: 0
      0 	w: 1
      nil	w: 0
      sort	w: 0
      choose	w: 0
      cons	w: x2 + 3
    USABLE RULES: { }
    Removed DPs: #3 #5
Number of SCCs: 1, DPs: 1
  SCC { #4 }
POLO(Sum)... succeeded.
      #insert	w: 2
      s 	w: x1 + 1
      insert	w: 0
      #choose	w: x4
      #sort	w: 0
      0 	w: 1
      nil	w: 0
      sort	w: 0
      choose	w: 0
      cons	w: 3
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 0, DPs: 0