Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711096
details
property
value
status
complete
benchmark
Ex8Polymorphic.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n105.star.cs.uiowa.edu
space
Applicative_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0220580101013 seconds
cpu usage
0.018955303
max memory
1859584.0
stage attributes
key
value
output-size
5404
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 h t x) (RULES app(app(fmap,app(app(cons,f),t_f)),x) -> app(app(cons,app(f,x)),app(app(fmap,t_f),x)) app(app(fmap,nil),x) -> nil app(app(map,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map,f),t)) app(app(map,f),nil) -> nil app(app(twice,f),x) -> app(f,app(f,x)) ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(fmap,app(app(cons,f),t_f)),x) -> app(app(cons,app(f,x)),app(app(fmap,t_f),x)) app(app(fmap,nil),x) -> nil app(app(map,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map,f),t)) app(app(map,f),nil) -> nil app(app(twice,f),x) -> app(f,app(f,x)) -> 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(cons,f),t_f)),x) -> APP(app(cons,app(f,x)),app(app(fmap,t_f),x)) APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(cons,app(f,x)) APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(f,x) APP(app(map,f),app(app(cons,h),t)) -> APP(app(cons,app(f,h)),app(app(map,f),t)) APP(app(map,f),app(app(cons,h),t)) -> APP(app(map,f),t) APP(app(map,f),app(app(cons,h),t)) -> APP(cons,app(f,h)) APP(app(map,f),app(app(cons,h),t)) -> APP(f,h) APP(app(twice,f),x) -> APP(f,app(f,x)) APP(app(twice,f),x) -> APP(f,x) -> Rules: app(app(fmap,app(app(cons,f),t_f)),x) -> app(app(cons,app(f,x)),app(app(fmap,t_f),x)) app(app(fmap,nil),x) -> nil app(app(map,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map,f),t)) app(app(map,f),nil) -> nil app(app(twice,f),x) -> app(f,app(f,x)) Problem 1: SCC Processor: -> Pairs: APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(app(cons,app(f,x)),app(app(fmap,t_f),x)) APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(cons,app(f,x)) APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(f,x) APP(app(map,f),app(app(cons,h),t)) -> APP(app(cons,app(f,h)),app(app(map,f),t)) APP(app(map,f),app(app(cons,h),t)) -> APP(app(map,f),t) APP(app(map,f),app(app(cons,h),t)) -> APP(cons,app(f,h)) APP(app(map,f),app(app(cons,h),t)) -> APP(f,h) APP(app(twice,f),x) -> APP(f,app(f,x)) APP(app(twice,f),x) -> APP(f,x) -> Rules: app(app(fmap,app(app(cons,f),t_f)),x) -> app(app(cons,app(f,x)),app(app(fmap,t_f),x)) app(app(fmap,nil),x) -> nil app(app(map,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map,f),t)) app(app(map,f),nil) -> nil app(app(twice,f),x) -> app(f,app(f,x)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(f,x) APP(app(map,f),app(app(cons,h),t)) -> APP(app(map,f),t) APP(app(map,f),app(app(cons,h),t)) -> APP(f,h) APP(app(twice,f),x) -> APP(f,app(f,x)) APP(app(twice,f),x) -> APP(f,x) ->->-> Rules: app(app(fmap,app(app(cons,f),t_f)),x) -> app(app(cons,app(f,x)),app(app(fmap,t_f),x)) app(app(fmap,nil),x) -> nil app(app(map,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map,f),t)) app(app(map,f),nil) -> nil app(app(twice,f),x) -> app(f,app(f,x)) Problem 1: Subterm Processor: -> Pairs: APP(app(fmap,app(app(cons,f),t_f)),x) -> APP(f,x) APP(app(map,f),app(app(cons,h),t)) -> APP(app(map,f),t) APP(app(map,f),app(app(cons,h),t)) -> APP(f,h) APP(app(twice,f),x) -> APP(f,app(f,x)) APP(app(twice,f),x) -> APP(f,x) -> Rules: app(app(fmap,app(app(cons,f),t_f)),x) -> app(app(cons,app(f,x)),app(app(fmap,t_f),x)) app(app(fmap,nil),x) -> nil app(app(map,f),app(app(cons,h),t)) -> app(app(cons,app(f,h)),app(app(map,f),t)) app(app(map,f),nil) -> nil app(app(twice,f),x) -> app(f,app(f,x))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472