/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(0,X,%X.%Y.Z[%X,%Y]) => X
 (meta X)[is acc in 0,X,%X.%Y.Z[%X,%Y]] [is positive in 0] [is acc in X]  >>True
Checking  (2) rec(s(U),V,%Z.%U.I[%Z,%U]) => I[U,rec(U,V,%V.%W.I[%V,%W])]
 (meta I)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in I[%Z,%U]] 
 (meta U)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in U] 
 (fun rec=rec) subterm comparison of args w. LR LR
 (meta U)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in U] 
 (meta V)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in V] 
 (meta I)[is acc in s(U),V,%Z.%U.I[%Z,%U]] [is positive in s(U)] [is acc in I[%Z,%U]]  >>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) Y1 + U1 => rec(Y1,U1,succ)
 (fun plus>rec)
 (meta Y1)[is acc in Y1,U1] [is acc in Y1] 
 (meta U1)[is acc in Y1,U1] [is acc in U1] 
 (fun plus>succ) >>True
#SN!
******** Signature ********
 0 : nat
 plus : (nat,nat) -> nat
 rec : (nat,nat,((nat,nat) -> nat)) -> nat
 s : nat -> nat
 succ : (nat,nat) -> nat
******** Computation Rules ********
 (1)  rec(0,X,%X.%Y.Z[%X,%Y]) => X
 (2)  rec(s(U),V,%Z.%U.I[%Z,%U]) => I[U,rec(U,V,%V.%W.I[%V,%W])]
 (3)  succ(P,X1) => s(X1)
 (4)  Y1 + U1 => rec(Y1,U1,succ)

YES