Problem Secret 05 TRS cime4

Tool LMPO

Execution Time
0.037
Answer
MAYBE
InputSecret 05 TRS cime4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(X) -> u(h(X), h(X), X)
     , u(d(), c(Y), X) -> k(Y)
     , h(d()) -> c(a())
     , h(d()) -> c(b())
     , f(k(a()), k(b()), X) -> f(X, X, X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool MPO

Execution Time
0.053
Answer
MAYBE
InputSecret 05 TRS cime4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(X) -> u(h(X), h(X), X)
     , u(d(), c(Y), X) -> k(Y)
     , h(d()) -> c(a())
     , h(d()) -> c(b())
     , f(k(a()), k(b()), X) -> f(X, X, X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP*

Execution Time
0.033
Answer
MAYBE
InputSecret 05 TRS cime4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(X) -> u(h(X), h(X), X)
     , u(d(), c(Y), X) -> k(Y)
     , h(d()) -> c(a())
     , h(d()) -> c(b())
     , f(k(a()), k(b()), X) -> f(X, X, X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool POP* (PS)

Execution Time
0.035
Answer
MAYBE
InputSecret 05 TRS cime4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(X) -> u(h(X), h(X), X)
     , u(d(), c(Y), X) -> k(Y)
     , h(d()) -> c(a())
     , h(d()) -> c(b())
     , f(k(a()), k(b()), X) -> f(X, X, X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP*

Execution Time
0.039
Answer
MAYBE
InputSecret 05 TRS cime4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(X) -> u(h(X), h(X), X)
     , u(d(), c(Y), X) -> k(Y)
     , h(d()) -> c(a())
     , h(d()) -> c(b())
     , f(k(a()), k(b()), X) -> f(X, X, X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Tool Small POP* (PS)

Execution Time
0.091
Answer
MAYBE
InputSecret 05 TRS cime4

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  g(X) -> u(h(X), h(X), X)
     , u(d(), c(Y), X) -> k(Y)
     , h(d()) -> c(a())
     , h(d()) -> c(b())
     , f(k(a()), k(b()), X) -> f(X, X, X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..