details

property	value
status	complete
benchmark	size-12-alpha-3-num-327.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	43.4555 seconds
cpu usage	169.885
user time	166.857
system time	3.02814
max virtual memory	1.0957404E7
max residence set size	131748.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to SRS Standard