interpretations
Execution Time (secs) | - |
Answer | YES(?,O(n^1)) |
Input | SK90 2.36 |
YES(?,O(n^1))
We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).
Strict Trs:
{ implies(x, or(y, z)) -> or(y, implies(x, z))
, implies(not(x), y) -> or(x, y)
, implies(not(x), or(y, z)) -> implies(y, or(x, z)) }
Obligation:
innermost runtime complexity
Answer:
YES(?,O(n^1))
The following argument positions are usable:
Uargs(implies) = {}, Uargs(not) = {}, Uargs(or) = {2}
TcT has computed following constructor-based matrix interpretation
satisfying not(EDA).
[implies](x1, x2) = [3] x1 + [3] x2 + [2]
[not](x1) = [1] x1 + [1]
[or](x1, x2) = [1] x1 + [1] x2 + [2]
This order satisfies following ordering constraints
[implies(x, or(y, z))] = [3] x + [3] y + [3] z + [8]
> [3] x + [1] y + [3] z + [4]
= [or(y, implies(x, z))]
[implies(not(x), y)] = [3] x + [3] y + [5]
> [1] x + [1] y + [2]
= [or(x, y)]
[implies(not(x), or(y, z))] = [3] x + [3] y + [3] z + [11]
> [3] x + [3] y + [3] z + [8]
= [implies(y, or(x, z))]
Hurray, we answered YES(?,O(n^1))
lmpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 2.36 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ implies(not(x), y) -> or(x, y)
, implies(not(x), or(y, z)) -> implies(y, or(x, z))
, implies(x, or(y, z)) -> or(y, implies(x, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
mpo
Execution Time (secs) | - |
Answer | MAYBE |
Input | SK90 2.36 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ implies(not(x), y) -> or(x, y)
, implies(not(x), or(y, z)) -> implies(y, or(x, z))
, implies(x, or(y, z)) -> or(y, implies(x, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar
Execution Time (secs) | 0.131 |
Answer | MAYBE |
Input | SK90 2.36 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ implies(not(x), y) -> or(x, y)
, implies(not(x), or(y, z)) -> implies(y, or(x, z))
, implies(x, or(y, z)) -> or(y, implies(x, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..
popstar-ps
Execution Time (secs) | 0.153 |
Answer | MAYBE |
Input | SK90 2.36 |
MAYBE
We are left with following problem, upon which TcT provides the
certificate MAYBE.
Strict Trs:
{ implies(not(x), y) -> or(x, y)
, implies(not(x), or(y, z)) -> implies(y, or(x, z))
, implies(x, or(y, z)) -> or(y, implies(x, z)) }
Obligation:
innermost runtime complexity
Answer:
MAYBE
The input cannot be shown compatible
Arrrr..