/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: lim, s, z
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) z + X => X
 (meta X)[is acc in z,X] [is positive in z] [is acc in X]  >>True
Checking  (2) s(Y) + U => s(Y + U)
 (fun plus>s)
 (fun plus=plus) subterm comparison of args w. LR LR
 (meta Y)[is acc in s(Y),U] [is positive in s(Y)] [is acc in Y] 
 (meta U)[is acc in s(Y),U] [is positive in s(Y)] [is acc in U]  >>True
Checking  (3) lim(%X.H[%X]) + W => lim(%Y.(H[%Y] + W))
 (fun plus>lim)
 (fun plus=plus) subterm comparison of args w. LR LR
 (meta H)[is acc in lim(%X.H[%X]),W] [is positive in lim(%X.H[%X])] [is acc in H[%X]] 
 (meta W)[is acc in lim(%X.H[%X]),W] [is positive in lim(%X.H[%X])] [is acc in W]  >>True
#SN!
******** Signature ********
 lim : (N -> O) -> O
 plus : (O,O) -> O
 s : O -> O
 z : O
******** Computation Rules ********
 (1)  z + X => X
 (2)  s(Y) + U => s(Y + U)
 (3)  lim(%X.H[%X]) + W => lim(%Y.(H[%Y] + W))

YES