Problem Transformed CSR 04 Ex1 GM03 FR

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	Transformed CSR 04 Ex1 GM03 FR

stdout:

MAYBE

Problem:
p(0()) -> 0()
p(s(X)) -> X
leq(0(),Y) -> true()
leq(s(X),0()) -> false()
leq(s(X),s(Y)) -> leq(X,Y)
if(true(),X,Y) -> activate(X)
if(false(),X,Y) -> activate(Y)
diff(X,Y) -> if(leq(X,Y),n__0(),n__s(n__diff(n__p(X),Y)))
0() -> n__0()
s(X) -> n__s(X)
diff(X1,X2) -> n__diff(X1,X2)
p(X) -> n__p(X)
activate(n__0()) -> 0()
activate(n__s(X)) -> s(activate(X))
activate(n__diff(X1,X2)) -> diff(activate(X1),activate(X2))
activate(n__p(X)) -> p(activate(X))
activate(X) -> X

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	Transformed CSR 04 Ex1 GM03 FR

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 GM03 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  p(0()) -> 0()
     , p(s(X)) -> X
     , leq(0(), Y) -> true()
     , leq(s(X), 0()) -> false()
     , leq(s(X), s(Y)) -> leq(X, Y)
     , if(true(), X, Y) -> activate(X)
     , if(false(), X, Y) -> activate(Y)
     , diff(X, Y) -> if(leq(X, Y), n__0(), n__s(n__diff(n__p(X), Y)))
     , 0() -> n__0()
     , s(X) -> n__s(X)
     , diff(X1, X2) -> n__diff(X1, X2)
     , p(X) -> n__p(X)
     , activate(n__0()) -> 0()
     , activate(n__s(X)) -> s(activate(X))
     , activate(n__diff(X1, X2)) -> diff(activate(X1), activate(X2))
     , activate(n__p(X)) -> p(activate(X))
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	Transformed CSR 04 Ex1 GM03 FR

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	Transformed CSR 04 Ex1 GM03 FR

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  p(0()) -> 0()
     , p(s(X)) -> X
     , leq(0(), Y) -> true()
     , leq(s(X), 0()) -> false()
     , leq(s(X), s(Y)) -> leq(X, Y)
     , if(true(), X, Y) -> activate(X)
     , if(false(), X, Y) -> activate(Y)
     , diff(X, Y) -> if(leq(X, Y), n__0(), n__s(n__diff(n__p(X), Y)))
     , 0() -> n__0()
     , s(X) -> n__s(X)
     , diff(X1, X2) -> n__diff(X1, X2)
     , p(X) -> n__p(X)
     , activate(n__0()) -> 0()
     , activate(n__s(X)) -> s(activate(X))
     , activate(n__diff(X1, X2)) -> diff(activate(X1), activate(X2))
     , activate(n__p(X)) -> p(activate(X))
     , activate(X) -> X}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds