MAYBE

Succeeded in reading "/export/starexec/sandbox2/benchmark/theBenchmark.ari".
    (CONDITIONTYPE ORIENTED)
    (VAR x y)
    (RULES
      +(0,x) -> x
      +(s(x),y) -> s(+(x,y))
    )

No "->="-rules.

Decomposed conditions and removed infeasible rules if possible.
    (VAR x y)
    (RULES
      +(0,x) -> x
      +(s(x),y) -> s(+(x,y))
    )

(VAR y x)
(CONDITION 
+(s(x),y) == s(y)
)

Optimized the infeasibility problem if possible.

(VAR y x)
(CONDITION 
+(s(x),y) == s(y)
)

This is ultra-RL and deterministic.

This is operationally terminating and confluent.

Failed to prove joinability of a ccp with the conditions.

This is a constructor-based system.

(RTG_of_NARROWINGTREE
(START
  Gamma[+(s(x),y10) == s(y) : { e, 1, 1.1 }]
)
(NONTERMINALS
  Gamma[+(s(x),y10) == s(y) : { e, 1, 1.1 }]
  Gamma[+(s7,y13) == s8 : { e, 1 }]
)
(RULES
  Gamma[+(s(x),y10) == s(y) : { e, 1, 1.1 }] -> ({ s5 -> s(x) } & (Rec(Gamma[+(s7,y13) == s8 : { e, 1 }], { s6 -> s8, y10 -> y13, s5 -> s7 }) & { s6 -> s(y) }))
  Gamma[+(s7,y13) == s8 : { e, 1 }] -> { s8 -> +(s7,y13) }
  Gamma[+(s7,y13) == s8 : { e, 1 }] -> { x25 -> x27, s8 -> x27, y13 -> x27, s7 -> 0 }
  Gamma[+(s7,y13) == s8 : { e, 1 }] -> ((Rec(Gamma[+(s7,y13) == s8 : { e, 1 }], { +2 -> s8, y14 -> y13, x26 -> s7 }) & { s8 -> s(+2) }) . { y13 -> y14, s7 -> s(x26) })
)
)

Failed to prove infeasibility of the linearized conditions by means of narrowing trees.

This is not ultra-RL and deterministic.


MAYBE