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	n005.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	7.81855607033 seconds
cpu usage	7.801945628
max memory	1.15552256E8

stage attributes

key	value
output-size	13011
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 x:S y:S z:S) (RULES bsort(.(x:S,y:S)) -> last(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) bsort(nil) -> nil bubble(.(x:S,.(y:S,z:S))) -> if(<=(x:S,y:S),.(y:S,bubble(.(x:S,z:S))),.(x:S,bubble(.(y:S,z:S)))) bubble(.(x:S,nil)) -> .(x:S,nil) bubble(nil) -> nil butlast(.(x:S,.(y:S,z:S))) -> .(x:S,butlast(.(y:S,z:S))) butlast(.(x:S,nil)) -> nil butlast(nil) -> nil last(.(x:S,.(y:S,z:S))) -> last(.(y:S,z:S)) last(.(x:S,nil)) -> x:S last(nil) -> 0 ) Problem 1: Innermost Equivalent Processor: -> Rules: bsort(.(x:S,y:S)) -> last(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) bsort(nil) -> nil bubble(.(x:S,.(y:S,z:S))) -> if(<=(x:S,y:S),.(y:S,bubble(.(x:S,z:S))),.(x:S,bubble(.(y:S,z:S)))) bubble(.(x:S,nil)) -> .(x:S,nil) bubble(nil) -> nil butlast(.(x:S,.(y:S,z:S))) -> .(x:S,butlast(.(y:S,z:S))) butlast(.(x:S,nil)) -> nil butlast(nil) -> nil last(.(x:S,.(y:S,z:S))) -> last(.(y:S,z:S)) last(.(x:S,nil)) -> x:S 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:S,y:S)) -> BSORT(butlast(bubble(.(x:S,y:S)))) BSORT(.(x:S,y:S)) -> BUBBLE(.(x:S,y:S)) BSORT(.(x:S,y:S)) -> BUTLAST(bubble(.(x:S,y:S))) BSORT(.(x:S,y:S)) -> LAST(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) BUBBLE(.(x:S,.(y:S,z:S))) -> BUBBLE(.(x:S,z:S)) BUBBLE(.(x:S,.(y:S,z:S))) -> BUBBLE(.(y:S,z:S)) BUTLAST(.(x:S,.(y:S,z:S))) -> BUTLAST(.(y:S,z:S)) LAST(.(x:S,.(y:S,z:S))) -> LAST(.(y:S,z:S)) -> Rules: bsort(.(x:S,y:S)) -> last(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) bsort(nil) -> nil bubble(.(x:S,.(y:S,z:S))) -> if(<=(x:S,y:S),.(y:S,bubble(.(x:S,z:S))),.(x:S,bubble(.(y:S,z:S)))) bubble(.(x:S,nil)) -> .(x:S,nil) bubble(nil) -> nil butlast(.(x:S,.(y:S,z:S))) -> .(x:S,butlast(.(y:S,z:S))) butlast(.(x:S,nil)) -> nil butlast(nil) -> nil last(.(x:S,.(y:S,z:S))) -> last(.(y:S,z:S)) last(.(x:S,nil)) -> x:S last(nil) -> 0 Problem 1: SCC Processor: -> Pairs: BSORT(.(x:S,y:S)) -> BSORT(butlast(bubble(.(x:S,y:S)))) BSORT(.(x:S,y:S)) -> BUBBLE(.(x:S,y:S)) BSORT(.(x:S,y:S)) -> BUTLAST(bubble(.(x:S,y:S))) BSORT(.(x:S,y:S)) -> LAST(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) BUBBLE(.(x:S,.(y:S,z:S))) -> BUBBLE(.(x:S,z:S)) BUBBLE(.(x:S,.(y:S,z:S))) -> BUBBLE(.(y:S,z:S)) BUTLAST(.(x:S,.(y:S,z:S))) -> BUTLAST(.(y:S,z:S)) LAST(.(x:S,.(y:S,z:S))) -> LAST(.(y:S,z:S)) -> Rules: bsort(.(x:S,y:S)) -> last(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) bsort(nil) -> nil bubble(.(x:S,.(y:S,z:S))) -> if(<=(x:S,y:S),.(y:S,bubble(.(x:S,z:S))),.(x:S,bubble(.(y:S,z:S)))) bubble(.(x:S,nil)) -> .(x:S,nil) bubble(nil) -> nil butlast(.(x:S,.(y:S,z:S))) -> .(x:S,butlast(.(y:S,z:S))) butlast(.(x:S,nil)) -> nil butlast(nil) -> nil last(.(x:S,.(y:S,z:S))) -> last(.(y:S,z:S)) last(.(x:S,nil)) -> x:S last(nil) -> 0 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LAST(.(x:S,.(y:S,z:S))) -> LAST(.(y:S,z:S)) ->->-> Rules: bsort(.(x:S,y:S)) -> last(.(bubble(.(x:S,y:S)),bsort(butlast(bubble(.(x:S,y:S)))))) bsort(nil) -> nil bubble(.(x:S,.(y:S,z:S))) -> if(<=(x:S,y:S),.(y:S,bubble(.(x:S,z:S))),.(x:S,bubble(.(y:S,z:S)))) popout

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

job log

popout

actions

all output return to TRS Standard