details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	260.6 seconds
cpu usage	345.267
user time	319.965
system time	25.3024
max virtual memory	3458368.0
max residence set size	9344.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: 0(1(0(x1))) -> 0(2(3(1(3(0(x1)))))) 2: 0(2(1(x1))) -> 3(1(3(0(2(x1))))) 3: 0(2(1(x1))) -> 0(2(3(3(1(3(x1)))))) 4: 0(2(1(x1))) -> 0(4(3(1(3(2(2(x1))))))) 5: 0(2(1(x1))) -> 0(2(3(2(2(1(3(2(x1)))))))) 6: 1(0(0(x1))) -> 2(3(1(3(0(0(x1)))))) 7: 0(0(2(0(x1)))) -> 0(0(4(4(3(2(0(x1))))))) 8: 0(1(2(1(x1)))) -> 0(3(1(3(1(3(2(x1))))))) 9: 0(1(3(5(x1)))) -> 0(5(4(4(3(1(4(x1))))))) 10: 0(1(3(5(x1)))) -> 3(5(4(3(1(3(2(0(x1)))))))) 11: 0(1(5(1(x1)))) -> 5(3(1(3(0(1(x1)))))) 12: 0(2(1(4(x1)))) -> 0(3(2(2(1(4(x1)))))) 13: 0(2(1(4(x1)))) -> 3(2(1(0(4(3(x1)))))) 14: 0(2(2(1(x1)))) -> 3(2(0(2(3(1(x1)))))) 15: 0(2(2(5(x1)))) -> 3(1(3(2(2(0(4(5(x1)))))))) 16: 0(2(4(4(x1)))) -> 3(2(0(4(4(5(4(x1))))))) 17: 0(2(4(5(x1)))) -> 3(2(0(4(5(x1))))) 18: 0(3(3(4(x1)))) -> 5(4(3(2(3(0(x1)))))) 19: 0(3(5(1(x1)))) -> 5(4(3(2(2(0(1(x1))))))) 20: 1(0(2(4(x1)))) -> 2(3(0(3(1(4(x1)))))) 21: 1(1(2(5(x1)))) -> 1(3(2(2(1(5(x1)))))) 22: 0(0(0(3(4(x1))))) -> 0(0(4(4(5(2(3(0(x1)))))))) 23: 0(0(1(1(5(x1))))) -> 5(0(3(1(3(1(0(5(x1)))))))) 24: 0(1(2(2(4(x1))))) -> 4(3(2(1(2(3(0(x1))))))) 25: 0(1(5(1(4(x1))))) -> 5(3(1(0(4(3(1(x1))))))) 26: 0(2(2(0(1(x1))))) -> 0(4(3(0(2(3(2(1(x1)))))))) 27: 0(2(2(2(5(x1))))) -> 3(2(2(5(4(3(2(0(x1)))))))) 28: 0(2(2(5(0(x1))))) -> 3(2(2(0(5(2(3(0(x1)))))))) 29: 0(3(4(1(4(x1))))) -> 2(3(3(1(0(5(4(4(x1)))))))) 30: 0(4(1(3(4(x1))))) -> 3(1(3(0(4(4(5(x1))))))) 31: 0(4(2(2(4(x1))))) -> 3(2(2(0(4(4(x1)))))) 32: 0(4(2(4(1(x1))))) -> 3(1(0(4(4(3(2(x1))))))) 33: 0(5(2(1(5(x1))))) -> 5(4(5(2(3(1(0(x1))))))) 34: 1(0(2(2(4(x1))))) -> 2(2(0(4(3(1(4(x1))))))) 35: 1(0(2(2(4(x1))))) -> 2(3(3(2(1(0(4(3(x1)))))))) 36: 1(2(2(0(1(x1))))) -> 4(3(2(1(0(2(3(1(x1)))))))) 37: 1(2(3(5(0(x1))))) -> 5(2(3(1(3(0(x1)))))) 38: 1(2(4(3(5(x1))))) -> 5(4(3(1(3(2(x1)))))) 39: 0(0(1(3(3(5(x1)))))) -> 0(3(2(3(0(1(5(x1))))))) 40: 0(0(2(2(3(0(x1)))))) -> 0(2(3(0(3(2(0(x1))))))) 41: 0(0(2(2(5(1(x1)))))) -> 0(3(0(2(3(2(1(5(x1)))))))) 42: 0(0(3(5(3(0(x1)))))) -> 0(5(0(3(1(3(3(0(x1)))))))) 43: 0(0(4(0(5(1(x1)))))) -> 0(0(4(0(4(3(1(5(x1)))))))) 44: 0(0(4(1(3(0(x1)))))) -> 0(0(3(2(3(0(1(4(x1)))))))) 45: 0(1(0(3(4(5(x1)))))) -> 3(1(0(4(3(5(0(4(x1)))))))) 46: 0(1(4(0(2(5(x1)))))) -> 0(5(2(0(4(4(1(x1))))))) 47: 0(1(5(3(4(0(x1)))))) -> 0(4(4(2(0(3(1(5(x1)))))))) 48: 0(2(1(5(3(5(x1)))))) -> 3(2(1(3(5(1(5(0(x1)))))))) 49: 0(3(5(2(4(1(x1)))))) -> 0(0(5(4(3(2(1(x1))))))) 50: 0(5(0(1(5(4(x1)))))) -> 3(1(3(0(0(5(4(5(x1)))))))) 51: 0(5(1(1(3(4(x1)))))) -> 4(1(0(4(5(4(3(1(x1)))))))) 52: 0(5(3(4(1(4(x1)))))) -> 5(4(0(4(3(1(3(x1))))))) 53: 0(5(3(4(1(5(x1)))))) -> 0(3(2(1(0(5(4(5(x1)))))))) 54: 0(5(5(0(1(5(x1)))))) -> 0(5(5(3(2(1(5(0(x1)))))))) 55: 1(0(2(4(0(5(x1)))))) -> 1(4(0(3(2(3(0(5(x1)))))))) 56: 1(1(4(0(1(0(x1)))))) -> 0(3(1(3(1(4(1(0(x1)))))))) 57: 1(2(1(0(2(1(x1)))))) -> 1(1(3(2(0(2(1(x1))))))) 58: 1(2(4(0(3(4(x1)))))) -> 3(2(0(4(3(3(1(4(x1)))))))) 59: 1(2(4(3(3(0(x1)))))) -> 4(0(2(3(3(1(3(0(x1)))))))) 60: 1(2(4(3(3(5(x1)))))) -> 3(2(3(2(5(4(3(1(x1)))))))) 61: 1(2(4(3(4(5(x1)))))) -> 3(1(3(2(4(5(4(x1))))))) 62: 1(2(4(5(1(0(x1)))))) -> 0(4(2(1(3(1(5(x1))))))) 63: 1(2(4(5(3(4(x1)))))) -> 4(3(2(2(1(3(5(4(x1)))))))) 64: 1(2(5(5(3(0(x1)))))) -> 5(2(3(3(1(3(5(0(x1)))))))) 65: 0(0(2(4(5(3(5(x1))))))) -> 2(0(5(4(3(5(3(0(x1)))))))) 66: 0(1(0(5(3(5(1(x1))))))) -> 1(0(0(5(5(3(1(3(x1)))))))) 67: 0(1(2(2(5(2(0(x1))))))) -> 5(1(0(3(2(2(2(0(x1)))))))) 68: 0(2(1(5(4(0(1(x1))))))) -> 0(0(5(1(2(3(1(4(x1)))))))) 69: 0(2(3(4(1(1(4(x1))))))) -> 3(1(0(4(4(1(2(0(x1)))))))) 70: 0(2(4(1(1(5(1(x1))))))) -> 3(1(0(5(4(1(1(2(x1)))))))) 71: 0(2(5(0(4(0(1(x1))))))) -> 0(5(1(0(4(3(2(0(x1)))))))) 72: 0(2(5(5(3(5(1(x1))))))) -> 0(5(5(1(5(5(3(2(x1)))))))) 73: 0(4(0(3(5(2(0(x1))))))) -> 0(4(0(4(5(3(2(0(x1)))))))) 74: 0(4(1(1(4(1(5(x1))))))) -> 0(4(3(1(4(1(1(5(x1)))))))) 75: 0(4(1(4(0(3(5(x1))))))) -> 3(1(5(0(0(4(3(4(x1)))))))) 76: 0(5(1(3(4(2(4(x1))))))) -> 5(4(4(0(3(1(5(2(x1)))))))) 77: 1(0(3(3(3(4(0(x1))))))) -> 0(3(0(3(3(1(4(5(x1)))))))) 78: 1(0(3(4(4(3(5(x1))))))) -> 5(4(3(1(3(0(2(4(x1)))))))) 79: 1(2(0(4(1(3(5(x1))))))) -> 5(4(2(3(1(4(1(0(x1)))))))) 80: 1(2(4(0(5(3(5(x1))))))) -> 5(1(3(2(3(5(0(4(x1)))))))) Number of strict rules: 80 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #0(2(1(x1))) -> #1(3(0(2(x1)))) #2: #0(2(1(x1))) -> #0(2(x1)) #3: #0(0(4(0(5(1(x1)))))) -> #0(0(4(0(4(3(1(5(x1)))))))) #4: #0(0(4(0(5(1(x1)))))) -> #0(4(0(4(3(1(5(x1))))))) #5: #0(0(4(0(5(1(x1)))))) -> #0(4(3(1(5(x1))))) #6: #0(0(4(0(5(1(x1)))))) -> #1(5(x1)) #7: #0(3(4(1(4(x1))))) -> #1(0(5(4(4(x1))))) #8: #0(3(4(1(4(x1))))) -> #0(5(4(4(x1)))) #9: #1(0(2(2(4(x1))))) -> #1(0(4(3(x1)))) #10: #1(0(2(2(4(x1))))) -> #0(4(3(x1))) #11: #0(1(0(5(3(5(1(x1))))))) -> #1(0(0(5(5(3(1(3(x1)))))))) #12: #0(1(0(5(3(5(1(x1))))))) -> #0(0(5(5(3(1(3(x1))))))) #13: #0(1(0(5(3(5(1(x1))))))) -> #0(5(5(3(1(3(x1)))))) #14: #0(1(0(5(3(5(1(x1))))))) -> #1(3(x1)) popout

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

job log

popout

actions

all output return to SRS Standard