/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: return
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) return(X) >>=%X.Z[%X] => Z[X]
 (meta Z)[is acc in return(X),%X.Z[%X]] [is positive in return(X)] [is acc in Z[%X]] 
 (meta X)[is acc in return(X),%X.Z[%X]] [is positive in return(X)] [is acc in X]  >>True
Checking  (2) U >>=%Y.return(%Y) => U
 (meta U)[is acc in U,%Y.return(%Y)] [is acc in U]  >>True
Checking  (3) (V >>=%U.I[%U]) >>=%Z.J[%Z] => V >>=%W.(I[%W] >>=%V.J[%V])
 (fun bind=bind) subterm comparison of args w. LR LR
 (meta V)[is acc in V >>=%U.I[%U],%Z.J[%Z]] [is positive in V >>=%U.I[%U]] [is acc in V] 
 (fun bind=bind) subterm comparison of args w. LR LR
 (meta I)[is acc in V >>=%U.I[%U],%Z.J[%Z]] [is positive in V >>=%U.I[%U]] [is acc in I[%U]] 
 (meta J)[is acc in V >>=%U.I[%U],%Z.J[%Z]] [is positive in V >>=%U.I[%U]] [is acc in J[%Z]]  >>True
#SN!
******** Signature ********
 bind : (Ta,(a -> Ta)) -> Ta
 return : a -> Ta
******** Computation Rules ********
 (1)  return(X) >>=%X.Z[%X] => Z[X]
 (2)  U >>=%Y.return(%Y) => U
 (3)  (V >>=%U.I[%U]) >>=%Z.J[%Z] => V >>=%W.(I[%W] >>=%V.J[%V])

YES