details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.175989151001 seconds
cpu usage	0.230089582
max memory	1.7338368E7

stage attributes

key	value
output-size	2965
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: le(0(),y) -> true() 2: le(s(x),0()) -> false() 3: le(s(x),s(y)) -> le(x,y) 4: pred(s(x)) -> x 5: minus(x,0()) -> x 6: minus(x,s(y)) -> pred(minus(x,y)) 7: mod(0(),y) -> 0() 8: mod(s(x),0()) -> 0() 9: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) 10: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) 11: if_mod(false(),s(x),s(y)) -> s(x) 12: rand(x) ->= x 13: rand(x) ->= rand(s(x)) Number of strict rules: 11 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(x,s(y)) -> #pred(minus(x,y)) #2: #minus(x,s(y)) -> #minus(x,y) #3: #mod(s(x),s(y)) -> #if_mod(le(y,x),s(x),s(y)) #4: #mod(s(x),s(y)) -> #le(y,x) #5: #if_mod(true(),s(x),s(y)) -> #mod(minus(x,y),s(y)) #6: #if_mod(true(),s(x),s(y)) -> #minus(x,y) #7: #le(s(x),s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 4 SCC { #2 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [2,1] p: 0 w: max(x1 + 4, x2 + 2) s s: [1] p: 1 w: x1 #le s: [2] p: 0 w: max(x2) minus s: 1 mod s: [2,1] p: 1 w: max(x1 + 2, x2 + 4) false s: [] p: 1 w: 1 true s: [] p: 0 w: 3 pred s: 1 rand s: [] p: 0 w: x1 + 1 if_mod s: [3,2] p: 1 w: max(x1, x2 + 2, x3 + 4) 0 s: [] p: 1 w: 0 #minus s: [2] p: 0 w: max(x2) #mod s: [] p: 0 w: max(x2) #if_mod s: [1,2,3] p: 0 w: max(x1 + 1, x2 + 1, x3 + 1) #pred s: [] p: 0 w: 0 Removed DPs: #2 Number of SCCs: 2, DPs: 3 SCC { #7 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [2,1] p: 0 w: max(x1 + 4, x2 + 2) s s: [1] p: 1 w: x1 #le s: 2 minus s: 1 mod s: [2,1] p: 1 w: max(x1 + 2, x2 + 4) false s: [] p: 1 w: 1 true s: [] p: 0 w: 3 pred s: 1 rand s: [] p: 0 w: x1 + 1 if_mod s: [3,2] p: 1 w: max(x1, x2 + 2, x3 + 4) 0 s: [] p: 1 w: 0 #minus s: [2] p: 0 w: max(x2) #mod s: [] p: 0 w: max(x2) #if_mod s: [1,2,3] p: 0 w: max(x1 + 1, x2 + 1, x3 + 1) #pred s: [] p: 0 w: 0 Removed DPs: #7 Number of SCCs: 1, DPs: 2 SCC { #3 #5 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [2] p: 0 w: max(x1 + 4, x2 + 2) s s: [1] p: 1 w: x1 #le s: 2 minus s: 1 mod s: [2,1] p: 1 w: max(x1 + 2, x2 + 4) false s: [] p: 1 w: 1 true s: [] p: 0 w: 3 pred s: 1 rand s: [] p: 0 w: x1 + 1 if_mod s: [3,2] p: 1 w: max(x1, x2 + 2, x3 + 4) 0 s: [] p: 1 w: 0 #minus s: [2] p: 0 w: max(x2) #mod s: 1 #if_mod s: 2 #pred s: [] p: 0 w: 0 Removed DPs: #5 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to TRS Relat 75837