details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0199859142303 seconds
cpu usage	0.016497123
max memory	1851392.0

stage attributes

key	value
output-size	4816
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 y ys) (RULES app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) app(app(filter,f),nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) app(app(filter,f),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(filtersub,false),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(app(filtersub,true),f),app(app(cons,y),ys)) -> APP(app(cons,y),app(app(filter,f),ys)) APP(app(app(filtersub,true),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(filtersub,app(f,y)),f) APP(app(filter,f),app(app(cons,y),ys)) -> APP(filtersub,app(f,y)) APP(app(filter,f),app(app(cons,y),ys)) -> APP(f,y) -> Rules: app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) app(app(filter,f),nil) -> nil Problem 1: SCC Processor: -> Pairs: APP(app(app(filtersub,false),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(app(filtersub,true),f),app(app(cons,y),ys)) -> APP(app(cons,y),app(app(filter,f),ys)) APP(app(app(filtersub,true),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(filtersub,app(f,y)),f) APP(app(filter,f),app(app(cons,y),ys)) -> APP(filtersub,app(f,y)) APP(app(filter,f),app(app(cons,y),ys)) -> APP(f,y) -> Rules: app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) app(app(filter,f),nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(app(filtersub,false),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(app(filtersub,true),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) APP(app(filter,f),app(app(cons,y),ys)) -> APP(f,y) ->->-> Rules: app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) app(app(filter,f),nil) -> nil Problem 1: Subterm Processor: -> Pairs: APP(app(app(filtersub,false),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(app(filtersub,true),f),app(app(cons,y),ys)) -> APP(app(filter,f),ys) APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) APP(app(filter,f),app(app(cons,y),ys)) -> APP(f,y) -> Rules: app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) app(app(filter,f),nil) -> nil ->Projection: pi(APP) = 2 Problem 1: SCC Processor: -> Pairs: APP(app(filter,f),app(app(cons,y),ys)) -> APP(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) -> Rules: app(app(app(filtersub,false),f),app(app(cons,y),ys)) -> app(app(filter,f),ys) app(app(app(filtersub,true),f),app(app(cons,y),ys)) -> app(app(cons,y),app(app(filter,f),ys)) app(app(filter,f),app(app(cons,y),ys)) -> app(app(app(filtersub,app(f,y)),f),app(app(cons,y),ys)) popout

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

job log

popout

actions

all output return to TRS Stand 20472