details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	3.0335 seconds
cpu usage	2.78428
user time	2.55911
system time	0.225169
max virtual memory	665356.0
max residence set size	43464.0

stage attributes

key	value
starexec-result	YES

output

YES We consider the system theBenchmark. Alphabet: 0 : [] --> A active : [] --> A -> A afterNth : [] --> A -> A -> A app : [] --> (A -> A) -> A -> A cons : [] --> A -> A -> A fst : [] --> A -> A head : [] --> A -> A map : [] --> (A -> A) -> 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 u : [] --> A -> A -> A -> A -> A Rules: active (natsFrom x) => mark (cons x (natsFrom (s x))) active (fst (pair x y)) => mark x active (snd (pair x y)) => mark y active (splitAt 0 x) => mark (pair nil x) active (splitAt (s x) (cons y z)) => mark (u (splitAt x z) x y z) active (u (pair x y) z v w) => mark (pair (cons v x) y) active (head (cons x y)) => mark x active (tail (cons x y)) => mark y active (sel x y) => mark (head (afterNth x y)) active (take x y) => mark (fst (splitAt x y)) active (afterNth x y) => mark (snd (splitAt x y)) mark (natsFrom x) => active (natsFrom (mark x)) mark (cons x y) => active (cons (mark x) y) mark (s x) => active (s (mark x)) mark (fst x) => active (fst (mark x)) mark (pair x y) => active (pair (mark x) (mark y)) mark (snd x) => active (snd (mark x)) mark (splitAt x y) => active (splitAt (mark x) (mark y)) mark 0 => active 0 mark nil => active nil mark (u x y z v) => active (u (mark x) y z v) mark (head x) => active (head (mark x)) mark (tail x) => active (tail (mark x)) mark (sel x y) => active (sel (mark x) (mark y)) mark (afterNth x y) => active (afterNth (mark x) (mark y)) mark (take x y) => active (take (mark x) (mark y)) natsFrom (mark x) => natsFrom x natsFrom (active x) => natsFrom x cons (mark x) y => cons x y cons x (mark y) => cons x y cons (active x) y => cons x y cons x (active y) => cons x y s (mark x) => s x s (active x) => s x fst (mark x) => fst x fst (active x) => fst x pair (mark x) y => pair x y pair x (mark y) => pair x y pair (active x) y => pair x y pair x (active y) => pair x y snd (mark x) => snd x snd (active x) => snd x splitAt (mark x) y => splitAt x y splitAt x (mark y) => splitAt x y splitAt (active x) y => splitAt x y splitAt x (active y) => splitAt x y u (mark x) y z v => u x y z v u x (mark y) z v => u x y z v u x y (mark z) v => u x y z v u x y z (mark v) => u x y z v u (active x) y z v => u x y z v u x (active y) z v => u x y z v u x y (active z) v => u x y z v u x y z (active v) => u x y z v head (mark x) => head x head (active x) => head x tail (mark x) => tail x tail (active x) => tail x sel (mark x) y => sel x y sel x (mark y) => sel x y sel (active x) y => sel x y sel x (active y) => sel x y afterNth (mark x) y => afterNth x y afterNth x (mark y) => afterNth x y afterNth (active x) y => afterNth x y afterNth x (active y) => afterNth x y take (mark x) y => take x y take x (mark y) => take x y take (active x) y => take x y take x (active y) => take x y map (/\x.f x) nil => nil app (/\x.f x) y => f y popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta