Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919008
details
property
value
status
complete
benchmark
AotoYamada_05__022.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0186278820038 seconds
cpu usage
0.015428231
max memory
1892352.0
stage attributes
key
value
output-size
1802
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ******** General Schema criterion ******** Found constructors: cons, leaf, nil, node Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: maptlist, mapt Checking (1) mapt(F,leaf(Y)) => leaf(F[Y]) (fun mapt>leaf) (meta F)[is acc in F,leaf(Y)] [is acc in F] (meta Y)[is acc in F,leaf(Y)] [is positive in leaf(Y)] [is acc in Y] >>True Checking (2) mapt(G,node(V)) => node(maptlist(G,V)) (fun mapt>node) (fun mapt=maptlist) subterm comparison of args w. LR LR (meta G)[is acc in G,node(V)] [is acc in G] (meta V)[is acc in G,node(V)] [is positive in node(V)] [is acc in V] >>True Checking (3) maptlist(I,nil) => nil (fun maptlist>nil) >>True Checking (4) maptlist(J,cons(X1,Y1)) => cons(mapt(J,X1),maptlist(J,Y1)) (fun maptlist>cons) (fun maptlist=mapt) subterm comparison of args w. LR LR (meta J)[is acc in J,cons(X1,Y1)] [is acc in J] (meta X1)[is acc in J,cons(X1,Y1)] [is positive in cons(X1,Y1)] [is acc in X1] (fun maptlist=maptlist) subterm comparison of args w. LR LR (meta J)[is acc in J,cons(X1,Y1)] [is acc in J] (meta Y1)[is acc in J,cons(X1,Y1)] [is positive in cons(X1,Y1)] [is acc in Y1] >>True #SN! ******** Signature ******** cons : (b,c) -> c leaf : a -> b mapt : ((a -> a),b) -> b maptlist : ((a -> a),c) -> c nil : c node : c -> b ******** Computation Rules ******** (1) mapt(F,leaf(Y)) => leaf(F[Y]) (2) mapt(G,node(V)) => node(maptlist(G,V)) (3) maptlist(I,nil) => nil (4) maptlist(J,cons(X1,Y1)) => cons(mapt(J,X1),maptlist(J,Y1)) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631