details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	3.82403 seconds
cpu usage	3.81405
user time	3.6782
system time	0.135854
max virtual memory	752160.0
max residence set size	51608.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 foldr : [] --> (A -> A -> A) -> 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 foldr (/\x./\y.f x y) z nil => z foldr (/\x./\y.f x y) z (cons u v) => f u (foldr (/\w./\x'.f w x') z v) Using the transformations described in [Kop11], this system can be brought in a form without leading free variables in the left-hand side, and where the left-hand side of a variable is always a functional term or application headed by a functional term. We now transform the resulting AFS into an AFSM by replacing all free variables by meta-variables (with arity 0). This leads to the following AFSM: 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 popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta