/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
a -> b | a ->* c, b ->* c
f(x:S) -> g(a)
g(x:S) -> f(x:S)
)

Problem 1: 
Valid CTRS Processor:
-> Rules:
 a -> b | a ->* c, b ->* c
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)
-> The system is a deterministic 3-CTRS.

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 F(x:S) -> A
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
-> Rules:
 a -> b | a ->* c, b ->* c
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)

Conditional Termination Problem 2:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> b | a ->* c, b ->* c
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)

Problem 1: 

SCC Processor:
-> Pairs:
 F(x:S) -> A
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
-> Rules:
 a -> b | a ->* c, b ->* c
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
->->-> Rules:
 a -> b | a ->* c, b ->* c
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)

Problem 1: 

Unsatisfiable Rule Processor:
-> Pairs:
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
-> Rules:
 a -> b | a ->* c, b ->* c
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)
->AGES Output:
 
Model Results

System:
mod InTheory is
  sorts S Bool .

op _->*_ : S S -> Bool .
op _->_ : S S -> Bool .
op a :  -> S .
op f : S -> S .
op g : S -> S .
op b :  -> S .
op c :  -> S .
op fSNonEmpty :  -> S .
op gtrsim : S S -> Bool .
op sqsupset : S S -> Bool .

endm


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

Results:


Domains:
S: -|N

Function Interpretations:
|[a]| = 0
|[f(x_1_1:S)]| = 0
|[g(x_1_1:S)]| = 0
|[b]| = 0
|[c]| =  - 1
|[fSNonEmpty]| = 0

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

Problem 1: 

SCC Processor:
-> Pairs:
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
-> Rules:
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
->->-> Rules:
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)

Problem 1: 

Infinite Processor:
-> Pairs:
 F(x:S) -> G(a)
 G(x:S) -> F(x:S)
-> QPairs:
 Empty
-> Rules:
 f(x:S) -> g(a)
 g(x:S) -> f(x:S)
-> Pairs in cycle:
 F(a) -> G(a)
 G(a) -> F(a)

The problem is infinite.