Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487073629
details
property
value
status
complete
benchmark
Ex4MapList.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
Applicative_05
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.25066 seconds
cpu usage
0.210127
user time
0.119766
system time
0.090361
max virtual memory
113188.0
max residence set size
5696.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S f:S t:S x:S) (RULES app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> 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(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(app(fmap,t:S),x:S) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(cons,app(f:S,x:S)) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(f:S,x:S) -> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil Problem 1: SCC Processor: -> Pairs: APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(app(fmap,t:S),x:S) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(cons,app(f:S,x:S)) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(f:S,x:S) -> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(app(fmap,t:S),x:S) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(f:S,x:S) ->->-> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil Problem 1: Reduction Pairs Processor: -> Pairs: APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(app(fmap,t:S),x:S) APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(f:S,x:S) -> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil -> Usable rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil ->Interpretation type: Simple mixed ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [app](X1,X2) = 2.X1.X2 + 2.X1 [cons] = 0 [fSNonEmpty] = 0 [fcons] = 2 [fmap] = 2 [fnil] = 1 [nil] = 0 [APP](X1,X2) = 2.X1.X2 + 2.X1 Problem 1: SCC Processor: -> Pairs: APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(f:S,x:S) -> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> APP(f:S,x:S) ->->-> Rules: app(app(fmap,app(app(fcons,f:S),t:S)),x:S) -> app(app(cons,app(f:S,x:S)),app(app(fmap,t:S),x:S)) app(app(fmap,fnil),x:S) -> nil Problem 1:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard