details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0446889400482 seconds
cpu usage	0.017795241
max memory	1753088.0

stage attributes

key	value
output-size	2894
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(s(x:S)) -> x:S pos(p(x:S)) -> ffalse | pos(x:S) ->* ffalse pos(s(0)) -> ttrue pos(s(x:S)) -> ttrue | pos(x:S) ->* ttrue pos(0) -> ffalse s(p(x:S)) -> x:S ) Problem 1: Valid CTRS Processor: -> Rules: p(s(x:S)) -> x:S pos(p(x:S)) -> ffalse | pos(x:S) ->* ffalse pos(s(0)) -> ttrue pos(s(x:S)) -> ttrue | pos(x:S) ->* ttrue pos(0) -> ffalse s(p(x:S)) -> x:S -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: Empty -> QPairs: Empty -> Rules: p(s(x:S)) -> x:S pos(p(x:S)) -> ffalse | pos(x:S) ->* ffalse pos(s(0)) -> ttrue pos(s(x:S)) -> ttrue | pos(x:S) ->* ttrue pos(0) -> ffalse s(p(x:S)) -> x:S Conditional Termination Problem 2: -> Pairs: POS(p(x:S)) -> POS(x:S) POS(s(x:S)) -> POS(x:S) -> QPairs: Empty -> Rules: p(s(x:S)) -> x:S pos(p(x:S)) -> ffalse | pos(x:S) ->* ffalse pos(s(0)) -> ttrue pos(s(x:S)) -> ttrue | pos(x:S) ->* ttrue pos(0) -> ffalse s(p(x:S)) -> x:S The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: Empty -> QPairs: Empty -> Rules: p(s(x:S)) -> x:S pos(p(x:S)) -> ffalse | pos(x:S) ->* ffalse pos(s(0)) -> ttrue pos(s(x:S)) -> ttrue | pos(x:S) ->* ttrue pos(0) -> ffalse s(p(x:S)) -> x:S ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: SCC Processor: -> Pairs: POS(p(x:S)) -> POS(x:S) POS(s(x:S)) -> POS(x:S) -> QPairs: Empty -> Rules: p(s(x:S)) -> x:S pos(p(x:S)) -> ffalse | pos(x:S) ->* ffalse pos(s(0)) -> ttrue pos(s(x:S)) -> ttrue | pos(x:S) ->* ttrue pos(0) -> ffalse s(p(x:S)) -> x:S ->Strongly Connected Components: popout

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

job log

popout

actions

all output return to TRS Conditional