details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.019658 seconds
cpu usage	0.02018
user time	0.009489
system time	0.010691
max virtual memory	113176.0
max residence set size	5296.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR v_NonEmpty:S @l1:S @l2:S @t:S @t1:S @t2:S @x:S @xs:S) 0.00/0.01 (RULES 0.00/0.01 append(@l1:S,@l2:S) -> append#1(@l1:S,@l2:S) 0.00/0.01 append#1(::(@x:S,@xs:S),@l2:S) -> ::(@x:S,append(@xs:S,@l2:S)) 0.00/0.01 append#1(nil,@l2:S) -> @l2:S 0.00/0.01 subtrees(@t:S) -> subtrees#1(@t:S) 0.00/0.01 subtrees#1(leaf) -> nil 0.00/0.01 subtrees#1(node(@x:S,@t1:S,@t2:S)) -> subtrees#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#2(@l1:S,@t1:S,@t2:S,@x:S) -> subtrees#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> ::(node(@x:S,@t1:S,@t2:S),append(@l1:S,@l2:S)) 0.00/0.01 ) 0.00/0.01 (STRATEGY INNERMOST) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 -> Pairs: 0.00/0.01 APPEND(@l1:S,@l2:S) -> APPEND#1(@l1:S,@l2:S) 0.00/0.01 APPEND#1(::(@x:S,@xs:S),@l2:S) -> APPEND(@xs:S,@l2:S) 0.00/0.01 SUBTREES(@t:S) -> SUBTREES#1(@t:S) 0.00/0.01 SUBTREES#1(node(@x:S,@t1:S,@t2:S)) -> SUBTREES(@t1:S) 0.00/0.01 SUBTREES#1(node(@x:S,@t1:S,@t2:S)) -> SUBTREES#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 SUBTREES#2(@l1:S,@t1:S,@t2:S,@x:S) -> SUBTREES(@t2:S) 0.00/0.01 SUBTREES#2(@l1:S,@t1:S,@t2:S,@x:S) -> SUBTREES#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 SUBTREES#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> APPEND(@l1:S,@l2:S) 0.00/0.01 -> Rules: 0.00/0.01 append(@l1:S,@l2:S) -> append#1(@l1:S,@l2:S) 0.00/0.01 append#1(::(@x:S,@xs:S),@l2:S) -> ::(@x:S,append(@xs:S,@l2:S)) 0.00/0.01 append#1(nil,@l2:S) -> @l2:S 0.00/0.01 subtrees(@t:S) -> subtrees#1(@t:S) 0.00/0.01 subtrees#1(leaf) -> nil 0.00/0.01 subtrees#1(node(@x:S,@t1:S,@t2:S)) -> subtrees#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#2(@l1:S,@t1:S,@t2:S,@x:S) -> subtrees#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> ::(node(@x:S,@t1:S,@t2:S),append(@l1:S,@l2:S)) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 APPEND(@l1:S,@l2:S) -> APPEND#1(@l1:S,@l2:S) 0.00/0.01 APPEND#1(::(@x:S,@xs:S),@l2:S) -> APPEND(@xs:S,@l2:S) 0.00/0.01 SUBTREES(@t:S) -> SUBTREES#1(@t:S) 0.00/0.01 SUBTREES#1(node(@x:S,@t1:S,@t2:S)) -> SUBTREES(@t1:S) 0.00/0.01 SUBTREES#1(node(@x:S,@t1:S,@t2:S)) -> SUBTREES#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 SUBTREES#2(@l1:S,@t1:S,@t2:S,@x:S) -> SUBTREES(@t2:S) 0.00/0.01 SUBTREES#2(@l1:S,@t1:S,@t2:S,@x:S) -> SUBTREES#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 SUBTREES#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> APPEND(@l1:S,@l2:S) 0.00/0.01 -> Rules: 0.00/0.01 append(@l1:S,@l2:S) -> append#1(@l1:S,@l2:S) 0.00/0.01 append#1(::(@x:S,@xs:S),@l2:S) -> ::(@x:S,append(@xs:S,@l2:S)) 0.00/0.01 append#1(nil,@l2:S) -> @l2:S 0.00/0.01 subtrees(@t:S) -> subtrees#1(@t:S) 0.00/0.01 subtrees#1(leaf) -> nil 0.00/0.01 subtrees#1(node(@x:S,@t1:S,@t2:S)) -> subtrees#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#2(@l1:S,@t1:S,@t2:S,@x:S) -> subtrees#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> ::(node(@x:S,@t1:S,@t2:S),append(@l1:S,@l2:S)) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 APPEND(@l1:S,@l2:S) -> APPEND#1(@l1:S,@l2:S) 0.00/0.01 APPEND#1(::(@x:S,@xs:S),@l2:S) -> APPEND(@xs:S,@l2:S) 0.00/0.01 ->->-> Rules: 0.00/0.01 append(@l1:S,@l2:S) -> append#1(@l1:S,@l2:S) 0.00/0.01 append#1(::(@x:S,@xs:S),@l2:S) -> ::(@x:S,append(@xs:S,@l2:S)) 0.00/0.01 append#1(nil,@l2:S) -> @l2:S 0.00/0.01 subtrees(@t:S) -> subtrees#1(@t:S) 0.00/0.01 subtrees#1(leaf) -> nil 0.00/0.01 subtrees#1(node(@x:S,@t1:S,@t2:S)) -> subtrees#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#2(@l1:S,@t1:S,@t2:S,@x:S) -> subtrees#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> ::(node(@x:S,@t1:S,@t2:S),append(@l1:S,@l2:S)) 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 SUBTREES(@t:S) -> SUBTREES#1(@t:S) 0.00/0.01 SUBTREES#1(node(@x:S,@t1:S,@t2:S)) -> SUBTREES(@t1:S) 0.00/0.01 SUBTREES#1(node(@x:S,@t1:S,@t2:S)) -> SUBTREES#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 SUBTREES#2(@l1:S,@t1:S,@t2:S,@x:S) -> SUBTREES(@t2:S) 0.00/0.01 ->->-> Rules: 0.00/0.01 append(@l1:S,@l2:S) -> append#1(@l1:S,@l2:S) 0.00/0.01 append#1(::(@x:S,@xs:S),@l2:S) -> ::(@x:S,append(@xs:S,@l2:S)) 0.00/0.01 append#1(nil,@l2:S) -> @l2:S 0.00/0.01 subtrees(@t:S) -> subtrees#1(@t:S) 0.00/0.01 subtrees#1(leaf) -> nil 0.00/0.01 subtrees#1(node(@x:S,@t1:S,@t2:S)) -> subtrees#2(subtrees(@t1:S),@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#2(@l1:S,@t1:S,@t2:S,@x:S) -> subtrees#3(subtrees(@t2:S),@l1:S,@t1:S,@t2:S,@x:S) 0.00/0.01 subtrees#3(@l2:S,@l1:S,@t1:S,@t2:S,@x:S) -> ::(node(@x:S,@t1:S,@t2:S),append(@l1:S,@l2:S)) 0.00/0.01 0.00/0.01 0.00/0.01 The problem is decomposed in 2 subproblems. 0.00/0.01 0.00/0.01 Problem 1.1: 0.00/0.01 0.00/0.01 Subterm Processor: 0.00/0.01 -> Pairs: 0.00/0.01 APPEND(@l1:S,@l2:S) -> APPEND#1(@l1:S,@l2:S) 0.00/0.01 APPEND#1(::(@x:S,@xs:S),@l2:S) -> APPEND(@xs:S,@l2:S) 0.00/0.01 -> Rules: 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