details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.016445 seconds
cpu usage	0.016885
user time	0.004593
system time	0.012292
max virtual memory	113188.0
max residence set size	4388.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) ) Problem 1: Innermost Equivalent Processor: -> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: ACK(s(x:S),0) -> ACK(x:S,s(0)) ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) ACK(s(x:S),s(y:S)) -> ACK(x:S,ack(s(x:S),y:S)) -> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) Problem 1: SCC Processor: -> Pairs: ACK(s(x:S),0) -> ACK(x:S,s(0)) ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) ACK(s(x:S),s(y:S)) -> ACK(x:S,ack(s(x:S),y:S)) -> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACK(s(x:S),0) -> ACK(x:S,s(0)) ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) ACK(s(x:S),s(y:S)) -> ACK(x:S,ack(s(x:S),y:S)) ->->-> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) Problem 1: Subterm Processor: -> Pairs: ACK(s(x:S),0) -> ACK(x:S,s(0)) ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) ACK(s(x:S),s(y:S)) -> ACK(x:S,ack(s(x:S),y:S)) -> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) ->Projection: pi(ACK) = 1 Problem 1: SCC Processor: -> Pairs: ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) -> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) ->->-> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) Problem 1: Subterm Processor: -> Pairs: ACK(s(x:S),s(y:S)) -> ACK(s(x:S),y:S) -> Rules: ack(0,y:S) -> s(y:S) ack(s(x:S),0) -> ack(x:S,s(0)) ack(s(x:S),s(y:S)) -> ack(x:S,ack(s(x:S),y:S)) ->Projection: pi(ACK) = 2 Problem 1: popout

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

job log

popout

actions

all output return to TRS Standard