Tool CaT
stdout:
MAYBE
Problem:
f(x,a()) -> f(x,b())
b() -> a()
f(a(),x) -> a()
f(b(),x) -> a()
f(f(x,y),z) -> a()
Proof:
Complexity Transformation Processor:
strict:
f(x,a()) -> f(x,b())
b() -> a()
f(a(),x) -> a()
f(b(),x) -> a()
f(f(x,y),z) -> a()
weak:
Bounds Processor:
bound: 1
enrichment: match
automaton:
final states: {3,2}
transitions:
a1() -> 2*
f0(1,1) -> 2*
f0(1,3) -> 2*
a0() -> 3,1
b0() -> 3*
problem:
strict:
f(x,a()) -> f(x,b())
b() -> a()
f(b(),x) -> a()
f(f(x,y),z) -> a()
weak:
f(a(),x) -> a()
Bounds Processor:
bound: 0
enrichment: match
automaton:
final states: {3,2}
transitions:
f0(1,1) -> 2*
f0(1,3) -> 2*
a0() -> 2,3,1
b0() -> 3*
problem:
strict:
f(x,a()) -> f(x,b())
b() -> a()
f(f(x,y),z) -> a()
weak:
f(b(),x) -> a()
f(a(),x) -> a()
Bounds Processor:
bound: 0
enrichment: match
automaton:
final states: {3,2}
transitions:
f0(1,1) -> 2*
f0(1,3) -> 2*
a0() -> 2,3,1
b0() -> 3*
problem:
strict:
f(x,a()) -> f(x,b())
b() -> a()
weak:
f(f(x,y),z) -> a()
f(b(),x) -> a()
f(a(),x) -> a()
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[b] = 6,
[f](x0, x1) = x0 + x1 + 6,
[a] = 12
orientation:
f(x,a()) = x + 18 >= x + 12 = f(x,b())
b() = 6 >= 12 = a()
f(f(x,y),z) = x + y + z + 12 >= 12 = a()
f(b(),x) = x + 12 >= 12 = a()
f(a(),x) = x + 18 >= 12 = a()
problem:
strict:
b() -> a()
weak:
f(x,a()) -> f(x,b())
f(f(x,y),z) -> a()
f(b(),x) -> a()
f(a(),x) -> a()
Open
Tool IRC1
stdout:
MAYBE
Warning when parsing problem:
Unsupported strategy 'OUTERMOST'Tool IRC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: innermost runtime-complexity with respect to
Rules:
{ f(x, a()) -> f(x, b())
, b() -> a()
, f(a(), x) -> a()
, f(b(), x) -> a()
, f(f(x, y), z) -> a()}
Proof Output:
Computation stopped due to timeout after 60.0 secondsTool RC1
stdout:
MAYBE
Warning when parsing problem:
Unsupported strategy 'OUTERMOST'Tool RC2
stdout:
TIMEOUT
'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer: TIMEOUT
Input Problem: runtime-complexity with respect to
Rules:
{ f(x, a()) -> f(x, b())
, b() -> a()
, f(a(), x) -> a()
, f(b(), x) -> a()
, f(f(x, y), z) -> a()}
Proof Output:
Computation stopped due to timeout after 60.0 seconds