details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.224992990494 seconds
cpu usage	0.280893304
max memory	1.8067456E7

stage attributes

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

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

job log

popout

actions

all output return to TRS Relat 75837