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


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


YES

Problem 1: 

(VAR x y)
(RULES
=(x,y) -> xor(x,xor(y,true))
implies(x,y) -> xor(and(x,y),xor(x,true))
not(x) -> xor(x,true)
or(x,y) -> xor(and(x,y),xor(x,y))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 =(x,y) -> xor(x,xor(y,true))
 implies(x,y) -> xor(and(x,y),xor(x,true))
 not(x) -> xor(x,true)
 or(x,y) -> xor(and(x,y),xor(x,y))
-> 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,y) -> xor(x,xor(y,true))
 implies(x,y) -> xor(and(x,y),xor(x,true))
 not(x) -> xor(x,true)
 or(x,y) -> xor(and(x,y),xor(x,y))

Problem 1: 

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

The problem is finite.