details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	44.974 seconds
cpu usage	175.864
user time	171.316
system time	4.54825
max virtual memory	1.1836084E7
max residence set size	102068.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: a(a(b(x1))) -> b(a(x1)) b(a(a(x1))) -> a(a(a(b(x1)))) a(c(x1)) -> c(b(x1)) Proof: String Reversal Processor: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) DP Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> b#(a(a(a(x1)))) c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) TDG Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> b#(a(a(a(x1)))) c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) graph: c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> b#(c(x1)) c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) -> b#(a(a(x1))) -> a#(b(x1)) c#(a(x1)) -> b#(c(x1)) -> b#(a(a(x1))) -> b#(x1) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(a(x1))) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(a(a(x1))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> b#(a(a(a(x1)))) -> b#(a(a(x1))) -> a#(b(x1)) a#(a(b(x1))) -> b#(a(a(a(x1)))) -> b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> b#(a(a(a(x1)))) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> a#(a(a(x1))) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> a#(a(x1)) b#(a(a(x1))) -> a#(b(x1)) -> a#(a(b(x1))) -> a#(x1) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(b(x1)) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> b#(x1) SCC Processor: #sccs: 2 #rules: 7 #arcs: 24/64 DPs: c#(a(x1)) -> c#(x1) TRS: b(a(a(x1))) -> a(b(x1)) a(a(b(x1))) -> b(a(a(a(x1)))) c(a(x1)) -> b(c(x1)) Usable Rule Processor: DPs: c#(a(x1)) -> c#(x1) TRS: Arctic Interpretation Processor: dimension: 4 usable rules: interpretation: [1 0 0 0] [0] [0 0 0 0] [0] [a](x0) = [1 0 0 0]x0 + [0] [0 0 0 0] [0], [c#](x0) = [0 -& -& -&]x0 orientation: c#(a(x1)) = [1 0 0 0]x1 + [0] >= [0 -& -& -&]x1 = c#(x1) problem: DPs: TRS: Qed popout

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

job log

popout

actions

all output return to SRS Standard