details

property	value
status	complete
benchmark	ohl206.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n099.star.cs.uiowa.edu
space	Mixed_CTRS_2014

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.11189198494 seconds
cpu usage	0.020036035
max memory	2453504.0

stage attributes

key	value
output-size	2648
starexec-result	YES

output

/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 f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) ) Problem 1: Valid CTRS Processor: -> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: F(x:S,y:S) -> PLUS(y:S,z) | plus(x:S,y:S) ->* plus(z,z) PLUS(s(x:S),y:S) -> PLUS(x:S,s(y:S)) -> QPairs: Empty -> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) Conditional Termination Problem 2: -> Pairs: F(x:S,y:S) -> PLUS(x:S,y:S) -> QPairs: PLUS(s(x:S),y:S) -> PLUS(x:S,s(y:S)) -> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: F(x:S,y:S) -> PLUS(y:S,z) | plus(x:S,y:S) ->* plus(z,z) PLUS(s(x:S),y:S) -> PLUS(x:S,s(y:S)) -> QPairs: Empty -> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(s(x:S),y:S) -> PLUS(x:S,s(y:S)) -> QPairs: Empty ->->-> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) Problem 1.1: Conditional Subterm Processor: -> Pairs: PLUS(s(x:S),y:S) -> PLUS(x:S,s(y:S)) -> QPairs: Empty -> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S plus(s(x:S),y:S) -> plus(x:S,s(y:S)) ->Projection: pi(PLUS) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty -> QPairs: Empty -> Rules: f(x:S,y:S) -> plus(y:S,z) | plus(x:S,y:S) ->* plus(z,z) plus(0,y:S) -> y:S popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Conditional