details

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

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	0.0934960842133 seconds
cpu usage	0.092348841
max memory	9535488.0

stage attributes

key	value
output-size	9110
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_hrs /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using NaTT (Nagoya Termination Tool) Input TRS: 1: app(nil(),L) -> L 2: app(cons(N,L),Y) -> cons(N,app(L,Y)) 3: reverse(nil()) -> nil() 4: reverse(cons(N,L)) -> app(reverse(L),cons(N,nil())) 5: shuffle(nil()) -> nil() 6: shuffle(cons(N,L)) -> cons(N,shuffle(reverse(L))) 7: uhalf(0()) -> 0() 8: uhalf(s(0())) -> s(0()) 9: uhalf(s(s(N))) -> s(uhalf(N)) 10: tail(cons(N,L)) -> L 11: head(cons(N,L)) -> N 12: _(X1,X2) -> X1 13: _(X1,X2) -> X2 Number of strict rules: 13 Direct POLO(bPol) ... removes: 8 3 5 10 7 12 11 9 13 6 s w: 2 * x1 + 1 reverse w: x1 + 5905 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 8099 tail w: x1 + 281 0 w: 1 nil w: 0 head w: 2 * x1 cons w: x1 + x2 + 16352 uhalf w: 2 * x1 + 1 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 s w: 2 * x1 + 1 reverse w: 2 * x1 + 2236 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 8099 tail w: x1 + 281 0 w: 1 nil w: 0 head w: 2 * x1 cons w: x1 + x2 + 16352 uhalf w: 2 * x1 + 1 app w: x1 + x2 + 2447 Number of strict rules: 1 Direct POLO(bPol) ... removes: 2 s w: 2 * x1 + 1 reverse w: 2 * x1 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 2279 tail w: x1 + 281 0 w: 1 nil w: 0 head w: 2 * x1 cons w: x1 + x2 + 2483 uhalf w: 2 * x1 + 1 app w: 2 * x1 + 2 * x2 + 9168 Number of strict rules: 0 ... Input TRS: 1: app(nil(),L) -> L 2: app(cons(N,L),Y) -> cons(N,app(L,Y)) 3: reverse(nil()) -> nil() 4: reverse(cons(N,L)) -> app(reverse(L),cons(N,nil())) 5: shuffle(nil()) -> nil() 6: shuffle(cons(N,L)) -> cons(N,shuffle(reverse(L))) 7: uhalf(0()) -> 0() 8: uhalf(s(0())) -> s(0()) 9: uhalf(s(s(N))) -> s(uhalf(N)) 10: tail(cons(N,L)) -> L 11: head(cons(N,L)) -> N 12: _(X1,X2) -> X1 13: _(X1,X2) -> X2 Number of strict rules: 13 Direct POLO(bPol) ... removes: 8 3 5 10 7 12 11 9 13 6 s w: 2 * x1 + 1 reverse w: x1 + 5905 _ w: 2 * x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 8099 tail w: x1 + 281 0 w: 1 nil w: 0 head w: 2 * x1 cons w: x1 + x2 + 16352 uhalf w: 2 * x1 + 1 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 s w: 2 * x1 + 1 reverse w: 2 * x1 + 2236 _ w: 2 * x1 + 2 * x2 + 1 popout

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

job log

popout

actions

all output return to HRS 58631