/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, false, nil, s, true
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) if(true,F,Z) => F
 (meta F)[is acc in true,F,Z] [is positive in true] [is acc in F]  >>True
Checking  (2) if(false,F,Z) => Z
 (meta Z)[is acc in false,F,Z] [is positive in false] [is acc in Z]  >>True
Checking  (3) test(%X.s(%X)) => true
 (fun test>true) >>True
Checking  (4) head(cons(G,V)) => G
 (meta G)[is acc in cons(G,V)] [is positive in cons(G,V)] [is acc in G]  >>True
Checking  (5) tail(cons(G,V)) => V
 (meta V)[is acc in cons(G,V)] [is positive in cons(G,V)] [is acc in V]  >>True
#SN!
******** Signature ********
 cons : ((nat -> nat),funlist) -> funlist
 false : bool
 head : (funlist,nat) -> nat
 if : (bool,(nat -> string),(nat -> string),nat) -> string
 nil : funlist
 s : nat -> nat
 tail : funlist -> funlist
 test : (nat -> nat) -> bool
 true : bool
******** Computation Rules ********
 (1)  if(true,F,Z) => F
 (2)  if(false,F,Z) => Z
 (3)  test(%X.s(%X)) => true
 (4)  head(cons(G,V)) => G
 (5)  tail(cons(G,V)) => V

YES