MAYBE

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

No "->="-rules.

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

(VAR x)
(CONDITION 
-(x,x) == s(x)
)

Optimized the infeasibility problem if possible.

(VAR x)
(CONDITION 
-(x,x) == s(x)
)

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[-(x27,x28) == s(x) : { e, 1 }]
)
(NONTERMINALS
  Gamma[-(x27,x28) == s(x) : { e, 1 }]
  Gamma[-(x35,x36) == s4 : { e, 1 }]
)
(RULES
  Gamma[-(x27,x28) == s(x) : { e, 1 }] -> (Rec(Gamma[-(x35,x36) == s4 : { e, 1 }], { s3 -> s4, x28 -> x36, x27 -> x35 }) & { s3 -> s(x) })
  Gamma[-(x35,x36) == s4 : { e, 1 }] -> { s4 -> -(x35,x36) }
  Gamma[-(x35,x36) == s4 : { e, 1 }] -> { s4 -> 0, x36 -> x38, x35 -> 0 }
  Gamma[-(x35,x36) == s4 : { e, 1 }] -> { x39 -> x42, s4 -> x42, x36 -> 0, x35 -> x42 }
  Gamma[-(x35,x36) == s4 : { e, 1 }] -> (Rec(Gamma[-(x35,x36) == s4 : { e, 1 }], { s4 -> s4, y10 -> x36, x40 -> x35 }) . { x36 -> s(y10), x35 -> s(x40) })
)
)

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

This is not ultra-RL and deterministic.


MAYBE