/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: 0, s
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) rec(G,ap(H,s(W))) => ap(ap(G,W),rec(G,H[W]))
 (fun rec>ap)
 (fun rec>ap)
 (meta G)[is acc in G,ap(H,s(W))] [is acc in G] 
 (meta W)[is acc in G,ap(H,s(W))] [is positive in s(W)] [is acc in W] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta G)[is acc in G,ap(H,s(W))] [is acc in G] 
 (meta H)[is acc in G,ap(H,s(W))] [is acc in H] 
 (meta W)[is acc in G,ap(H,s(W))] [is positive in s(W)] [is acc in W]  >>True
#SN!
******** Signature ********
 0 : N
 rec : (((N,(N -> B),N) -> B),B,N) -> B
 s : N -> N
 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)  rec(G,ap(H,s(W))) => ap(ap(G,W),rec(G,H[W]))

YES