/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: 0, false, true
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) rec(F,ap(Z,0)) => Z
 (meta Z)[is acc in F,ap(Z,0)] [is acc in Z]  >>True
Checking  (ap) ap(x.M[x],N) => M[N]
 (meta M)[is acc in x.M[x],N] [is acc in M[x]] 
 (meta N)[is acc in x.M[x],N] [is acc in N]  >>True
Checking  (ap0) ap(M,N) => M[N]
 (meta M)[is acc in M,N] [is acc in M] 
 (meta N)[is acc in M,N] [is acc in N]  >>True
Checking  (2) g(U) => true
 (fun g>true) >>True
Checking  (3) h(V,I,P) => not(I[P])
 (fun h>not)
 (meta I)[is acc in V,I,P] [is acc in I] 
 (meta P)[is acc in V,I,P] [is acc in P]  >>True
Checking  (4) not(true) => false
 (fun not>false) >>True
Checking  (5) not(false) => true
 (fun not>true) >>True
Checking  (6) even(X1,Y1) => rec(h,g(X1),Y1)
 (fun even>rec)
 (fun even>h)
 (fun even>g)
 (meta X1)[is acc in X1,Y1] [is acc in X1] 
 (meta Y1)[is acc in X1,Y1] [is acc in Y1]  >>True
#SN!
******** Signature ********
 0 : N
 even : (N,N) -> B
 false : B
 g : N -> B
 h : (N,(N -> B),N) -> B
 not : B -> B
 rec : (((N,(N -> B),N) -> B),B,N) -> B
 true : B
 ap : ((a -> b),a) -> b
******** Computation Rules ********
 (1)  rec(F,ap(Z,0)) => Z
 (ap)  ap(x.M[x],N) => M[N]
 (ap0)  ap(M,N) => M[N]
 (2)  g(U) => true
 (3)  h(V,I,P) => not(I[P])
 (4)  not(true) => false
 (5)  not(false) => true
 (6)  even(X1,Y1) => rec(h,g(X1),Y1)

YES