details

property	value
status	complete
benchmark	rtL-evo.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	Relative_05

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.395936 seconds
cpu usage	0.078487
user time	0.049885
system time	0.028602
max virtual memory	113188.0
max residence set size	9296.0

stage attributes

key	value
starexec-result	NO

output

NO Input TRS: 1: top(U(x,y)) -> top(check(D(x,y))) 2: D(x,B()) -> U(x,B()) 3: F(x,U(O(y),z)) -> U(x,F(y,z)) 4: F(x,U(N(y),z)) -> U(x,F(y,z)) 5: D(O(x),F(y,z)) -> F(x,D(y,z)) 6: D(N(x),F(y,z)) -> F(x,D(y,z)) 7: F(x,U(E(),y)) -> U(x,F(E(),y)) 8: D(E(),F(x,y)) -> F(E(),D(x,y)) 9: E() ->= N(E()) 10: check(O(x)) ->= O(x) 11: check(U(x,y)) ->= U(check(x),y) 12: check(U(x,y)) ->= U(x,check(y)) 13: check(D(x,y)) ->= D(check(x),y) 14: check(D(x,y)) ->= D(x,check(y)) 15: check(F(x,y)) ->= F(check(x),y) 16: check(F(x,y)) ->= F(x,check(y)) 17: check(O(x)) ->= O(check(x)) 18: check(N(x)) ->= N(check(x)) Number of strict rules: 8 Direct POLO(bPol) ... removes: 3 5 F w: x1 + x2 + 1 top w: x1 + 2331 E w: 0 D w: x1 + x2 + 1 O w: x1 + 3 B w: 19265 check w: x1 N w: 2 * x1 U w: x1 + x2 + 1 Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #D(N(x),F(y,z)) -> #F(x,D(y,z)) #2: #D(N(x),F(y,z)) -> #D(y,z) #3: #check(D(x,y)) ->? #D(check(x),y) #4: #check(D(x,y)) ->? #check(x) #5: #check(U(x,y)) ->? #check(x) #6: #check(U(x,y)) ->? #check(y) #7: #check(D(x,y)) ->? #D(x,check(y)) #8: #check(D(x,y)) ->? #check(y) #9: #F(x,U(E(),y)) -> #F(E(),y) #10: #check(O(x)) ->? #check(x) #11: #check(F(x,y)) ->? #F(x,check(y)) #12: #check(F(x,y)) ->? #check(y) #13: #top(U(x,y)) -> #top(check(D(x,y))) #14: #top(U(x,y)) -> #check(D(x,y)) #15: #top(U(x,y)) -> #D(x,y) #16: #D(E(),F(x,y)) -> #F(E(),D(x,y)) #17: #D(E(),F(x,y)) -> #D(x,y) #18: #check(F(x,y)) ->? #F(check(x),y) #19: #check(F(x,y)) ->? #check(x) #20: #F(x,U(N(y),z)) -> #F(y,z) #21: #check(N(x)) ->? #check(x) Number of SCCs: 4, DPs: 13 SCC { #13 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #top(U(x_{i5},B())) -#13-> #top(check(D(x_{i5},B()))) --->* #top(U(check(x_{i5}),B())) Looping with: [ x_{i5} := check(x_{i5}); ] popout

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

job log

popout

actions

all output return to TRS Relative