details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	44.9271 seconds
cpu usage	176.024
user time	173.028
system time	2.99569
max virtual memory	1.182794E7
max residence set size	132156.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to SRS Standard