details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	23.3406 seconds
cpu usage	23.1594
user time	18.1854
system time	4.97398
max virtual memory	710512.0
max residence set size	8572.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES check(rest(x:S)) -> rest(check(x:S)) check(cons(x:S,y:S)) -> cons(check(x:S),y:S) check(cons(x:S,y:S)) -> cons(x:S,check(y:S)) check(cons(x:S,y:S)) -> cons(x:S,y:S) check(sent(x:S)) -> sent(check(x:S)) rest(cons(x:S,y:S)) -> sent(y:S) rest(nil) -> sent(nil) top(sent(x:S)) -> top(check(rest(x:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: CHECK(rest(x:S)) -> CHECK(x:S) CHECK(rest(x:S)) -> REST(check(x:S)) CHECK(cons(x:S,y:S)) -> CHECK(x:S) CHECK(cons(x:S,y:S)) -> CHECK(y:S) CHECK(sent(x:S)) -> CHECK(x:S) TOP(sent(x:S)) -> CHECK(rest(x:S)) TOP(sent(x:S)) -> REST(x:S) TOP(sent(x:S)) -> TOP(check(rest(x:S))) -> Rules: check(rest(x:S)) -> rest(check(x:S)) check(cons(x:S,y:S)) -> cons(check(x:S),y:S) check(cons(x:S,y:S)) -> cons(x:S,check(y:S)) check(cons(x:S,y:S)) -> cons(x:S,y:S) check(sent(x:S)) -> sent(check(x:S)) rest(cons(x:S,y:S)) -> sent(y:S) rest(nil) -> sent(nil) top(sent(x:S)) -> top(check(rest(x:S))) Problem 1: SCC Processor: -> Pairs: CHECK(rest(x:S)) -> CHECK(x:S) CHECK(rest(x:S)) -> REST(check(x:S)) CHECK(cons(x:S,y:S)) -> CHECK(x:S) CHECK(cons(x:S,y:S)) -> CHECK(y:S) CHECK(sent(x:S)) -> CHECK(x:S) TOP(sent(x:S)) -> CHECK(rest(x:S)) TOP(sent(x:S)) -> REST(x:S) TOP(sent(x:S)) -> TOP(check(rest(x:S))) -> Rules: check(rest(x:S)) -> rest(check(x:S)) check(cons(x:S,y:S)) -> cons(check(x:S),y:S) check(cons(x:S,y:S)) -> cons(x:S,check(y:S)) check(cons(x:S,y:S)) -> cons(x:S,y:S) check(sent(x:S)) -> sent(check(x:S)) rest(cons(x:S,y:S)) -> sent(y:S) rest(nil) -> sent(nil) top(sent(x:S)) -> top(check(rest(x:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: CHECK(rest(x:S)) -> CHECK(x:S) CHECK(cons(x:S,y:S)) -> CHECK(x:S) CHECK(cons(x:S,y:S)) -> CHECK(y:S) CHECK(sent(x:S)) -> CHECK(x:S) ->->-> Rules: check(rest(x:S)) -> rest(check(x:S)) check(cons(x:S,y:S)) -> cons(check(x:S),y:S) check(cons(x:S,y:S)) -> cons(x:S,check(y:S)) check(cons(x:S,y:S)) -> cons(x:S,y:S) check(sent(x:S)) -> sent(check(x:S)) rest(cons(x:S,y:S)) -> sent(y:S) rest(nil) -> sent(nil) top(sent(x:S)) -> top(check(rest(x:S))) ->->Cycle: ->->-> Pairs: TOP(sent(x:S)) -> TOP(check(rest(x:S))) ->->-> Rules: check(rest(x:S)) -> rest(check(x:S)) check(cons(x:S,y:S)) -> cons(check(x:S),y:S) check(cons(x:S,y:S)) -> cons(x:S,check(y:S)) check(cons(x:S,y:S)) -> cons(x:S,y:S) check(sent(x:S)) -> sent(check(x:S)) rest(cons(x:S,y:S)) -> sent(y:S) rest(nil) -> sent(nil) top(sent(x:S)) -> top(check(rest(x:S))) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: CHECK(rest(x:S)) -> CHECK(x:S) CHECK(cons(x:S,y:S)) -> CHECK(x:S) CHECK(cons(x:S,y:S)) -> CHECK(y:S) CHECK(sent(x:S)) -> CHECK(x:S) -> Rules: popout

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

job log

popout

actions

all output return to TRS Standard