YES

Problem 1:

(VAR vu95NonEmpty x y)
(RULES
a -> b
b -> c
f(x) -> y | x ->* y
)

Problem 1:

Well-founded Relation Processor:
-> Rules:
 a -> b
 b -> c
 f(x) -> y | x ->* y
->AGES Output:

Model Results

System:
mod InTheory is
sort S .
sort Bool .


op _->*_ : S S -> Bool [m = 2] .
op _->_ : S S -> Bool [m = 2] .
op a :  -> S .
op b :  -> S .
op f : S -> S .
op c :  -> S .
op fSNonEmpty :  -> S .
op sqsupset : S S -> Bool [wellfounded m = 1] .

endm


Property:
x ->R* x
x ->R y /\ y ->R* z => x ->R* z
x1 ->R y1 => f(x1) ->R f(y1)
a ->R b
b ->R c
x ->R* y => f(x) ->R y
x ->R y => sqsupset(x,y)

Results:


Domains:
S: |N \ {0}

Function Interpretations:
|[a]| = 3
|[b]| = 2
|[c]| = 1
|[f(x_1_1:S)]| = 4 + 2.x_1_1:S
|[fSNonEmpty]| = 1

Predicate Interpretations:
 x_1_1:S ->* x_2_1:S <=> (1 + x_1_1:S >= x_2_1:S)
 x_1_1:S -> x_2_1:S <=> ((x_1_1:S >= 1 + x_2_1:S) /\ (x_1_1:S + x_2_1:S >= 0))
sqsupset(x_1_1:S,x_2_1:S) <=> (x_1_1:S >= 1 + x_2_1:S)

The problem is finite.
0.43user 0.10system 0:00.80elapsed 66%CPU (0avgtext+0avgdata 22352maxresident)k
25080inputs+64outputs (112major+7038minor)pagefaults 0swaps