details

property	value
status	complete
benchmark	4.59.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n070.star.cs.uiowa.edu
space	SK90

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.151755094528 seconds
cpu usage	0.07326596
max memory	4370432.0

stage attributes

key	value
output-size	8902
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 greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil ) Problem 1: Innermost Equivalent Processor: -> Rules: greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: GREATERS(x:S,.(y:S,z:S)) -> GREATERS(x:S,z:S) LOWERS(x:S,.(y:S,z:S)) -> LOWERS(x:S,z:S) QSORT(.(x:S,y:S)) -> GREATERS(x:S,y:S) QSORT(.(x:S,y:S)) -> LOWERS(x:S,y:S) QSORT(.(x:S,y:S)) -> QSORT(greaters(x:S,y:S)) QSORT(.(x:S,y:S)) -> QSORT(lowers(x:S,y:S)) -> Rules: greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil Problem 1: SCC Processor: -> Pairs: GREATERS(x:S,.(y:S,z:S)) -> GREATERS(x:S,z:S) LOWERS(x:S,.(y:S,z:S)) -> LOWERS(x:S,z:S) QSORT(.(x:S,y:S)) -> GREATERS(x:S,y:S) QSORT(.(x:S,y:S)) -> LOWERS(x:S,y:S) QSORT(.(x:S,y:S)) -> QSORT(greaters(x:S,y:S)) QSORT(.(x:S,y:S)) -> QSORT(lowers(x:S,y:S)) -> Rules: greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LOWERS(x:S,.(y:S,z:S)) -> LOWERS(x:S,z:S) ->->-> Rules: greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil ->->Cycle: ->->-> Pairs: GREATERS(x:S,.(y:S,z:S)) -> GREATERS(x:S,z:S) ->->-> Rules: greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil ->->Cycle: ->->-> Pairs: QSORT(.(x:S,y:S)) -> QSORT(greaters(x:S,y:S)) QSORT(.(x:S,y:S)) -> QSORT(lowers(x:S,y:S)) ->->-> Rules: greaters(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),greaters(x:S,z:S),.(y:S,greaters(x:S,z:S))) greaters(x:S,nil) -> nil lowers(x:S,.(y:S,z:S)) -> if(<=(y:S,x:S),.(y:S,lowers(x:S,z:S)),lowers(x:S,z:S)) lowers(x:S,nil) -> nil qsort(.(x:S,y:S)) -> ++(qsort(lowers(x:S,y:S)),.(x:S,qsort(greaters(x:S,y:S)))) qsort(nil) -> nil popout

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

job log

popout

actions

all output return to TRS Standard