Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919156
details
property
value
status
complete
benchmark
Applicative_first_order_05__30.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.19354891777 seconds
cpu usage
0.267075729
max memory
1.9304448E7
stage attributes
key
value
output-size
6686
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 We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using NaTT (Nagoya Termination Tool) Input TRS: 1: xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> xbcolon(xbcolon(Y,V),xbcolon(xbcolon(xbcolon(Y,U),V),X)) 2: _(X1,X2) -> X1 3: _(X1,X2) -> X2 Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(xbcolon(Y,V),xbcolon(xbcolon(xbcolon(Y,U),V),X)) #2: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(Y,V) #3: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(xbcolon(xbcolon(Y,U),V),X) #4: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(xbcolon(Y,U),V) #5: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(Y,U) Number of SCCs: 1, DPs: 5 SCC { #1..5 } POLO(Sum)... POLO(max)... succeeded. xbcolon w: max(x1 + 2456, x2) #xbcolon w: max(x1 + 18314, x2 + 15858) c w: 609 _ w: 0 #_ w: 0 USABLE RULES: { 1 } Removed DPs: #2 #4 #5 Number of SCCs: 1, DPs: 2 SCC { #1 #3 } POLO(Sum)... POLO(max)... QLPOS... succeeded. xbcolon s: [1,2] p: 1 #xbcolon s: [1] p: 1 c s: [] p: 0 _ s: [] p: 0 #_ s: [2] p: 0 USABLE RULES: { 1 } Removed DPs: #1 #3 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> xbcolon(xbcolon(Y,V),xbcolon(xbcolon(xbcolon(Y,U),V),X)) 2: _(X1,X2) -> X1 3: _(X1,X2) -> X2 Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(xbcolon(Y,V),xbcolon(xbcolon(xbcolon(Y,U),V),X)) #2: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(Y,V) #3: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(xbcolon(xbcolon(Y,U),V),X) #4: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(xbcolon(Y,U),V) #5: #xbcolon(xbcolon(xbcolon(xbcolon(c(),Y),U),V),X) -> #xbcolon(Y,U) Number of SCCs: 1, DPs: 5 SCC { #1..5 } POLO(Sum)... POLO(max)... succeeded. xbcolon w: max(x1 + 2456, x2) #xbcolon w: max(x1 + 18314, x2 + 15858) c w: 609 _ w: 0 #_ w: 0 USABLE RULES: { 1 } Removed DPs: #2 #4 #5 Number of SCCs: 1, DPs: 2 SCC { #1 #3 } POLO(Sum)... POLO(max)... QLPOS... succeeded. xbcolon s: [1,2] p: 1 #xbcolon s: [1] p: 1 c s: [] p: 0 _ s: [] p: 0 #_ s: [2] p: 0 USABLE RULES: { 1 } Removed DPs: #1 #3 Number of SCCs: 0, DPs: 0 >>YES ******** Signature ******** map : ((c -> c),d) -> d nil : d cons : (c,d) -> d filter : ((c -> b),d) -> d filter2 : (b,(c -> b),c,d) -> d true : b false : b ******** Computation rules ******** (2) map(I,nil) => nil (3) map(J,cons(X1,Y1)) => cons(J[X1],map(J,Y1)) (4) filter(G1,nil) => nil (5) filter(H1,cons(W1,P1)) => filter2(H1[W1],H1,W1,P1) (6) filter2(true,F2,Y2,U2) => cons(Y2,filter(F2,U2)) (7) filter2(false,H2,W2,P2) => filter(H2,P2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631