/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

******** General Schema criterion ********
Found constructors: nil, cons
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) op(F,G,X) => F[G[X]]
 (meta F)[is acc in F,G,X] [is acc in F] 
 (meta G)[is acc in F,G,X] [is acc in G] 
 (meta X)[is acc in F,G,X] [is acc in X]  >>True
Checking  (2) implode(nil,F,X) => X
 (meta X)[is acc in nil,F,X] [is positive in nil] [is acc in X]  >>True
Checking  (3) implode(cons(H,T),F,X) => implode(T,F,F[X])
 (fun implode=implode) subterm comparison of args w. LR LR
 (meta T)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in T] 
 (meta F)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in F] 
 (meta F)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in F] 
 (meta X)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in X]  >>True
Checking  (4) explode(nil,F,X) => X
 (meta X)[is acc in nil,F,X] [is positive in nil] [is acc in X]  >>True
Checking  (5) explode(cons(H,T),F,X) => explode(T,op(F,F),F[X])
 (fun explode=explode) subterm comparison of args w. LR LR
 (meta T)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in T] 
 (fun explode>op)
 (meta F)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in F] 
 (meta F)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in F] 
 (meta F)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in F] 
 (meta X)[is acc in cons(H,T),F,X] [is positive in cons(H,T)] [is acc in X]  >>True
#SN!
******** Signature ********
 nil : list
 cons : (nat,list) -> list
 op : ((nat -> nat),(nat -> nat),nat) -> nat
 implode : (list,(nat -> nat),nat) -> nat
 explode : (list,(nat -> nat),nat) -> nat
******** Computation Rules ********
 (1)  op(F,G,X) => F[G[X]]
 (2)  implode(nil,F,X) => X
 (3)  implode(cons(H,T),F,X) => implode(T,F,F[X])
 (4)  explode(nil,F,X) => X
 (5)  explode(cons(H,T),F,X) => explode(T,op(F,F),F[X])

YES