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


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


MAYBE

** 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 = [conv^#(s(_0)) -> conv^#(half(s(_0)))]
  TRS = {half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), lastbit(0) -> 0, lastbit(s(0)) -> s(0), lastbit(s(s(_0))) -> lastbit(_0), conv(0) -> cons(nil,0), conv(s(_0)) -> cons(conv(half(s(_0))),lastbit(s(_0)))}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... Failed!
    ## Trying with lexicographic path orders... Failed!
    ## Trying with Knuth-Bendix orders... Failed!
  Don't know whether this DP problem is finite.
  ## DP problem:
  Dependency pairs = [lastbit^#(s(s(_0))) -> lastbit^#(_0)]
  TRS = {half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), lastbit(0) -> 0, lastbit(s(0)) -> s(0), lastbit(s(s(_0))) -> lastbit(_0), conv(0) -> cons(nil,0), conv(s(_0)) -> cons(conv(half(s(_0))),lastbit(s(_0)))}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
  ## DP problem:
  Dependency pairs = [half^#(s(s(_0))) -> half^#(_0)]
  TRS = {half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), lastbit(0) -> 0, lastbit(s(0)) -> s(0), lastbit(s(s(_0))) -> lastbit(_0), conv(0) -> cons(nil,0), conv(s(_0)) -> cons(conv(half(s(_0))),lastbit(s(_0)))}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
## A DP problem could not be proved finite.
## Now, we try to prove that this problem is infinite.
## Could not solve the following DP problems:
1: Dependency pairs = [conv^#(s(_0)) -> conv^#(half(s(_0)))]
TRS = {half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), lastbit(0) -> 0, lastbit(s(0)) -> s(0), lastbit(s(s(_0))) -> lastbit(_0), conv(0) -> cons(nil,0), conv(s(_0)) -> cons(conv(half(s(_0))),lastbit(s(_0)))}
Hence, could not prove (non)termination of the TRS under analysis.
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 = 299