details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.329574 seconds
cpu usage	0.042149
user time	0.026688
system time	0.015461
max virtual memory	113176.0
max residence set size	5860.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.32 YES 0.00/0.32 Input TRS: 0.00/0.32 1: i(0(x1)) -> p(s(p(s(0(p(s(p(s(x1))))))))) 0.00/0.32 2: i(s(x1)) -> p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x1)))))))))))))))))) 0.00/0.32 3: j(0(x1)) -> p(s(p(p(s(s(0(p(s(p(s(x1))))))))))) 0.00/0.32 4: j(s(x1)) -> s(s(s(s(p(p(s(s(i(p(s(p(s(x1))))))))))))) 0.00/0.32 5: p(p(s(x1))) -> p(x1) 0.00/0.32 6: p(s(x1)) -> x1 0.00/0.32 7: p(0(x1)) -> 0(s(s(s(s(s(s(s(s(x1))))))))) 0.00/0.32 Number of strict rules: 7 0.00/0.32 Direct POLO(bPol) ... removes: 1 3 0.00/0.32 s w: x1 0.00/0.32 p w: x1 0.00/0.32 0 w: x1 + 4 0.00/0.32 j w: x1 + 1 0.00/0.32 i w: x1 + 1 0.00/0.32 Number of strict rules: 5 0.00/0.32 Direct POLO(bPol) ... failed. 0.00/0.32 Uncurrying p 0.00/0.32 2: i(s(x1)) -> p^1_s(p^1_s(s(j(p^1_s(p^1_s(p(p(p(p^1_s(s(s(s(x1))))))))))))) 0.00/0.32 4: j(s(x1)) -> s(s(s(s(p(p^1_s(s(i(p^1_s(p^1_s(x1)))))))))) 0.00/0.32 5: p(p^1_s(x1)) -> p(x1) 0.00/0.32 6: p^1_s(x1) -> x1 0.00/0.32 7: p^1_0(x1) -> 0(s(s(s(s(s(s(s(s(x1))))))))) 0.00/0.32 8: p(0(_1)) ->= p^1_0(_1) 0.00/0.32 9: p(s(_1)) ->= p^1_s(_1) 0.00/0.32 Number of strict rules: 5 0.00/0.32 Direct POLO(bPol) ... failed. 0.00/0.32 Dependency Pairs: 0.00/0.32 #1: #i(s(x1)) -> #p^1_s(p^1_s(s(j(p^1_s(p^1_s(p(p(p(p^1_s(s(s(s(x1))))))))))))) 0.00/0.32 #2: #i(s(x1)) -> #p^1_s(s(j(p^1_s(p^1_s(p(p(p(p^1_s(s(s(s(x1)))))))))))) 0.00/0.32 #3: #i(s(x1)) -> #j(p^1_s(p^1_s(p(p(p(p^1_s(s(s(s(x1)))))))))) 0.00/0.32 #4: #i(s(x1)) -> #p^1_s(p^1_s(p(p(p(p^1_s(s(s(s(x1))))))))) 0.00/0.32 #5: #i(s(x1)) -> #p^1_s(p(p(p(p^1_s(s(s(s(x1)))))))) 0.00/0.32 #6: #i(s(x1)) -> #p(p(p(p^1_s(s(s(s(x1))))))) 0.00/0.32 #7: #i(s(x1)) -> #p(p(p^1_s(s(s(s(x1)))))) 0.00/0.32 #8: #i(s(x1)) -> #p(p^1_s(s(s(s(x1))))) 0.00/0.32 #9: #i(s(x1)) -> #p^1_s(s(s(s(x1)))) 0.00/0.32 #10: #p(s(_1)) ->? #p^1_s(_1) 0.00/0.32 #11: #p(p^1_s(x1)) -> #p(x1) 0.00/0.32 #12: #p(0(_1)) ->? #p^1_0(_1) 0.00/0.32 #13: #j(s(x1)) -> #p(p^1_s(s(i(p^1_s(p^1_s(x1)))))) 0.00/0.32 #14: #j(s(x1)) -> #p^1_s(s(i(p^1_s(p^1_s(x1))))) 0.00/0.32 #15: #j(s(x1)) -> #i(p^1_s(p^1_s(x1))) 0.00/0.32 #16: #j(s(x1)) -> #p^1_s(p^1_s(x1)) 0.00/0.32 #17: #j(s(x1)) -> #p^1_s(x1) 0.00/0.32 Number of SCCs: 2, DPs: 3 0.00/0.32 SCC { #11 } 0.00/0.32 POLO(Sum)... succeeded. 0.00/0.32 s w: 0 0.00/0.32 #p^1_0 w: 0 0.00/0.32 #p^1_s w: 0 0.00/0.32 p^1_0 w: 0 0.00/0.32 p^1_s w: x1 + 1 0.00/0.32 #p w: x1 0.00/0.32 p w: 0 0.00/0.32 0 w: 0 0.00/0.32 #j w: 0 0.00/0.32 j w: 0 0.00/0.32 i w: 0 0.00/0.32 #i w: 0 0.00/0.32 USABLE RULES: { } 0.00/0.32 Removed DPs: #11 0.00/0.32 Number of SCCs: 1, DPs: 2 0.00/0.32 SCC { #3 #15 } 0.00/0.32 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. 0.00/0.32 s w: max(x1 + 18, 0) 0.00/0.32 #p^1_0 w: max(x1 - 1, 0) 0.00/0.32 #p^1_s w: 0 0.00/0.32 p^1_0 w: 0 0.00/0.32 p^1_s w: max(x1 + 2, 0) 0.00/0.32 #p w: 0 0.00/0.32 p w: max(x1 - 16, 0) 0.00/0.32 0 w: 0 0.00/0.32 #j w: max(x1 - 16, 0) 0.00/0.32 j w: max(x1 - 1, 0) 0.00/0.32 i w: max(x1 - 1, 0) 0.00/0.32 #i w: max(x1 - 3, 0) 0.00/0.32 USABLE RULES: { 5..9 } 0.00/0.32 Removed DPs: #3 #15 0.00/0.32 Number of SCCs: 0, DPs: 0 0.00/0.32 EOF popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29