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


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


YES
Input TRS:
    1: f(f(X)) -> c(n__f(n__g(n__f(X))))
    2: c(X) -> d(activate(X))
    3: h(X) -> c(n__d(X))
    4: f(X) -> n__f(X)
    5: g(X) -> n__g(X)
    6: d(X) -> n__d(X)
    7: activate(n__f(X)) -> f(activate(X))
    8: activate(n__g(X)) -> g(X)
    9: activate(n__d(X)) -> d(X)
    10: activate(X) -> X
Number of strict rules: 10
Direct POLO(bPol) ... removes: 3
      h 	w: x1 + 1
      d 	w: x1
      activate	w: x1
      c 	w: x1
      f 	w: 2 * x1 + 2
      n__f	w: 2 * x1 + 2
      n__g	w: x1
      n__d	w: x1
      g 	w: x1
Number of strict rules: 9
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #c(X) -> #d(activate(X))
   #2: #c(X) -> #activate(X)
   #3: #activate(n__d(X)) -> #d(X)
   #4: #activate(n__f(X)) -> #f(activate(X))
   #5: #activate(n__f(X)) -> #activate(X)
   #6: #f(f(X)) -> #c(n__f(n__g(n__f(X))))
   #7: #activate(n__g(X)) -> #g(X)
Number of SCCs: 1, DPs: 4
  SCC { #2 #4..6 }
POLO(Sum)... succeeded.
      h 	w: 0
      d 	w: 1
      activate	w: x1 + 1
      #activate	w: x1
      c 	w: 1
      f 	w: x1 + 1
      n__f	w: x1 + 1
      #d 	w: 0
      #f 	w: 1
      #g 	w: 0
      n__g	w: 0
      #c 	w: x1
      n__d	w: 1
      g 	w: 0
    USABLE RULES: { 1 2 4..10 }
    Removed DPs: #5
Number of SCCs: 1, DPs: 3
  SCC { #2 #4 #6 }
POLO(Sum)... succeeded.
      h 	w: 0
      d 	w: 1
      activate	w: x1 + 1
      #activate	w: x1
      c 	w: 1
      f 	w: x1 + 4
      n__f	w: x1 + 4
      #d 	w: 0
      #f 	w: x1 + 2
      #g 	w: 0
      n__g	w: 0
      #c 	w: x1 + 1
      n__d	w: 1
      g 	w: 0
    USABLE RULES: { 1 2 4..10 }
    Removed DPs: #2 #4 #6
Number of SCCs: 0, DPs: 0