details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.068480014801 seconds
cpu usage	0.081642548
max memory	1.3012992E7

stage attributes

key	value
output-size	1356
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: p(0()) -> 0() 2: p(s(X)) -> X 3: leq(0(),Y) -> true() 4: leq(s(X),0()) -> false() 5: leq(s(X),s(Y)) -> leq(X,Y) 6: if(true(),X,Y) -> activate(X) 7: if(false(),X,Y) -> activate(Y) 8: diff(X,Y) -> if(leq(X,Y),n__0(),n__s(diff(p(X),Y))) 9: 0() -> n__0() 10: s(X) -> n__s(X) 11: activate(n__0()) -> 0() 12: activate(n__s(X)) -> s(X) 13: activate(X) -> X Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #if(true(),X,Y) -> #activate(X) #2: #activate(n__0()) -> #0() #3: #activate(n__s(X)) -> #s(X) #4: #if(false(),X,Y) -> #activate(Y) #5: #leq(s(X),s(Y)) -> #leq(X,Y) #6: #diff(X,Y) -> #if(leq(X,Y),n__0(),n__s(diff(p(X),Y))) #7: #diff(X,Y) -> #leq(X,Y) #8: #diff(X,Y) -> #diff(p(X),Y) #9: #diff(X,Y) -> #p(X) Number of SCCs: 2, DPs: 2 SCC { #8 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #diff(X,Y_{1}) -#8-> #diff(p(X),Y_{1}) --->* #diff(p(X),Y_{1}) Looping with: [ Y_{1} := Y_{1}; X := p(X); ] popout

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

job log

popout

actions

all output return to TRS Stand 20472