/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...
## 1 initial DP problem to solve.
## First, we try to decompose this problem into smaller problems.
## Round 1 [1 DP problem]:
  ## DP problem:
  Dependency pairs = [implies^#(not(_0),not(_1)) -> implies^#(_1,and(_0,_1))]
  TRS = {and(_0,false) -> false, and(_0,not(false)) -> _0, not(not(_0)) -> _0, implies(false,_0) -> not(false), implies(_0,false) -> not(_0), implies(not(_0),not(_1)) -> implies(_1,and(_0,_1))}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations...
      The constraints are satisfied by the polynomials:
      {false:[0], not(_0):[1 + 2 * _0], implies(_0,_1):[1 + 2 * _0 + 2 * _1], and(_0,_1):[_0 + _1], implies^#(_0,_1):[_0 + _1]}
      for all instantiations of the variables with values greater than or equal to mu = 0.
  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