details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	43.2461941242 seconds
cpu usage	43.160861847
max memory	2.527232E7

stage attributes

key	value
output-size	4946
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 a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S ) Problem 1: Innermost Equivalent Processor: -> Rules: a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: A(d,a(s,x:S)) -> A(d,a(p,a(s,x:S))) A(d,a(s,x:S)) -> A(p,a(s,x:S)) A(d,a(s,x:S)) -> A(s,a(d,a(p,a(s,x:S)))) A(d,a(s,x:S)) -> A(s,a(s,a(d,a(p,a(s,x:S))))) A(f,a(s,x:S)) -> A(d,a(f,a(p,a(s,x:S)))) A(f,a(s,x:S)) -> A(f,a(p,a(s,x:S))) A(f,a(s,x:S)) -> A(p,a(s,x:S)) -> Rules: a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: A(d,a(s,x:S)) -> A(d,a(p,a(s,x:S))) A(d,a(s,x:S)) -> A(p,a(s,x:S)) A(d,a(s,x:S)) -> A(s,a(d,a(p,a(s,x:S)))) A(d,a(s,x:S)) -> A(s,a(s,a(d,a(p,a(s,x:S))))) A(f,a(s,x:S)) -> A(d,a(f,a(p,a(s,x:S)))) A(f,a(s,x:S)) -> A(f,a(p,a(s,x:S))) A(f,a(s,x:S)) -> A(p,a(s,x:S)) -> Rules: a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(d,a(s,x:S)) -> A(d,a(p,a(s,x:S))) ->->-> Rules: a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S ->->Cycle: ->->-> Pairs: A(f,a(s,x:S)) -> A(f,a(p,a(s,x:S))) ->->-> Rules: a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S The problem is decomposed in 2 subproblems. Problem 1.1: Narrowing Processor: -> Pairs: A(d,a(s,x:S)) -> A(d,a(p,a(s,x:S))) -> Rules: a(d,a(s,x:S)) -> a(s,a(s,a(d,a(p,a(s,x:S))))) a(d,0) -> 0 a(f,a(s,x:S)) -> a(d,a(f,a(p,a(s,x:S)))) a(f,0) -> a(s,0) a(p,a(s,x:S)) -> x:S popout

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

job log

popout

actions

all output return to TRS Standard