details

property	value
status	complete
benchmark	Applicative_05__Ex7Sorting.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)	2.02964 seconds
cpu usage	2.02974
user time	1.94002
system time	0.08972
max virtual memory	157412.0
max residence set size	42188.0

stage attributes

key	value
starexec-result	YES

output

YES We consider the system theBenchmark. Alphabet: 0 : [] --> a asort : [b] --> b cons : [a * b] --> b dsort : [b] --> b insert : [a -> a -> a * a -> a -> a * b * a] --> b max : [] --> a -> a -> a min : [] --> a -> a -> a nil : [] --> b s : [a] --> a sort : [a -> a -> a * a -> a -> a * b] --> b Rules: sort(f, g, nil) => nil sort(f, g, cons(x, y)) => insert(f, g, sort(f, g, y), x) insert(f, g, nil, x) => cons(x, nil) insert(f, g, cons(x, y), z) => cons(f x z, insert(f, g, y, g x z)) max 0 x => x max x 0 => x max s(x) s(y) => max x y min 0 x => 0 min x 0 => 0 min s(x) s(y) => min x y asort(x) => sort(min, max, x) dsort(x) => sort(max, min, x) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): sort(F, G, nil) >? nil sort(F, G, cons(X, Y)) >? insert(F, G, sort(F, G, Y), X) insert(F, G, nil, X) >? cons(X, nil) insert(F, G, cons(X, Y), Z) >? cons(F X Z, insert(F, G, Y, G X Z)) max 0 X >? X max X 0 >? X max s(X) s(Y) >? max X Y min 0 X >? 0 min X 0 >? 0 min s(X) s(Y) >? min X Y asort(X) >? sort(min, max, X) dsort(X) >? sort(max, min, X) We use a recursive path ordering as defined in [Kop12, Chapter 5]. Argument functions: [[0]] = _|_ [[insert(x_1, x_2, x_3, x_4)]] = insert(x_2, x_3, x_4, x_1) [[nil]] = _|_ We choose Lex = {insert} and Mul = {@_{o -> o -> o}, @_{o -> o}, asort, cons, dsort, max, min, s, sort}, and the following precedence: dsort > asort = max > min > s > sort > insert > @_{o -> o} > cons > @_{o -> o -> o} Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: sort(F, G, _|_) >= _|_ sort(F, G, cons(X, Y)) >= insert(F, G, sort(F, G, Y), X) insert(F, G, _|_, X) >= cons(X, _|_) insert(F, G, cons(X, Y), Z) > cons(@_{o -> o}(@_{o -> o -> o}(F, X), Z), insert(F, G, Y, @_{o -> o}(@_{o -> o -> o}(G, X), Z))) @_{o -> o}(@_{o -> o -> o}(max, _|_), X) > X @_{o -> o}(@_{o -> o -> o}(max, X), _|_) >= X @_{o -> o}(@_{o -> o -> o}(max, s(X)), s(Y)) >= @_{o -> o}(@_{o -> o -> o}(max, X), Y) @_{o -> o}(@_{o -> o -> o}(min, _|_), X) >= _|_ @_{o -> o}(@_{o -> o -> o}(min, X), _|_) >= _|_ @_{o -> o}(@_{o -> o -> o}(min, s(X)), s(Y)) >= @_{o -> o}(@_{o -> o -> o}(min, X), Y) asort(X) >= sort(min, max, X) dsort(X) >= sort(max, min, X) With these choices, we have: 1] sort(F, G, _|_) >= _|_ by (Bot) 2] sort(F, G, cons(X, Y)) >= insert(F, G, sort(F, G, Y), X) because [3], by (Star) 3] sort*(F, G, cons(X, Y)) >= insert(F, G, sort(F, G, Y), X) because sort > insert, [4], [6], [8] and [14], by (Copy) 4] sort*(F, G, cons(X, Y)) >= F because [5], by (Select) 5] F >= F by (Meta) 6] sort*(F, G, cons(X, Y)) >= G because [7], by (Select) 7] G >= G by (Meta) 8] sort*(F, G, cons(X, Y)) >= sort(F, G, Y) because sort in Mul, [9], [10] and [11], by (Stat) 9] F >= F by (Meta) 10] G >= G by (Meta) 11] cons(X, Y) > Y because [12], by definition 12] cons*(X, Y) >= Y because [13], by (Select) 13] Y >= Y by (Meta) 14] sort*(F, G, cons(X, Y)) >= X because [15], by (Select) 15] cons(X, Y) >= X because [16], by (Star) 16] cons*(X, Y) >= X because [17], by (Select) 17] X >= X by (Meta) 18] insert(F, G, _|_, X) >= cons(X, _|_) because [19], by (Star) 19] insert*(F, G, _|_, X) >= cons(X, _|_) because insert > cons, [20] and [22], by (Copy) 20] insert*(F, G, _|_, X) >= X because [21], by (Select) 21] X >= X by (Meta) popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta