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


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


NO

Problem 1: 

(VAR L N)
(RULES
U11(tt) -> tt
U21(tt) -> tt
U31(tt) -> tt
U41(tt) -> U42(isNatIList)
U42(tt) -> tt
U51(tt) -> U52(isNatList)
U52(tt) -> tt
U61(tt) -> U62(isNat)
U62(tt) -> s(length(L))
isNat -> U11(isNatList)
isNat -> U21(isNat)
isNat -> tt
isNatIList -> U31(isNatList)
isNatIList -> U41(isNat)
isNatIList -> tt
isNatList -> U51(isNat)
isNatList -> tt
length(cons(N)) -> U61(isNatList)
length(nil) -> 0
zeros -> cons(0)
)

Problem 1: 

Extra Variables Processor:
-> Rules:
 U11(tt) -> tt
 U21(tt) -> tt
 U31(tt) -> tt
 U41(tt) -> U42(isNatIList)
 U42(tt) -> tt
 U51(tt) -> U52(isNatList)
 U52(tt) -> tt
 U61(tt) -> U62(isNat)
 U62(tt) -> s(length(L))
 isNat -> U11(isNatList)
 isNat -> U21(isNat)
 isNat -> tt
 isNatIList -> U31(isNatList)
 isNatIList -> U41(isNat)
 isNatIList -> tt
 isNatList -> U51(isNat)
 isNatList -> tt
 length(cons(N)) -> U61(isNatList)
 length(nil) -> 0
 zeros -> cons(0)
-> The system has extra variables.

The problem is infinite.