/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) -> U12(isNat)
U12(tt) -> U13(isNat)
U13(tt) -> tt
U21(tt) -> U22(isNat)
U22(tt) -> tt
U31(tt) -> N
U41(tt) -> s(plus(N,M))
and(tt) -> X
isNat -> U11(and(isNatKind))
isNat -> U21(isNatKind)
isNat -> tt
isNatKind -> and(isNatKind)
isNatKind -> isNatKind
isNatKind -> tt
plus(N,0) -> U31(and(isNat))
plus(N,s(M)) -> U41(and(and(isNat)))
)

Problem 1: 

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

The problem is infinite.