details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0892381668091 seconds
cpu usage	0.027460214
max memory	2072576.0

stage attributes

key	value
output-size	7581
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S fun:S x:S xs:S) (RULES app(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> app(app(filter,fun:S),xs:S) app(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,fun:S),xs:S)) app(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) app(app(filter,fun:S),nil) -> nil app(app(map,fun:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(fun:S,x:S)),app(app(map,fun:S),xs:S)) app(app(map,fun:S),nil) -> nil app(f,a) -> app(f,b) app(g,b) -> app(g,a) ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> app(app(filter,fun:S),xs:S) app(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,fun:S),xs:S)) app(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) app(app(filter,fun:S),nil) -> nil app(app(map,fun:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(fun:S,x:S)),app(app(map,fun:S),xs:S)) app(app(map,fun:S),nil) -> nil app(f,a) -> app(f,b) app(g,b) -> app(g,a) -> 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),fun:S),x:S),xs:S) -> APP(app(filter,fun:S),xs:S) APP(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> APP(app(cons,x:S),app(app(filter,fun:S),xs:S)) APP(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> APP(app(filter,fun:S),xs:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(app(filter2,app(fun:S,x:S)),fun:S),x:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(filter2,app(fun:S,x:S)),fun:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(filter2,app(fun:S,x:S)) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(fun:S,x:S) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,app(fun:S,x:S)),app(app(map,fun:S),xs:S)) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(map,fun:S),xs:S) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(cons,app(fun:S,x:S)) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(fun:S,x:S) -> Rules: app(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> app(app(filter,fun:S),xs:S) app(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,fun:S),xs:S)) app(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) app(app(filter,fun:S),nil) -> nil app(app(map,fun:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(fun:S,x:S)),app(app(map,fun:S),xs:S)) app(app(map,fun:S),nil) -> nil app(f,a) -> app(f,b) app(g,b) -> app(g,a) Problem 1: SCC Processor: -> Pairs: APP(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> APP(app(filter,fun:S),xs:S) APP(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> APP(app(cons,x:S),app(app(filter,fun:S),xs:S)) APP(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> APP(app(filter,fun:S),xs:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(app(filter2,app(fun:S,x:S)),fun:S),x:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(filter2,app(fun:S,x:S)),fun:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(filter2,app(fun:S,x:S)) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(fun:S,x:S) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(cons,app(fun:S,x:S)),app(app(map,fun:S),xs:S)) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(map,fun:S),xs:S) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(cons,app(fun:S,x:S)) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(fun:S,x:S) -> Rules: app(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> app(app(filter,fun:S),xs:S) app(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,fun:S),xs:S)) app(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> app(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) app(app(filter,fun:S),nil) -> nil app(app(map,fun:S),app(app(cons,x:S),xs:S)) -> app(app(cons,app(fun:S,x:S)),app(app(map,fun:S),xs:S)) app(app(map,fun:S),nil) -> nil app(f,a) -> app(f,b) app(g,b) -> app(g,a) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> APP(app(filter,fun:S),xs:S) APP(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> APP(app(filter,fun:S),xs:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(app(app(filter2,app(fun:S,x:S)),fun:S),x:S),xs:S) APP(app(filter,fun:S),app(app(cons,x:S),xs:S)) -> APP(fun:S,x:S) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(app(map,fun:S),xs:S) APP(app(map,fun:S),app(app(cons,x:S),xs:S)) -> APP(fun:S,x:S) ->->-> Rules: app(app(app(app(filter2,ffalse),fun:S),x:S),xs:S) -> app(app(filter,fun:S),xs:S) app(app(app(app(filter2,ttrue),fun:S),x:S),xs:S) -> app(app(cons,x:S),app(app(filter,fun:S),xs:S)) popout

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

job log

popout

actions

all output return to TRS Standard