details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0623030662537 seconds
cpu usage	0.02173675
max memory	1880064.0

stage attributes

key	value
output-size	2306
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 y:S) (RULES a -> c a -> d b -> c b -> d c -> e c -> l d -> m f(x:S) -> x:S | x:S ->* e g(d,x:S,y:S) -> A | y:S ->* x:S h(x:S,y:S) -> g(x:S,y:S,f(k)) | y:S ->* x:S k -> l k -> m ) Problem 1: Valid CTRS Processor: -> Rules: a -> c a -> d b -> c b -> d c -> e c -> l d -> m f(x:S) -> x:S | x:S ->* e g(d,x:S,y:S) -> A | y:S ->* x:S h(x:S,y:S) -> g(x:S,y:S,f(k)) | y:S ->* x:S k -> l k -> m -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: a# -> C a# -> D B -> C B -> D H(x:S,y:S) -> F(k) | y:S ->* x:S H(x:S,y:S) -> G(x:S,y:S,f(k)) | y:S ->* x:S H(x:S,y:S) -> K | y:S ->* x:S -> QPairs: Empty -> Rules: a -> c a -> d b -> c b -> d c -> e c -> l d -> m f(x:S) -> x:S | x:S ->* e g(d,x:S,y:S) -> A | y:S ->* x:S h(x:S,y:S) -> g(x:S,y:S,f(k)) | y:S ->* x:S k -> l k -> m Conditional Termination Problem 2: -> Pairs: Empty -> QPairs: Empty -> Rules: a -> c a -> d b -> c b -> d c -> e c -> l d -> m f(x:S) -> x:S | x:S ->* e g(d,x:S,y:S) -> A | y:S ->* x:S h(x:S,y:S) -> g(x:S,y:S,f(k)) | y:S ->* x:S k -> l k -> m The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: a# -> C a# -> D popout

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

job log

popout

actions

all output return to TRS Conditional