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


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


YES

******** General Schema criterion ********
Found constructors: appBG, banga
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) abs(%X.F[%X])@Y => F[Y]
 (meta F)[is acc in abs(%X.F[%X]),Y] [is positive in abs(%X.F[%X])] [is acc in F[%X]] 
 (meta Y)[is acc in abs(%X.F[%X]),Y] [is positive in abs(%X.F[%X])] [is acc in Y]  >>True
Checking  (2) abs(%Y.(U@%Y)) => U
 (meta U)[is acc in %Y.(U@%Y)] [is positive in U@%Y] [is acc in U]  >>True
Checking  (3) let(banga(V),%Z.I[%Z]) => I[V]
 (meta I)[is acc in banga(V),%Z.I[%Z]] [is positive in banga(V)] [is acc in I[%Z]] 
 (meta V)[is acc in banga(V),%Z.I[%Z]] [is positive in banga(V)] [is acc in V]  >>True
Checking  (4) let(P,%U.appBG(X1,banga(%U))) => appBG(X1,P)
 (fun let>appBG)
 (meta X1)[is acc in P,%U.appBG(X1,banga(%U))] [is positive in appBG(X1,banga(%U))] [is acc in X1] 
 (meta P)[is acc in P,%U.appBG(X1,banga(%U))] [is acc in P]  >>True
#SN!
******** Signature ********
 abs : (a -> b) -> ab
 app : (ab,a) -> b
 appBG : (BGaBGb,BGa) -> BGb
 banga : a -> BGa
 let : (BGa,(a -> BGb)) -> BGb
******** Computation Rules ********
 (1)  abs(%X.F[%X])@Y => F[Y]
 (2)  abs(%Y.(U@%Y)) => U
 (3)  let(banga(V),%Z.I[%Z]) => I[V]
 (4)  let(P,%U.appBG(X1,banga(%U))) => appBG(X1,P)

YES