details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	0.021145 seconds
cpu usage	0.009362
user time	0.00209
system time	0.007272
max virtual memory	0.0
max residence set size	1412.0

stage attributes

key	value
starexec-result	NO

output

NO We consider the system theBenchmark. Alphabet: f : [d -> d * b] --> c g : [b * a] --> d -> d h : [a -> b -> c] --> b i : [c] --> c Rules: f(g(h(j), x), y) => i(j x y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). This system is non-terminating, as demonstrated by the following reduction: f(g(h(/\x./\y.f(g(y, x), y)), z), h(/\u./\v.f(g(v, u), v))) => i((/\x./\y.f(g(y, x), y)) z h(/\u./\v.f(g(v, u), v))) =>_beta i(f(g(h(/\x./\y.f(g(y, x), y)), z), h(/\u./\v.f(g(v, u), v)))) That is, a term s reduces to a term of the form C[s]. popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta