/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Problem 1: 

(VAR M N X)
(RULES
U11(tt) -> N
U21(tt) -> s(plus(N,M))
U31(tt) -> 0
U41(tt) -> plus(x(N,M),N)
and(tt) -> X
isNat -> and(isNat)
isNat -> isNat
isNat -> tt
plus(N,0) -> U11(isNat)
plus(N,s(M)) -> U21(and(isNat))
x(N,0) -> U31(isNat)
x(N,s(M)) -> U41(and(isNat))
)

Problem 1: 

Extra Variables Processor:
-> Rules:
 U11(tt) -> N
 U21(tt) -> s(plus(N,M))
 U31(tt) -> 0
 U41(tt) -> plus(x(N,M),N)
 and(tt) -> X
 isNat -> and(isNat)
 isNat -> isNat
 isNat -> tt
 plus(N,0) -> U11(isNat)
 plus(N,s(M)) -> U21(and(isNat))
 x(N,0) -> U31(isNat)
 x(N,s(M)) -> U41(and(isNat))
-> The system has extra variables.

The problem is infinite.