interpretations
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__a() -> a__c()
, a__a() -> a__d()
, a__a() -> a()
, a__c() -> e()
, a__c() -> l()
, a__c() -> c()
, a__b() -> a__c()
, a__b() -> a__d()
, a__b() -> b()
, a__k() -> l()
, a__k() -> m()
, a__k() -> k()
, a__d() -> m()
, a__d() -> d()
, a__A() -> a__h(a__f(a__a()), a__f(a__b()))
, a__A() -> A()
, a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
, a__h(X1, X2) -> h(X1, X2)
, a__f(X) -> a__z(mark(X), X)
, a__f(X) -> f(X)
, a__g(X1, X2, X3) -> g(X1, X2, X3)
, a__g(d(), X, X) -> a__A()
, mark(e()) -> e()
, mark(l()) -> l()
, mark(m()) -> m()
, mark(d()) -> a__d()
, mark(A()) -> a__A()
, mark(a()) -> a__a()
, mark(b()) -> a__b()
, mark(c()) -> a__c()
, mark(k()) -> a__k()
, mark(z(X1, X2)) -> a__z(mark(X1), X2)
, mark(f(X)) -> a__f(mark(X))
, mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
, mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
, a__z(X1, X2) -> z(X1, X2)
, a__z(e(), X) -> mark(X) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
None of the processors succeeded.
Details of failed attempt(s):
-----------------------------
1) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
2) 'matrix interpretation of dimension 3' failed due to the
following reason:
The input cannot be shown compatible
3) 'custom shape polynomial interpretation' failed due to the
following reason:
The input cannot be shown compatible
4) 'matrix interpretation of dimension 1' failed due to the
following reason:
The input cannot be shown compatible
Arrrr..
lmpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__a() -> a__c()
, a__b() -> a__c()
, a__c() -> e()
, a__k() -> l()
, a__d() -> m()
, a__a() -> a__d()
, a__b() -> a__d()
, a__c() -> l()
, a__k() -> m()
, a__A() -> a__h(a__f(a__a()), a__f(a__b()))
, a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
, a__g(d(), X, X) -> a__A()
, a__f(X) -> a__z(mark(X), X)
, a__z(e(), X) -> mark(X)
, mark(A()) -> a__A()
, mark(a()) -> a__a()
, mark(b()) -> a__b()
, mark(c()) -> a__c()
, mark(d()) -> a__d()
, mark(k()) -> a__k()
, mark(z(X1, X2)) -> a__z(mark(X1), X2)
, mark(f(X)) -> a__f(mark(X))
, mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
, mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
, mark(e()) -> e()
, mark(l()) -> l()
, mark(m()) -> m()
, a__A() -> A()
, a__a() -> a()
, a__b() -> b()
, a__c() -> c()
, a__d() -> d()
, a__k() -> k()
, a__z(X1, X2) -> z(X1, X2)
, a__f(X) -> f(X)
, a__h(X1, X2) -> h(X1, X2)
, a__g(X1, X2, X3) -> g(X1, X2, X3) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__a() -> a__c()
, a__b() -> a__c()
, a__c() -> e()
, a__k() -> l()
, a__d() -> m()
, a__a() -> a__d()
, a__b() -> a__d()
, a__c() -> l()
, a__k() -> m()
, a__A() -> a__h(a__f(a__a()), a__f(a__b()))
, a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
, a__g(d(), X, X) -> a__A()
, a__f(X) -> a__z(mark(X), X)
, a__z(e(), X) -> mark(X)
, mark(A()) -> a__A()
, mark(a()) -> a__a()
, mark(b()) -> a__b()
, mark(c()) -> a__c()
, mark(d()) -> a__d()
, mark(k()) -> a__k()
, mark(z(X1, X2)) -> a__z(mark(X1), X2)
, mark(f(X)) -> a__f(mark(X))
, mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
, mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
, mark(e()) -> e()
, mark(l()) -> l()
, mark(m()) -> m()
, a__A() -> A()
, a__a() -> a()
, a__b() -> b()
, a__c() -> c()
, a__d() -> d()
, a__k() -> k()
, a__z(X1, X2) -> z(X1, X2)
, a__f(X) -> f(X)
, a__h(X1, X2) -> h(X1, X2)
, a__g(X1, X2, X3) -> g(X1, X2, X3) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__a() -> a__c()
, a__b() -> a__c()
, a__c() -> e()
, a__k() -> l()
, a__d() -> m()
, a__a() -> a__d()
, a__b() -> a__d()
, a__c() -> l()
, a__k() -> m()
, a__A() -> a__h(a__f(a__a()), a__f(a__b()))
, a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
, a__g(d(), X, X) -> a__A()
, a__f(X) -> a__z(mark(X), X)
, a__z(e(), X) -> mark(X)
, mark(A()) -> a__A()
, mark(a()) -> a__a()
, mark(b()) -> a__b()
, mark(c()) -> a__c()
, mark(d()) -> a__d()
, mark(k()) -> a__k()
, mark(z(X1, X2)) -> a__z(mark(X1), X2)
, mark(f(X)) -> a__f(mark(X))
, mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
, mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
, mark(e()) -> e()
, mark(l()) -> l()
, mark(m()) -> m()
, a__A() -> A()
, a__a() -> a()
, a__b() -> b()
, a__c() -> c()
, a__d() -> d()
, a__k() -> k()
, a__z(X1, X2) -> z(X1, X2)
, a__f(X) -> f(X)
, a__h(X1, X2) -> h(X1, X2)
, a__g(X1, X2, X3) -> g(X1, X2, X3) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ a__a() -> a__c()
, a__b() -> a__c()
, a__c() -> e()
, a__k() -> l()
, a__d() -> m()
, a__a() -> a__d()
, a__b() -> a__d()
, a__c() -> l()
, a__k() -> m()
, a__A() -> a__h(a__f(a__a()), a__f(a__b()))
, a__h(X, X) -> a__g(mark(X), mark(X), a__f(a__k()))
, a__g(d(), X, X) -> a__A()
, a__f(X) -> a__z(mark(X), X)
, a__z(e(), X) -> mark(X)
, mark(A()) -> a__A()
, mark(a()) -> a__a()
, mark(b()) -> a__b()
, mark(c()) -> a__c()
, mark(d()) -> a__d()
, mark(k()) -> a__k()
, mark(z(X1, X2)) -> a__z(mark(X1), X2)
, mark(f(X)) -> a__f(mark(X))
, mark(h(X1, X2)) -> a__h(mark(X1), mark(X2))
, mark(g(X1, X2, X3)) -> a__g(mark(X1), mark(X2), mark(X3))
, mark(e()) -> e()
, mark(l()) -> l()
, mark(m()) -> m()
, a__A() -> A()
, a__a() -> a()
, a__b() -> b()
, a__c() -> c()
, a__d() -> d()
, a__k() -> k()
, a__z(X1, X2) -> z(X1, X2)
, a__f(X) -> f(X)
, a__h(X1, X2) -> h(X1, X2)
, a__g(X1, X2, X3) -> g(X1, X2, X3) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..