details

property	value
status	complete
benchmark	#3.6a_rand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n165.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.294358 seconds
cpu usage	0.114712
user time	0.069572
system time	0.04514
max virtual memory	113176.0
max residence set size	8868.0

stage attributes

key	value
starexec-result	MAYBE

output

0.00/0.28 MAYBE 0.00/0.29 Input TRS: 0.00/0.29 1: le(0(),y) -> true() 0.00/0.29 2: le(s(x),0()) -> false() 0.00/0.29 3: le(s(x),s(y)) -> le(x,y) 0.00/0.29 4: minus(x,0()) -> x 0.00/0.29 5: minus(s(x),s(y)) -> minus(x,y) 0.00/0.29 6: gcd(0(),y) -> y 0.00/0.29 7: gcd(s(x),0()) -> s(x) 0.00/0.29 8: gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 0.00/0.29 9: if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y)) 0.00/0.29 10: if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x)) 0.00/0.29 11: rand(x) ->= x 0.00/0.29 12: rand(x) ->= rand(s(x)) 0.00/0.29 Number of strict rules: 10 0.00/0.29 Direct POLO(bPol) ... failed. 0.00/0.29 Uncurrying ... failed. 0.00/0.29 Dependency Pairs: 0.00/0.29 #1: #if_gcd(true(),s(x),s(y)) -> #gcd(minus(x,y),s(y)) 0.00/0.29 #2: #if_gcd(true(),s(x),s(y)) -> #minus(x,y) 0.00/0.29 #3: #if_gcd(false(),s(x),s(y)) -> #gcd(minus(y,x),s(x)) 0.00/0.29 #4: #if_gcd(false(),s(x),s(y)) -> #minus(y,x) 0.00/0.29 #5: #minus(s(x),s(y)) -> #minus(x,y) 0.00/0.29 #6: #le(s(x),s(y)) -> #le(x,y) 0.00/0.29 #7: #gcd(s(x),s(y)) -> #if_gcd(le(y,x),s(x),s(y)) 0.00/0.29 #8: #gcd(s(x),s(y)) -> #le(y,x) 0.00/0.29 Number of SCCs: 3, DPs: 5 0.00/0.29 SCC { #6 } 0.00/0.29 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. 0.00/0.29 le s: [] p: 1 w: max(x2 + 3) 0.00/0.29 s s: [1] p: 3 w: x1 0.00/0.29 #le s: [2,1] p: 4 w: max(x1 + 2, x2 + 1) 0.00/0.29 minus s: [1] p: 2 w: max(x1) 0.00/0.29 gcd s: [] p: 4 w: max(x1 + 3, x2 + 3) 0.00/0.29 false s: [] p: 1 w: 4 0.00/0.29 true s: [] p: 1 w: 3 0.00/0.29 rand s: [] p: 0 w: x1 + 1 0.00/0.29 0 s: [] p: 0 w: 2 0.00/0.29 #minus s: [] p: 0 w: max(x2) 0.00/0.29 if_gcd s: [] p: 4 w: max(x1, x2 + 3, x3 + 3) 0.00/0.29 #if_gcd s: [3,2,1] p: 0 w: max(x1 + 1, x2, x3 + 1) 0.00/0.29 #gcd s: [2] p: 0 w: max(x2) 0.00/0.29 Removed DPs: #6 0.00/0.29 Number of SCCs: 2, DPs: 4 0.00/0.29 SCC { #5 } 0.00/0.29 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. 0.00/0.29 le s: [] p: 1 w: max(x2 + 3) 0.00/0.29 s s: [1] p: 3 w: x1 0.00/0.29 #le s: [2,1] p: 4 w: max(x1 + 2, x2 + 1) 0.00/0.29 minus s: [1] p: 2 w: max(x1) 0.00/0.29 gcd s: [] p: 4 w: max(x1 + 3, x2 + 3) 0.00/0.29 false s: [] p: 1 w: 4 0.00/0.29 true s: [] p: 1 w: 3 0.00/0.29 rand s: [] p: 0 w: x1 + 1 0.00/0.29 0 s: [] p: 0 w: 2 0.00/0.29 #minus s: [1] p: 0 w: max(x1) 0.00/0.29 if_gcd s: [] p: 4 w: max(x1, x2 + 3, x3 + 3) 0.00/0.29 #if_gcd s: [3,2,1] p: 0 w: max(x1 + 1, x2, x3 + 1) 0.00/0.29 #gcd s: [2] p: 0 w: max(x2) 0.00/0.29 Removed DPs: #5 0.00/0.29 Number of SCCs: 1, DPs: 3 0.00/0.29 SCC { #1 #3 #7 } 0.00/0.29 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 0.00/0.29 Finding a loop... failed. 0.00/0.29 EOF popout

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

job log

popout

actions

all output return to TRS_Relative 2019-03-21 03.54