Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712285
details
property
value
status
complete
benchmark
#3.45.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.057354927063 seconds
cpu usage
0.052189016
max memory
4288512.0
stage attributes
key
value
output-size
15240
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 fun x xs y) (RULES app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil app(f,app(s,x)) -> app(f,x) app(g,app(app(cons,app(s,x)),y)) -> app(s,x) app(g,app(app(cons,0),y)) -> app(g,y) app(h,app(app(cons,x),y)) -> app(h,app(g,app(app(cons,x),y))) ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil app(f,app(s,x)) -> app(f,x) app(g,app(app(cons,app(s,x)),y)) -> app(s,x) app(g,app(app(cons,0),y)) -> app(g,y) app(h,app(app(cons,x),y)) -> app(h,app(g,app(app(cons,x),y))) -> 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,false),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(cons,x),app(app(filter,fun),xs)) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(app(filter2,app(fun,x)),fun),x),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(filter2,app(fun,x)),fun),x) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(filter2,app(fun,x)),fun) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(filter2,app(fun,x)) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(cons,app(fun,x)),app(app(map,fun),xs)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(map,fun),xs) APP(app(map,fun),app(app(cons,x),xs)) -> APP(cons,app(fun,x)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(f,app(s,x)) -> APP(f,x) APP(g,app(app(cons,0),y)) -> APP(g,y) APP(h,app(app(cons,x),y)) -> APP(g,app(app(cons,x),y)) APP(h,app(app(cons,x),y)) -> APP(h,app(g,app(app(cons,x),y))) -> Rules: app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil app(f,app(s,x)) -> app(f,x) app(g,app(app(cons,app(s,x)),y)) -> app(s,x) app(g,app(app(cons,0),y)) -> app(g,y) app(h,app(app(cons,x),y)) -> app(h,app(g,app(app(cons,x),y))) Problem 1: SCC Processor: -> Pairs: APP(app(app(app(filter2,false),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(cons,x),app(app(filter,fun),xs)) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(app(filter2,app(fun,x)),fun),x),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(filter2,app(fun,x)),fun),x) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(filter2,app(fun,x)),fun) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(filter2,app(fun,x)) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(cons,app(fun,x)),app(app(map,fun),xs)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(map,fun),xs) APP(app(map,fun),app(app(cons,x),xs)) -> APP(cons,app(fun,x)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(f,app(s,x)) -> APP(f,x) APP(g,app(app(cons,0),y)) -> APP(g,y) APP(h,app(app(cons,x),y)) -> APP(g,app(app(cons,x),y)) APP(h,app(app(cons,x),y)) -> APP(h,app(g,app(app(cons,x),y))) -> Rules: app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472