details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	43.9378890991 seconds
cpu usage	43.788872896
max memory	3.53562624E8

stage attributes

key	value
output-size	2057
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S h(s(x:S)) -> x:S ) Problem 1: Valid CTRS Processor: -> Rules: b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S h(s(x:S)) -> x:S -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: B -> B F(x:S,y:S) -> G(s(x:S)) | c(g(x:S)) ->* c(a) F(x:S,y:S) -> H(s(x:S)) | c(h(x:S)) ->* c(a) -> QPairs: Empty -> Rules: b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S h(s(x:S)) -> x:S Conditional Termination Problem 2: -> Pairs: F(x:S,y:S) -> G(x:S) F(x:S,y:S) -> H(x:S) -> QPairs: Empty -> Rules: b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S h(s(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: B -> B F(x:S,y:S) -> G(s(x:S)) | c(g(x:S)) ->* c(a) F(x:S,y:S) -> H(s(x:S)) | c(h(x:S)) ->* c(a) -> QPairs: Empty -> Rules: b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S h(s(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B -> B -> QPairs: Empty ->->-> Rules: b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S h(s(x:S)) -> x:S Problem 1: Infinite Processor: -> Pairs: B -> B -> QPairs: Empty -> Rules: b -> b f(x:S,y:S) -> g(s(x:S)) | c(g(x:S)) ->* c(a) f(x:S,y:S) -> h(s(x:S)) | c(h(x:S)) ->* c(a) g(s(x:S)) -> x:S popout

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

job log

popout

actions

all output return to TRS Conditional