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


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


YES

******** General Schema criterion ********
Found constructors: succ, zero
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) lam(%X.F[%X])@Y => F[Y]
 (meta F)[is acc in lam(%X.F[%X]),Y] [is positive in lam(%X.F[%X])] [is acc in F[%X]] 
 (meta Y)[is acc in lam(%X.F[%X]),Y] [is positive in lam(%X.F[%X])] [is acc in Y]  >>True
Checking  (2) lam(%Y.(U@%Y)) => U
 (meta U)[is acc in %Y.(U@%Y)] [is positive in U@%Y] [is acc in U]  >>True
Checking  (3) rec(zero,V,%Z.I[%Z]) => V
 (meta V)[is acc in zero,V,%Z.I[%Z]] [is positive in zero] [is acc in V]  >>True
Checking  (4) rec(succ(P),X1,%U.Z1[%U]) => Z1[P,rec(P,X1,%V.Z1[%V])]
 (meta Z1)[is acc in succ(P),X1,%U.Z1[%U]] [is positive in succ(P)] [is acc in Z1[%U]] 
 (meta P)[is acc in succ(P),X1,%U.Z1[%U]] [is positive in succ(P)] [is acc in P] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta P)[is acc in succ(P),X1,%U.Z1[%U]] [is positive in succ(P)] [is acc in P] 
 (meta X1)[is acc in succ(P),X1,%U.Z1[%U]] [is positive in succ(P)] [is acc in X1] 
 (meta Z1)[is acc in succ(P),X1,%U.Z1[%U]] [is positive in succ(P)] [is acc in Z1[%U]]  >>True
#SN!
******** Signature ********
 app : (arrab,a) -> b
 lam : (a -> b) -> arrab
 rec : (Nat,a,((Nat,a) -> a)) -> a
 succ : Nat -> Nat
 zero : Nat
******** Computation Rules ********
 (1)  lam(%X.F[%X])@Y => F[Y]
 (2)  lam(%Y.(U@%Y)) => U
 (3)  rec(zero,V,%Z.I[%Z]) => V
 (4)  rec(succ(P),X1,%U.Z1[%U]) => Z1[P,rec(P,X1,%V.Z1[%V])]

YES