details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.80385 seconds
cpu usage	1.94236
user time	1.39859
system time	0.543772
max virtual memory	2717992.0
max residence set size	66856.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: f(a(),f(a(),x)) -> f(c(),f(b(),x)) f(b(),f(b(),x)) -> f(a(),f(c(),x)) f(c(),f(c(),x)) -> f(b(),f(a(),x)) Proof: Extended Uncurrying Processor: application symbol: f symbol table: b ==> b0/0 b1/1 c ==> c0/0 c1/1 a ==> a0/0 a1/1 uncurry-rules: f(a0(),x1) -> a1(x1) f(c0(),x3) -> c1(x3) f(b0(),x5) -> b1(x5) eta-rules: problem: a1(a1(x)) -> c1(b1(x)) b1(b1(x)) -> a1(c1(x)) c1(c1(x)) -> b1(a1(x)) f(a0(),x1) -> a1(x1) f(c0(),x3) -> c1(x3) f(b0(),x5) -> b1(x5) Matrix Interpretation Processor: dim=3 interpretation: [1] [a0] = [0] [0], [0] [b0] = [0] [0], [1 0 0] [1 1 1] [0] [f](x0, x1) = [0 0 0]x0 + [1 0 1]x1 + [1] [0 0 1] [1 1 0] [0], [1 1 0] [0] [a1](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [1 1 0] [0] [c1](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [1 1 0] [0] [b1](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [0] [c0] = [0] [1] orientation: [1 1 0] [1] [1 1 0] [1] a1(a1(x)) = [0 0 0]x + [1] >= [0 0 0]x + [1] = c1(b1(x)) [0 0 0] [0] [0 0 0] [0] [1 1 0] [1] [1 1 0] [1] b1(b1(x)) = [0 0 0]x + [1] >= [0 0 0]x + [1] = a1(c1(x)) [0 0 0] [0] [0 0 0] [0] [1 1 0] [1] [1 1 0] [1] c1(c1(x)) = [0 0 0]x + [1] >= [0 0 0]x + [1] = b1(a1(x)) [0 0 0] [0] [0 0 0] [0] [1 1 1] [1] [1 1 0] [0] f(a0(),x1) = [1 0 1]x1 + [1] >= [0 0 0]x1 + [1] = a1(x1) [1 1 0] [0] [0 0 0] [0] [1 1 1] [0] [1 1 0] [0] f(c0(),x3) = [1 0 1]x3 + [1] >= [0 0 0]x3 + [1] = c1(x3) [1 1 0] [1] [0 0 0] [0] [1 1 1] [0] [1 1 0] [0] f(b0(),x5) = [1 0 1]x5 + [1] >= [0 0 0]x5 + [1] = b1(x5) [1 1 0] [0] [0 0 0] [0] problem: a1(a1(x)) -> c1(b1(x)) b1(b1(x)) -> a1(c1(x)) c1(c1(x)) -> b1(a1(x)) f(c0(),x3) -> c1(x3) f(b0(),x5) -> b1(x5) Matrix Interpretation Processor: dim=1 interpretation: [b0] = 2, [f](x0, x1) = 4x0 + 4x1, [a1](x0) = 3x0 + 3, [c1](x0) = 3x0 + 3, [b1](x0) = 3x0 + 3, popout

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

job log

popout

actions

all output return to TRS Standard