details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.26303601265 seconds
cpu usage	0.253974101
max memory	9.744384E7

stage attributes

key	value
output-size	10078
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 w ws x' xs xs' y y' ys ys' z zs) (RULES get(cons(x',xs')) -> tp2(y,cons(x',zs)) | get(xs') -> tp2(y,zs) get(cons(y,ys)) -> tp2(y,ys) ssp'(cons(x',xs'),v) -> cons(y',ys') | get(xs') -> tp2(y',zs), sub(v,y') -> w, ssp'(cons(x',zs),w) -> ys' ssp'(cons(y',ws),v) -> cons(y',ys') | sub(v,y') -> w, ssp'(ws,w) -> ys' ssp'(xs,0) -> nil sub(s(v),s(w)) -> z | sub(v,w) -> z sub(z,0) -> z ) Problem 1: Valid CTRS Processor: -> Rules: get(cons(x',xs')) -> tp2(y,cons(x',zs)) | get(xs') -> tp2(y,zs) get(cons(y,ys)) -> tp2(y,ys) ssp'(cons(x',xs'),v) -> cons(y',ys') | get(xs') -> tp2(y',zs), sub(v,y') -> w, ssp'(cons(x',zs),w) -> ys' ssp'(cons(y',ws),v) -> cons(y',ys') | sub(v,y') -> w, ssp'(ws,w) -> ys' ssp'(xs,0) -> nil sub(s(v),s(w)) -> z | sub(v,w) -> z sub(z,0) -> z -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: Empty -> QPairs: Empty -> Rules: get(cons(x',xs')) -> tp2(y,cons(x',zs)) | get(xs') -> tp2(y,zs) get(cons(y,ys)) -> tp2(y,ys) ssp'(cons(x',xs'),v) -> cons(y',ys') | get(xs') -> tp2(y',zs), sub(v,y') -> w, ssp'(cons(x',zs),w) -> ys' ssp'(cons(y',ws),v) -> cons(y',ys') | sub(v,y') -> w, ssp'(ws,w) -> ys' ssp'(xs,0) -> nil sub(s(v),s(w)) -> z | sub(v,w) -> z sub(z,0) -> z Conditional Termination Problem 2: -> Pairs: GET(cons(x',xs')) -> GET(xs') SSP'(cons(x',xs'),v) -> GET(xs') SSP'(cons(x',xs'),v) -> SSP'(cons(x',zs),w) | get(xs') -> tp2(y',zs), sub(v,y') -> w SSP'(cons(x',xs'),v) -> SUB(v,y') | get(xs') -> tp2(y',zs) SSP'(cons(y',ws),v) -> SSP'(ws,w) | sub(v,y') -> w SSP'(cons(y',ws),v) -> SUB(v,y') SUB(s(v),s(w)) -> SUB(v,w) -> QPairs: Empty -> Rules: get(cons(x',xs')) -> tp2(y,cons(x',zs)) | get(xs') -> tp2(y,zs) get(cons(y,ys)) -> tp2(y,ys) ssp'(cons(x',xs'),v) -> cons(y',ys') | get(xs') -> tp2(y',zs), sub(v,y') -> w, ssp'(cons(x',zs),w) -> ys' ssp'(cons(y',ws),v) -> cons(y',ys') | sub(v,y') -> w, ssp'(ws,w) -> ys' ssp'(xs,0) -> nil sub(s(v),s(w)) -> z | sub(v,w) -> z sub(z,0) -> z The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: Empty -> QPairs: Empty -> Rules: get(cons(x',xs')) -> tp2(y,cons(x',zs)) | get(xs') -> tp2(y,zs) get(cons(y,ys)) -> tp2(y,ys) ssp'(cons(x',xs'),v) -> cons(y',ys') | get(xs') -> tp2(y',zs), sub(v,y') -> w, ssp'(cons(x',zs),w) -> ys' ssp'(cons(y',ws),v) -> cons(y',ys') | sub(v,y') -> w, ssp'(ws,w) -> ys' ssp'(xs,0) -> nil sub(s(v),s(w)) -> z | sub(v,w) -> z sub(z,0) -> z ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: SCC Processor: -> Pairs: GET(cons(x',xs')) -> GET(xs') SSP'(cons(x',xs'),v) -> GET(xs') popout

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

job log

popout

actions

all output return to TRS Condi 20667