/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 = [and^#(xor(_0,_1),_2) -> and^#(_0,_2), and^#(xor(_0,_1),_2) -> and^#(_1,_2)]
  TRS = {not(_0) -> xor(_0,true), or(_0,_1) -> xor(and(_0,_1),xor(_0,_1)), implies(_0,_1) -> xor(and(_0,_1),xor(_0,true)), and(_0,true) -> _0, and(_0,false) -> false, and(_0,_0) -> _0, xor(_0,false) -> _0, xor(_0,_0) -> false, and(xor(_0,_1),_2) -> xor(and(_0,_2),and(_1,_2))}
    ## 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