Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270463

details

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

run statistics

property	value
solver	Wanda 2.1c
configuration	default
runtime (wallclock)	11.6549 seconds
cpu usage	11.6552
user time	11.3645
system time	0.290647
max virtual memory	266228.0
max residence set size	150440.0

stage attributes

key	value
starexec-result	YES

output

11.52/11.61	YES
11.61/11.64	We consider the system theBenchmark.
11.61/11.64	
11.61/11.64	  Alphabet:
11.61/11.64	
11.61/11.64	    0 : [] --> nat 
11.61/11.64	    plus : [nat * nat] --> nat 
11.61/11.64	    rec : [nat * nat * nat -> nat -> nat] --> nat 
11.61/11.64	    s : [nat] --> nat 
11.61/11.64	    succ : [] --> nat -> nat -> nat 
11.61/11.64	    xap : [nat -> nat -> nat * nat] --> nat -> nat 
11.61/11.64	    yap : [nat -> nat * nat] --> nat 
11.61/11.64	
11.61/11.64	  Rules:
11.61/11.64	
11.61/11.64	    rec(0, x, /\y./\z.yap(xap(f, y), z)) => x 
11.61/11.64	    rec(s(x), y, /\z./\u.yap(xap(f, z), u)) => yap(xap(f, x), rec(x, y, /\v./\w.yap(xap(f, v), w))) 
11.61/11.64	    succ x y => s(y) 
11.61/11.64	    plus(x, y) => rec(x, y, succ) 
11.61/11.64	    xap(f, x) => f x 
11.61/11.64	    yap(f, x) => f x 
11.61/11.64	
11.61/11.64	This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).
11.61/11.64	
11.61/11.64	Symbol xap is an encoding for application that is only used in innocuous ways.  We can simplify the program (without losing non-termination) by removing it.  This gives:
11.61/11.64	
11.61/11.64	  Alphabet:
11.61/11.64	
11.61/11.64	    0 : [] --> nat 
11.61/11.64	    plus : [nat * nat] --> nat 
11.61/11.64	    rec : [nat * nat * nat -> nat -> nat] --> nat 
11.61/11.64	    s : [nat] --> nat 
11.61/11.64	    succ : [] --> nat -> nat -> nat 
11.61/11.64	    yap : [nat -> nat * nat] --> nat 
11.61/11.64	
11.61/11.64	  Rules:
11.61/11.64	
11.61/11.64	    rec(0, X, /\x./\y.yap(F(x), y)) => X 
11.61/11.64	    rec(s(X), Y, /\x./\y.yap(F(x), y)) => yap(F(X), rec(X, Y, /\z./\u.yap(F(z), u))) 
11.61/11.64	    succ X Y => s(Y) 
11.61/11.64	    plus(X, Y) => rec(X, Y, succ) 
11.61/11.64	    yap(F, X) => F X 
11.61/11.64	
11.61/11.64	We use rule removal, following [Kop12, Theorem 2.23].
11.61/11.64	
11.61/11.64	This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]):
11.61/11.64	
11.61/11.64	  rec(0, X, /\x./\y.yap(F(x), y)) >? X 
11.61/11.64	  rec(s(X), Y, /\x./\y.yap(F(x), y)) >? yap(F(X), rec(X, Y, /\z./\u.yap(F(z), u))) 
11.61/11.64	  succ X Y >? s(Y) 
11.61/11.64	  plus(X, Y) >? rec(X, Y, succ) 
11.61/11.64	  yap(F, X) >? F X 
11.61/11.64	
11.61/11.64	We use a recursive path ordering as defined in [Kop12, Chapter 5].
11.61/11.64	
11.61/11.64	Argument functions:
11.61/11.64	
11.61/11.64	  [[succ]] = _|_ 
11.61/11.64	
11.61/11.64	We choose Lex = {} and Mul = {0, @_{o -> o -> o}, @_{o -> o}, plus, rec, s, yap}, and the following precedence: 0 > @_{o -> o -> o} > s > plus > rec > yap > @_{o -> o}
11.61/11.64	
11.61/11.64	Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:
11.61/11.64	
11.61/11.64	  rec(0, X, /\x./\y.yap(F(x), y)) >= X 
11.61/11.64	  rec(s(X), Y, /\x./\y.yap(F(x), y)) >= yap(F(X), rec(X, Y, /\x./\y.yap(F(x), y))) 
11.61/11.64	  @_{o -> o}(@_{o -> o -> o}(_|_, X), Y) >= s(Y) 
11.61/11.64	  plus(X, Y) > rec(X, Y, _|_) 
11.61/11.64	  yap(F, X) >= @_{o -> o}(F, X) 
11.61/11.64	
11.61/11.64	With these choices, we have:
11.61/11.64	
11.61/11.64	  1] rec(0, X, /\x./\y.yap(F(x), y)) >= X  because [2], by (Star) 
11.61/11.64	  2] rec*(0, X, /\x./\y.yap(F(x), y)) >= X  because [3], by (Select) 
11.61/11.64	  3] X >= X  by (Meta) 
11.61/11.64	
11.61/11.64	  4] rec(s(X), Y, /\x./\y.yap(F(x), y)) >= yap(F(X), rec(X, Y, /\x./\y.yap(F(x), y)))  because [5], by (Star) 
11.61/11.64	  5] rec*(s(X), Y, /\x./\y.yap(F(x), y)) >= yap(F(X), rec(X, Y, /\x./\y.yap(F(x), y)))  because [6], by (Select) 
11.61/11.64	  6] yap(F(rec*(s(X), Y, /\x./\y.yap(F(x), y))), rec*(s(X), Y, /\z./\u.yap(F(z), u))) >= yap(F(X), rec(X, Y, /\x./\y.yap(F(x), y)))  because yap in Mul, [7] and [12], by (Fun) 
11.61/11.64	  7] F(rec*(s(X), Y, /\x./\y.yap(F(x), y))) >= F(X)  because [8], by (Meta) 
11.61/11.64	  8] rec*(s(X), Y, /\x./\y.yap(F(x), y)) >= X  because [9], by (Select) 
11.61/11.64	  9] s(X) >= X  because [10], by (Star) 
11.61/11.64	  10] s*(X) >= X  because [11], by (Select) 
11.61/11.64	  11] X >= X  by (Meta) 
11.61/11.64	  12] rec*(s(X), Y, /\x./\y.yap(F(x), y)) >= rec(X, Y, /\x./\y.yap(F(x), y))  because rec in Mul, [13], [15] and [16], by (Stat) 
11.61/11.64	  13] s(X) > X  because [14], by definition 
11.61/11.64	  14] s*(X) >= X  because [11], by (Select) 
11.61/11.64	  15] Y >= Y  by (Meta) 
11.61/11.64	  16] /\x./\z.yap(F(x), z) >= /\x./\z.yap(F(x), z)  because [17], by (Abs) 
11.61/11.64	  17] /\z.yap(F(y), z) >= /\z.yap(F(y), z)  because [18], by (Abs) 
11.61/11.64	  18] yap(F(y), x) >= yap(F(y), x)  because yap in Mul, [19] and [21], by (Fun) 
11.61/11.64	  19] F(y) >= F(y)  because [20], by (Meta) 
11.61/11.64	  20] y >= y  by (Var) 
11.61/11.64	  21] x >= x  by (Var) 
11.61/11.64	
11.61/11.64	  22] @_{o -> o}(@_{o -> o -> o}(_|_, X), Y) >= s(Y)  because [23], by (Star) 
11.61/11.64	  23] @_{o -> o}*(@_{o -> o -> o}(_|_, X), Y) >= s(Y)  because [24], by (Select) 
11.61/11.64	  24] @_{o -> o -> o}(_|_, X) @_{o -> o}*(@_{o -> o -> o}(_|_, X), Y) >= s(Y)  because [25] 
11.61/11.64	  25] @_{o -> o -> o}*(_|_, X, @_{o -> o}*(@_{o -> o -> o}(_|_, X), Y)) >= s(Y)  because @_{o -> o -> o} > s and [26], by (Copy) 
11.61/11.64	  26] @_{o -> o -> o}*(_|_, X, @_{o -> o}*(@_{o -> o -> o}(_|_, X), Y)) >= Y  because [27], by (Select) 
11.61/11.64	  27] @_{o -> o}*(@_{o -> o -> o}(_|_, X), Y) >= Y  because [28], by (Select)

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