details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.17192196846 seconds
cpu usage	0.223646155
max memory	1.5966208E7

stage attributes

key	value
output-size	2830
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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: minus(x,0()) -> x 5: minus(s(x),s(y)) -> minus(x,y) 6: mod(0(),y) -> 0() 7: mod(s(x),0()) -> 0() 8: mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) 9: if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) 10: if_mod(false(),s(x),s(y)) -> s(x) 11: rand(x) ->= x 12: rand(x) ->= rand(s(x)) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #if_mod(true(),s(x),s(y)) -> #mod(minus(x,y),s(y)) #2: #if_mod(true(),s(x),s(y)) -> #minus(x,y) #3: #minus(s(x),s(y)) -> #minus(x,y) #4: #le(s(x),s(y)) -> #le(x,y) #5: #mod(s(x),s(y)) -> #if_mod(le(y,x),s(x),s(y)) #6: #mod(s(x),s(y)) -> #le(y,x) Number of SCCs: 3, DPs: 4 SCC { #4 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [] p: 4 w: 0 s s: [1] p: 5 w: x1 #le s: [2] p: 6 w: max(x1 + 2, x2 + 1) minus s: [1] p: 1 w: max(x1) mod s: [1] p: 2 w: max(x1) false s: [] p: 4 w: 0 true s: [] p: 0 w: 0 rand s: [] p: 0 w: x1 + 1 if_mod s: [2,1] p: 1 w: max(x1, x2) 0 s: [] p: 3 w: 0 #minus s: [2,1] p: 0 w: max(x1 + 1, x2) #mod s: [1] p: 0 w: max(x1) #if_mod s: [1,3,2] p: 0 w: max(x1 + 1, x2, x3) Removed DPs: #4 Number of SCCs: 2, DPs: 3 SCC { #3 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [] p: 4 w: 0 s s: [1] p: 5 w: x1 #le s: [2] p: 6 w: max(x1 + 2, x2 + 1) minus s: [1] p: 1 w: max(x1) mod s: [1] p: 2 w: max(x1) false s: [] p: 4 w: 0 true s: [] p: 0 w: 0 rand s: [] p: 0 w: x1 + 1 if_mod s: [2,1] p: 1 w: max(x1, x2) 0 s: [] p: 3 w: 0 #minus s: [2] p: 0 w: max(x1 + 1, x2) #mod s: [1] p: 0 w: max(x1) #if_mod s: [1,3,2] p: 0 w: max(x1 + 1, x2, x3) Removed DPs: #3 Number of SCCs: 1, DPs: 2 SCC { #1 #5 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... succeeded. le s: [] p: 4 w: 0 s s: [1] p: 5 w: x1 #le s: [2] p: 6 w: max(x1 + 2, x2 + 1) minus s: [1] p: 1 w: max(x1) mod s: [1] p: 2 w: max(x1) false s: [] p: 4 w: 0 true s: [] p: 0 w: 0 rand s: [] p: 0 w: x1 + 1 if_mod s: [2,1] p: 1 w: max(x1, x2) 0 s: [] p: 3 w: 0 #minus s: [2] p: 0 w: max(x1 + 1, x2) #mod s: [1] p: 6 w: max(x1 + 1, x2 + 3) #if_mod s: [2] p: 6 w: max(x1 + 2, x2 + 1, x3 + 3) Removed DPs: #1 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