/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: s, z
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) ack(z,X) => s(X)
 (fun ack>s)
 (meta X)[is acc in z,X] [is positive in z] [is acc in X]  >>True
Checking  (2) ack(s(Y),z) => ack(Y,s(z))
 (fun ack=ack) subterm comparison of args w. LR LR
 (meta Y)[is acc in s(Y),z] [is positive in s(Y)] [is acc in Y] 
 (fun ack>s)
 (fun ack>z) >>True
Checking  (3) ack(s(U),s(V)) => ack(U,ack(s(U),V))
 (fun ack=ack) subterm comparison of args w. LR LR
 (meta U)[is acc in s(U),s(V)] [is positive in s(U)] [is acc in U] 
 (fun ack=ack) subterm comparison of args w. LR LR
 (fun ack>s)
 (meta U)[is acc in s(U),s(V)] [is positive in s(U)] [is acc in U] 
 (meta V)[is acc in s(U),s(V)] [is positive in s(U)] [is positive in s(V)] [is acc in V]  >>True
#SN!
******** Signature ********
 ack : (N,N) -> N
 s : N -> N
 z : N
******** Computation Rules ********
 (1)  ack(z,X) => s(X)
 (2)  ack(s(Y),z) => ack(Y,s(z))
 (3)  ack(s(U),s(V)) => ack(U,ack(s(U),V))

YES