Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714349
details
property
value
status
complete
benchmark
4.61.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n023.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
7.71571207047 seconds
cpu usage
7.619426326
max memory
1.1522048E8
stage attributes
key
value
output-size
11116
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 x y z) (RULES bsort(.(x,y)) -> last(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) bsort(nil) -> nil bubble(.(x,.(y,z))) -> if(<=(x,y),.(y,bubble(.(x,z))),.(x,bubble(.(y,z)))) bubble(.(x,nil)) -> .(x,nil) bubble(nil) -> nil butlast(.(x,.(y,z))) -> .(x,butlast(.(y,z))) butlast(.(x,nil)) -> nil butlast(nil) -> nil last(.(x,.(y,z))) -> last(.(y,z)) last(.(x,nil)) -> x last(nil) -> 0 ) Problem 1: Innermost Equivalent Processor: -> Rules: bsort(.(x,y)) -> last(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) bsort(nil) -> nil bubble(.(x,.(y,z))) -> if(<=(x,y),.(y,bubble(.(x,z))),.(x,bubble(.(y,z)))) bubble(.(x,nil)) -> .(x,nil) bubble(nil) -> nil butlast(.(x,.(y,z))) -> .(x,butlast(.(y,z))) butlast(.(x,nil)) -> nil butlast(nil) -> nil last(.(x,.(y,z))) -> last(.(y,z)) last(.(x,nil)) -> x last(nil) -> 0 -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: BSORT(.(x,y)) -> BSORT(butlast(bubble(.(x,y)))) BSORT(.(x,y)) -> BUBBLE(.(x,y)) BSORT(.(x,y)) -> BUTLAST(bubble(.(x,y))) BSORT(.(x,y)) -> LAST(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) BUBBLE(.(x,.(y,z))) -> BUBBLE(.(x,z)) BUBBLE(.(x,.(y,z))) -> BUBBLE(.(y,z)) BUTLAST(.(x,.(y,z))) -> BUTLAST(.(y,z)) LAST(.(x,.(y,z))) -> LAST(.(y,z)) -> Rules: bsort(.(x,y)) -> last(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) bsort(nil) -> nil bubble(.(x,.(y,z))) -> if(<=(x,y),.(y,bubble(.(x,z))),.(x,bubble(.(y,z)))) bubble(.(x,nil)) -> .(x,nil) bubble(nil) -> nil butlast(.(x,.(y,z))) -> .(x,butlast(.(y,z))) butlast(.(x,nil)) -> nil butlast(nil) -> nil last(.(x,.(y,z))) -> last(.(y,z)) last(.(x,nil)) -> x last(nil) -> 0 Problem 1: SCC Processor: -> Pairs: BSORT(.(x,y)) -> BSORT(butlast(bubble(.(x,y)))) BSORT(.(x,y)) -> BUBBLE(.(x,y)) BSORT(.(x,y)) -> BUTLAST(bubble(.(x,y))) BSORT(.(x,y)) -> LAST(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) BUBBLE(.(x,.(y,z))) -> BUBBLE(.(x,z)) BUBBLE(.(x,.(y,z))) -> BUBBLE(.(y,z)) BUTLAST(.(x,.(y,z))) -> BUTLAST(.(y,z)) LAST(.(x,.(y,z))) -> LAST(.(y,z)) -> Rules: bsort(.(x,y)) -> last(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) bsort(nil) -> nil bubble(.(x,.(y,z))) -> if(<=(x,y),.(y,bubble(.(x,z))),.(x,bubble(.(y,z)))) bubble(.(x,nil)) -> .(x,nil) bubble(nil) -> nil butlast(.(x,.(y,z))) -> .(x,butlast(.(y,z))) butlast(.(x,nil)) -> nil butlast(nil) -> nil last(.(x,.(y,z))) -> last(.(y,z)) last(.(x,nil)) -> x last(nil) -> 0 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LAST(.(x,.(y,z))) -> LAST(.(y,z)) ->->-> Rules: bsort(.(x,y)) -> last(.(bubble(.(x,y)),bsort(butlast(bubble(.(x,y)))))) bsort(nil) -> nil bubble(.(x,.(y,z))) -> if(<=(x,y),.(y,bubble(.(x,z))),.(x,bubble(.(y,z))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472