/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)
(RULES
a -> b | f(a) ->* b
)

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

Problem 1: 

Dependency Pairs Processor:

Conditional Termination Problem 1:
-> Pairs:
 Empty
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) ->* b

Conditional Termination Problem 2:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) ->* b

Problem 1: 

SCC Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) ->* b
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A -> A
-> QPairs:
 Empty
->->-> Rules:
 a -> b | f(a) ->* b

Problem 1: 

Unsatisfiable Rule Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 a -> b | f(a) ->* b
->AGES Output:
 
Model Results

System:
mod InTheory is
  sorts S Bool .

op _->*_ : S S -> Bool .
op _->_ : S S -> Bool .
op a :  -> S .
op b :  -> S .
op f : S -> 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)
f(a) ->R* b => a ->R b
x:S ->R y:S => gtrsim(x:S,y:S)
sqsupset(b,f(a))

Results:


Domains:
S: |N

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

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

Problem 1: 

Infinite Processor:
-> Pairs:
 A -> A
-> QPairs:
 Empty
-> Rules:
 Empty
-> Pairs in cycle:
 A -> A

The problem is infinite.