Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516960683
details
property
value
status
complete
benchmark
thiemann15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n028.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.163673877716 seconds
cpu usage
0.110634505
max memory
1.3684736E7
stage attributes
key
value
output-size
2564
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: half(0()) -> 0() 2: half(s(0())) -> 0() 3: half(s(s(x))) -> s(half(x)) 4: inc(0()) -> 0() 5: inc(s(x)) -> s(inc(x)) 6: zero(0()) -> true() 7: zero(s(x)) -> false() 8: p(0()) -> 0() 9: p(s(x)) -> x 10: bits(x) -> bitIter(x,0()) 11: bitIter(x,y) -> if(zero(x),x,inc(y)) 12: if(true(),x,y) -> p(y) 13: if(false(),x,y) -> bitIter(half(x),y) Number of strict rules: 13 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #if(false(),x,y) -> #bitIter(half(x),y) #2: #if(false(),x,y) -> #half(x) #3: #bitIter(x,y) -> #if(zero(x),x,inc(y)) #4: #bitIter(x,y) -> #zero(x) #5: #bitIter(x,y) -> #inc(y) #6: #if(true(),x,y) -> #p(y) #7: #bits(x) -> #bitIter(x,0()) #8: #inc(s(x)) -> #inc(x) #9: #half(s(s(x))) -> #half(x) Number of SCCs: 3, DPs: 4 SCC { #8 } Sum... succeeded. zero(x1) w: (0) s(x1) w: (1 + x1) bitIter(x1,x2) w: (0) false() w: (0) #half(x1) w: (0) #inc(x1) w: (x1) #p(x1) w: (0) inc(x1) w: (0) true() w: (0) half(x1) w: (0) p(x1) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #bits(x1) w: (0) #bitIter(x1,x2) w: (0) #if(x1,x2,x3) w: (0) #zero(x1) w: (0) bits(x1) w: (0) USABLE RULES: { } Removed DPs: #8 Number of SCCs: 2, DPs: 3 SCC { #9 } Sum... succeeded. zero(x1) w: (0) s(x1) w: (1 + x1) bitIter(x1,x2) w: (0) false() w: (0) #half(x1) w: (x1) #inc(x1) w: (0) #p(x1) w: (0) inc(x1) w: (0) true() w: (0) half(x1) w: (0) p(x1) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #bits(x1) w: (0) #bitIter(x1,x2) w: (0) #if(x1,x2,x3) w: (0) #zero(x1) w: (0) bits(x1) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 1, DPs: 2 SCC { #1 #3 } Sum... Max... QLPOpS... NegMaxSum... succeeded. zero(x1) w: (max{0, 1 + x1}) s(x1) w: (max{0, 5 + x1}) bitIter(x1,x2) w: (0) false() w: (6) #half(x1) w: (0) #inc(x1) w: (0) #p(x1) w: (0) inc(x1) w: (0) true() w: (1) half(x1) w: (max{0, -4 + x1}) p(x1) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #bits(x1) w: (0) #bitIter(x1,x2) w: (max{0, 3 + x1}) #if(x1,x2,x3) w: (max{0, 1 + x2, 1 + x1}) #zero(x1) w: (0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard