details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	300.037 seconds
cpu usage	448.15
user time	385.31
system time	62.84
max virtual memory	9030752.0
max residence set size	12616.0

stage attributes

unavailable

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default: line 4: 7164 Done xsltproc "$DIR/xtc2tpdb.xml" "$1" 7165 Alarm clock | NaTT.exe 2> "$2/stdout.txt" 2> $DIR/stderr.txt Input TRS: 1: 2(5(3(0(x1)))) -> 1(0(0(1(3(0(4(5(1(2(x1)))))))))) 2: 1(3(5(4(3(x1))))) -> 2(1(4(1(4(0(3(0(1(1(x1)))))))))) 3: 5(1(3(5(0(x1))))) -> 5(1(4(3(0(4(4(5(2(1(x1)))))))))) 4: 5(4(4(2(5(x1))))) -> 4(3(1(1(1(1(5(3(3(5(x1)))))))))) 5: 2(2(5(0(5(4(x1)))))) -> 2(1(4(1(3(3(2(2(5(4(x1)))))))))) 6: 3(0(5(5(4(3(x1)))))) -> 3(3(0(3(2(3(5(5(1(0(x1)))))))))) 7: 3(5(4(3(5(2(x1)))))) -> 2(0(5(2(0(5(2(2(3(2(x1)))))))))) 8: 4(4(2(5(5(0(x1)))))) -> 4(4(0(0(3(3(3(2(2(3(x1)))))))))) 9: 4(5(3(5(5(0(x1)))))) -> 4(2(2(3(0(2(4(1(1(5(x1)))))))))) 10: 5(4(5(1(1(2(x1)))))) -> 5(4(0(3(3(3(3(2(5(5(x1)))))))))) 11: 5(5(5(5(5(3(x1)))))) -> 5(5(0(1(4(0(0(5(0(1(x1)))))))))) 12: 3(5(0(0(5(4(3(x1))))))) -> 0(1(2(1(1(5(5(2(1(0(x1)))))))))) 13: 3(5(4(2(5(2(3(x1))))))) -> 4(0(4(0(0(2(2(3(4(4(x1)))))))))) 14: 3(5(4(5(1(4(0(x1))))))) -> 1(1(1(0(0(3(3(1(2(5(x1)))))))))) 15: 0(x1) ->= 0(1(0(2(0(1(0(3(1(2(x1)))))))))) 16: 0(x1) ->= 0(1(0(3(3(1(1(0(1(2(x1)))))))))) 17: 0(x1) ->= 0(1(1(1(2(4(2(5(2(1(x1)))))))))) 18: 0(x1) ->= 0(2(0(3(3(2(0(1(3(4(x1)))))))))) 19: 2(x1) ->= 3(1(5(3(2(4(5(3(2(3(x1)))))))))) 20: 3(x1) ->= 3(1(5(2(5(3(1(0(2(4(x1)))))))))) 21: 0(0(x1)) ->= 0(5(2(0(2(2(3(1(3(4(x1)))))))))) 22: 0(0(x1)) ->= 1(0(1(4(4(2(0(1(4(1(x1)))))))))) 23: 0(0(x1)) ->= 4(3(1(5(1(0(4(1(0(2(x1)))))))))) 24: 2(2(x1)) ->= 2(1(1(3(2(3(0(0(1(3(x1)))))))))) 25: 2(3(x1)) ->= 2(1(3(1(0(1(1(2(1(1(x1)))))))))) 26: 2(5(x1)) ->= 3(1(5(1(0(2(0(0(2(5(x1)))))))))) 27: 3(0(x1)) ->= 2(2(0(2(1(3(0(0(3(3(x1)))))))))) 28: 3(0(x1)) ->= 3(0(4(2(2(2(5(2(1(2(x1)))))))))) 29: 4(0(x1)) ->= 4(0(2(2(0(0(0(3(0(1(x1)))))))))) 30: 5(0(x1)) ->= 5(0(1(5(2(4(1(0(3(3(x1)))))))))) 31: 5(2(x1)) ->= 4(1(3(3(1(4(0(4(0(2(x1)))))))))) 32: 5(3(x1)) ->= 0(2(1(1(3(0(0(5(1(5(x1)))))))))) 33: 5(3(x1)) ->= 0(3(3(1(0(1(0(4(5(3(x1)))))))))) 34: 5(3(x1)) ->= 5(1(3(1(1(0(0(5(2(5(x1)))))))))) 35: 0(5(0(x1))) ->= 0(2(5(3(0(1(4(1(0(3(x1)))))))))) 36: 2(0(0(x1))) ->= 2(2(0(2(4(4(3(4(0(1(x1)))))))))) 37: 2(2(3(x1))) ->= 1(0(0(5(1(4(0(4(4(1(x1)))))))))) 38: 2(3(0(x1))) ->= 1(1(4(0(1(1(2(0(1(1(x1)))))))))) 39: 2(3(0(x1))) ->= 2(4(0(2(1(3(4(2(4(2(x1)))))))))) 40: 2(5(0(x1))) ->= 1(3(3(1(0(4(5(0(1(4(x1)))))))))) 41: 2(5(0(x1))) ->= 3(1(3(3(4(4(5(0(2(0(x1)))))))))) 42: 2(5(3(x1))) ->= 2(0(1(0(2(4(2(0(4(5(x1)))))))))) 43: 2(5(4(x1))) ->= 3(1(2(2(3(1(3(1(5(4(x1)))))))))) 44: 3(3(0(x1))) ->= 3(0(1(2(3(0(3(3(0(1(x1)))))))))) 45: 3(5(0(x1))) ->= 3(5(0(2(4(4(2(3(4(4(x1)))))))))) 46: 3(5(2(x1))) ->= 3(0(1(1(3(0(1(0(0(3(x1)))))))))) 47: 4(2(2(x1))) ->= 4(1(5(3(2(1(1(2(1(4(x1)))))))))) 48: 4(2(3(x1))) ->= 4(2(0(2(2(1(3(0(3(0(x1)))))))))) 49: 5(2(2(x1))) ->= 0(0(4(4(2(1(1(2(3(2(x1)))))))))) 50: 5(4(3(x1))) ->= 5(0(0(0(2(1(4(2(1(2(x1)))))))))) 51: 1(1(3(0(x1)))) ->= 1(1(3(0(1(4(4(1(0(4(x1)))))))))) 52: 1(5(2(3(x1)))) ->= 1(2(4(0(3(1(4(0(2(3(x1)))))))))) 53: 4(4(5(3(x1)))) ->= 4(4(3(1(0(5(1(5(1(5(x1)))))))))) 54: 0(0(5(4(0(x1))))) ->= 0(0(3(5(1(1(5(0(3(2(x1)))))))))) 55: 2(5(5(4(3(x1))))) ->= 3(1(4(5(0(5(0(0(2(1(x1)))))))))) 56: 3(4(5(4(3(x1))))) ->= 5(1(3(2(4(5(0(2(3(0(x1)))))))))) 57: 0(5(3(5(0(0(x1)))))) ->= 0(5(0(1(0(5(0(4(1(3(x1)))))))))) 58: 2(1(2(5(2(2(x1)))))) ->= 2(0(4(1(3(0(2(0(1(4(x1)))))))))) 59: 3(3(4(0(5(4(0(x1))))))) ->= 2(0(0(0(2(5(4(5(0(3(x1)))))))))) 60: 4(5(2(0(1(5(0(x1))))))) ->= 4(0(2(4(3(0(4(3(5(0(x1)))))))))) Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #1(3(5(4(3(x1))))) -> #2(1(4(1(4(0(3(0(1(1(x1)))))))))) #2: #1(3(5(4(3(x1))))) -> #1(4(1(4(0(3(0(1(1(x1))))))))) #3: #1(3(5(4(3(x1))))) -> #4(1(4(0(3(0(1(1(x1)))))))) #4: #1(3(5(4(3(x1))))) -> #1(4(0(3(0(1(1(x1))))))) #5: #1(3(5(4(3(x1))))) -> #4(0(3(0(1(1(x1)))))) #6: #1(3(5(4(3(x1))))) -> #0(3(0(1(1(x1))))) #7: #1(3(5(4(3(x1))))) -> #3(0(1(1(x1)))) #8: #1(3(5(4(3(x1))))) -> #0(1(1(x1))) #9: #1(3(5(4(3(x1))))) -> #1(1(x1)) #10: #1(3(5(4(3(x1))))) -> #1(x1) #11: #2(5(4(x1))) ->? #3(1(2(2(3(1(3(1(5(4(x1)))))))))) #12: #2(5(4(x1))) ->? #1(2(2(3(1(3(1(5(4(x1))))))))) #13: #2(5(4(x1))) ->? #2(2(3(1(3(1(5(4(x1)))))))) #14: #2(5(4(x1))) ->? #2(3(1(3(1(5(4(x1))))))) #15: #2(5(4(x1))) ->? #3(1(3(1(5(4(x1)))))) #16: #2(5(4(x1))) ->? #1(3(1(5(4(x1))))) #17: #2(5(4(x1))) ->? #3(1(5(4(x1)))) #18: #2(5(4(x1))) ->? #1(5(4(x1))) #19: #4(0(x1)) ->? #4(0(2(2(0(0(0(3(0(1(x1)))))))))) #20: #4(0(x1)) ->? #0(2(2(0(0(0(3(0(1(x1))))))))) #21: #4(0(x1)) ->? #2(2(0(0(0(3(0(1(x1)))))))) #22: #4(0(x1)) ->? #2(0(0(0(3(0(1(x1))))))) #23: #4(0(x1)) ->? #0(0(0(3(0(1(x1)))))) #24: #4(0(x1)) ->? #0(0(3(0(1(x1))))) #25: #4(0(x1)) ->? #0(3(0(1(x1)))) #26: #4(0(x1)) ->? #3(0(1(x1))) #27: #4(0(x1)) ->? #0(1(x1)) #28: #4(0(x1)) ->? #1(x1) #29: #0(5(0(x1))) ->? #0(2(5(3(0(1(4(1(0(3(x1)))))))))) #30: #0(5(0(x1))) ->? #2(5(3(0(1(4(1(0(3(x1))))))))) #31: #0(5(0(x1))) ->? #5(3(0(1(4(1(0(3(x1)))))))) #32: #0(5(0(x1))) ->? #3(0(1(4(1(0(3(x1))))))) #33: #0(5(0(x1))) ->? #0(1(4(1(0(3(x1)))))) popout

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

job log

popout

actions

all output return to SRS Relative