details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	0.0135591 seconds
cpu usage	0.007969
user time	0.004813
system time	0.003156
max virtual memory	0.0
max residence set size	1360.0

stage attributes

key	value
starexec-result	NO

output

NO We consider the system theBenchmark. Alphabet: 0 : [] --> b 1 : [] --> b cons : [d * e] --> e f : [b] --> a false : [] --> c filter : [d -> c * e] --> e filter2 : [c * d -> c * d * e] --> e map : [d -> d * e] --> e nil : [] --> e true : [] --> c Rules: f(0) => f(0) 0 => 1 map(g, nil) => nil map(g, cons(x, y)) => cons(g x, map(g, y)) filter(g, nil) => nil filter(g, cons(x, y)) => filter2(g x, g, x, y) filter2(true, g, x, y) => cons(x, filter(g, y)) filter2(false, g, x, y) => filter(g, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). It is easy to see that this system is non-terminating: f(0) => f(0) That is, a term s reduces to a term t which instantiates s. popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta