/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 = [lessleaves^#(cons(_0,_1),cons(_2,_3)) -> lessleaves^#(concat(_0,_1),concat(_2,_3))]
  TRS = {concat(leaf,_0) -> _0, concat(cons(_0,_1),_2) -> cons(_0,concat(_1,_2)), lessleaves(_0,leaf) -> false, lessleaves(leaf,cons(_0,_1)) -> true, lessleaves(cons(_0,_1),cons(_2,_3)) -> lessleaves(concat(_0,_1),concat(_2,_3))}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... This DP problem is too complex! Aborting!
    ## Trying with lexicographic path orders... Failed!
    ## Trying with Knuth-Bendix orders...
      The constraints are satisfied by the Knuth-Bendix order using
      the precedence:
      concat > [cons]
      and the weight function:
      {variables:1, cons:1, lessleaves:0, true:1, leaf:1, concat:0, false:1, lessleaves^#:0}
  This DP problem is finite.
  ## DP problem:
  Dependency pairs = [concat^#(cons(_0,_1),_2) -> concat^#(_1,_2)]
  TRS = {concat(leaf,_0) -> _0, concat(cons(_0,_1),_2) -> cons(_0,concat(_1,_2)), lessleaves(_0,leaf) -> false, lessleaves(leaf,cons(_0,_1)) -> true, lessleaves(cons(_0,_1),cons(_2,_3)) -> lessleaves(concat(_0,_1),concat(_2,_3))}
    ## 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