details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	41.9368 seconds
cpu usage	163.703
user time	161.02
system time	2.68266
max virtual memory	1.1441816E7
max residence set size	132408.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: a(a(b(x1))) -> c(b(a(a(a(x1))))) a(c(x1)) -> b(a(x1)) Proof: String Reversal Processor: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) DP Processor: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> b#(c(x1)) c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) TDG Processor: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> b#(c(x1)) c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) graph: c#(a(x1)) -> b#(x1) -> b#(a(a(x1))) -> b#(c(x1)) c#(a(x1)) -> b#(x1) -> b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(x1) -> c#(a(x1)) -> b#(x1) b#(a(a(x1))) -> b#(c(x1)) -> b#(a(a(x1))) -> b#(c(x1)) b#(a(a(x1))) -> b#(c(x1)) -> b#(a(a(x1))) -> c#(x1) Matrix Interpretation Processor: dim=4 interpretation: [c#](x0) = [0 0 0 1]x0, [0 0 0 1] [1] [1 0 0 0] [0] [a](x0) = [0 0 0 0]x0 + [0] [0 1 0 0] [0], [b#](x0) = [0 1 0 0]x0, [0 1 0 0] [0 1 0 0] [b](x0) = [0 0 0 1]x0 [0 1 0 0] , [1 0 0 1] [0 0 0 1] [c](x0) = [0 0 0 0]x0 [1 0 0 1] orientation: b#(a(a(x1))) = [0 0 0 1]x1 + [1] >= [0 0 0 1]x1 = c#(x1) b#(a(a(x1))) = [0 0 0 1]x1 + [1] >= [0 0 0 1]x1 = b#(c(x1)) c#(a(x1)) = [0 1 0 0]x1 >= [0 1 0 0]x1 = b#(x1) [0 0 0 1] [1] [0 0 0 1] [1] [0 0 0 1] [1] [0 0 0 1] [1] b(a(a(x1))) = [1 0 0 0]x1 + [0] >= [0 0 0 0]x1 + [0] = a(a(a(b(c(x1))))) [0 0 0 1] [1] [0 0 0 1] [1] [0 1 0 1] [1] [0 1 0 0] [1] [0 1 0 0] [0] [0 1 0 0] [0] c(a(x1)) = [0 0 0 0]x1 + [0] >= [0 0 0 0]x1 + [0] = a(b(x1)) [0 1 0 1] [1] [0 1 0 0] [0] problem: DPs: c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) Restore Modifier: DPs: c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) EDG Processor: DPs: c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) graph: SCC Processor: #sccs: 0 #rules: 0 #arcs: 0/1 popout

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

job log

popout

actions

all output return to SRS Standard