details

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

run statistics

property	value
solver	Wanda 2.2a
configuration	default
runtime (wallclock)	0.262741 seconds
cpu usage	0.252712
user time	0.211443
system time	0.041269
max virtual memory	113188.0
max residence set size	9020.0

stage attributes

key	value
starexec-result	YES

output

YES We consider the system theBenchmark. Alphabet: 0 : [] --> nat rec : [] --> nat -> nat -> (nat -> nat -> nat) -> nat s : [] --> nat -> nat xplus : [] --> nat -> nat -> nat xtimes : [] --> nat -> nat -> nat Rules: xplus x 0 => x xplus x (s y) => s (xplus x y) rec 0 x (/\y./\z.f y z) => x rec (s x) y (/\z./\u.f z u) => f x (rec x y (/\v./\w.f v w)) xtimes x y => rec y 0 (/\z./\u.xplus x u) Using the transformations described in [Kop11], this system can be brought in a form without leading free variables in the left-hand side, and where the left-hand side of a variable is always a functional term or application headed by a functional term. We now transform the resulting AFS into an AFSM by replacing all free variables by meta-variables (with arity 0). This leads to the following AFSM: Alphabet: 0 : [] --> nat rec : [nat * nat * nat -> nat -> nat] --> nat s : [nat] --> nat xplus : [nat * nat] --> nat xtimes : [nat * nat] --> nat ~AP1 : [nat -> nat -> nat * nat] --> nat -> nat Rules: xplus(X, 0) => X xplus(X, s(Y)) => s(xplus(X, Y)) rec(0, X, /\x./\y.~AP1(F, x) y) => X rec(s(X), Y, /\x./\y.~AP1(F, x) y) => ~AP1(F, X) rec(X, Y, /\z./\u.~AP1(F, z) u) xtimes(X, Y) => rec(Y, 0, /\x./\y.xplus(X, y)) rec(0, X, /\x./\y.xplus(x, y)) => X rec(0, X, /\x./\y.xtimes(x, y)) => X rec(s(X), Y, /\x./\y.xplus(x, y)) => xplus(X, rec(X, Y, /\z./\u.xplus(z, u))) rec(s(X), Y, /\x./\y.xtimes(x, y)) => xtimes(X, rec(X, Y, /\z./\u.xtimes(z, u))) ~AP1(F, X) => F X Symbol ~AP1 is an encoding for application that is only used in innocuous ways. We can simplify the program (without losing non-termination) by removing it. Additionally, we can remove some (now-)redundant rules. This gives: Alphabet: 0 : [] --> nat rec : [nat * nat * nat -> nat -> nat] --> nat s : [nat] --> nat xplus : [nat * nat] --> nat xtimes : [nat * nat] --> nat Rules: xplus(X, 0) => X xplus(X, s(Y)) => s(xplus(X, Y)) rec(0, X, /\x./\y.Y(x, y)) => X rec(s(X), Y, /\x./\y.Z(x, y)) => Z(X, rec(X, Y, /\z./\u.Z(z, u))) xtimes(X, Y) => rec(Y, 0, /\x./\y.xplus(X, y)) We use rule removal, following [Kop12, Theorem 2.23]. This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): xplus(X, 0) >? X xplus(X, s(Y)) >? s(xplus(X, Y)) rec(0, X, /\x./\y.Y(x, y)) >? X rec(s(X), Y, /\x./\y.Z(x, y)) >? Z(X, rec(X, Y, /\z./\u.Z(z, u))) xtimes(X, Y) >? rec(Y, 0, /\x./\y.xplus(X, y)) We use a recursive path ordering as defined in [Kop12, Chapter 5]. Argument functions: [[0]] = _|_ We choose Lex = {} and Mul = {rec, s, xplus, xtimes}, and the following precedence: xtimes > rec > xplus > s Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: xplus(X, _|_) >= X xplus(X, s(Y)) > s(xplus(X, Y)) rec(_|_, X, /\x./\y.Y(x, y)) > X rec(s(X), Y, /\x./\y.Z(x, y)) >= Z(X, rec(X, Y, /\x./\y.Z(x, y))) xtimes(X, Y) > rec(Y, _|_, /\x./\y.xplus(X, y)) With these choices, we have: 1] xplus(X, _|_) >= X because [2], by (Star) 2] xplus*(X, _|_) >= X because [3], by (Select) 3] X >= X by (Meta) 4] xplus(X, s(Y)) > s(xplus(X, Y)) because [5], by definition 5] xplus*(X, s(Y)) >= s(xplus(X, Y)) because xplus > s and [6], by (Copy) 6] xplus*(X, s(Y)) >= xplus(X, Y) because xplus in Mul, [7] and [8], by (Stat) 7] X >= X by (Meta) 8] s(Y) > Y because [9], by definition popout

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

job log

popout

actions

all output return to Higher Order Rewriting Union Beta