Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919107
details
property
value
status
complete
benchmark
Applicative_AG01_innermost__#4.15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.302812099457 seconds
cpu usage
0.341583424
max memory
1.8878464E7
stage attributes
key
value
output-size
2854
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO 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: f(0(),1(),g(X,Y),U) -> f(g(X,Y),g(X,Y),g(X,Y),h(X)) 2: g(0(),1()) -> 0() 3: g(0(),1()) -> 1() 4: h(g(V,W)) -> h(V) Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f(0(),1(),g(X,Y),U) -> #f(g(X,Y),g(X,Y),g(X,Y),h(X)) #2: #f(0(),1(),g(X,Y),U) -> #h(X) #3: #h(g(V,W)) -> #h(V) Number of SCCs: 2, DPs: 2 SCC { #3 } POLO(Sum)... succeeded. h w: 0 1 w: 0 f w: 0 0 w: 0 #h w: x1 #f w: 0 #g w: 0 g w: x1 + 1 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 1, DPs: 1 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #f(0(),1(),g(0(),1()),U) -#1-> #f(g(0(),1()),g(0(),1()),g(0(),1()),h(0())) --->* #f(0(),1(),g(0(),1()),h(0())) Looping with: [ U := h(0()); ] ... Input TRS: 1: f(0(),1(),g(X,Y),U) -> f(g(X,Y),g(X,Y),g(X,Y),h(X)) 2: g(0(),1()) -> 0() 3: g(0(),1()) -> 1() 4: h(g(V,W)) -> h(V) Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f(0(),1(),g(X,Y),U) -> #f(g(X,Y),g(X,Y),g(X,Y),h(X)) #2: #f(0(),1(),g(X,Y),U) -> #h(X) #3: #h(g(V,W)) -> #h(V) Number of SCCs: 2, DPs: 2 SCC { #3 } POLO(Sum)... succeeded. h w: 0 1 w: 0 f w: 0 0 w: 0 #h w: x1 #f w: 0 #g w: 0 g w: x1 + 1 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 1, DPs: 1 SCC { #1 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #f(0(),1(),g(0(),1()),U) -#1-> #f(g(0(),1()),g(0(),1()),g(0(),1()),h(0())) --->* #f(0(),1(),g(0(),1()),h(0())) Looping with: [ U := h(0()); ] >>NO ******** Signature ******** 0 : b 1 : b cons : (e,f) -> f f : (b,b,b,c) -> a false : d filter : ((e -> d),f) -> f filter2 : (d,(e -> d),e,f) -> f g : (b,b) -> b h : b -> c map : ((e -> e),f) -> f nil : f true : d ******** Computation Rules ******** (1) f(0,1,g(X,Y),U) => f(g(X,Y),g(X,Y),g(X,Y),h(X)) (2) g(0,1) => 0 (3) g(0,1) => 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631