Tool CaT
Execution Time | Unknown |
---|
Answer | MAYBE |
---|
Input | AG01 3.36 |
---|
stdout:
MAYBE
Problem:
minus(x,0()) -> x
minus(s(x),s(y)) -> minus(x,y)
f(0()) -> s(0())
f(s(x)) -> minus(s(x),g(f(x)))
g(0()) -> 0()
g(s(x)) -> minus(s(x),f(g(x)))
Proof:
OpenTool IRC1
Execution Time | Unknown |
---|
Answer | MAYBE |
---|
Input | AG01 3.36 |
---|
stdout:
MAYBE
Tool IRC2
Execution Time | Unknown |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: innermost runtime-complexity with respect to
Rules:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool RC1
Execution Time | Unknown |
---|
Answer | MAYBE |
---|
Input | AG01 3.36 |
---|
stdout:
MAYBE
Tool RC2
Execution Time | Unknown |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: runtime-complexity with respect to
Rules:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool pair1rc
Execution Time | Unknown |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: none
Certificate: TIMEOUT
Application of 'pair1 (timeout of 60.0 seconds)':
-------------------------------------------------
Computation stopped due to timeout after 60.0 seconds
Arrrr..Tool pair2rc
Execution Time | Unknown |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: none
Certificate: TIMEOUT
Application of 'pair2 (timeout of 60.0 seconds)':
-------------------------------------------------
Computation stopped due to timeout after 60.0 seconds
Arrrr..Tool pair3irc
Execution Time | Unknown |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: TIMEOUT
Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
Computation stopped due to timeout after 60.0 seconds
Arrrr..Tool pair3rc
Execution Time | Unknown |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: none
Certificate: TIMEOUT
Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
Computation stopped due to timeout after 60.0 seconds
Arrrr..Tool rc
Execution Time | Unknown |
---|
Answer | MAYBE |
---|
Input | AG01 3.36 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'rc (timeout of 60.0 seconds)':
----------------------------------------------
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'Fastest' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'Sequentially' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
Empty strict component of the problem is NOT empty.
2) 'Fastest' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'matrix-interpretation of dimension 4 (timeout of 100.0 seconds)' failed due to the following reason:
The input cannot be shown compatible
2) 'matrix-interpretation of dimension 3 (timeout of 100.0 seconds)' failed due to the following reason:
The input cannot be shown compatible
3) 'matrix-interpretation of dimension 2 (timeout of 100.0 seconds)' failed due to the following reason:
The input cannot be shown compatible
2) 'Fastest' failed due to the following reason:
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'Bounds with perSymbol-enrichment and initial automaton 'match' (timeout of 5.0 seconds)' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'Bounds with minimal-enrichment and initial automaton 'match' (timeout of 100.0 seconds)' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'dp' failed due to the following reason:
We have computed the following dependency pairs
Strict Dependency Pairs:
{ minus^#(x, 0()) -> c_1(x)
, minus^#(s(x), s(y)) -> c_2(minus^#(x, y))
, f^#(0()) -> c_3()
, f^#(s(x)) -> c_4(minus^#(s(x), g(f(x))))
, g^#(0()) -> c_5()
, g^#(s(x)) -> c_6(minus^#(s(x), f(g(x))))}
We consider the following Problem:
Strict DPs:
{ minus^#(x, 0()) -> c_1(x)
, minus^#(s(x), s(y)) -> c_2(minus^#(x, y))
, f^#(0()) -> c_3()
, f^#(s(x)) -> c_4(minus^#(s(x), g(f(x))))
, g^#(0()) -> c_5()
, g^#(s(x)) -> c_6(minus^#(s(x), f(g(x))))}
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'usablerules':
-----------------------------
All rules are usable.
No subproblems were generated.
Arrrr..Tool tup3irc
Execution Time | 60.05796ms |
---|
Answer | TIMEOUT |
---|
Input | AG01 3.36 |
---|
stdout:
TIMEOUT
We consider the following Problem:
Strict Trs:
{ minus(x, 0()) -> x
, minus(s(x), s(y)) -> minus(x, y)
, f(0()) -> s(0())
, f(s(x)) -> minus(s(x), g(f(x)))
, g(0()) -> 0()
, g(s(x)) -> minus(s(x), f(g(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: TIMEOUT
Application of 'tup3 (timeout of 60.0 seconds)':
------------------------------------------------
Computation stopped due to timeout after 60.0 seconds
Arrrr..