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


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


YES

Problem 1: 

(VAR v_NonEmpty:S x:S y:S)
(RULES
=(x:S,y:S) -> xor(x:S,xor(y:S,ttrue))
implies(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,ttrue))
not(x:S) -> xor(x:S,ttrue)
or(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,y:S))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 =(x:S,y:S) -> xor(x:S,xor(y:S,ttrue))
 implies(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,ttrue))
 not(x:S) -> xor(x:S,ttrue)
 or(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,y:S))
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 =(x:S,y:S) -> xor(x:S,xor(y:S,ttrue))
 implies(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,ttrue))
 not(x:S) -> xor(x:S,ttrue)
 or(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,y:S))

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 =(x:S,y:S) -> xor(x:S,xor(y:S,ttrue))
 implies(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,ttrue))
 not(x:S) -> xor(x:S,ttrue)
 or(x:S,y:S) -> xor(and(x:S,y:S),xor(x:S,y:S))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.