details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0160899162292 seconds
cpu usage	0.012799687
max memory	1392640.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Condi 20667