details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0773169994354 seconds
cpu usage	0.019539121
max memory	1630208.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Conditional