details

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

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	0.0539531707764 seconds
cpu usage	0.052669139
max memory	8474624.0

stage attributes

key	value
output-size	7917
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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(),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: _(X1,X2) -> X1 6: _(X1,X2) -> X2 Number of strict rules: 6 Direct POLO(bPol) ... removes: 3 5 6 reverse w: x1 + 5854 _ w: 2 * x1 + 2 * x2 + 1 nil w: 0 cons w: 2 * x1 + x2 + 536 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 reverse w: 2 * x1 + 5854 _ w: 2 * x1 + 2 * x2 + 1 nil w: 1 cons w: 2 * x1 + x2 + 536 app w: x1 + x2 Number of strict rules: 1 Direct POLO(bPol) ... removes: 2 reverse w: 2 * x1 + 5853 _ w: 2 * x1 + 2 * x2 + 1 nil w: 1 cons w: 2 * x1 + x2 + 2241 app w: 2 * x1 + 2 * x2 + 1 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: _(X1,X2) -> X1 6: _(X1,X2) -> X2 Number of strict rules: 6 Direct POLO(bPol) ... removes: 3 5 6 reverse w: x1 + 5854 _ w: 2 * x1 + 2 * x2 + 1 nil w: 0 cons w: 2 * x1 + x2 + 536 app w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 4 1 reverse w: 2 * x1 + 5854 _ w: 2 * x1 + 2 * x2 + 1 nil w: 1 cons w: 2 * x1 + x2 + 536 app w: x1 + x2 Number of strict rules: 1 Direct POLO(bPol) ... removes: 2 reverse w: 2 * x1 + 5853 _ w: 2 * x1 + 2 * x2 + 1 nil w: 1 cons w: 2 * x1 + x2 + 2241 app w: 2 * x1 + 2 * x2 + 1 Number of strict rules: 0 >>YES ******** Signature ******** hshuffle : ((nat -> nat),list) -> list nil : list cons : (nat,list) -> list reverse : list -> list ******** Computation rules ******** (5) hshuffle(F1,nil) => nil (6) hshuffle(Z1,cons(U1,V1)) => cons(Z1[U1],hshuffle(Z1,reverse(V1))) ******** General Schema criterion ******** Found constructors: cons, nil Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) nil@X => X (meta X)[is acc in nil,X] [is positive in nil] [is acc in X] >>True Checking (2) cons(Y,U)@V => cons(Y,U@V) (fun app>cons) (meta Y)[is acc in cons(Y,U),V] [is positive in cons(Y,U)] [is acc in Y] (fun app=app) subterm comparison of args w. LR LR (meta U)[is acc in cons(Y,U),V] [is positive in cons(Y,U)] [is acc in U] (meta V)[is acc in cons(Y,U),V] [is positive in cons(Y,U)] [is acc in V] >>True Checking (3) reverse(nil) => nil (fun reverse>nil) >>True Checking (4) reverse(cons(W,P)) => reverse(P)@cons(W,nil) popout

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

job log

popout

actions

all output return to HRS 58631