details

property	value
status	complete
benchmark	aprove5.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n192.star.cs.uiowa.edu
space	Secret_05_TRS

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.0779481 seconds
cpu usage	0.028254
user time	0.015993
system time	0.012261
max virtual memory	113188.0
max residence set size	6136.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: minus(x,0()) -> x 2: minus(0(),y) -> 0() 3: minus(s(x),s(y)) -> minus(p(s(x)),p(s(y))) 4: minus(x,plus(y,z)) -> minus(minus(x,y),z) 5: p(s(s(x))) -> s(p(s(x))) 6: p(0()) -> s(s(0())) 7: div(s(x),s(y)) -> s(div(minus(x,y),s(y))) 8: div(plus(x,y),z) -> plus(div(x,z),div(y,z)) 9: plus(0(),y) -> y 10: plus(s(x),y) -> s(plus(y,minus(s(x),s(0())))) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying p 1: minus(x,0()) -> x 2: minus(0(),y) -> 0() 3: minus(s(x),s(y)) -> minus(p^1_s(x),p^1_s(y)) 4: minus(x,plus(y,z)) -> minus(minus(x,y),z) 5: p^1_s(s(x)) -> s(p^1_s(x)) 6: p^1_0() -> s(s(0())) 7: div(s(x),s(y)) -> s(div(minus(x,y),s(y))) 8: div(plus(x,y),z) -> plus(div(x,z),div(y,z)) 9: plus(0(),y) -> y 10: plus(s(x),y) -> s(plus(y,minus(s(x),s(0())))) 11: p(0()) ->= p^1_0() 12: p(s(_1)) ->= p^1_s(_1) Number of strict rules: 10 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #p(0()) ->? #p^1_0() #2: #p(s(_1)) ->? #p^1_s(_1) #3: #div(s(x),s(y)) -> #div(minus(x,y),s(y)) #4: #div(s(x),s(y)) -> #minus(x,y) #5: #plus(s(x),y) -> #plus(y,minus(s(x),s(0()))) #6: #plus(s(x),y) -> #minus(s(x),s(0())) #7: #p^1_s(s(x)) -> #p^1_s(x) #8: #minus(s(x),s(y)) -> #minus(p^1_s(x),p^1_s(y)) #9: #minus(s(x),s(y)) -> #p^1_s(x) #10: #minus(s(x),s(y)) -> #p^1_s(y) #11: #div(plus(x,y),z) -> #plus(div(x,z),div(y,z)) #12: #div(plus(x,y),z) -> #div(x,z) #13: #div(plus(x,y),z) -> #div(y,z) #14: #minus(x,plus(y,z)) -> #minus(minus(x,y),z) #15: #minus(x,plus(y,z)) -> #minus(x,y) Number of SCCs: 5, DPs: 8 SCC { #7 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 1 #p^1_0 w: 0 #p^1_s w: x1 minus w: 0 p^1_0 w: 0 #plus w: 0 div w: 0 p^1_s w: 0 #p w: 0 p w: 0 0 w: 0 #minus w: 0 plus w: 0 USABLE RULES: { } Removed DPs: #7 Number of SCCs: 4, DPs: 7 SCC { #8 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 2 #p^1_0 w: 0 #p^1_s w: 0 minus w: 0 p^1_0 w: 0 #plus w: 0 div w: 0 p^1_s w: x1 + 1 #p w: 0 p w: 0 0 w: 0 #minus w: x1 + x2 plus w: 0 USABLE RULES: { 5 } Removed DPs: #8 Number of SCCs: 3, DPs: 6 SCC { #5 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 2 #p^1_0 w: 0 #p^1_s w: 0 minus w: 1 p^1_0 w: 0 #plus w: x1 + x2 div w: 0 p^1_s w: x1 + 1 #p w: 0 p w: 0 0 w: 36466 #minus w: x1 + x2 plus w: 0 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard