Tool Bounds
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ p(0(x1)) -> 0(s(s(s(s(x1)))))
, p(s(x1)) -> x1
, p(p(s(x1))) -> p(x1)
, bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1))))))))))))
, bar(0(x1)) -> 0(p(s(s(s(x1)))))
, foo(s(x1)) ->
p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))))))
, foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: TIMEOUT
Proof:
Computation stopped due to timeout after 60.0 seconds.
Arrrr..Tool EDA
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ p(0(x1)) -> 0(s(s(s(s(x1)))))
, p(s(x1)) -> x1
, p(p(s(x1))) -> p(x1)
, bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1))))))))))))
, bar(0(x1)) -> 0(p(s(s(s(x1)))))
, foo(s(x1)) ->
p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))))))
, foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(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:
{ p(0(x1)) -> 0(s(s(s(s(x1)))))
, p(s(x1)) -> x1
, p(p(s(x1))) -> p(x1)
, bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1))))))))))))
, bar(0(x1)) -> 0(p(s(s(s(x1)))))
, foo(s(x1)) ->
p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))))))
, foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(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:
{ p(0(x1)) -> 0(s(s(s(s(x1)))))
, p(s(x1)) -> x1
, p(p(s(x1))) -> p(x1)
, bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1))))))))))))
, bar(0(x1)) -> 0(p(s(s(s(x1)))))
, foo(s(x1)) ->
p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))))))
, foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(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:
{ p(0(x1)) -> 0(s(s(s(s(x1)))))
, p(s(x1)) -> x1
, p(p(s(x1))) -> p(x1)
, bar(s(x1)) -> p(s(p(p(s(s(foo(s(p(p(s(s(x1))))))))))))
, bar(0(x1)) -> 0(p(s(s(s(x1)))))
, foo(s(x1)) ->
p(s(p(p(p(s(s(p(s(s(p(s(foo(p(p(s(s(p(s(bar(p(p(s(s(p(s(x1))))))))))))))))))))))))))
, foo(0(x1)) -> 0(s(p(p(p(s(s(s(p(s(x1))))))))))}
StartTerms: all
Strategy: none
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..