Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919083
details
property
value
status
complete
benchmark
Applicative_05__ReverseLastInit.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0264811515808 seconds
cpu usage
0.019345512
max memory
2060288.0
stage attributes
key
value
output-size
2257
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_hrs /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) compose(F,Z,U) => Z[F[U]] (meta Z)[is acc in F,Z,U] [is acc in Z] (meta F)[is acc in F,Z,U] [is acc in F] (meta U)[is acc in F,Z,U] [is acc in U] >>True Checking (2) reverse(V) => reverse2(V,nil) (fun reverse>reverse2) (meta V)[is acc in V] [is acc in V] (fun reverse>nil) >>True Checking (3) reverse2(nil,W) => W (meta W)[is acc in nil,W] [is positive in nil] [is acc in W] >>True Checking (4) reverse2(cons(X1,Y1),P) => reverse2(Y1,cons(X1,P)) (fun reverse2=reverse2) subterm comparison of args w. LR LR (meta Y1)[is acc in cons(X1,Y1),P] [is positive in cons(X1,Y1)] [is acc in Y1] (fun reverse2>cons) (meta X1)[is acc in cons(X1,Y1),P] [is positive in cons(X1,Y1)] [is acc in X1] (meta P)[is acc in cons(X1,Y1),P] [is positive in cons(X1,Y1)] [is acc in P] >>True Checking (5) hd(cons(U1,V1)) => U1 (meta U1)[is acc in cons(U1,V1)] [is positive in cons(U1,V1)] [is acc in U1] >>True Checking (6) tl(cons(W1,P1)) => P1 (meta P1)[is acc in cons(W1,P1)] [is positive in cons(W1,P1)] [is acc in P1] >>True Checking (7) last => compose(hd,reverse) (fun last>compose) (fun last>hd) (fun last>reverse) >>True Checking (8) init => compose(reverse,compose(tl,reverse)) (fun init>compose) (fun init>reverse) (fun init>compose) (fun init>tl) (fun init>reverse) >>True #SN! ******** Signature ******** compose : ((a -> a),(a -> a),a) -> a cons : (a,a) -> a hd : a -> a init : a -> a last : a -> a nil : a reverse : a -> a reverse2 : (a,a) -> a tl : a -> a ******** Computation Rules ******** (1) compose(F,Z,U) => Z[F[U]] (2) reverse(V) => reverse2(V,nil) (3) reverse2(nil,W) => W (4) reverse2(cons(X1,Y1),P) => reverse2(Y1,cons(X1,P)) (5) hd(cons(U1,V1)) => U1 (6) tl(cons(W1,P1)) => P1 (7) last => compose(hd,reverse) (8) init => compose(reverse,compose(tl,reverse)) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631