/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: 
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) pia(pair(V,W)) => V
 (meta V)[is acc in pair(V,W)] [is positive in pair(V,W)] [is acc in V]  >>True
Checking  (4) pib(pair(P,X1)) => X1
 (meta X1)[is acc in pair(P,X1)] [is positive in pair(P,X1)] [is acc in X1]  >>True
Checking  (5) pair(pia(Y1),pib(Y1)) => Y1
 (meta Y1)[is acc in pia(Y1),pib(Y1)] [is positive in pia(Y1)] [is acc in Y1]  >>True
#SN!
******** Signature ********
 app : (arrab,a) -> b
 lam : (a -> b) -> arrab
 pair : (a,b) -> prodab
 pia : prodab -> a
 pib : prodab -> b
******** Computation Rules ********
 (1)  lam(%X.F[%X])@Y => F[Y]
 (2)  lam(%Y.(U@%Y)) => U
 (3)  pia(pair(V,W)) => V
 (4)  pib(pair(P,X1)) => X1
 (5)  pair(pia(Y1),pib(Y1)) => Y1

YES