details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0946180820465 seconds
cpu usage	0.077867247
max memory	4431872.0

stage attributes

key	value
output-size	14151
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 ) Problem 1: Valid CTRS Processor: -> Rules: p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: P(q(x:S)) -> P(r(x:S)) P(q(x:S)) -> R(x:S) Q(h(x:S)) -> R(x:S) R(x:S) -> R(h(x:S)) | s(x:S) ->* 0 -> QPairs: Empty -> Rules: p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 Conditional Termination Problem 2: -> Pairs: R(x:S) -> S(x:S) -> QPairs: Empty -> Rules: p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: P(q(x:S)) -> P(r(x:S)) P(q(x:S)) -> R(x:S) Q(h(x:S)) -> R(x:S) R(x:S) -> R(h(x:S)) | s(x:S) ->* 0 -> QPairs: Empty -> Rules: p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: R(x:S) -> R(h(x:S)) | s(x:S) ->* 0 -> QPairs: Empty ->->-> Rules: p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 ->->Cycle: ->->-> Pairs: P(q(x:S)) -> P(r(x:S)) -> QPairs: Empty ->->-> Rules: p(q(x:S)) -> p(r(x:S)) q(h(x:S)) -> r(x:S) r(x:S) -> r(h(x:S)) | s(x:S) ->* 0 s(x:S) -> 1 The problem is decomposed in 2 subproblems. Problem 1.1.1: popout

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

job log

popout

actions

all output return to TRS Conditional