details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0156421661377 seconds
cpu usage	0.012334457
max memory	1503232.0

stage attributes

key	value
output-size	1680
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 x) (RULES f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) ) Problem 1: Valid CTRS Processor: -> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: G(s(x)) -> G(x) -> QPairs: Empty -> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) Conditional Termination Problem 2: -> Pairs: Empty -> QPairs: G(s(x)) -> G(x) -> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: G(s(x)) -> G(x) -> QPairs: Empty -> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(s(x)) -> G(x) ->->-> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) Problem 1.1: Conditional Subterm Processor: -> Pairs: G(s(x)) -> G(x) -> QPairs: Empty -> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) ->Projection: pi(G) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty -> QPairs: Empty -> Rules: f(g(x)) -> x | x -> s(0) g(s(x)) -> g(x) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: SCC Processor: -> Pairs: Empty -> QPairs: popout

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

job log

popout

actions

all output return to TRS Condi 20667