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


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


YES
Input TRS:
    1: dbl(0()) -> 0()
    2: dbl(s(X)) -> s(n__s(n__dbl(activate(X))))
    3: dbls(nil()) -> nil()
    4: dbls(cons(X,Y)) -> cons(n__dbl(activate(X)),n__dbls(activate(Y)))
    5: sel(0(),cons(X,Y)) -> activate(X)
    6: sel(s(X),cons(Y,Z)) -> sel(activate(X),activate(Z))
    7: indx(nil(),X) -> nil()
    8: indx(cons(X,Y),Z) -> cons(n__sel(activate(X),activate(Z)),n__indx(activate(Y),activate(Z)))
    9: from(X) -> cons(activate(X),n__from(n__s(activate(X))))
    10: s(X) -> n__s(X)
    11: dbl(X) -> n__dbl(X)
    12: dbls(X) -> n__dbls(X)
    13: sel(X1,X2) -> n__sel(X1,X2)
    14: indx(X1,X2) -> n__indx(X1,X2)
    15: from(X) -> n__from(X)
    16: activate(n__s(X)) -> s(X)
    17: activate(n__dbl(X)) -> dbl(activate(X))
    18: activate(n__dbls(X)) -> dbls(activate(X))
    19: activate(n__sel(X1,X2)) -> sel(activate(X1),activate(X2))
    20: activate(n__indx(X1,X2)) -> indx(activate(X1),X2)
    21: activate(n__from(X)) -> from(X)
    22: activate(X) -> X
Number of strict rules: 22
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #dbl(s(X)) -> #s(n__s(n__dbl(activate(X))))
   #2: #dbl(s(X)) -> #activate(X)
   #3: #sel(s(X),cons(Y,Z)) -> #sel(activate(X),activate(Z))
   #4: #sel(s(X),cons(Y,Z)) -> #activate(X)
   #5: #sel(s(X),cons(Y,Z)) -> #activate(Z)
   #6: #from(X) -> #activate(X)
   #7: #from(X) -> #activate(X)
   #8: #activate(n__indx(X1,X2)) -> #indx(activate(X1),X2)
   #9: #activate(n__indx(X1,X2)) -> #activate(X1)
   #10: #sel(0(),cons(X,Y)) -> #activate(X)
   #11: #activate(n__dbl(X)) -> #dbl(activate(X))
   #12: #activate(n__dbl(X)) -> #activate(X)
   #13: #activate(n__sel(X1,X2)) -> #sel(activate(X1),activate(X2))
   #14: #activate(n__sel(X1,X2)) -> #activate(X1)
   #15: #activate(n__sel(X1,X2)) -> #activate(X2)
   #16: #activate(n__from(X)) -> #from(X)
   #17: #activate(n__s(X)) -> #s(X)
   #18: #indx(cons(X,Y),Z) -> #activate(X)
   #19: #indx(cons(X,Y),Z) -> #activate(Z)
   #20: #indx(cons(X,Y),Z) -> #activate(Y)
   #21: #indx(cons(X,Y),Z) -> #activate(Z)
   #22: #dbls(cons(X,Y)) -> #activate(X)
   #23: #dbls(cons(X,Y)) -> #activate(Y)
   #24: #activate(n__dbls(X)) -> #dbls(activate(X))
   #25: #activate(n__dbls(X)) -> #activate(X)
Number of SCCs: 1, DPs: 23
  SCC { #2..16 #18..25 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      dbls	w: x1 + 2
      activate	w: x1
      dbl	w: x1 + 2
      indx	w: max(x1 + 4, x2 + 6)
      n__indx	w: max(x1 + 4, x2 + 6)
      n__from	w: x1 + 2
      #dbl	w: x1 + 1
      #activate	w: x1
      #dbls	w: x1 + 1
      n__dbls	w: x1 + 2
      n__s	w: x1
      n__dbl	w: x1 + 2
      0 	w: 1
      #sel	w: max(x1 + 3, x2 + 1)
      #indx	w: max(x1 + 1, x2 + 5)
      sel	w: max(x1 + 4, x2 + 2)
      from	w: x1 + 2
      #s 	w: 0
      nil	w: 7
      n__sel	w: max(x1 + 4, x2 + 2)
      #from	w: x1 + 1
      cons	w: max(x1 + 1, x2)
    USABLE RULES: { 1..22 }
    Removed DPs: #2 #4..16 #18..25
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded.
      s 	s: [1]	p: 2	w: x1
      dbls	s: [1]	p: 4	w: x1 + 4
      activate	s: 1
      dbl	s: [1]	p: 3	w: x1 + 2
      indx	s: []	p: 0	w: x2 + 4
      n__indx	s: []	p: 0	w: x2 + 4
      n__from	s: []	p: 1	w: x1 + 2
      #dbl	s: []	p: 0	w: 1
      #activate	s: []	p: 0	w: 1
      #dbls	s: []	p: 0	w: 0
      n__dbls	s: [1]	p: 4	w: x1 + 4
      n__s	s: [1]	p: 2	w: x1
      n__dbl	s: [1]	p: 3	w: x1 + 2
      0 	s: []	p: 0	w: 0
      #sel	s: [1]	p: 2	w: x1 + 2
      #indx	s: []	p: 0	w: x2
      sel	s: []	p: 0	w: x2 + 2
      from	s: []	p: 1	w: x1 + 2
      #s 	s: []	p: 0	w: 0
      nil	s: []	p: 0	w: 0
      n__sel	s: []	p: 0	w: x2 + 2
      #from	s: []	p: 0	w: 0
      cons	s: []	p: 0	w: max(x1 + 1, x2)
    USABLE RULES: { 1..22 }
    Removed DPs: #3
Number of SCCs: 0, DPs: 0