/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, nil
Checking type order >>OK
Checking positivity of constructors >>OK
Checking function dependency >>OK
Checking  (1) map(%X.F[%X],nil) => nil
 (fun map>nil) >>True
Checking  (2) map(%Y.Z[%Y],cons(U,V)) => cons(Z[U],map(%Z.Z[%Z],V))
 (fun map>cons)
 (meta Z)[is acc in %Y.Z[%Y],cons(U,V)] [is acc in Z[%Y]] 
 (meta U)[is acc in %Y.Z[%Y],cons(U,V)] [is positive in cons(U,V)] [is acc in U] 
 (fun map=map) subterm comparison of args w. LR LR
 (meta Z)[is acc in %Y.Z[%Y],cons(U,V)] [is acc in Z[%Y]] 
 (meta V)[is acc in %Y.Z[%Y],cons(U,V)] [is positive in cons(U,V)] [is acc in V]  >>True
Checking  (3) map(%V.I[%V],map(%U.J[%U],X1)) => map(%W.o(%G.I[%G],%F.J[%F],%W),X1)
 (fun map=map) subterm comparison of args w. LR LR >>False

Try again using status RL
Checking  (1) map(%X.F[%X],nil) => nil
 (fun map>nil) >>True
Checking  (2) map(%Y.Z[%Y],cons(U,V)) => cons(Z[U],map(%Z.Z[%Z],V))
 (fun map>cons)
 (meta Z)[is acc in %Y.Z[%Y],cons(U,V)] [is acc in Z[%Y]] 
 (meta U)[is acc in %Y.Z[%Y],cons(U,V)] [is positive in cons(U,V)] [is acc in U] 
 (fun map=map) subterm comparison of args w. RL RL
 (meta Z)[is acc in %Y.Z[%Y],cons(U,V)] [is acc in Z[%Y]] 
 (meta V)[is acc in %Y.Z[%Y],cons(U,V)] [is positive in cons(U,V)] [is acc in V]  >>True
Checking  (3) map(%V.I[%V],map(%U.J[%U],X1)) => map(%W.o(%G.I[%G],%F.J[%F],%W),X1)
 (fun map=map) subterm comparison of args w. RL RL
 (fun map>o)
 (meta I)[is acc in %V.I[%V],map(%U.J[%U],X1)] [is acc in I[%V]] 
 (meta J)[is acc in %V.I[%V],map(%U.J[%U],X1)] [is positive in map(%U.J[%U],X1)] [is acc in J[%U]] 
 (meta X1)[is acc in %V.I[%V],map(%U.J[%U],X1)] [is positive in map(%U.J[%U],X1)] [is acc in X1]  >>True
Checking  (4) o(%I.Z1[%I],%H.G1[%H],V1) => Z1[G1[V1]]
 (meta Z1)[is acc in %I.Z1[%I],%H.G1[%H],V1] [is acc in Z1[%I]] 
 (meta G1)[is acc in %I.Z1[%I],%H.G1[%H],V1] [is acc in G1[%H]] 
 (meta V1)[is acc in %I.Z1[%I],%H.G1[%H],V1] [is acc in V1]  >>True
#SN!
******** Signature ********
 cons : (a,alist) -> alist
 map : ((a -> a),alist) -> alist
 nil : alist
 o : ((a -> a),(a -> a),a) -> a
******** Computation Rules ********
 (1)  map(%X.F[%X],nil) => nil
 (2)  map(%Y.Z[%Y],cons(U,V)) => cons(Z[U],map(%Z.Z[%Z],V))
 (3)  map(%V.I[%V],map(%U.J[%U],X1)) => map(%W.o(%G.I[%G],%F.J[%F],%W),X1)
 (4)  o(%I.Z1[%I],%H.G1[%H],V1) => Z1[G1[V1]]

YES