details

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

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	0.0906610488892 seconds
cpu usage	0.08484198
max memory	7258112.0

stage attributes

key	value
output-size	8170
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_hrs /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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(),X) -> X 2: app(cons(Y,U),V) -> cons(Y,app(U,V)) 3: reverse(nil()) -> nil() 4: reverse(cons(W,P)) -> app(reverse(P),cons(W,nil())) 5: shuffle(nil()) -> nil() 6: shuffle(cons(X1,Y1)) -> cons(X1,shuffle(reverse(Y1))) 7: _(X1,X2) -> X1 8: _(X1,X2) -> X2 Number of strict rules: 8 Direct POLO(bPol) ... removes: 8 5 7 reverse w: x1 _ w: x1 + 2 * x2 + 1 shuffle w: x1 + 6284 nil w: 0 cons w: 2 * x1 + x2 + 1889 app w: x1 + x2 Number of strict rules: 5 Direct POLO(bPol) ... removes: 6 reverse w: x1 _ w: x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 2276 nil w: 0 cons w: 2 * x1 + x2 + 8587 app w: x1 + x2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 3 reverse w: x1 + 1595 _ w: x1 + 2 * x2 + 1 shuffle w: x1 + 2276 nil w: 0 cons w: 2 * x1 + x2 + 7579 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 reverse w: 2 * x1 + 3541 _ w: x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 328 nil w: 1920 cons w: 2 * x1 + x2 + 3895 app w: x1 + x2 + 1974 Number of strict rules: 1 Direct POLO(bPol) ... removes: 2 reverse w: 2 * x1 + 3541 _ w: x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 328 nil w: 1920 cons w: 2 * x1 + x2 + 7081 app w: 2 * x1 + x2 + 1620 Number of strict rules: 0 ... Input TRS: 1: app(nil(),X) -> X 2: app(cons(Y,U),V) -> cons(Y,app(U,V)) 3: reverse(nil()) -> nil() 4: reverse(cons(W,P)) -> app(reverse(P),cons(W,nil())) 5: shuffle(nil()) -> nil() 6: shuffle(cons(X1,Y1)) -> cons(X1,shuffle(reverse(Y1))) 7: _(X1,X2) -> X1 8: _(X1,X2) -> X2 Number of strict rules: 8 Direct POLO(bPol) ... removes: 8 5 7 reverse w: x1 _ w: x1 + 2 * x2 + 1 shuffle w: x1 + 6284 nil w: 0 cons w: 2 * x1 + x2 + 1889 app w: x1 + x2 Number of strict rules: 5 Direct POLO(bPol) ... removes: 6 reverse w: x1 _ w: x1 + 2 * x2 + 1 shuffle w: 2 * x1 + 2276 nil w: 0 cons w: 2 * x1 + x2 + 8587 app w: x1 + x2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 3 reverse w: x1 + 1595 _ w: x1 + 2 * x2 + 1 shuffle w: x1 + 2276 nil w: 0 cons w: 2 * x1 + x2 + 7579 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 reverse w: 2 * x1 + 3541 popout

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

job log

popout

actions

all output return to HRS 58631