details

property	value
status	complete
benchmark	Ex4_7_15_Bor03_FR.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	Transformed_CSR_04

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.501927 seconds
cpu usage	0.92565
user time	0.651429
system time	0.274221
max virtual memory	96176.0
max residence set size	62724.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: f(0()) -> cons(0(),n__f(n__s(n__0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() f(X) -> n__f(X) s(X) -> n__s(X) 0() -> n__0() activate(n__f(X)) -> f(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(n__0()) -> 0() activate(X) -> X Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [n__f](x0) = [0 0 1]x0 + [0] [0 1 0] [1], [1 1 1] [activate](x0) = [1 1 0]x0 [1 0 1] , [1 0 0] [0] [f](x0) = [0 0 1]x0 + [0] [0 1 0] [1], [1 0 0] [0] [n__s](x0) = [0 0 1]x0 + [0] [0 1 0] [1], [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [0] [0] = [0] [0], [1 0 0] [p](x0) = [0 0 0]x0 [1 0 0] , [1 0 0] [1] [s](x0) = [0 0 1]x0 + [0] [0 1 0] [1], [0] [n__0] = [0] [0] orientation: [0] [0] f(0()) = [0] >= [0] = cons(0(),n__f(n__s(n__0()))) [1] [0] [1] [1] f(s(0())) = [1] >= [1] = f(p(s(0()))) [1] [1] [1] [0] p(s(0())) = [0] >= [0] = 0() [1] [0] [1 0 0] [0] [1 0 0] [0] f(X) = [0 0 1]X + [0] >= [0 0 1]X + [0] = n__f(X) [0 1 0] [1] [0 1 0] [1] [1 0 0] [1] [1 0 0] [0] s(X) = [0 0 1]X + [0] >= [0 0 1]X + [0] = n__s(X) [0 1 0] [1] [0 1 0] [1] [0] [0] 0() = [0] >= [0] = n__0() [0] [0] [1 1 1] [1] [1 1 1] [0] activate(n__f(X)) = [1 0 1]X + [0] >= [1 0 1]X + [0] = f(activate(X)) [1 1 0] [1] [1 1 0] [1] [1 1 1] [1] [1 1 1] [1] activate(n__s(X)) = [1 0 1]X + [0] >= [1 0 1]X + [0] = s(activate(X)) [1 1 0] [1] [1 1 0] [1] [0] [0] activate(n__0()) = [0] >= [0] = 0() [0] [0] [1 1 1] activate(X) = [1 1 0]X >= X = X [1 0 1] problem: f(0()) -> cons(0(),n__f(n__s(n__0()))) f(s(0())) -> f(p(s(0()))) f(X) -> n__f(X) 0() -> n__0() activate(n__s(X)) -> s(activate(X)) activate(n__0()) -> 0() popout

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

job log

popout

actions

all output return to TRS Standard