Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1)))))))))
     , half(s(s(x1))) -> s(half(p(p(s(s(x1))))))
     , half(0(x1)) -> 0(s(s(half(p(s(p(s(x1))))))))
     , j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1)))))))))))
     , g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1)))))))))))
     , f(s(x1)) -> p(s(g(p(s(s(x1))))))
     , p(p(s(x1))) -> p(x1)
     , p(s(x1)) -> x1
     , p(0(x1)) -> 0(s(s(p(x1))))}
  StartTerms: all
  Strategy: none
Certificate: TIMEOUT
Proof:
  Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool CDI
stdout:
TIMEOUT
Statistics:
Number of monomials: 0
Last formula building started for bound 0
Last SAT solving started for bound 0Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1)))))))))
     , half(s(s(x1))) -> s(half(p(p(s(s(x1))))))
     , half(0(x1)) -> 0(s(s(half(p(s(p(s(x1))))))))
     , j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1)))))))))))
     , g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1)))))))))))
     , f(s(x1)) -> p(s(g(p(s(s(x1))))))
     , p(p(s(x1))) -> p(x1)
     , p(s(x1)) -> x1
     , p(0(x1)) -> 0(s(s(p(x1))))}
  StartTerms: all
  Strategy: none
Certificate: TIMEOUT
Proof:
  Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool IDA
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1)))))))))
     , half(s(s(x1))) -> s(half(p(p(s(s(x1))))))
     , half(0(x1)) -> 0(s(s(half(p(s(p(s(x1))))))))
     , j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1)))))))))))
     , g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1)))))))))))
     , f(s(x1)) -> p(s(g(p(s(s(x1))))))
     , p(p(s(x1))) -> p(x1)
     , p(s(x1)) -> x1
     , p(0(x1)) -> 0(s(s(p(x1))))}
  StartTerms: all
  Strategy: none
Certificate: TIMEOUT
Proof:
  Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI
stdout:
TIMEOUT
We consider the following Problem:
  Strict Trs:
    {  rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1)))))))))
     , half(s(s(x1))) -> s(half(p(p(s(s(x1))))))
     , half(0(x1)) -> 0(s(s(half(p(s(p(s(x1))))))))
     , j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1)))))))))))
     , g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1)))))))))))
     , f(s(x1)) -> p(s(g(p(s(s(x1))))))
     , p(p(s(x1))) -> p(x1)
     , p(s(x1)) -> x1
     , p(0(x1)) -> 0(s(s(p(x1))))}
  StartTerms: all
  Strategy: none
Certificate: TIMEOUT
Proof:
  Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool TRI2
stdout:
MAYBE
We consider the following Problem:
  Strict Trs:
    {  rd(0(x1)) -> 0(s(0(0(0(0(s(0(rd(x1)))))))))
     , half(s(s(x1))) -> s(half(p(p(s(s(x1))))))
     , half(0(x1)) -> 0(s(s(half(p(s(p(s(x1))))))))
     , j(s(x1)) -> p(s(s(p(s(f(p(s(p(p(s(x1)))))))))))
     , g(s(x1)) -> p(p(s(s(s(j(s(p(s(p(s(x1)))))))))))
     , f(s(x1)) -> p(s(g(p(s(s(x1))))))
     , p(p(s(x1))) -> p(x1)
     , p(s(x1)) -> x1
     , p(0(x1)) -> 0(s(s(p(x1))))}
  StartTerms: all
  Strategy: none
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..