details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	61.5895810127 seconds
cpu usage	61.460590367
max memory	1.6347136E7

stage attributes

key	value
output-size	11473
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 w:S ws:S xs:S y:S ys:S z:S zs:S) (RULES r(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> r(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) r(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),nil),ws:S) r(xs:S,nil,zs:S,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) r(xs:S,ys:S,zs:S,nil) -> xs:S ) Problem 1: Innermost Equivalent Processor: -> Rules: r(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> r(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) r(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),nil),ws:S) r(xs:S,nil,zs:S,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) r(xs:S,ys:S,zs:S,nil) -> xs:S -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: R(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) R(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),nil),ws:S) R(xs:S,nil,zs:S,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) -> Rules: r(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> r(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) r(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),nil),ws:S) r(xs:S,nil,zs:S,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) r(xs:S,ys:S,zs:S,nil) -> xs:S Problem 1: SCC Processor: -> Pairs: R(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) R(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),nil),ws:S) R(xs:S,nil,zs:S,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) -> Rules: r(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> r(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) r(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),nil),ws:S) r(xs:S,nil,zs:S,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) r(xs:S,ys:S,zs:S,nil) -> xs:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: R(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) R(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),nil),ws:S) R(xs:S,nil,zs:S,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) ->->-> Rules: r(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> r(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) r(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),nil),ws:S) r(xs:S,nil,zs:S,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) r(xs:S,ys:S,zs:S,nil) -> xs:S Problem 1: Instantiation Processor: -> Pairs: R(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) R(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),nil),ws:S) R(xs:S,nil,zs:S,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) -> Rules: r(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> r(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) r(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),nil),ws:S) r(xs:S,nil,zs:S,cons(w:S,ws:S)) -> r(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) r(xs:S,ys:S,zs:S,nil) -> xs:S ->Instantiated Pairs: ->->Original Pair: R(xs:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) ->-> Instantiated pairs: R(cons(y:S,ys:S),cons(y:S,ys:S),cons(succ(zero),nil),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),nil,cons(succ(zero),cons(w:S,ws:S))) R(cons(y:S,ys:S),cons(y:S,ys:S),cons(succ(zero),zs:S),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(w:S,ws:S))) R(ys:S,cons(y:S,ys:S),cons(z:S,zs:S),cons(succ(zero),cons(x8:S,x9:S))) -> R(ys:S,cons(y:S,ys:S),zs:S,cons(succ(zero),cons(succ(zero),cons(x8:S,x9:S)))) ->->Original Pair: R(xs:S,cons(y:S,ys:S),nil,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),nil),ws:S) ->-> Instantiated pairs: R(ys:S,cons(y:S,ys:S),nil,cons(succ(zero),cons(x8:S,x9:S))) -> R(ys:S,ys:S,cons(succ(zero),nil),cons(x8:S,x9:S)) ->->Original Pair: R(xs:S,nil,zs:S,cons(w:S,ws:S)) -> R(xs:S,xs:S,cons(succ(zero),zs:S),ws:S) ->-> Instantiated pairs: R(nil,nil,cons(succ(zero),nil),cons(w:S,ws:S)) -> R(nil,nil,cons(succ(zero),cons(succ(zero),nil)),ws:S) R(nil,nil,cons(succ(zero),x17:S),cons(w:S,ws:S)) -> R(nil,nil,cons(succ(zero),cons(succ(zero),x17:S)),ws:S) Problem 1: SCC Processor: -> Pairs: R(cons(y:S,ys:S),cons(y:S,ys:S),cons(succ(zero),nil),cons(w:S,ws:S)) -> R(ys:S,cons(y:S,ys:S),nil,cons(succ(zero),cons(w:S,ws:S))) popout

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

job log

popout

actions

all output return to TRS Standard