LMPO
| Execution Time (secs) | 0.041  | 
| Answer | MAYBE  | 
| Input | AG01 3.1 | 
MAYBE
We consider the following Problem:
  Strict Trs:
    {  minus(x, 0()) -> x
     , minus(s(x), s(y)) -> minus(x, y)
     , quot(0(), s(y)) -> 0()
     , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.065  | 
| Answer | MAYBE  | 
| Input | AG01 3.1 | 
MAYBE
We consider the following Problem:
  Strict Trs:
    {  minus(x, 0()) -> x
     , minus(s(x), s(y)) -> minus(x, y)
     , quot(0(), s(y)) -> 0()
     , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.033  | 
| Answer | MAYBE  | 
| Input | AG01 3.1 | 
MAYBE
We consider the following Problem:
  Strict Trs:
    {  minus(x, 0()) -> x
     , minus(s(x), s(y)) -> minus(x, y)
     , quot(0(), s(y)) -> 0()
     , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.046  | 
| Answer | MAYBE  | 
| Input | AG01 3.1 | 
MAYBE
We consider the following Problem:
  Strict Trs:
    {  minus(x, 0()) -> x
     , minus(s(x), s(y)) -> minus(x, y)
     , quot(0(), s(y)) -> 0()
     , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.036  | 
| Answer | MAYBE  | 
| Input | AG01 3.1 | 
MAYBE
We consider the following Problem:
  Strict Trs:
    {  minus(x, 0()) -> x
     , minus(s(x), s(y)) -> minus(x, y)
     , quot(0(), s(y)) -> 0()
     , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.033  | 
| Answer | MAYBE  | 
| Input | AG01 3.1 | 
MAYBE
We consider the following Problem:
  Strict Trs:
    {  minus(x, 0()) -> x
     , minus(s(x), s(y)) -> minus(x, y)
     , quot(0(), s(y)) -> 0()
     , quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..