/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...
## 3 initial DP problems to solve.
## First, we try to decompose these problems into smaller problems.
## Round 1 [3 DP problems]:
  ## DP problem:
  Dependency pairs = [-^#(s(_0),s(_1)) -> -^#(_0,_1)]
  TRS = {exp(_0,0) -> s(0), exp(_0,s(_1)) -> *(_0,exp(_0,_1)), *(0,_0) -> 0, *(s(_0),_1) -> +(_1,*(_0,_1)), -(0,_0) -> 0, -(_0,0) -> _0, -(s(_0),s(_1)) -> -(_0,_1)}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
  ## DP problem:
  Dependency pairs = [exp^#(_0,s(_1)) -> exp^#(_0,_1)]
  TRS = {exp(_0,0) -> s(0), exp(_0,s(_1)) -> *(_0,exp(_0,_1)), *(0,_0) -> 0, *(s(_0),_1) -> +(_1,*(_0,_1)), -(0,_0) -> 0, -(_0,0) -> _0, -(s(_0),s(_1)) -> -(_0,_1)}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
  ## DP problem:
  Dependency pairs = [*^#(s(_0),_1) -> *^#(_0,_1)]
  TRS = {exp(_0,0) -> s(0), exp(_0,s(_1)) -> *(_0,exp(_0,_1)), *(0,_0) -> 0, *(s(_0),_1) -> +(_1,*(_0,_1)), -(0,_0) -> 0, -(_0,0) -> _0, -(s(_0),s(_1)) -> -(_0,_1)}
    ## 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