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