details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	106.339 seconds
cpu usage	381.025
user time	377.815
system time	3.21018
max virtual memory	5171540.0
max residence set size	1685892.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE We consider the system theBenchmark. Alphabet: 0 : [] --> b cons : [b * b] --> b del : [b * b] --> b eq : [b * b] --> a false : [] --> a filter : [b -> a * b] --> b filter2 : [a * b -> a * b * b] --> b if : [a * b * b] --> b le : [b * b] --> a map : [b -> b * b] --> b min : [b * b] --> b minsort : [b] --> b nil : [] --> b s : [b] --> b true : [] --> a Rules: le(0, x) => true le(s(x), 0) => false le(s(x), s(y)) => le(x, y) eq(0, 0) => true eq(0, s(x)) => false eq(s(x), 0) => false eq(s(x), s(y)) => eq(x, y) if(true, x, y) => x if(false, x, y) => y minsort(nil) => nil minsort(cons(x, y)) => cons(min(x, y), minsort(del(min(x, y), cons(x, y)))) min(x, nil) => x min(x, cons(y, z)) => if(le(x, y), min(x, z), min(y, z)) del(x, nil) => nil del(x, cons(y, z)) => if(eq(x, y), z, cons(y, del(x, z))) map(f, nil) => nil map(f, cons(x, y)) => cons(f x, map(f, y)) filter(f, nil) => nil filter(f, cons(x, y)) => filter2(f x, f, x, y) filter2(true, f, x, y) => cons(x, filter(f, y)) filter2(false, f, x, y) => filter(f, 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