details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	19.0922400951 seconds
cpu usage	18.620513598
max memory	3.3189888E7

stage attributes

key	value
output-size	44062
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 @_@9 @a @b @breadth@1 @breadth@2 @breadth@7 @breadth@8 @children@3 @children@4 @children@5 @children@6 @copyover@1 @copyover@2 @dequeue@1 @dequeue@2 @dequeue@3 @dequeue@4 @elem @inq @l @l1 @l2 @outq @queue @queue' @x @xs @y @ys @z) (RULES breadth(@breadth@1,@breadth@2) -> breadth#1(dequeue(@breadth@1,@breadth@2)) breadth#1(tuple#2(@queue',@elem)) -> breadth#2(@elem,@queue') breadth#2(::(@z,@_@9),@queue') -> breadth#3(breadth#4(@z),@queue') breadth#2(nil,@queue') -> nil breadth#3(tuple#2(@x,@ys),@queue') -> ::(@x,breadth#5(enqueues(@ys,@queue'))) breadth#4(tuple#4(@children@3,@children@4,@children@5,@children@6)) -> children(@children@3,@children@4,@children@5,@children@6) breadth#5(tuple#2(@breadth@7,@breadth@8)) -> breadth(@breadth@7,@breadth@8) children(@a,@b,@l1,@l2) -> tuple#2(tuple#2(@a,@b),children#1(@l1,@b,@l2)) children#1(::(@x,@xs),@b,@l2) -> children#3(@l2,@b,@x,@xs) children#1(nil,@b,@l2) -> children#2(@l2,@b) children#2(::(@y,@ys),@b) -> ::(tuple#4(@y,@b,nil,@ys),nil) children#2(nil,@b) -> nil children#3(::(@y,@ys),@b,@x,@xs) -> ::(tuple#4(@x,@b,nil,@xs),::(tuple#4(@x,@y,@xs,@ys),nil)) children#3(nil,@b,@x,@xs) -> nil copyover(@copyover@1,@copyover@2) -> copyover#1(tuple#2(@copyover@1,@copyover@2)) copyover#1(tuple#2(@inq,@outq)) -> copyover#2(@inq,@outq) copyover#2(::(@x,@xs),@outq) -> copyover(@xs,::(@x,@outq)) copyover#2(nil,@outq) -> tuple#2(nil,@outq) dequeue(@dequeue@1,@dequeue@2) -> dequeue#1(tuple#2(@dequeue@1,@dequeue@2)) dequeue#1(tuple#2(@inq,@outq)) -> dequeue#2(@outq,@inq) dequeue#2(::(@y,@ys),@inq) -> tuple#2(tuple#2(@inq,@ys),::(@y,nil)) dequeue#2(nil,@inq) -> dequeue#3(@inq) dequeue#3(::(@x,@xs)) -> dequeue#4(copyover(::(@x,@xs),nil)) dequeue#3(nil) -> tuple#2(tuple#2(nil,nil),nil) dequeue#4(tuple#2(@dequeue@3,@dequeue@4)) -> dequeue(@dequeue@3,@dequeue@4) empty(@x) -> tuple#2(nil,nil) enqueue(@x,@queue) -> enqueue#1(@queue,@x) enqueue#1(tuple#2(@inq,@outq),@x) -> tuple#2(::(@x,@inq),@outq) enqueues(@l,@queue) -> enqueues#1(@l,@queue) enqueues#1(::(@x,@xs),@queue) -> enqueues(@xs,enqueue(@x,@queue)) enqueues#1(nil,@queue) -> @queue startBreadth(@xs) -> startBreadth#1(@xs) startBreadth#1(::(@x,@xs)) -> startBreadth#2(enqueue(tuple#4(@x,@x,@xs,@xs),empty(#unit))) startBreadth#1(nil) -> nil startBreadth#2(tuple#2(@breadth@1,@breadth@2)) -> breadth(@breadth@1,@breadth@2) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: BREADTH(@breadth@1,@breadth@2) -> BREADTH#1(dequeue(@breadth@1,@breadth@2)) BREADTH(@breadth@1,@breadth@2) -> DEQUEUE(@breadth@1,@breadth@2) BREADTH#1(tuple#2(@queue',@elem)) -> BREADTH#2(@elem,@queue') BREADTH#2(::(@z,@_@9),@queue') -> BREADTH#3(breadth#4(@z),@queue') BREADTH#2(::(@z,@_@9),@queue') -> BREADTH#4(@z) BREADTH#3(tuple#2(@x,@ys),@queue') -> BREADTH#5(enqueues(@ys,@queue')) BREADTH#3(tuple#2(@x,@ys),@queue') -> ENQUEUES(@ys,@queue') BREADTH#4(tuple#4(@children@3,@children@4,@children@5,@children@6)) -> CHILDREN(@children@3,@children@4,@children@5,@children@6) BREADTH#5(tuple#2(@breadth@7,@breadth@8)) -> BREADTH(@breadth@7,@breadth@8) CHILDREN(@a,@b,@l1,@l2) -> CHILDREN#1(@l1,@b,@l2) CHILDREN#1(::(@x,@xs),@b,@l2) -> CHILDREN#3(@l2,@b,@x,@xs) CHILDREN#1(nil,@b,@l2) -> CHILDREN#2(@l2,@b) COPYOVER(@copyover@1,@copyover@2) -> COPYOVER#1(tuple#2(@copyover@1,@copyover@2)) COPYOVER#1(tuple#2(@inq,@outq)) -> COPYOVER#2(@inq,@outq) COPYOVER#2(::(@x,@xs),@outq) -> COPYOVER(@xs,::(@x,@outq)) DEQUEUE(@dequeue@1,@dequeue@2) -> DEQUEUE#1(tuple#2(@dequeue@1,@dequeue@2)) DEQUEUE#1(tuple#2(@inq,@outq)) -> DEQUEUE#2(@outq,@inq) DEQUEUE#2(nil,@inq) -> DEQUEUE#3(@inq) DEQUEUE#3(::(@x,@xs)) -> COPYOVER(::(@x,@xs),nil) DEQUEUE#3(::(@x,@xs)) -> DEQUEUE#4(copyover(::(@x,@xs),nil)) DEQUEUE#4(tuple#2(@dequeue@3,@dequeue@4)) -> DEQUEUE(@dequeue@3,@dequeue@4) ENQUEUE(@x,@queue) -> ENQUEUE#1(@queue,@x) ENQUEUES(@l,@queue) -> ENQUEUES#1(@l,@queue) ENQUEUES#1(::(@x,@xs),@queue) -> ENQUEUE(@x,@queue) ENQUEUES#1(::(@x,@xs),@queue) -> ENQUEUES(@xs,enqueue(@x,@queue)) STARTBREADTH(@xs) -> STARTBREADTH#1(@xs) STARTBREADTH#1(::(@x,@xs)) -> EMPTY(#unit) STARTBREADTH#1(::(@x,@xs)) -> ENQUEUE(tuple#4(@x,@x,@xs,@xs),empty(#unit)) STARTBREADTH#1(::(@x,@xs)) -> STARTBREADTH#2(enqueue(tuple#4(@x,@x,@xs,@xs),empty(#unit))) STARTBREADTH#2(tuple#2(@breadth@1,@breadth@2)) -> BREADTH(@breadth@1,@breadth@2) -> Rules: breadth(@breadth@1,@breadth@2) -> breadth#1(dequeue(@breadth@1,@breadth@2)) breadth#1(tuple#2(@queue',@elem)) -> breadth#2(@elem,@queue') breadth#2(::(@z,@_@9),@queue') -> breadth#3(breadth#4(@z),@queue') breadth#2(nil,@queue') -> nil breadth#3(tuple#2(@x,@ys),@queue') -> ::(@x,breadth#5(enqueues(@ys,@queue'))) breadth#4(tuple#4(@children@3,@children@4,@children@5,@children@6)) -> children(@children@3,@children@4,@children@5,@children@6) breadth#5(tuple#2(@breadth@7,@breadth@8)) -> breadth(@breadth@7,@breadth@8) children(@a,@b,@l1,@l2) -> tuple#2(tuple#2(@a,@b),children#1(@l1,@b,@l2)) children#1(::(@x,@xs),@b,@l2) -> children#3(@l2,@b,@x,@xs) children#1(nil,@b,@l2) -> children#2(@l2,@b) children#2(::(@y,@ys),@b) -> ::(tuple#4(@y,@b,nil,@ys),nil) children#2(nil,@b) -> nil children#3(::(@y,@ys),@b,@x,@xs) -> ::(tuple#4(@x,@b,nil,@xs),::(tuple#4(@x,@y,@xs,@ys),nil)) children#3(nil,@b,@x,@xs) -> nil copyover(@copyover@1,@copyover@2) -> copyover#1(tuple#2(@copyover@1,@copyover@2)) popout

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

job log

popout

actions

all output return to TRS Inner 89993