/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: branch, leaf
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) mapbt(F,leaf(Y)) => leaf(F[Y])
 (fun mapbt>leaf)
 (meta F)[is acc in F,leaf(Y)] [is acc in F] 
 (meta Y)[is acc in F,leaf(Y)] [is positive in leaf(Y)] [is acc in Y]  >>True
Checking  (2) mapbt(G,branch(P,V,W)) => branch(G[P],mapbt(G,V),mapbt(G,W))
 (fun mapbt>branch)
 (meta G)[is acc in G,branch(P,V,W)] [is acc in G] 
 (meta P)[is acc in G,branch(P,V,W)] [is positive in branch(P,V,W)] [is acc in P] 
 (fun mapbt=mapbt) subterm comparison of args w. LR LR
 (meta G)[is acc in G,branch(P,V,W)] [is acc in G] 
 (meta V)[is acc in G,branch(P,V,W)] [is positive in branch(P,V,W)] [is acc in V] 
 (fun mapbt=mapbt) subterm comparison of args w. LR LR
 (meta G)[is acc in G,branch(P,V,W)] [is acc in G] 
 (meta W)[is acc in G,branch(P,V,W)] [is positive in branch(P,V,W)] [is acc in W]  >>True
#SN!
******** Signature ********
 branch : (a,b,b) -> b
 leaf : a -> b
 mapbt : ((a -> a),b) -> b
******** Computation Rules ********
 (1)  mapbt(F,leaf(Y)) => leaf(F[Y])
 (2)  mapbt(G,branch(P,V,W)) => branch(G[P],mapbt(G,V),mapbt(G,W))

YES