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


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


YES

** BEGIN proof argument **
All the DP problems were proved finite.
As all the involved DP processors are sound,
the TRS under analysis terminates.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Applying the DP framework...
## 2 initial DP problems to solve.
## First, we try to decompose these problems into smaller problems.
## Round 1 [2 DP problems]:
  ## DP problem:
  Dependency pairs = [w^#(a(a(_0))) -> w^#(_0)]
  TRS = {a(c(d(_0))) -> c(_0), u(b(d(d(_0)))) -> b(_0), v(a(a(_0))) -> u(v(_0)), v(a(c(_0))) -> u(b(d(_0))), v(c(_0)) -> b(_0), w(a(a(_0))) -> u(w(_0)), w(a(c(_0))) -> u(b(d(_0))), w(c(_0)) -> b(_0)}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
  ## DP problem:
  Dependency pairs = [v^#(a(a(_0))) -> v^#(_0)]
  TRS = {a(c(d(_0))) -> c(_0), u(b(d(d(_0)))) -> b(_0), v(a(a(_0))) -> u(v(_0)), v(a(c(_0))) -> u(b(d(_0))), v(c(_0)) -> b(_0), w(a(a(_0))) -> u(w(_0)), w(a(c(_0))) -> u(b(d(_0))), w(c(_0)) -> b(_0)}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
## All the DP problems were proved finite.
As all the involved DP processors are sound,
the TRS under analysis terminates.
Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64
using Java version 1.8.0_292
** END proof description **
Total number of generated unfolded rules = 0