Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270485

details

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

run statistics

property	value
solver	Wanda 2.1c
configuration	default
runtime (wallclock)	0.384248 seconds
cpu usage	0.384462
user time	0.346777
system time	0.037685
max virtual memory	113176.0
max residence set size	11716.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.35	YES
0.00/0.38	We consider the system theBenchmark.
0.00/0.38	
0.00/0.38	  Alphabet:
0.00/0.38	
0.00/0.38	    app : [] --> list -> list -> list 
0.00/0.38	    cons : [] --> nat -> list -> list 
0.00/0.38	    foldl : [] --> (list -> nat -> list) -> list -> list -> list 
0.00/0.38	    iconsc : [] --> list -> nat -> list 
0.00/0.38	    nil : [] --> list 
0.00/0.38	    reverse : [] --> list -> list 
0.00/0.38	    reverse1 : [] --> list -> list 
0.00/0.38	
0.00/0.38	  Rules:
0.00/0.38	
0.00/0.38	    app nil x => x 
0.00/0.38	    app (cons x y) z => cons x (app y z) 
0.00/0.38	    foldl (/\x./\y.f x y) z nil => z 
0.00/0.38	    foldl (/\x./\y.f x y) z (cons u v) => foldl (/\w./\x'.f w x') (f z u) v 
0.00/0.38	    iconsc x y => cons y x 
0.00/0.38	    reverse x => foldl (/\y./\z.iconsc y z) nil x 
0.00/0.38	    reverse1 x => foldl (/\y./\z.app (cons z nil) y) nil x 
0.00/0.38	
0.00/0.38	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.
0.00/0.38	
0.00/0.38	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:
0.00/0.38	
0.00/0.38	  Alphabet:
0.00/0.38	
0.00/0.38	    app : [list * list] --> list 
0.00/0.38	    cons : [nat * list] --> list 
0.00/0.38	    foldl : [list -> nat -> list * list * list] --> list 
0.00/0.38	    iconsc : [list * nat] --> list 
0.00/0.38	    nil : [] --> list 
0.00/0.38	    reverse : [list] --> list 
0.00/0.38	    reverse1 : [list] --> list 
0.00/0.38	    ~AP1 : [list -> nat -> list * list] --> nat -> list 
0.00/0.38	
0.00/0.38	  Rules:
0.00/0.38	
0.00/0.38	    app(nil, X) => X 
0.00/0.38	    app(cons(X, Y), Z) => cons(X, app(Y, Z)) 
0.00/0.38	    foldl(/\x./\y.~AP1(F, x) y, X, nil) => X 
0.00/0.38	    foldl(/\x./\y.~AP1(F, x) y, X, cons(Y, Z)) => foldl(/\z./\u.~AP1(F, z) u, ~AP1(F, X) Y, Z) 
0.00/0.38	    iconsc(X, Y) => cons(Y, X) 
0.00/0.38	    reverse(X) => foldl(/\x./\y.iconsc(x, y), nil, X) 
0.00/0.38	    reverse1(X) => foldl(/\x./\y.app(cons(y, nil), x), nil, X) 
0.00/0.38	    foldl(/\x./\y.iconsc(x, y), X, nil) => X 
0.00/0.38	    foldl(/\x./\y.iconsc(x, y), X, cons(Y, Z)) => foldl(/\z./\u.iconsc(z, u), iconsc(X, Y), Z) 
0.00/0.38	    ~AP1(F, X) => F X 
0.00/0.38	
0.00/0.38	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:
0.00/0.38	
0.00/0.38	  Alphabet:
0.00/0.38	
0.00/0.38	    app : [list * list] --> list 
0.00/0.38	    cons : [nat * list] --> list 
0.00/0.38	    foldl : [list -> nat -> list * list * list] --> list 
0.00/0.38	    iconsc : [list * nat] --> list 
0.00/0.38	    nil : [] --> list 
0.00/0.38	    reverse : [list] --> list 
0.00/0.38	    reverse1 : [list] --> list 
0.00/0.38	
0.00/0.38	  Rules:
0.00/0.38	
0.00/0.38	    app(nil, X) => X 
0.00/0.38	    app(cons(X, Y), Z) => cons(X, app(Y, Z)) 
0.00/0.38	    foldl(/\x./\y.X(x, y), Y, nil) => Y 
0.00/0.38	    foldl(/\x./\y.X(x, y), Y, cons(Z, U)) => foldl(/\z./\u.X(z, u), X(Y, Z), U) 
0.00/0.38	    iconsc(X, Y) => cons(Y, X) 
0.00/0.38	    reverse(X) => foldl(/\x./\y.iconsc(x, y), nil, X) 
0.00/0.38	    reverse1(X) => foldl(/\x./\y.app(cons(y, nil), x), nil, X) 
0.00/0.38	
0.00/0.38	We use rule removal, following [Kop12, Theorem 2.23].
0.00/0.38	
0.00/0.38	This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]):
0.00/0.38	
0.00/0.38	  app(nil, X) >? X 
0.00/0.38	  app(cons(X, Y), Z) >? cons(X, app(Y, Z)) 
0.00/0.38	  foldl(/\x./\y.X(x, y), Y, nil) >? Y 
0.00/0.38	  foldl(/\x./\y.X(x, y), Y, cons(Z, U)) >? foldl(/\z./\u.X(z, u), X(Y, Z), U) 
0.00/0.38	  iconsc(X, Y) >? cons(Y, X) 
0.00/0.38	  reverse(X) >? foldl(/\x./\y.iconsc(x, y), nil, X) 
0.00/0.38	  reverse1(X) >? foldl(/\x./\y.app(cons(y, nil), x), nil, X) 
0.00/0.38	
0.00/0.38	We use a recursive path ordering as defined in [Kop12, Chapter 5].
0.00/0.38	
0.00/0.38	Argument functions:
0.00/0.38	
0.00/0.38	  [[foldl(x_1, x_2, x_3)]] = foldl(x_3, x_2, x_1) 
0.00/0.38	  [[nil]] = _|_ 
0.00/0.38	
0.00/0.38	We choose Lex = {foldl} and Mul = {app, cons, iconsc, reverse, reverse1}, and the following precedence: reverse > iconsc > reverse1 > app > cons > foldl
0.00/0.38	
0.00/0.38	Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows:
0.00/0.38	
0.00/0.38	  app(_|_, X) > X 
0.00/0.38	  app(cons(X, Y), Z) >= cons(X, app(Y, Z)) 
0.00/0.38	  foldl(/\x./\y.X(x, y), Y, _|_) > Y 
0.00/0.38	  foldl(/\x./\y.X(x, y), Y, cons(Z, U)) > foldl(/\x./\y.X(x, y), X(Y, Z), U)

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