YES

Problem 1:

(VAR vu95NonEmpty x)
(RULES
a -> c
a -> d
b -> c
b -> d
f(x) -> x | x ->* c
g(x,x) -> h(x,x)
h(x,f(x)) -> x
)

Problem 1:

Well-founded Relation Processor:
-> Rules:
 a -> c
 a -> d
 b -> c
 b -> d
 f(x) -> x | x ->* c
 g(x,x) -> h(x,x)
 h(x,f(x)) -> x
->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 g : S S -> S .
op h : S S -> S .
op c :  -> S .
op d :  -> 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)
x1 ->R y1 => g(x1,x2) ->R g(y1,x2)
x2 ->R y2 => g(x1,x2) ->R g(x1,y2)
x1 ->R y1 => h(x1,x2) ->R h(y1,x2)
x2 ->R y2 => h(x1,x2) ->R h(x1,y2)
a ->R c
a ->R d
b ->R c
b ->R d
x ->R* c => f(x) ->R x
g(x,x) ->R h(x,x)
h(x,f(x)) ->R x
x ->R y => sqsupset(x,y)

Results:


Domains:
S: |N U {-1}

Function Interpretations:
|[a]| = 2
|[b]| = 2
|[c]| = - 1
|[d]| = 1
|[f(x_1_1:S)]| = 3 + 3.x_1_1:S
|[fSNonEmpty]| = 1
|[g(x_1_1:S,x_2_1:S)]| = 6 + 3.x_1_1:S + 3.x_2_1:S
|[h(x_1_1:S,x_2_1:S)]| = 3 + 3.x_1_1:S + x_2_1:S

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

The problem is finite.
0.88user 0.11system 0:01.27elapsed 78%CPU (0avgtext+0avgdata 54488maxresident)k
25848inputs+128outputs (116major+15364minor)pagefaults 0swaps