/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 R(x1) -> r(x1)
 r(p(x1)) -> p(p(r(P(x1))))
 r(r(x1)) -> x1
 r(P(P(x1))) -> P(P(r(x1)))
 p(P(x1)) -> x1
 P(p(x1)) -> x1
 r(R(x1)) -> x1
 R(r(x1)) -> x1

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {7,2,3,1}
   transitions:
    P0(2) -> 4*
    P0(1) -> 8*
    P0(8) -> 7*
    f40() -> 2*
    r0(2) -> 1*
    r0(4) -> 5*
    p0(5) -> 6*
    p0(6) -> 3*
    1 -> 3*
    2 -> 6,4,1
    3 -> 7,1
    5 -> 7*
    6 -> 8*
    7 -> 1,5
    8 -> 6*
  problem:
   
  Qed