details

property	value
status	complete
benchmark	Applicative_05__TreeMap.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n007.star.cs.uiowa.edu
space	Uncurried_Applicative_11

run statistics

property	value
solver	sol 37957
configuration	default
runtime (wallclock)	0.0213749408722 seconds
cpu usage	0.01790693
max memory	2158592.0

stage attributes

key	value
output-size	3105
starexec-result	YES

output

/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: cons, nil, node Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) map(F,nil) => nil (fun map>nil) >>True Checking (2) map(Z,cons(U,V)) => cons(Z[U],map(Z,V)) (fun map>cons) (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] (meta U)[is acc in Z,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 Z,cons(U,V)] [is acc in Z] (meta V)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in V] >>True Checking (3) treemap(I,node(P,X1)) => node(I[P],map(treemap(I),X1)) (fun treemap>node) (meta I)[is acc in I,node(P,X1)] [is acc in I] (meta P)[is acc in I,node(P,X1)] [is positive in node(P,X1)] [is acc in P] (fun treemap>map) (fun treemap=treemap) subterm comparison of args w. LR LR >>False Try again using status RL Checking (1) map(F,nil) => nil (fun map>nil) >>True Checking (2) map(Z,cons(U,V)) => cons(Z[U],map(Z,V)) (fun map>cons) (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] (meta U)[is acc in Z,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 Z,cons(U,V)] [is acc in Z] (meta V)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in V] >>True Checking (3) treemap(I,node(P,X1)) => node(I[P],map(treemap(I),X1)) (fun treemap>node) (meta I)[is acc in I,node(P,X1)] [is acc in I] (meta P)[is acc in I,node(P,X1)] [is positive in node(P,X1)] [is acc in P] (fun treemap>map) (fun treemap=treemap) subterm comparison of args w. RL RL >>False Try again using status Mul Checking (1) map(F,nil) => nil (fun map>nil) >>True Checking (2) map(Z,cons(U,V)) => cons(Z[U],map(Z,V)) (fun map>cons) (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] (meta U)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in U] (fun map=map) subterm comparison of args w. Mul Mul (meta Z)[is acc in Z,cons(U,V)] [is acc in Z] (meta V)[is acc in Z,cons(U,V)] [is positive in cons(U,V)] [is acc in V] >>True Checking (3) treemap(I,node(P,X1)) => node(I[P],map(treemap(I),X1)) (fun treemap>node) (meta I)[is acc in I,node(P,X1)] [is acc in I] (meta P)[is acc in I,node(P,X1)] [is positive in node(P,X1)] [is acc in P] (fun treemap>map) (fun treemap=treemap) subterm comparison of args w. Mul Mul (meta I)[is acc in I,node(P,X1)] [is acc in I] (meta X1)[is acc in I,node(P,X1)] [is positive in node(P,X1)] [is acc in X1] >>True #SN! ******** Signature ******** cons : (c,b) -> b map : ((c -> c),b) -> b nil : b node : (a,b) -> c treemap : ((a -> a),c) -> c ******** Computation Rules ******** (1) map(F,nil) => nil (2) map(Z,cons(U,V)) => cons(Z[U],map(Z,V)) (3) treemap(I,node(P,X1)) => node(I[P],map(treemap(I),X1)) YES popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to HRS union beta 16688