details

property	value
status	complete
benchmark	gen-15.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n180.star.cs.uiowa.edu
space	Secret_06_TRS

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.58172 seconds
cpu usage	8.89195
user time	7.30346
system time	1.5885
max virtual memory	5709916.0
max residence set size	96516.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: c(z,x,a()) -> f(b(b(f(z),z),x)) b(y,b(z,a())) -> f(b(c(f(a()),y,z),z)) f(c(c(z,a(),a()),x,a())) -> z Proof: DP Processor: DPs: c#(z,x,a()) -> f#(z) c#(z,x,a()) -> b#(f(z),z) c#(z,x,a()) -> b#(b(f(z),z),x) c#(z,x,a()) -> f#(b(b(f(z),z),x)) b#(y,b(z,a())) -> f#(a()) b#(y,b(z,a())) -> c#(f(a()),y,z) b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) b#(y,b(z,a())) -> f#(b(c(f(a()),y,z),z)) TRS: c(z,x,a()) -> f(b(b(f(z),z),x)) b(y,b(z,a())) -> f(b(c(f(a()),y,z),z)) f(c(c(z,a(),a()),x,a())) -> z TDG Processor: DPs: c#(z,x,a()) -> f#(z) c#(z,x,a()) -> b#(f(z),z) c#(z,x,a()) -> b#(b(f(z),z),x) c#(z,x,a()) -> f#(b(b(f(z),z),x)) b#(y,b(z,a())) -> f#(a()) b#(y,b(z,a())) -> c#(f(a()),y,z) b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) b#(y,b(z,a())) -> f#(b(c(f(a()),y,z),z)) TRS: c(z,x,a()) -> f(b(b(f(z),z),x)) b(y,b(z,a())) -> f(b(c(f(a()),y,z),z)) f(c(c(z,a(),a()),x,a())) -> z graph: b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) -> b#(y,b(z,a())) -> f#(b(c(f(a()),y,z),z)) b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) -> b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) -> b#(y,b(z,a())) -> c#(f(a()),y,z) b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) -> b#(y,b(z,a())) -> f#(a()) b#(y,b(z,a())) -> c#(f(a()),y,z) -> c#(z,x,a()) -> f#(b(b(f(z),z),x)) b#(y,b(z,a())) -> c#(f(a()),y,z) -> c#(z,x,a()) -> b#(b(f(z),z),x) b#(y,b(z,a())) -> c#(f(a()),y,z) -> c#(z,x,a()) -> b#(f(z),z) b#(y,b(z,a())) -> c#(f(a()),y,z) -> c#(z,x,a()) -> f#(z) c#(z,x,a()) -> b#(b(f(z),z),x) -> b#(y,b(z,a())) -> f#(b(c(f(a()),y,z),z)) c#(z,x,a()) -> b#(b(f(z),z),x) -> b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) c#(z,x,a()) -> b#(b(f(z),z),x) -> b#(y,b(z,a())) -> c#(f(a()),y,z) c#(z,x,a()) -> b#(b(f(z),z),x) -> b#(y,b(z,a())) -> f#(a()) c#(z,x,a()) -> b#(f(z),z) -> b#(y,b(z,a())) -> f#(b(c(f(a()),y,z),z)) c#(z,x,a()) -> b#(f(z),z) -> b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) c#(z,x,a()) -> b#(f(z),z) -> b#(y,b(z,a())) -> c#(f(a()),y,z) c#(z,x,a()) -> b#(f(z),z) -> b#(y,b(z,a())) -> f#(a()) SCC Processor: #sccs: 1 #rules: 4 #arcs: 16/64 DPs: b#(y,b(z,a())) -> b#(c(f(a()),y,z),z) b#(y,b(z,a())) -> c#(f(a()),y,z) c#(z,x,a()) -> b#(f(z),z) c#(z,x,a()) -> b#(b(f(z),z),x) TRS: c(z,x,a()) -> f(b(b(f(z),z),x)) b(y,b(z,a())) -> f(b(c(f(a()),y,z),z)) f(c(c(z,a(),a()),x,a())) -> z Arctic Interpretation Processor: dimension: 1 usable rules: c(z,x,a()) -> f(b(b(f(z),z),x)) b(y,b(z,a())) -> f(b(c(f(a()),y,z),z)) f(c(c(z,a(),a()),x,a())) -> z interpretation: [c#](x0, x1, x2) = 4x0 + x1 + x2 + 4, [c](x0, x1, x2) = 1x0 + 4, [b](x0, x1) = x0 + 4, [a] = 0, [b#](x0, x1) = x0 + x1 + 0, [f](x0) = x0 + 0 orientation: b#(y,b(z,a())) = y + z + 4 >= z + 4 = b#(c(f(a()),y,z),z) b#(y,b(z,a())) = y + z + 4 >= y + z + 4 = c#(f(a()),y,z) c#(z,x,a()) = x + 4z + 4 >= z + 0 = b#(f(z),z) popout

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

job log

popout

actions

all output return to TRS Standard