Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516967473
details
property
value
status
complete
benchmark
aprove07.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n169.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.606593132019 seconds
cpu usage
0.617917378
max memory
2.7623424E7
stage attributes
key
value
output-size
3511
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: plus(x,y) -> plusIter(x,y,0()) 2: plusIter(x,y,z) -> ifPlus(le(x,z),x,y,z) 3: ifPlus(true(),x,y,z) -> y 4: ifPlus(false(),x,y,z) -> plusIter(x,s(y),s(z)) 5: le(s(x),0()) -> false() 6: le(0(),y) -> true() 7: le(s(x),s(y)) -> le(x,y) 8: sum(xs) -> sumIter(xs,0()) 9: sumIter(xs,x) -> ifSum(isempty(xs),xs,x,plus(x,head(xs))) 10: ifSum(true(),xs,x,y) -> x 11: ifSum(false(),xs,x,y) -> sumIter(tail(xs),y) 12: isempty(nil()) -> true() 13: isempty(cons(x,xs)) -> false() 14: head(nil()) -> error() 15: head(cons(x,xs)) -> x 16: tail(nil()) -> nil() 17: tail(cons(x,xs)) -> xs 18: a() -> b() 19: a() -> c() Number of strict rules: 19 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #plusIter(x,y,z) -> #ifPlus(le(x,z),x,y,z) #2: #plusIter(x,y,z) -> #le(x,z) #3: #sumIter(xs,x) -> #ifSum(isempty(xs),xs,x,plus(x,head(xs))) #4: #sumIter(xs,x) -> #isempty(xs) #5: #sumIter(xs,x) -> #plus(x,head(xs)) #6: #sumIter(xs,x) -> #head(xs) #7: #ifSum(false(),xs,x,y) -> #sumIter(tail(xs),y) #8: #ifSum(false(),xs,x,y) -> #tail(xs) #9: #le(s(x),s(y)) -> #le(x,y) #10: #plus(x,y) -> #plusIter(x,y,0()) #11: #sum(xs) -> #sumIter(xs,0()) #12: #ifPlus(false(),x,y,z) -> #plusIter(x,s(y),s(z)) Number of SCCs: 3, DPs: 5 SCC { #9 } Sum... succeeded. a() w: (0) isempty(x1) w: (0) le(x1,x2) w: (0) plusIter(x1,x2,x3) w: (0) #ifSum(x1,x2,x3,x4) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (x2 + x1) b() w: (0) ifSum(x1,x2,x3,x4) w: (0) #plus(x1,x2) w: (0) #isempty(x1) w: (0) false() w: (0) sumIter(x1,x2) w: (0) #head(x1) w: (0) c() w: (0) true() w: (0) sum(x1) w: (0) tail(x1) w: (0) error() w: (0) 0() w: (0) nil() w: (0) #tail(x1) w: (0) #sumIter(x1,x2) w: (0) ifPlus(x1,x2,x3,x4) w: (0) plus(x1,x2) w: (0) head(x1) w: (0) cons(x1,x2) w: (0) #a() w: (0) #ifPlus(x1,x2,x3,x4) w: (0) #sum(x1) w: (0) #plusIter(x1,x2,x3) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 2, DPs: 4 SCC { #3 #7 } Sum... Max... QLPOpS... NegMaxSum... succeeded. a() w: (0) isempty(x1) w: (max{0, 1 + x1}) le(x1,x2) w: (max{0, 6 + x2}) plusIter(x1,x2,x3) w: (max{0, 1 + x2, -1 + x1}) #ifSum(x1,x2,x3,x4) w: (max{0, 2 + x4, -1 + x2, -2 + x1}) s(x1) w: (max{0, x1}) #le(x1,x2) w: (0) b() w: (0) ifSum(x1,x2,x3,x4) w: (0) #plus(x1,x2) w: (0) #isempty(x1) w: (0) false() w: (6) sumIter(x1,x2) w: (0) #head(x1) w: (0) c() w: (0) true() w: (1) sum(x1) w: (0) tail(x1) w: (max{0, -5 + x1})
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard