/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Uncurrying transformation.. done ******** General Schema criterion ******** Found constructors: 0, s Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) rec(%X.%Y.F[%X,%Y],Y,0) => Y (meta Y)[is acc in %X.%Y.F[%X,%Y],Y,0] [is acc in Y] >>True Checking (2) rec(%Z.%U.G[%Z,%U],V,s(W)) => G[W,rec(%V.%W.G[%V,%W],V,W)] (meta G)[is acc in %Z.%U.G[%Z,%U],V,s(W)] [is acc in G[%Z,%U]] (meta W)[is acc in %Z.%U.G[%Z,%U],V,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 %Z.%U.G[%Z,%U],V,s(W)] [is acc in G[%Z,%U]] (meta V)[is acc in %Z.%U.G[%Z,%U],V,s(W)] [is acc in V] (meta W)[is acc in %Z.%U.G[%Z,%U],V,s(W)] [is positive in s(W)] [is acc in W] >>True Checking (3) succ(P,X1) => s(X1) (fun succ>s) (meta X1)[is acc in P,X1] [is acc in X1] >>True Checking (4) add(Y1,U1) => rec(%F.%G.succ(%F,%G),Y1,U1) (fun add>rec) (fun add>succ) (meta Y1)[is acc in Y1,U1] [is acc in Y1] (meta U1)[is acc in Y1,U1] [is acc in U1] >>True Checking (5) add(V1,0) => V1 (meta V1)[is acc in V1,0] [is acc in V1] >>True Checking (6) add(W1,s(P1)) => s(add(W1,P1)) (fun add>s) (fun add=add) subterm comparison of args w. LR LR (meta W1)[is acc in W1,s(P1)] [is acc in W1] (meta P1)[is acc in W1,s(P1)] [is positive in s(P1)] [is acc in P1] >>True #SN! ******** Signature ******** 0 : nat add : (nat,nat) -> nat rec : (((nat,nat) -> nat),nat,nat) -> nat s : nat -> nat succ : (nat,nat) -> nat ******** Computation Rules ******** (1) rec(%X.%Y.F[%X,%Y],Y,0) => Y (2) rec(%Z.%U.G[%Z,%U],V,s(W)) => G[W,rec(%V.%W.G[%V,%W],V,W)] (3) succ(P,X1) => s(X1) (4) add(Y1,U1) => rec(%F.%G.succ(%F,%G),Y1,U1) (5) add(V1,0) => V1 (6) add(W1,s(P1)) => s(add(W1,P1)) YES