Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270209
details
property
value
status
complete
benchmark
kop11cai1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Kop_13
run statistics
property
value
solver
Wanda 2.1c
configuration
default
runtime (wallclock)
1.74173 seconds
cpu usage
0.774656
user time
0.718848
system time
0.055808
max virtual memory
134748.0
max residence set size
20368.0
stage attributes
key
value
starexec-result
YES
output
0.70/1.70 YES 0.70/1.73 We consider the system theBenchmark. 0.70/1.73 0.70/1.73 Alphabet: 0.70/1.73 0.70/1.73 0 : [] --> nat 0.70/1.73 cons : [nat * list] --> list 0.70/1.73 map : [nat -> nat * list] --> list 0.70/1.73 nil : [] --> list 0.70/1.73 op : [nat -> nat * nat -> nat] --> nat -> nat 0.70/1.73 pow : [nat -> nat * nat] --> nat -> nat 0.70/1.73 s : [nat] --> nat 0.70/1.73 0.70/1.73 Rules: 0.70/1.73 0.70/1.73 map(f, nil) => nil 0.70/1.73 map(f, cons(x, y)) => cons(f x, map(f, y)) 0.70/1.73 pow(f, 0) => /\x.x 0.70/1.73 pow(f, s(x)) => op(f, pow(f, x)) 0.70/1.73 op(f, g) x => f (g x) 0.70/1.73 /\x.f x => f 0.70/1.73 0.70/1.73 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.70/1.73 0.70/1.73 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.70/1.73 0.70/1.73 Alphabet: 0.70/1.73 0.70/1.73 0 : [] --> nat 0.70/1.73 cons : [nat * list] --> list 0.70/1.73 map : [nat -> nat * list] --> list 0.70/1.73 nil : [] --> list 0.70/1.73 op : [nat -> nat * nat -> nat] --> nat -> nat 0.70/1.73 pow : [nat -> nat * nat] --> nat -> nat 0.70/1.73 s : [nat] --> nat 0.70/1.73 ~AP1 : [nat -> nat * nat] --> nat 0.70/1.73 ~L1 : [nat -> nat] --> nat -> nat 0.70/1.73 0.70/1.73 Rules: 0.70/1.73 0.70/1.73 map(F, nil) => nil 0.70/1.73 map(F, cons(X, Y)) => cons(~AP1(F, X), map(F, Y)) 0.70/1.73 pow(F, 0) => ~L1(/\x.x) 0.70/1.73 pow(F, s(X)) => op(F, pow(F, X)) 0.70/1.73 op(F, G) X => ~AP1(F, ~AP1(G, X)) 0.70/1.73 ~L1(/\x.~AP1(F, x)) => F 0.70/1.73 ~L1(/\x.op(F, G) x) => op(F, G) 0.70/1.73 ~AP1(F, X) => F X 0.70/1.73 ~L1(F) => F 0.70/1.73 0.70/1.73 We use rule removal, following [Kop12, Theorem 2.23]. 0.70/1.73 0.70/1.73 This gives the following requirements (possibly using Theorems 2.25 and 2.26 in [Kop12]): 0.70/1.73 0.70/1.73 map(F, nil) >? nil 0.70/1.73 map(F, cons(X, Y)) >? cons(~AP1(F, X), map(F, Y)) 0.70/1.73 pow(F, 0) >? ~L1(/\x.x) 0.70/1.73 pow(F, s(X)) >? op(F, pow(F, X)) 0.70/1.73 op(F, G) X >? ~AP1(F, ~AP1(G, X)) 0.70/1.73 ~L1(/\x.~AP1(F, x)) >? F 0.70/1.73 ~L1(/\x.op(F, G) x) >? op(F, G) 0.70/1.73 ~AP1(F, X) >? F X 0.70/1.73 ~L1(F) >? F 0.70/1.73 0.70/1.73 We use a recursive path ordering as defined in [Kop12, Chapter 5]. 0.70/1.73 0.70/1.73 Argument functions: 0.70/1.73 0.70/1.73 [[nil]] = _|_ 0.70/1.73 0.70/1.73 We choose Lex = {} and Mul = {0, @_{o -> o}, cons, map, op, pow, s, ~AP1, ~L1}, and the following precedence: 0 > pow > s > ~L1 > op > map = ~AP1 > @_{o -> o} > cons 0.70/1.74 0.70/1.74 Taking the argument function into account, and fixing the greater / greater equal choices, the constraints can be denoted as follows: 0.70/1.74 0.70/1.74 map(F, _|_) >= _|_ 0.70/1.74 map(F, cons(X, Y)) > cons(~AP1(F, X), map(F, Y)) 0.70/1.74 pow(F, 0) > ~L1(/\x.x) 0.70/1.74 pow(F, s(X)) >= op(F, pow(F, X)) 0.70/1.74 @_{o -> o}(op(F, G), X) >= ~AP1(F, ~AP1(G, X)) 0.70/1.74 ~L1(/\x.~AP1(F, x)) >= F 0.70/1.74 ~L1(/\x.@_{o -> o}(op(F, G), x)) >= op(F, G) 0.70/1.74 ~AP1(F, X) > @_{o -> o}(F, X) 0.70/1.74 ~L1(F) >= F 0.70/1.74 0.70/1.74 With these choices, we have: 0.70/1.74 0.70/1.74 1] map(F, _|_) >= _|_ by (Bot) 0.70/1.74 0.70/1.74 2] map(F, cons(X, Y)) > cons(~AP1(F, X), map(F, Y)) because [3], by definition 0.70/1.74 3] map*(F, cons(X, Y)) >= cons(~AP1(F, X), map(F, Y)) because map > cons, [4] and [9], by (Copy) 0.70/1.74 4] map*(F, cons(X, Y)) >= ~AP1(F, X) because map = ~AP1, map in Mul, [5] and [6], by (Stat) 0.70/1.74 5] F >= F by (Meta) 0.70/1.74 6] cons(X, Y) > X because [7], by definition 0.70/1.74 7] cons*(X, Y) >= X because [8], by (Select) 0.70/1.74 8] X >= X by (Meta) 0.70/1.74 9] map*(F, cons(X, Y)) >= map(F, Y) because map in Mul, [5] and [10], by (Stat) 0.70/1.74 10] cons(X, Y) > Y because [11], by definition 0.70/1.74 11] cons*(X, Y) >= Y because [12], by (Select) 0.70/1.74 12] Y >= Y by (Meta) 0.70/1.74
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