/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: cons, g Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) mapxb62201(F,cons(Y,U)) => cons(F[Y],mapxb62201(F,U)) (fun mapxb62201>cons) (meta F)[is acc in F,cons(Y,U)] [is acc in F] (meta Y)[is acc in F,cons(Y,U)] [is positive in cons(Y,U)] [is acc in Y] (fun mapxb62201=mapxb62201) subterm comparison of args w. LR LR (meta F)[is acc in F,cons(Y,U)] [is acc in F] (meta U)[is acc in F,cons(Y,U)] [is positive in cons(Y,U)] [is acc in U] >>True Checking (2) mapxb62202(I,V,cons(P,X1)) => cons(I[P,V],mapxb62202(I,V,X1)) (fun mapxb62202>cons) (meta I)[is acc in I,V,cons(P,X1)] [is acc in I] (meta P)[is acc in I,V,cons(P,X1)] [is positive in cons(P,X1)] [is acc in P] (meta V)[is acc in I,V,cons(P,X1)] [is acc in V] (fun mapxb62202=mapxb62202) subterm comparison of args w. LR LR (meta I)[is acc in I,V,cons(P,X1)] [is acc in I] (meta V)[is acc in I,V,cons(P,X1)] [is acc in V] (meta X1)[is acc in I,V,cons(P,X1)] [is positive in cons(P,X1)] [is acc in X1] >>True Checking (3) mapxb62203(G1,g,Y1,cons(V1,W1)) => cons(G1[g,V1,Y1],mapxb62203(G1,g,Y1,W1)) (fun mapxb62203>cons) (meta G1)[is acc in G1,g,Y1,cons(V1,W1)] [is acc in G1] (fun mapxb62203>g) (meta V1)[is acc in G1,g,Y1,cons(V1,W1)] [is positive in g] [is positive in cons(V1,W1)] [is acc in V1] (meta Y1)[is acc in G1,g,Y1,cons(V1,W1)] [is positive in g] [is acc in Y1] (fun mapxb62203=mapxb62203) subterm comparison of args w. LR LR (meta G1)[is acc in G1,g,Y1,cons(V1,W1)] [is acc in G1] (fun mapxb62203>g) (meta Y1)[is acc in G1,g,Y1,cons(V1,W1)] [is positive in g] [is acc in Y1] (meta W1)[is acc in G1,g,Y1,cons(V1,W1)] [is positive in g] [is positive in cons(V1,W1)] [is acc in W1] >>True #SN! ******** Signature ******** cons : (d,e) -> e g : b mapxb62201 : ((d -> d),e) -> e mapxb62202 : (((d,a) -> d),a,e) -> e mapxb62203 : (((b,d,c) -> d),b,c,e) -> e ******** Computation Rules ******** (1) mapxb62201(F,cons(Y,U)) => cons(F[Y],mapxb62201(F,U)) (2) mapxb62202(I,V,cons(P,X1)) => cons(I[P,V],mapxb62202(I,V,X1)) (3) mapxb62203(G1,g,Y1,cons(V1,W1)) => cons(G1[g,V1,Y1],mapxb62203(G1,g,Y1,W1)) YES