Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270327

details

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

run statistics

property	value
solver	Wanda 2.1c
configuration	default
runtime (wallclock)	5.23541 seconds
cpu usage	3.24354
user time	3.10659
system time	0.136949
max virtual memory	184780.0
max residence set size	68312.0

stage attributes

key	value
starexec-result	YES

output

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

popout

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

job log

popout

actions all output return to Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10