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	n174.star.cs.uiowa.edu
space	raML

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.68092 seconds
cpu usage	13.4674
user time	13.0512
system time	0.416184
max virtual memory	1.8836084E7
max residence set size	726024.0

stage attributes

key	value
starexec-result	YES

output

13.14/4.61 YES 13.36/4.63 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 13.36/4.63 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.36/4.63 13.36/4.63 13.36/4.63 Termination w.r.t. Q of the given QTRS could be proven: 13.36/4.63 13.36/4.63 (0) QTRS 13.36/4.63 (1) DependencyPairsProof [EQUIVALENT, 0 ms] 13.36/4.63 (2) QDP 13.36/4.63 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 13.36/4.63 (4) AND 13.36/4.63 (5) QDP 13.36/4.63 (6) UsableRulesProof [EQUIVALENT, 0 ms] 13.36/4.63 (7) QDP 13.36/4.63 (8) QReductionProof [EQUIVALENT, 1 ms] 13.36/4.63 (9) QDP 13.36/4.63 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.36/4.63 (11) YES 13.36/4.63 (12) QDP 13.36/4.63 (13) UsableRulesProof [EQUIVALENT, 0 ms] 13.36/4.63 (14) QDP 13.36/4.63 (15) QReductionProof [EQUIVALENT, 1 ms] 13.36/4.63 (16) QDP 13.36/4.63 (17) MRRProof [EQUIVALENT, 0 ms] 13.36/4.63 (18) QDP 13.36/4.63 (19) DependencyGraphProof [EQUIVALENT, 0 ms] 13.36/4.63 (20) TRUE 13.36/4.63 (21) QDP 13.36/4.63 (22) UsableRulesProof [EQUIVALENT, 0 ms] 13.36/4.63 (23) QDP 13.36/4.63 (24) QReductionProof [EQUIVALENT, 1 ms] 13.36/4.63 (25) QDP 13.36/4.63 (26) MRRProof [EQUIVALENT, 0 ms] 13.36/4.63 (27) QDP 13.36/4.63 (28) QDPOrderProof [EQUIVALENT, 13 ms] 13.36/4.63 (29) QDP 13.36/4.63 (30) DependencyGraphProof [EQUIVALENT, 0 ms] 13.36/4.63 (31) TRUE 13.36/4.63 (32) QDP 13.36/4.63 (33) UsableRulesProof [EQUIVALENT, 0 ms] 13.36/4.63 (34) QDP 13.36/4.63 (35) QReductionProof [EQUIVALENT, 0 ms] 13.36/4.63 (36) QDP 13.36/4.63 (37) QDPOrderProof [EQUIVALENT, 61 ms] 13.36/4.63 (38) QDP 13.36/4.63 (39) DependencyGraphProof [EQUIVALENT, 0 ms] 13.36/4.63 (40) TRUE 13.36/4.63 13.36/4.63 13.36/4.63 ---------------------------------------- 13.36/4.63 13.36/4.63 (0) 13.36/4.63 Obligation: 13.36/4.63 Q restricted rewrite system: 13.36/4.63 The TRS R consists of the following rules: 13.36/4.63 13.36/4.63 breadth(@breadth@1, @breadth@2) -> breadth#1(dequeue(@breadth@1, @breadth@2)) 13.36/4.63 breadth#1(tuple#2(@queue', @elem)) -> breadth#2(@elem, @queue') 13.36/4.63 breadth#2(::(@z, @_@9), @queue') -> breadth#3(breadth#4(@z), @queue') 13.36/4.63 breadth#2(nil, @queue') -> nil 13.36/4.63 breadth#3(tuple#2(@x, @ys), @queue') -> ::(@x, breadth#5(enqueues(@ys, @queue'))) 13.36/4.63 breadth#4(tuple#4(@children@3, @children@4, @children@5, @children@6)) -> children(@children@3, @children@4, @children@5, @children@6) 13.36/4.63 breadth#5(tuple#2(@breadth@7, @breadth@8)) -> breadth(@breadth@7, @breadth@8) 13.36/4.63 children(@a, @b, @l1, @l2) -> tuple#2(tuple#2(@a, @b), children#1(@l1, @b, @l2)) 13.36/4.63 children#1(::(@x, @xs), @b, @l2) -> children#3(@l2, @b, @x, @xs) 13.36/4.63 children#1(nil, @b, @l2) -> children#2(@l2, @b) 13.36/4.63 children#2(::(@y, @ys), @b) -> ::(tuple#4(@y, @b, nil, @ys), nil) 13.36/4.63 children#2(nil, @b) -> nil 13.36/4.63 children#3(::(@y, @ys), @b, @x, @xs) -> ::(tuple#4(@x, @b, nil, @xs), ::(tuple#4(@x, @y, @xs, @ys), nil)) 13.36/4.63 children#3(nil, @b, @x, @xs) -> nil 13.36/4.63 copyover(@copyover@1, @copyover@2) -> copyover#1(tuple#2(@copyover@1, @copyover@2)) 13.36/4.63 copyover#1(tuple#2(@inq, @outq)) -> copyover#2(@inq, @outq) 13.36/4.63 copyover#2(::(@x, @xs), @outq) -> copyover(@xs, ::(@x, @outq)) 13.36/4.63 copyover#2(nil, @outq) -> tuple#2(nil, @outq) 13.36/4.63 dequeue(@dequeue@1, @dequeue@2) -> dequeue#1(tuple#2(@dequeue@1, @dequeue@2)) 13.36/4.63 dequeue#1(tuple#2(@inq, @outq)) -> dequeue#2(@outq, @inq) 13.36/4.63 dequeue#2(::(@y, @ys), @inq) -> tuple#2(tuple#2(@inq, @ys), ::(@y, nil)) 13.36/4.63 dequeue#2(nil, @inq) -> dequeue#3(@inq) 13.36/4.63 dequeue#3(::(@x, @xs)) -> dequeue#4(copyover(::(@x, @xs), nil)) 13.36/4.63 dequeue#3(nil) -> tuple#2(tuple#2(nil, nil), nil) 13.36/4.63 dequeue#4(tuple#2(@dequeue@3, @dequeue@4)) -> dequeue(@dequeue@3, @dequeue@4) 13.36/4.63 empty(@x) -> tuple#2(nil, nil) 13.36/4.63 enqueue(@x, @queue) -> enqueue#1(@queue, @x) 13.36/4.63 enqueue#1(tuple#2(@inq, @outq), @x) -> tuple#2(::(@x, @inq), @outq) 13.36/4.63 enqueues(@l, @queue) -> enqueues#1(@l, @queue) 13.36/4.63 enqueues#1(::(@x, @xs), @queue) -> enqueues(@xs, enqueue(@x, @queue)) 13.36/4.63 enqueues#1(nil, @queue) -> @queue 13.36/4.63 startBreadth(@xs) -> startBreadth#1(@xs) 13.36/4.63 startBreadth#1(::(@x, @xs)) -> startBreadth#2(enqueue(tuple#4(@x, @x, @xs, @xs), empty(#unit))) 13.36/4.63 startBreadth#1(nil) -> nil 13.36/4.63 startBreadth#2(tuple#2(@breadth@1, @breadth@2)) -> breadth(@breadth@1, @breadth@2) 13.36/4.63 13.36/4.63 The set Q consists of the following terms: 13.36/4.63 13.36/4.63 breadth(x0, x1) 13.36/4.63 breadth#1(tuple#2(x0, x1)) 13.36/4.63 breadth#2(::(x0, x1), x2) 13.36/4.63 breadth#2(nil, x0) 13.36/4.63 breadth#3(tuple#2(x0, x1), x2) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12