details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	2.86668801308 seconds
cpu usage	2.652649232
max memory	1.31751936E8

stage attributes

key	value
output-size	24431
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x xs y ys zs) (RULES app(cons(x,xs),ys) -> cons(x,app(xs,ys)) app(nil,x) -> x le(0,x) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) qsort(cons(x,xs)) -> app(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) qsort(nil) -> nil split(x,cons(y,ys)) -> pair(cons(y,xs),zs) | split(x,ys) -> pairs(xs,zs), le(x,y) -> false split(x,cons(y,ys)) -> pair(xs,cons(y,zs)) | split(x,ys) -> pairs(xs,zs), le(x,y) -> true split(x,nil) -> pair(nil,nil) ) Problem 1: Valid CTRS Processor: -> Rules: app(cons(x,xs),ys) -> cons(x,app(xs,ys)) app(nil,x) -> x le(0,x) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) qsort(cons(x,xs)) -> app(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) qsort(nil) -> nil split(x,cons(y,ys)) -> pair(cons(y,xs),zs) | split(x,ys) -> pairs(xs,zs), le(x,y) -> false split(x,cons(y,ys)) -> pair(xs,cons(y,zs)) | split(x,ys) -> pairs(xs,zs), le(x,y) -> true split(x,nil) -> pair(nil,nil) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: APP(cons(x,xs),ys) -> APP(xs,ys) LE(s(x),s(y)) -> LE(x,y) QSORT(cons(x,xs)) -> APP(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) QSORT(cons(x,xs)) -> QSORT(ys) | split(x,xs) -> pair(ys,zs) QSORT(cons(x,xs)) -> QSORT(zs) | split(x,xs) -> pair(ys,zs) -> QPairs: Empty -> Rules: app(cons(x,xs),ys) -> cons(x,app(xs,ys)) app(nil,x) -> x le(0,x) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) qsort(cons(x,xs)) -> app(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) qsort(nil) -> nil split(x,cons(y,ys)) -> pair(cons(y,xs),zs) | split(x,ys) -> pairs(xs,zs), le(x,y) -> false split(x,cons(y,ys)) -> pair(xs,cons(y,zs)) | split(x,ys) -> pairs(xs,zs), le(x,y) -> true split(x,nil) -> pair(nil,nil) Conditional Termination Problem 2: -> Pairs: QSORT(cons(x,xs)) -> SPLIT(x,xs) SPLIT(x,cons(y,ys)) -> LE(x,y) | split(x,ys) -> pairs(xs,zs) SPLIT(x,cons(y,ys)) -> SPLIT(x,ys) -> QPairs: APP(cons(x,xs),ys) -> APP(xs,ys) LE(s(x),s(y)) -> LE(x,y) QSORT(cons(x,xs)) -> APP(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) QSORT(cons(x,xs)) -> QSORT(ys) | split(x,xs) -> pair(ys,zs) QSORT(cons(x,xs)) -> QSORT(zs) | split(x,xs) -> pair(ys,zs) -> Rules: app(cons(x,xs),ys) -> cons(x,app(xs,ys)) app(nil,x) -> x le(0,x) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) qsort(cons(x,xs)) -> app(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) qsort(nil) -> nil split(x,cons(y,ys)) -> pair(cons(y,xs),zs) | split(x,ys) -> pairs(xs,zs), le(x,y) -> false split(x,cons(y,ys)) -> pair(xs,cons(y,zs)) | split(x,ys) -> pairs(xs,zs), le(x,y) -> true split(x,nil) -> pair(nil,nil) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: APP(cons(x,xs),ys) -> APP(xs,ys) LE(s(x),s(y)) -> LE(x,y) QSORT(cons(x,xs)) -> APP(qsort(ys),cons(x,qsort(zs))) | split(x,xs) -> pair(ys,zs) QSORT(cons(x,xs)) -> QSORT(ys) | split(x,xs) -> pair(ys,zs) QSORT(cons(x,xs)) -> QSORT(zs) | split(x,xs) -> pair(ys,zs) -> QPairs: popout

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

job log

popout

actions

all output return to TRS Condi 20667