details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.146871805191 seconds
cpu usage	0.118105963
max memory	6176768.0

stage attributes

key	value
output-size	6021
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR f x xs y) (RULES app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) -> 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(map,f),app(app(cons,x),xs)) -> APP(app(cons,app(f,x)),app(app(map,f),xs)) APP(app(map,f),app(app(cons,x),xs)) -> APP(app(map,f),xs) APP(app(map,f),app(app(cons,x),xs)) -> APP(cons,app(f,x)) APP(app(map,f),app(app(cons,x),xs)) -> APP(f,x) APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) APP(app(plus,app(s,x)),y) -> APP(s,app(app(plus,x),y)) -> Rules: app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) Problem 1: SCC Processor: -> Pairs: APP(app(map,f),app(app(cons,x),xs)) -> APP(app(cons,app(f,x)),app(app(map,f),xs)) APP(app(map,f),app(app(cons,x),xs)) -> APP(app(map,f),xs) APP(app(map,f),app(app(cons,x),xs)) -> APP(cons,app(f,x)) APP(app(map,f),app(app(cons,x),xs)) -> APP(f,x) APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) APP(app(plus,app(s,x)),y) -> APP(s,app(app(plus,x),y)) -> Rules: app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) ->->-> Rules: app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) ->->Cycle: ->->-> Pairs: APP(app(map,f),app(app(cons,x),xs)) -> APP(app(map,f),xs) APP(app(map,f),app(app(cons,x),xs)) -> APP(f,x) ->->-> Rules: app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) -> Rules: app(app(map,f),app(app(cons,x),xs)) -> app(app(cons,app(f,x)),app(app(map,f),xs)) app(app(map,f),nil) -> nil app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(app(plus,0),y) -> y inc -> app(map,app(plus,app(s,0))) -> Usable rules: popout

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

job log

popout

actions

all output return to TRS Stand 20472