Tool CaT
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
Problem:
f(0(),y) -> y
f(x,0()) -> x
f(i(x),y) -> i(x)
f(f(x,y),z) -> f(x,f(y,z))
f(g(x,y),z) -> g(f(x,z),f(y,z))
f(1(),g(x,y)) -> x
f(2(),g(x,y)) -> y
Proof:
OpenTool IRC1
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
Tool IRC2
| Execution Time | Unknown |
|---|
| Answer | TIMEOUT |
|---|
| Input | SK90 2.07 |
|---|
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: innermost runtime-complexity with respect to
Rules:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool RC1
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
Tool RC2
| Execution Time | Unknown |
|---|
| Answer | TIMEOUT |
|---|
| Input | SK90 2.07 |
|---|
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: runtime-complexity with respect to
Rules:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool pair1rc
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'pair1 (timeout of 60.0 seconds)':
-------------------------------------------------
The processor is not applicable, reason is:
Input problem is not restricted to innermost rewriting
We abort the transformation and continue with the subprocessor on the problem
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
1) None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'dp' failed due to the following reason:
We have computed the following dependency pairs
Strict Dependency Pairs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
We consider the following Problem:
Strict DPs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'Fastest':
-------------------------
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
'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) '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'' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
Arrrr..Tool pair2rc
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'pair2 (timeout of 60.0 seconds)':
-------------------------------------------------
The processor is not applicable, reason is:
Input problem is not restricted to innermost rewriting
We abort the transformation and continue with the subprocessor on the problem
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
1) None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'dp' failed due to the following reason:
We have computed the following dependency pairs
Strict Dependency Pairs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
We consider the following Problem:
Strict DPs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'Fastest':
-------------------------
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
'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) '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'' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
Arrrr..Tool pair3irc
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
The input problem contains no overlaps that give rise to inapplicable rules.
We abort the transformation and continue with the subprocessor on the problem
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: innermost
1) None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'dp' failed due to the following reason:
We have computed the following dependency pairs
Strict Dependency Pairs:
{ f^#(0(), y) -> c_1()
, f^#(x, 0()) -> c_2()
, f^#(i(x), y) -> c_3()
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6()
, f^#(2(), g(x, y)) -> c_7()}
We consider the following Problem:
Strict DPs:
{ f^#(0(), y) -> c_1()
, f^#(x, 0()) -> c_2()
, f^#(i(x), y) -> c_3()
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6()
, f^#(2(), g(x, y)) -> c_7()}
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Application of 'Fastest':
-------------------------
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
'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) '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 minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
Arrrr..Tool pair3rc
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
The processor is not applicable, reason is:
Input problem is not restricted to innermost rewriting
We abort the transformation and continue with the subprocessor on the problem
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
1) None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'dp' failed due to the following reason:
We have computed the following dependency pairs
Strict Dependency Pairs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
We consider the following Problem:
Strict DPs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'Fastest':
-------------------------
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
'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) '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 minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
Arrrr..Tool rc
| Execution Time | Unknown |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
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:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
We consider the following Problem:
Strict DPs:
{ f^#(0(), y) -> c_1(y)
, f^#(x, 0()) -> c_2(x)
, f^#(i(x), y) -> c_3(x)
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6(x)
, f^#(2(), g(x, y)) -> c_7(y)}
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: none
Certificate: MAYBE
Application of 'usablerules':
-----------------------------
All rules are usable.
No subproblems were generated.
Arrrr..Tool tup3irc
| Execution Time | 45.808205ms |
|---|
| Answer | MAYBE |
|---|
| Input | SK90 2.07 |
|---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Application of 'tup3 (timeout of 60.0 seconds)':
------------------------------------------------
The input problem contains no overlaps that give rise to inapplicable rules.
We abort the transformation and continue with the subprocessor on the problem
Strict Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: innermost
1) None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'dp' failed due to the following reason:
We have computed the following dependency pairs
Strict Dependency Pairs:
{ f^#(0(), y) -> c_1()
, f^#(x, 0()) -> c_2()
, f^#(i(x), y) -> c_3()
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)), f^#(y, z))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6()
, f^#(2(), g(x, y)) -> c_7()}
We consider the following Problem:
Strict DPs:
{ f^#(0(), y) -> c_1()
, f^#(x, 0()) -> c_2()
, f^#(i(x), y) -> c_3()
, f^#(f(x, y), z) -> c_4(f^#(x, f(y, z)), f^#(y, z))
, f^#(g(x, y), z) -> c_5(f^#(x, z), f^#(y, z))
, f^#(1(), g(x, y)) -> c_6()
, f^#(2(), g(x, y)) -> c_7()}
Weak Trs:
{ f(0(), y) -> y
, f(x, 0()) -> x
, f(i(x), y) -> i(x)
, f(f(x, y), z) -> f(x, f(y, z))
, f(g(x, y), z) -> g(f(x, z), f(y, z))
, f(1(), g(x, y)) -> x
, f(2(), g(x, y)) -> y}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Application of 'Fastest':
-------------------------
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
'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 3 (timeout of 100.0 seconds)' failed due to the following reason:
The input cannot be shown compatible
2) '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) '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 minimal-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
match-boundness of the problem could not be verified.
Arrrr..