/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: inl, inr
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) case(inl(V),%U.I[%U],%Z.J[%Z]) => I[V]
 (meta I)[is acc in inl(V),%U.I[%U],%Z.J[%Z]] [is positive in inl(V)] [is acc in I[%U]] 
 (meta V)[is acc in inl(V),%U.I[%U],%Z.J[%Z]] [is positive in inl(V)] [is acc in V]  >>True
Checking  (4) case(inr(X1),%W.Z1[%W],%V.G1[%V]) => G1[X1]
 (meta G1)[is acc in inr(X1),%W.Z1[%W],%V.G1[%V]] [is positive in inr(X1)] [is acc in G1[%V]] 
 (meta X1)[is acc in inr(X1),%W.Z1[%W],%V.G1[%V]] [is positive in inr(X1)] [is acc in X1]  >>True
#SN!
******** Signature ********
 app : (arrAB,A) -> B
 case : (SAB,(A -> C),(B -> C)) -> C
 inl : A -> SAB
 inr : B -> SAB
 lam : (A -> B) -> arrAB
******** Computation Rules ********
 (1)  lam(%X.F[%X])@Y => F[Y]
 (2)  lam(%Y.(U@%Y)) => U
 (3)  case(inl(V),%U.I[%U],%Z.J[%Z]) => I[V]
 (4)  case(inr(X1),%W.Z1[%W],%V.G1[%V]) => G1[X1]

YES