details

property	value
status	complete
benchmark	Applicative_AG01_innermost__#4.8.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n138.star.cs.uiowa.edu
space	Uncurried_Applicative_11

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	6.32356 seconds
cpu usage	17.441
user time	16.7203
system time	0.720644
max virtual memory	5161596.0
max residence set size	580220.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE We consider the system theBenchmark. Alphabet: 0 : [] --> a cons : [e * f] --> f f : [a * a * a] --> b false : [] --> d filter : [e -> d * f] --> f filter2 : [d * e -> d * e * f] --> f g : [c * c] --> c map : [e -> e * f] --> f nil : [] --> f plus : [a * a] --> a s : [a] --> a true : [] --> d Rules: plus(x, 0) => x plus(x, s(y)) => s(plus(x, y)) f(0, s(0), x) => f(x, plus(x, x), x) g(x, y) => x g(x, y) => y map(h, nil) => nil map(h, cons(x, y)) => cons(h x, map(h, y)) filter(h, nil) => nil filter(h, cons(x, y)) => filter2(h x, h, x, y) filter2(true, h, x, y) => cons(x, filter(h, y)) filter2(false, h, x, y) => filter(h, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta