Tool CaT
stdout:
MAYBE
Problem:
a() -> f(a())
f(f(x)) -> b()
0(f(x)) -> 1(x)
1(f(x)) -> f(0(x))
Proof:
Complexity Transformation Processor:
strict:
a() -> f(a())
f(f(x)) -> b()
0(f(x)) -> 1(x)
1(f(x)) -> f(0(x))
weak:
Bounds Processor:
bound: 0
enrichment: match
automaton:
final states: {5,4,3,2}
transitions:
a0() -> 2*
f0(12) -> 13*
f0(1) -> 3*
b0() -> 1*
00(1) -> 4*
10(1) -> 5*
1 -> 13*
2 -> 12*
13 -> 2*
problem:
strict:
a() -> f(a())
f(f(x)) -> b()
0(f(x)) -> 1(x)
weak:
1(f(x)) -> f(0(x))
Bounds Processor:
bound: 0
enrichment: match
automaton:
final states: {5,4,3,2}
transitions:
a0() -> 2*
f0(10) -> 11*
f0(1) -> 3*
b0() -> 1*
00(1) -> 4*
10(1) -> 5*
1 -> 11*
2 -> 10*
11 -> 2*
problem:
strict:
a() -> f(a())
f(f(x)) -> b()
weak:
0(f(x)) -> 1(x)
1(f(x)) -> f(0(x))
Matrix Interpretation Processor:
dimension: 1
max_matrix:
1
interpretation:
[1](x0) = x0 + 32,
[0](x0) = x0 + 32,
[b] = 0,
[f](x0) = x0 + 110,
[a] = 20
orientation:
a() = 20 >= 130 = f(a())
f(f(x)) = x + 220 >= 0 = b()
0(f(x)) = x + 142 >= x + 32 = 1(x)
1(f(x)) = x + 142 >= x + 142 = f(0(x))
problem:
strict:
a() -> f(a())
weak:
f(f(x)) -> b()
0(f(x)) -> 1(x)
1(f(x)) -> f(0(x))
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:
{ a() -> f(a())
, f(f(x)) -> b()
, 0(f(x)) -> 1(x)
, 1(f(x)) -> f(0(x))}
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:
{ a() -> f(a())
, f(f(x)) -> b()
, 0(f(x)) -> 1(x)
, 1(f(x)) -> f(0(x))}
Proof Output:
Computation stopped due to timeout after 60.0 seconds