Problem Strategy outermost added 08 MYNAT nosorts L

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 MYNAT nosorts L

stdout:

MAYBE
The following error occured:
 The problem does not contain well-formed TRSs:
                                              
                                                REWRITE relation according to the following TRS
                                                 {  and(tt()) -> X
                                                  , plus(N, 0()) -> N
                                                  , plus(N, s(M)) -> s(plus(N, M))
                                                  , x(N, 0()) -> 0()
                                                  , x(N, s(M)) -> plus(x(N, M), N)}


Try --help.

Tool IRC2

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 MYNAT nosorts L

stdout:

MAYBE

The following error(s) occured:

 The problem does not contain well-formed TRSs:
   REWRITE relation according to the following TRS and outermost reductions
    {  and(tt()) -> X
     , plus(N, 0()) -> N
     , plus(N, s(M)) -> s(plus(N, M))
     , x(N, 0()) -> 0()
     , x(N, s(M)) -> plus(x(N, M), N)}

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 MYNAT nosorts L

stdout:

MAYBE
The following error occured:
 The problem does not contain well-formed TRSs:
                                              
                                                REWRITE relation according to the following TRS
                                                 {  and(tt()) -> X
                                                  , plus(N, 0()) -> N
                                                  , plus(N, s(M)) -> s(plus(N, M))
                                                  , x(N, 0()) -> 0()
                                                  , x(N, s(M)) -> plus(x(N, M), N)}


Try --help.

Tool RC2

Execution TimeUnknown
Answer
MAYBE
InputStrategy outermost added 08 MYNAT nosorts L

stdout:

MAYBE

The following error(s) occured:

 The problem does not contain well-formed TRSs:
   REWRITE relation according to the following TRS and outermost reductions
    {  and(tt()) -> X
     , plus(N, 0()) -> N
     , plus(N, s(M)) -> s(plus(N, M))
     , x(N, 0()) -> 0()
     , x(N, s(M)) -> plus(x(N, M), N)}