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


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


YES

Problem:
 f(X) -> g(n__h(n__f(X)))
 h(X) -> n__h(X)
 f(X) -> n__f(X)
 activate(n__h(X)) -> h(activate(X))
 activate(n__f(X)) -> f(activate(X))
 activate(X) -> X

Proof:
 WPO Processor:
  algebra: Sum
  weight function:
   w0 = 0
   w(n__f) = w(f) = 5
   w(activate) = 1
   w(h) = w(g) = w(n__h) = 0
  status function:
   st(activate) = st(h) = st(g) = st(n__h) = st(n__f) = st(f) = [0]
  precedence:
   activate > f > h > g ~ n__h ~ n__f
  problem:
   
  Qed