/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, leaf, max, nil, node, s, z
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>Regared as equal: heightt, heightf
Checking  (1) heightf(nil) => z
 (fun heightf>z) >>True
Checking  (2) heightf(cons(X,Y)) => max(heightt(X),heightf(Y))
 (fun heightf>max)
 (fun heightf=heightt) subterm comparison of args w. LR LR
 (meta X)[is acc in cons(X,Y)] [is positive in cons(X,Y)] [is acc in X] 
 (fun heightf=heightf) subterm comparison of args w. LR LR
 (meta Y)[is acc in cons(X,Y)] [is positive in cons(X,Y)] [is acc in Y]  >>True
Checking  (3) heightt(leaf) => z
 (fun heightt>z) >>True
Checking  (4) heightt(node(U)) => s(heightf(U))
 (fun heightt>s)
 (fun heightt=heightf) subterm comparison of args w. LR LR
 (meta U)[is acc in node(U)] [is positive in node(U)] [is acc in U]  >>True
#SN!
******** Signature ********
 cons : (t,f) -> f
 heightf : f -> N
 heightt : t -> N
 leaf : t
 max : (N,N) -> N
 nil : f
 node : f -> t
 s : N -> N
 z : N
******** Computation Rules ********
 (1)  heightf(nil) => z
 (2)  heightf(cons(X,Y)) => max(heightt(X),heightf(Y))
 (3)  heightt(leaf) => z
 (4)  heightt(node(U)) => s(heightf(U))

YES