details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0215299 seconds
cpu usage	0.02208
user time	0.006716
system time	0.015364
max virtual memory	113188.0
max residence set size	5456.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S f:S x:S xs:S y:S) (RULES app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,x:S),app(app(filter,f:S),xs:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter,f:S),xs:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(if,app(f:S,x:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) -> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil Problem 1: SCC Processor: -> Pairs: APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,x:S),app(app(filter,f:S),xs:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter,f:S),xs:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(if,app(f:S,x:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) -> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter,f:S),xs:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) ->->-> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil Problem 1: Subterm Processor: -> Pairs: APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter,f:S),xs:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) -> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil ->Projection: pi(APP) = 1 Problem 1: SCC Processor: -> Pairs: APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter,f:S),xs:S) -> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter,f:S),xs:S) ->->-> Rules: app(app(app(if,ffalse),x:S),y:S) -> y:S app(app(app(if,ttrue),x:S),y:S) -> x:S app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(if,app(f:S,x:S)),app(app(cons,x:S),app(app(filter,f:S),xs:S))),app(app(filter,f:S),xs:S)) app(app(filter,f:S),nil) -> nil Problem 1: popout

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

job log

popout

actions

all output return to TRS Standard