Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381918974
details
property
value
status
complete
benchmark
slml.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Hamana_17
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0194871425629 seconds
cpu usage
0.016671148
max memory
2088960.0
stage attributes
key
value
output-size
1922
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: return Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) abs(%X.F[%X])@Y => F[Y] (meta F)[is acc in abs(%X.F[%X]),Y] [is positive in abs(%X.F[%X])] [is acc in F[%X]] (meta Y)[is acc in abs(%X.F[%X]),Y] [is positive in abs(%X.F[%X])] [is acc in Y] >>True Checking (2) abs(%Y.(U@%Y)) => U (meta U)[is acc in %Y.(U@%Y)] [is positive in U@%Y] [is acc in U] >>True Checking (3) let(return(V),%Z.I[%Z]) => I[V] (meta I)[is acc in return(V),%Z.I[%Z]] [is positive in return(V)] [is acc in I[%Z]] (meta V)[is acc in return(V),%Z.I[%Z]] [is positive in return(V)] [is acc in V] >>True Checking (4) let(P,%U.return(%U)) => P (meta P)[is acc in P,%U.return(%U)] [is acc in P] >>True Checking (5) let(let(X1,%W.Z1[%W]),%V.G1[%V]) => let(X1,%G.let(Z1[%G],%F.G1[%F])) (fun let=let) subterm comparison of args w. LR LR (meta X1)[is acc in let(X1,%W.Z1[%W]),%V.G1[%V]] [is positive in let(X1,%W.Z1[%W])] [is acc in X1] (fun let=let) subterm comparison of args w. LR LR (meta Z1)[is acc in let(X1,%W.Z1[%W]),%V.G1[%V]] [is positive in let(X1,%W.Z1[%W])] [is acc in Z1[%W]] (meta G1)[is acc in let(X1,%W.Z1[%W]),%V.G1[%V]] [is positive in let(X1,%W.Z1[%W])] [is acc in G1[%V]] >>True #SN! ******** Signature ******** abs : (a -> a) -> aa app : (aa,a) -> a let : (ta,(a -> ta)) -> ta return : a -> ta ******** Computation Rules ******** (1) abs(%X.F[%X])@Y => F[Y] (2) abs(%Y.(U@%Y)) => U (3) let(return(V),%Z.I[%Z]) => I[V] (4) let(P,%U.return(%U)) => P (5) let(let(X1,%W.Z1[%W]),%V.G1[%V]) => let(X1,%G.let(Z1[%G],%F.G1[%F])) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631