/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 z:S) (RULES minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) ) Problem 1: Valid CTRS Processor: -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: Empty -> QPairs: Empty -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) Conditional Termination Problem 2: -> Pairs: MINUS(x:S,s(y:S)) -> MINUS(x:S,y:S) -> QPairs: Empty -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: Empty -> QPairs: Empty -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: SCC Processor: -> Pairs: MINUS(x:S,s(y:S)) -> MINUS(x:S,y:S) -> QPairs: Empty -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(x:S,s(y:S)) -> MINUS(x:S,y:S) -> QPairs: Empty ->->-> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) Problem 1.2: Conditional Subterm Processor: -> Pairs: MINUS(x:S,s(y:S)) -> MINUS(x:S,y:S) -> QPairs: Empty -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) ->Projection: pi(MINUS) = 2 Problem 1.2: SCC Processor: -> Pairs: Empty -> QPairs: Empty -> Rules: minus(x:S,0) -> x:S minus(x:S,s(y:S)) -> z:S | minus(x:S,y:S) ->* s(z:S) ->Strongly Connected Components: There is no strongly connected component The problem is finite.