details

property	value
status	timeout (wallclock)
benchmark	4141.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	ICFP_2010

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	300.029 seconds
cpu usage	356.65
user time	331.18
system time	25.47
max virtual memory	4903552.0
max residence set size	9592.0

stage attributes

unavailable

output

ERR Input TRS: 1: 0(1(x1)) -> 2(0(3(4(3(1(1(2(1(3(x1)))))))))) 2: 0(1(x1)) -> 4(4(2(4(2(3(3(1(3(3(x1)))))))))) 3: 0(1(x1)) -> 4(4(4(2(1(0(3(4(1(4(x1)))))))))) 4: 0(0(1(x1))) -> 5(4(2(1(4(1(3(4(2(2(x1)))))))))) 5: 0(2(0(x1))) -> 3(0(0(3(2(2(2(4(1(3(x1)))))))))) 6: 1(5(1(x1))) -> 1(5(3(2(4(3(0(3(2(4(x1)))))))))) 7: 0(1(2(5(x1)))) -> 1(4(3(0(3(4(4(2(3(5(x1)))))))))) 8: 0(2(2(1(x1)))) -> 3(0(5(2(1(1(2(2(3(1(x1)))))))))) 9: 0(4(5(4(x1)))) -> 1(1(5(4(1(2(4(1(4(3(x1)))))))))) 10: 4(5(1(0(x1)))) -> 2(0(3(2(4(2(5(2(2(2(x1)))))))))) 11: 0(2(0(0(1(x1))))) -> 0(2(2(0(5(4(4(3(4(1(x1)))))))))) 12: 0(2(0(4(1(x1))))) -> 2(3(0(3(2(4(2(0(4(1(x1)))))))))) 13: 3(0(0(1(5(x1))))) -> 3(2(4(3(2(2(1(2(0(5(x1)))))))))) 14: 3(0(2(2(1(x1))))) -> 3(2(0(5(4(1(3(1(4(3(x1)))))))))) 15: 3(3(5(0(1(x1))))) -> 3(2(4(1(1(0(5(1(2(4(x1)))))))))) 16: 5(3(3(5(1(x1))))) -> 5(3(2(5(4(4(1(1(4(4(x1)))))))))) 17: 5(4(5(0(2(x1))))) -> 5(4(0(3(4(5(2(1(3(1(x1)))))))))) 18: 0(0(0(2(2(5(x1)))))) -> 1(3(2(1(4(2(0(1(4(0(x1)))))))))) 19: 0(0(2(0(2(4(x1)))))) -> 5(2(3(4(4(5(2(1(4(1(x1)))))))))) 20: 0(0(2(2(5(4(x1)))))) -> 1(4(5(5(5(2(4(4(4(3(x1)))))))))) 21: 0(1(0(4(0(1(x1)))))) -> 0(3(0(3(3(3(0(1(1(4(x1)))))))))) 22: 0(2(4(0(2(4(x1)))))) -> 5(0(5(4(2(2(0(1(4(2(x1)))))))))) 23: 0(2(5(2(5(2(x1)))))) -> 3(2(1(1(1(1(5(1(4(3(x1)))))))))) 24: 0(3(0(5(0(2(x1)))))) -> 4(2(1(2(4(4(0(0(1(1(x1)))))))))) 25: 0(4(0(0(4(2(x1)))))) -> 0(2(2(3(5(4(4(3(1(4(x1)))))))))) 26: 1(1(0(4(0(4(x1)))))) -> 1(2(1(3(4(4(5(4(4(2(x1)))))))))) 27: 2(0(0(1(3(5(x1)))))) -> 4(2(4(0(2(4(4(1(3(5(x1)))))))))) 28: 2(5(0(0(3(5(x1)))))) -> 4(1(3(3(3(5(4(0(5(5(x1)))))))))) 29: 2(5(0(4(3(0(x1)))))) -> 2(4(1(2(2(0(5(5(2(0(x1)))))))))) 30: 2(5(4(0(0(1(x1)))))) -> 4(4(2(4(1(0(1(1(0(1(x1)))))))))) 31: 3(1(5(1(1(5(x1)))))) -> 3(3(0(3(3(0(3(2(2(0(x1)))))))))) 32: 3(5(1(0(5(1(x1)))))) -> 5(3(0(1(3(1(0(5(3(4(x1)))))))))) 33: 0(0(2(0(0(4(2(x1))))))) -> 1(3(4(1(0(0(5(5(2(4(x1)))))))))) 34: 0(0(4(3(0(1(5(x1))))))) -> 2(5(4(5(1(2(4(1(0(5(x1)))))))))) 35: 0(1(0(0(0(4(2(x1))))))) -> 3(2(5(2(0(4(2(3(4(1(x1)))))))))) 36: 0(1(0(4(0(0(2(x1))))))) -> 5(5(3(4(2(0(5(2(2(3(x1)))))))))) 37: 0(2(3(1(0(2(4(x1))))))) -> 3(3(1(0(4(2(1(2(4(3(x1)))))))))) 38: 0(2(3(1(5(0(1(x1))))))) -> 4(5(5(3(4(1(0(4(2(2(x1)))))))))) 39: 2(4(5(1(0(0(2(x1))))))) -> 4(3(1(2(1(3(4(1(5(1(x1)))))))))) 40: 3(0(3(0(5(2(5(x1))))))) -> 3(3(1(2(3(3(1(2(1(5(x1)))))))))) 41: 3(3(0(4(0(0(4(x1))))))) -> 3(3(3(1(1(5(4(4(5(4(x1)))))))))) 42: 3(3(5(0(1(5(2(x1))))))) -> 3(1(5(1(1(2(4(3(1(3(x1)))))))))) 43: 5(0(2(0(5(1(5(x1))))))) -> 5(0(0(0(0(3(2(4(3(5(x1)))))))))) 44: 5(1(1(3(1(0(4(x1))))))) -> 5(1(2(3(1(4(4(5(3(3(x1)))))))))) 45: 5(2(3(5(2(0(2(x1))))))) -> 5(2(2(4(4(1(2(5(5(2(x1)))))))))) Number of strict rules: 45 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #0(1(x1)) -> #4(4(2(4(2(3(3(1(3(3(x1)))))))))) #2: #0(1(x1)) -> #4(2(4(2(3(3(1(3(3(x1))))))))) #3: #0(1(x1)) -> #2(4(2(3(3(1(3(3(x1)))))))) #4: #0(1(x1)) -> #4(2(3(3(1(3(3(x1))))))) #5: #0(1(x1)) -> #2(3(3(1(3(3(x1)))))) #6: #0(1(x1)) -> #3(3(1(3(3(x1))))) #7: #0(1(x1)) -> #3(1(3(3(x1)))) #8: #0(1(x1)) -> #1(3(3(x1))) #9: #0(1(x1)) -> #3(3(x1)) #10: #0(1(x1)) -> #3(x1) #11: #5(0(2(0(5(1(5(x1))))))) -> #5(0(0(0(0(3(2(4(3(5(x1)))))))))) #12: #5(0(2(0(5(1(5(x1))))))) -> #0(0(0(0(3(2(4(3(5(x1))))))))) #13: #5(0(2(0(5(1(5(x1))))))) -> #0(0(0(3(2(4(3(5(x1)))))))) #14: #5(0(2(0(5(1(5(x1))))))) -> #0(0(3(2(4(3(5(x1))))))) #15: #5(0(2(0(5(1(5(x1))))))) -> #0(3(2(4(3(5(x1)))))) #16: #5(0(2(0(5(1(5(x1))))))) -> #3(2(4(3(5(x1))))) #17: #5(0(2(0(5(1(5(x1))))))) -> #2(4(3(5(x1)))) #18: #5(0(2(0(5(1(5(x1))))))) -> #4(3(5(x1))) #19: #5(0(2(0(5(1(5(x1))))))) -> #3(5(x1)) #20: #2(5(0(4(3(0(x1)))))) -> #2(4(1(2(2(0(5(5(2(0(x1)))))))))) #21: #2(5(0(4(3(0(x1)))))) -> #4(1(2(2(0(5(5(2(0(x1))))))))) #22: #2(5(0(4(3(0(x1)))))) -> #1(2(2(0(5(5(2(0(x1)))))))) #23: #2(5(0(4(3(0(x1)))))) -> #2(2(0(5(5(2(0(x1))))))) #24: #2(5(0(4(3(0(x1)))))) -> #2(0(5(5(2(0(x1)))))) #25: #2(5(0(4(3(0(x1)))))) -> #0(5(5(2(0(x1))))) #26: #2(5(0(4(3(0(x1)))))) -> #5(5(2(0(x1)))) #27: #2(5(0(4(3(0(x1)))))) -> #5(2(0(x1))) #28: #2(5(0(4(3(0(x1)))))) -> #2(0(x1)) #29: #0(1(0(0(0(4(2(x1))))))) -> #3(2(5(2(0(4(2(3(4(1(x1)))))))))) #30: #0(1(0(0(0(4(2(x1))))))) -> #2(5(2(0(4(2(3(4(1(x1))))))))) #31: #0(1(0(0(0(4(2(x1))))))) -> #5(2(0(4(2(3(4(1(x1)))))))) #32: #0(1(0(0(0(4(2(x1))))))) -> #2(0(4(2(3(4(1(x1))))))) #33: #0(1(0(0(0(4(2(x1))))))) -> #0(4(2(3(4(1(x1)))))) #34: #0(1(0(0(0(4(2(x1))))))) -> #4(2(3(4(1(x1))))) #35: #0(1(0(0(0(4(2(x1))))))) -> #2(3(4(1(x1)))) #36: #0(1(0(0(0(4(2(x1))))))) -> #3(4(1(x1))) #37: #0(1(0(0(0(4(2(x1))))))) -> #4(1(x1)) #38: #0(1(0(0(0(4(2(x1))))))) -> #1(x1) #39: #3(3(5(0(1(5(2(x1))))))) -> #3(1(5(1(1(2(4(3(1(3(x1)))))))))) #40: #3(3(5(0(1(5(2(x1))))))) -> #1(5(1(1(2(4(3(1(3(x1))))))))) #41: #3(3(5(0(1(5(2(x1))))))) -> #5(1(1(2(4(3(1(3(x1)))))))) #42: #3(3(5(0(1(5(2(x1))))))) -> #1(1(2(4(3(1(3(x1))))))) #43: #3(3(5(0(1(5(2(x1))))))) -> #1(2(4(3(1(3(x1)))))) #44: #3(3(5(0(1(5(2(x1))))))) -> #2(4(3(1(3(x1))))) #45: #3(3(5(0(1(5(2(x1))))))) -> #4(3(1(3(x1)))) #46: #3(3(5(0(1(5(2(x1))))))) -> #3(1(3(x1))) #47: #3(3(5(0(1(5(2(x1))))))) -> #1(3(x1)) #48: #3(3(5(0(1(5(2(x1))))))) -> #3(x1) #49: #3(3(0(4(0(0(4(x1))))))) -> #3(3(3(1(1(5(4(4(5(4(x1)))))))))) popout

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

job log

popout

actions

all output return to SRS Standard