details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.112154960632 seconds
cpu usage	0.044064639
max memory	1884160.0

stage attributes

key	value
output-size	4677
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 v_NonEmpty:S f:S x:S xs:S) (RULES app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) app(app(mapt,f:S),app(node,xs:S)) -> app(node,app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) app(app(mapt,f:S),app(node,xs:S)) -> app(node,app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) app(app(maptlist,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(mapt,f:S),app(leaf,x:S)) -> APP(leaf,app(f:S,x:S)) APP(app(mapt,f:S),app(leaf,x:S)) -> APP(f:S,x:S) APP(app(mapt,f:S),app(node,xs:S)) -> APP(app(maptlist,f:S),xs:S) APP(app(mapt,f:S),app(node,xs:S)) -> APP(node,app(app(maptlist,f:S),xs:S)) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(mapt,f:S),x:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(maptlist,f:S),xs:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(cons,app(app(mapt,f:S),x:S)) -> Rules: app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) app(app(mapt,f:S),app(node,xs:S)) -> app(node,app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),nil) -> nil Problem 1: SCC Processor: -> Pairs: APP(app(mapt,f:S),app(leaf,x:S)) -> APP(leaf,app(f:S,x:S)) APP(app(mapt,f:S),app(leaf,x:S)) -> APP(f:S,x:S) APP(app(mapt,f:S),app(node,xs:S)) -> APP(app(maptlist,f:S),xs:S) APP(app(mapt,f:S),app(node,xs:S)) -> APP(node,app(app(maptlist,f:S),xs:S)) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(mapt,f:S),x:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(maptlist,f:S),xs:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(cons,app(app(mapt,f:S),x:S)) -> Rules: app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) app(app(mapt,f:S),app(node,xs:S)) -> app(node,app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(mapt,f:S),app(leaf,x:S)) -> APP(f:S,x:S) APP(app(mapt,f:S),app(node,xs:S)) -> APP(app(maptlist,f:S),xs:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(mapt,f:S),x:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(maptlist,f:S),xs:S) ->->-> Rules: app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) app(app(mapt,f:S),app(node,xs:S)) -> app(node,app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),nil) -> nil Problem 1: Subterm Processor: -> Pairs: APP(app(mapt,f:S),app(leaf,x:S)) -> APP(f:S,x:S) APP(app(mapt,f:S),app(node,xs:S)) -> APP(app(maptlist,f:S),xs:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(mapt,f:S),x:S) APP(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> APP(app(maptlist,f:S),xs:S) -> Rules: app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) app(app(mapt,f:S),app(node,xs:S)) -> app(node,app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(app(mapt,f:S),x:S)),app(app(maptlist,f:S),xs:S)) app(app(maptlist,f:S),nil) -> nil ->Projection: pi(APP) = 2 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: app(app(mapt,f:S),app(leaf,x:S)) -> app(leaf,app(f:S,x:S)) popout

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

job log

popout

actions

all output return to TRS Standard