details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.037295 seconds
cpu usage	0.033507
user time	0.017874
system time	0.015633
max virtual memory	113188.0
max residence set size	5908.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S f:S x:S xs:S y:S z:S) (RULES app(app(app(app(filter2,ffalse),f:S),x:S),xs:S) -> app(app(filter,f:S),xs:S) app(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,f:S),xs:S)) app(app(*,x:S),app(app(+,y:S),z:S)) -> app(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) app(app(filter,f:S),nil) -> nil app(app(map,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) app(app(map,f:S),nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(app(app(filter2,ffalse),f:S),x:S),xs:S) -> app(app(filter,f:S),xs:S) app(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,f:S),xs:S)) app(app(*,x:S),app(app(+,y:S),z:S)) -> app(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) app(app(filter,f:S),nil) -> nil app(app(map,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) app(app(map,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(app(app(filter2,ffalse),f:S),x:S),xs:S) -> APP(app(filter,f:S),xs:S) APP(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> APP(app(cons,x:S),app(app(filter,f:S),xs:S)) APP(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> APP(app(filter,f:S),xs:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(*,x:S),y:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(*,x:S),z:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(+,app(app(*,x:S),y:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(app(filter2,app(f:S,x:S)),f:S),x:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter2,app(f:S,x:S)),f:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(filter2,app(f:S,x:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(app(map,f:S),xs:S) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(cons,app(f:S,x:S)) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) -> Rules: app(app(app(app(filter2,ffalse),f:S),x:S),xs:S) -> app(app(filter,f:S),xs:S) app(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,f:S),xs:S)) app(app(*,x:S),app(app(+,y:S),z:S)) -> app(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) app(app(filter,f:S),nil) -> nil app(app(map,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) app(app(map,f:S),nil) -> nil Problem 1: SCC Processor: -> Pairs: APP(app(app(app(filter2,ffalse),f:S),x:S),xs:S) -> APP(app(filter,f:S),xs:S) APP(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> APP(app(cons,x:S),app(app(filter,f:S),xs:S)) APP(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> APP(app(filter,f:S),xs:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(*,x:S),y:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(*,x:S),z:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(+,app(app(*,x:S),y:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(app(filter2,app(f:S,x:S)),f:S),x:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(app(filter2,app(f:S,x:S)),f:S) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(filter2,app(f:S,x:S)) APP(app(filter,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(app(map,f:S),xs:S) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(cons,app(f:S,x:S)) APP(app(map,f:S),app(app(cons,x:S),xs:S)) -> APP(f:S,x:S) -> Rules: app(app(app(app(filter2,ffalse),f:S),x:S),xs:S) -> app(app(filter,f:S),xs:S) app(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,f:S),xs:S)) app(app(*,x:S),app(app(+,y:S),z:S)) -> app(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) app(app(filter,f:S),nil) -> nil app(app(map,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) app(app(map,f:S),nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(*,x:S),y:S) APP(app(*,x:S),app(app(+,y:S),z:S)) -> APP(app(*,x:S),z:S) ->->-> Rules: app(app(app(app(filter2,ffalse),f:S),x:S),xs:S) -> app(app(filter,f:S),xs:S) app(app(app(app(filter2,ttrue),f:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,f:S),xs:S)) app(app(*,x:S),app(app(+,y:S),z:S)) -> app(app(+,app(app(*,x:S),y:S)),app(app(*,x:S),z:S)) app(app(filter,f:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(f:S,x:S)),f:S),x:S),xs:S) app(app(filter,f:S),nil) -> nil app(app(map,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(f:S,x:S)),app(app(map,f:S),xs:S)) app(app(map,f:S),nil) -> nil ->->Cycle: popout

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

job log

popout

actions

all output return to TRS Standard