details

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

run statistics

property	value
solver	ttt2-1.19
configuration	ttt2
runtime (wallclock)	2.23937 seconds
cpu usage	7.4431
user time	5.64574
system time	1.79735
max virtual memory	3521212.0
max residence set size	70464.0

stage attributes

key	value
starexec-result	YES

output

7.40/2.21 YES 7.40/2.22 7.40/2.22 Problem: 7.40/2.22 b(b(x1)) -> c(d(x1)) 7.40/2.22 c(c(x1)) -> d(d(d(x1))) 7.40/2.22 c(x1) -> g(x1) 7.40/2.22 d(d(x1)) -> c(f(x1)) 7.40/2.22 d(d(d(x1))) -> g(c(x1)) 7.40/2.22 f(x1) -> a(g(x1)) 7.40/2.22 g(x1) -> d(a(b(x1))) 7.40/2.22 g(g(x1)) -> b(c(x1)) 7.40/2.22 7.40/2.22 Proof: 7.40/2.22 Matrix Interpretation Processor: dim=2 7.40/2.22 7.40/2.22 interpretation: 7.40/2.22 [1 0] 7.40/2.22 [a](x0) = [0 0]x0, 7.40/2.22 7.40/2.22 [1 2] [1] 7.40/2.22 [f](x0) = [0 0]x0 + [0], 7.40/2.22 7.40/2.22 [1 2] [1] 7.40/2.22 [g](x0) = [0 0]x0 + [1], 7.40/2.22 7.40/2.22 [1 2] [1] 7.40/2.22 [c](x0) = [0 0]x0 + [1], 7.40/2.22 7.40/2.22 [1 2] [0] 7.40/2.22 [d](x0) = [0 0]x0 + [1], 7.40/2.22 7.40/2.22 [1 2] [1] 7.40/2.22 [b](x0) = [0 0]x0 + [1] 7.40/2.22 orientation: 7.40/2.22 [1 2] [4] [1 2] [3] 7.40/2.22 b(b(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = c(d(x1)) 7.40/2.22 7.40/2.22 [1 2] [4] [1 2] [4] 7.40/2.22 c(c(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = d(d(d(x1))) 7.40/2.22 7.40/2.22 [1 2] [1] [1 2] [1] 7.40/2.22 c(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = g(x1) 7.40/2.22 7.40/2.22 [1 2] [2] [1 2] [2] 7.40/2.22 d(d(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = c(f(x1)) 7.40/2.22 7.40/2.22 [1 2] [4] [1 2] [4] 7.40/2.22 d(d(d(x1))) = [0 0]x1 + [1] >= [0 0]x1 + [1] = g(c(x1)) 7.40/2.22 7.40/2.22 [1 2] [1] [1 2] [1] 7.40/2.22 f(x1) = [0 0]x1 + [0] >= [0 0]x1 + [0] = a(g(x1)) 7.40/2.22 7.40/2.22 [1 2] [1] [1 2] [1] 7.40/2.22 g(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = d(a(b(x1))) 7.40/2.22 7.40/2.22 [1 2] [4] [1 2] [4] 7.40/2.22 g(g(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = b(c(x1)) 7.40/2.22 problem: 7.40/2.22 c(c(x1)) -> d(d(d(x1))) 7.40/2.22 c(x1) -> g(x1) 7.40/2.22 d(d(x1)) -> c(f(x1)) 7.40/2.22 d(d(d(x1))) -> g(c(x1)) 7.40/2.22 f(x1) -> a(g(x1)) 7.40/2.22 g(x1) -> d(a(b(x1))) 7.40/2.22 g(g(x1)) -> b(c(x1)) 7.40/2.22 String Reversal Processor: 7.40/2.22 c(c(x1)) -> d(d(d(x1))) 7.40/2.22 c(x1) -> g(x1) 7.40/2.22 d(d(x1)) -> f(c(x1)) 7.40/2.22 d(d(d(x1))) -> c(g(x1)) 7.40/2.22 f(x1) -> g(a(x1)) 7.40/2.22 g(x1) -> b(a(d(x1))) 7.40/2.22 g(g(x1)) -> c(b(x1)) 7.40/2.22 Matrix Interpretation Processor: dim=3 7.40/2.22 7.40/2.22 interpretation: 7.40/2.22 [1 1 0] [0] 7.40/2.22 [a](x0) = [1 0 0]x0 + [1] 7.40/2.22 [0 0 0] [0], 7.40/2.22 7.40/2.22 [1 1 0] [0] 7.40/2.22 [f](x0) = [0 0 0]x0 + [0] 7.40/2.22 [0 0 0] [1], 7.40/2.22 7.40/2.22 [1 0 1] [0] 7.40/2.22 [g](x0) = [0 0 0]x0 + [0] 7.40/2.22 [0 0 0] [1], 7.40/2.22 7.40/2.22 [1 0 1] [1] 7.40/2.22 [c](x0) = [0 0 0]x0 + [0] 7.40/2.22 [0 0 0] [1], 7.40/2.22 7.40/2.22 [1 0 1] [0] 7.40/2.22 [d](x0) = [0 0 0]x0 + [0] 7.40/2.22 [0 0 0] [1], 7.40/2.22 7.40/2.22 [1 0 0] 7.40/2.22 [b](x0) = [0 0 0]x0 7.40/2.22 [0 0 0] 7.40/2.22 orientation: popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29