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


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


YES

******** General Schema criterion ********
Found constructors: 
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) unbox(box(V)) => V
 (meta V)[is acc in box(V)] [is positive in box(V)] [is acc in V]  >>True
Checking  (4) box(unbox(W)) => W
 (meta W)[is acc in unbox(W)] [is positive in unbox(W)] [is acc in W]  >>True
#SN!
******** Signature ********
 abs : (a -> b) -> Arrab
 app : (Arrab,a) -> b
 box : a -> Boxa
 unbox : Boxa -> a
******** Computation Rules ********
 (1)  abs(%X.F[%X])@Y => F[Y]
 (2)  abs(%Y.(U@%Y)) => U
 (3)  unbox(box(V)) => V
 (4)  box(unbox(W)) => W

YES