Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919096
details
property
value
status
complete
benchmark
h52.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Hamana_Kikuchi_18
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0202360153198 seconds
cpu usage
0.017717407
max memory
2097152.0
stage attributes
key
value
output-size
2271
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: 0, cons, nil, s Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) foldl(%Y.%X.F[%Y,%X],Y,nil) => Y (meta Y)[is acc in %Y.%X.F[%Y,%X],Y,nil] [is acc in Y] >>True Checking (2) foldl(%U.%Z.G[%U,%Z],V,cons(W,P)) => foldl(%W.%V.G[%W,%V],G[V,W],P) (fun foldl=foldl) subterm comparison of args w. LR LR >>False Try again using status RL Checking (1) foldl(%Y.%X.F[%Y,%X],Y,nil) => Y (meta Y)[is acc in %Y.%X.F[%Y,%X],Y,nil] [is acc in Y] >>True Checking (2) foldl(%U.%Z.G[%U,%Z],V,cons(W,P)) => foldl(%W.%V.G[%W,%V],G[V,W],P) (fun foldl=foldl) subterm comparison of args w. RL RL (meta G)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in G[%U,%Z]] (meta G)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in G[%U,%Z]] (meta V)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is acc in V] (meta W)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is positive in cons(W,P)] [is acc in W] (meta P)[is acc in %U.%Z.G[%U,%Z],V,cons(W,P)] [is positive in cons(W,P)] [is acc in P] >>True Checking (3) plusc(X1,0) => X1 (meta X1)[is acc in X1,0] [is acc in X1] >>True Checking (4) plusc(Y1,s(U1)) => s(plusc(Y1,U1)) (fun plusc>s) (fun plusc=plusc) subterm comparison of args w. RL RL (meta Y1)[is acc in Y1,s(U1)] [is acc in Y1] (meta U1)[is acc in Y1,s(U1)] [is positive in s(U1)] [is acc in U1] >>True Checking (5) sum(V1) => foldl(%G.%F.plusc(%G,%F),0,V1) (fun sum>foldl) (fun sum>plusc) (fun sum>0) (meta V1)[is acc in V1] [is acc in V1] >>True #SN! ******** Signature ******** 0 : nat cons : (nat,list) -> list foldl : (((nat,nat) -> nat),nat,list) -> nat nil : list plusc : (nat,nat) -> nat s : nat -> nat sum : list -> nat ******** Computation Rules ******** (1) foldl(%Y.%X.F[%Y,%X],Y,nil) => Y (2) foldl(%U.%Z.G[%U,%Z],V,cons(W,P)) => foldl(%W.%V.G[%W,%V],G[V,W],P) (3) plusc(X1,0) => X1 (4) plusc(Y1,s(U1)) => s(plusc(Y1,U1)) (5) sum(V1) => foldl(%G.%F.plusc(%G,%F),0,V1) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631