/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: g, a, b
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) f(ap(z.F[z],a),ap(G,a)) => g(ap(F,b),ap(G,F[b]))
 (fun f>g)
 (fun f>ap)
 (meta F)[is acc in ap(z.F[z],a),ap(G,a)] [is acc in F[z]] 
 (fun f>b)
 (fun f>ap)
 (meta G)[is acc in ap(z.F[z],a),ap(G,a)] [is positive in a] [is acc in G] 
 (meta F)[is acc in ap(z.F[z],a),ap(G,a)] [is acc in F[z]] 
 (fun f>b) >>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
#SN!
******** Signature ********
 f : (o,o) -> o
 g : (o,o) -> o
 a : o
 b : o
 ap : ((a -> b),a) -> b
******** Computation Rules ********
 (1)  f(ap(z.F[z],a),ap(G,a)) => g(ap(F,b),ap(G,F[b]))
 (ap)  ap(x.M[x],N) => M[N]
 (ap0)  ap(M,N) => M[N]

YES