details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	2.28713 seconds
cpu usage	2.3081
user time	2.15429
system time	0.153811
max virtual memory	736408.0
max residence set size	36508.0

stage attributes

key	value
starexec-result	YES

output

YES We consider the system theBenchmark. Alphabet: 0 : [] --> A afterNth : [A * A] --> A and : [A * A] --> A axxafterNth : [A * A] --> A axxand : [A * A] --> A axxfst : [A] --> A axxhead : [A] --> A axxnatsFrom : [A] --> A axxsel : [A * A] --> A axxsnd : [A] --> A axxsplitAt : [A * A] --> A axxtail : [A] --> A axxtake : [A * A] --> A axxu11 : [A * A * A * A] --> A axxu12 : [A * A] --> A cons : [A * A] --> A fst : [A] --> A head : [A] --> A mark : [A] --> A natsFrom : [A] --> A nil : [] --> A pair : [A * A] --> A s : [A] --> A sel : [A * A] --> A snd : [A] --> A splitAt : [A * A] --> A tail : [A] --> A take : [A * A] --> A tt : [] --> A u11 : [A * A * A * A] --> A u12 : [A * A] --> A Rules: axxu11(tt, x, y, z) => axxu12(axxsplitAt(mark(x), mark(z)), y) axxu12(pair(x, y), z) => pair(cons(mark(z), x), mark(y)) axxafterNth(x, y) => axxsnd(axxsplitAt(mark(x), mark(y))) axxand(tt, x) => mark(x) axxfst(pair(x, y)) => mark(x) axxhead(cons(x, y)) => mark(x) axxnatsFrom(x) => cons(mark(x), natsFrom(s(x))) axxsel(x, y) => axxhead(axxafterNth(mark(x), mark(y))) axxsnd(pair(x, y)) => mark(y) axxsplitAt(0, x) => pair(nil, mark(x)) axxsplitAt(s(x), cons(y, z)) => axxu11(tt, x, y, z) axxtail(cons(x, y)) => mark(y) axxtake(x, y) => axxfst(axxsplitAt(mark(x), mark(y))) mark(u11(x, y, z, u)) => axxu11(mark(x), y, z, u) mark(u12(x, y)) => axxu12(mark(x), y) mark(splitAt(x, y)) => axxsplitAt(mark(x), mark(y)) mark(afterNth(x, y)) => axxafterNth(mark(x), mark(y)) mark(snd(x)) => axxsnd(mark(x)) mark(and(x, y)) => axxand(mark(x), y) mark(fst(x)) => axxfst(mark(x)) mark(head(x)) => axxhead(mark(x)) mark(natsFrom(x)) => axxnatsFrom(mark(x)) mark(sel(x, y)) => axxsel(mark(x), mark(y)) mark(tail(x)) => axxtail(mark(x)) mark(take(x, y)) => axxtake(mark(x), mark(y)) mark(tt) => tt mark(pair(x, y)) => pair(mark(x), mark(y)) mark(cons(x, y)) => cons(mark(x), y) mark(s(x)) => s(mark(x)) mark(0) => 0 mark(nil) => nil axxu11(x, y, z, u) => u11(x, y, z, u) axxu12(x, y) => u12(x, y) axxsplitAt(x, y) => splitAt(x, y) axxafterNth(x, y) => afterNth(x, y) axxsnd(x) => snd(x) axxand(x, y) => and(x, y) axxfst(x) => fst(x) axxhead(x) => head(x) axxnatsFrom(x) => natsFrom(x) axxsel(x, y) => sel(x, y) axxtail(x) => tail(x) axxtake(x, y) => take(x, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). We observe that the rules contain a first-order subset: axxu11(tt, X, Y, Z) => axxu12(axxsplitAt(mark(X), mark(Z)), Y) axxu12(pair(X, Y), Z) => pair(cons(mark(Z), X), mark(Y)) axxafterNth(X, Y) => axxsnd(axxsplitAt(mark(X), mark(Y))) axxand(tt, X) => mark(X) axxfst(pair(X, Y)) => mark(X) axxhead(cons(X, Y)) => mark(X) axxnatsFrom(X) => cons(mark(X), natsFrom(s(X))) axxsel(X, Y) => axxhead(axxafterNth(mark(X), mark(Y))) axxsnd(pair(X, Y)) => mark(Y) axxsplitAt(0, X) => pair(nil, mark(X)) axxsplitAt(s(X), cons(Y, Z)) => axxu11(tt, X, Y, Z) axxtail(cons(X, Y)) => mark(Y) axxtake(X, Y) => axxfst(axxsplitAt(mark(X), mark(Y))) popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta