/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:
 i(0(x1)) -> p(s(p(s(0(p(s(p(s(x1)))))))))
 i(s(x1)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1))))))))))))))))))
 j(0(x1)) -> p(s(p(p(s(s(0(p(s(p(s(x1)))))))))))
 j(s(x1)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1)))))))))))))
 p(p(s(x1))) -> p(x1)
 p(s(x1)) -> x1
 p(0(x1)) -> 0(s(s(s(s(s(s(s(s(x1)))))))))

Proof:
 Bounds Processor:
  bound: 1
  enrichment: match
  automaton:
   final states: {43,2,42,33,28,11,1}
   transitions:
    p1(62) -> 63*
    p1(54) -> 55*
    p1(66) -> 67*
    p1(56) -> 57*
    p1(48) -> 49*
    f50() -> 2*
    p0(30) -> 31*
    p0(25) -> 26*
    p0(15) -> 16*
    p0(10) -> 1*
    p0(5) -> 6*
    p0(37) -> 38*
    p0(32) -> 28*
    p0(27) -> 11*
    p0(17) -> 18*
    p0(2) -> 42*
    p0(29) -> 30*
    p0(19) -> 20*
    p0(14) -> 15*
    p0(36) -> 37*
    p0(21) -> 22*
    p0(16) -> 17*
    p0(8) -> 9*
    p0(3) -> 4*
    s0(45) -> 46*
    s0(40) -> 41*
    s0(35) -> 36*
    s0(20) -> 21*
    s0(12) -> 13*
    s0(7) -> 8*
    s0(2) -> 3*
    s0(44) -> 45*
    s0(39) -> 40*
    s0(34) -> 35*
    s0(24) -> 25*
    s0(14) -> 44*
    s0(9) -> 10*
    s0(4) -> 5*
    s0(46) -> 47*
    s0(41) -> 33*
    s0(31) -> 32*
    s0(26) -> 27*
    s0(38) -> 39*
    s0(23) -> 24*
    s0(18) -> 19*
    s0(13) -> 14*
    s0(8) -> 29*
    s0(3) -> 12*
    00(47) -> 43*
    00(6) -> 7*
    j0(22) -> 23*
    i0(6) -> 34*
    1 -> 34,55
    2 -> 42,67,18,20,4
    3 -> 63,17,66
    4 -> 6*
    7 -> 57,9
    8 -> 30,56
    9 -> 1*
    11 -> 34,55
    12 -> 49,16,62
    13 -> 15,48
    18 -> 20*
    20 -> 22*
    24 -> 26*
    26 -> 11*
    28 -> 23*
    31 -> 28*
    33 -> 23*
    34 -> 55,38
    35 -> 37,54
    43 -> 42*
    49 -> 16*
    55 -> 38*
    57 -> 31*
    63 -> 17*
    67 -> 18*
  problem:
   
  Qed