details

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

run statistics

property	value
solver	ttt2-1.19
configuration	ttt2
runtime (wallclock)	2.77996 seconds
cpu usage	9.62721
user time	7.49188
system time	2.13532
max virtual memory	3577176.0
max residence set size	69880.0

stage attributes

key	value
starexec-result	YES

output

9.31/2.76 YES 9.31/2.77 9.31/2.77 Problem: 9.31/2.77 b(d(b(x1))) -> c(d(b(x1))) 9.31/2.77 b(a(c(x1))) -> b(c(x1)) 9.31/2.77 a(d(x1)) -> d(c(x1)) 9.31/2.77 b(b(b(x1))) -> a(b(c(x1))) 9.31/2.77 d(c(x1)) -> b(d(x1)) 9.31/2.77 d(c(x1)) -> d(b(d(x1))) 9.31/2.77 d(a(c(x1))) -> b(b(x1)) 9.31/2.77 9.31/2.77 Proof: 9.31/2.77 Matrix Interpretation Processor: dim=1 9.31/2.77 9.31/2.77 interpretation: 9.31/2.77 [a](x0) = 2x0 + 1, 9.31/2.77 9.31/2.77 [c](x0) = 2x0 + 1, 9.31/2.77 9.31/2.77 [d](x0) = x0, 9.31/2.77 9.31/2.77 [b](x0) = 2x0 + 1 9.31/2.77 orientation: 9.31/2.77 b(d(b(x1))) = 4x1 + 3 >= 4x1 + 3 = c(d(b(x1))) 9.31/2.77 9.31/2.77 b(a(c(x1))) = 8x1 + 7 >= 4x1 + 3 = b(c(x1)) 9.31/2.77 9.31/2.77 a(d(x1)) = 2x1 + 1 >= 2x1 + 1 = d(c(x1)) 9.31/2.77 9.31/2.77 b(b(b(x1))) = 8x1 + 7 >= 8x1 + 7 = a(b(c(x1))) 9.31/2.77 9.31/2.77 d(c(x1)) = 2x1 + 1 >= 2x1 + 1 = b(d(x1)) 9.31/2.77 9.31/2.77 d(c(x1)) = 2x1 + 1 >= 2x1 + 1 = d(b(d(x1))) 9.31/2.77 9.31/2.77 d(a(c(x1))) = 4x1 + 3 >= 4x1 + 3 = b(b(x1)) 9.31/2.77 problem: 9.31/2.77 b(d(b(x1))) -> c(d(b(x1))) 9.31/2.77 a(d(x1)) -> d(c(x1)) 9.31/2.77 b(b(b(x1))) -> a(b(c(x1))) 9.31/2.77 d(c(x1)) -> b(d(x1)) 9.31/2.77 d(c(x1)) -> d(b(d(x1))) 9.31/2.77 d(a(c(x1))) -> b(b(x1)) 9.31/2.77 Matrix Interpretation Processor: dim=3 9.31/2.77 9.31/2.77 interpretation: 9.31/2.77 [1 1 0] 9.31/2.77 [a](x0) = [0 1 0]x0 9.31/2.77 [0 0 0] , 9.31/2.77 9.31/2.77 [1 0 0] 9.31/2.77 [c](x0) = [0 0 1]x0 9.31/2.77 [0 0 0] , 9.31/2.77 9.31/2.77 [1 0 0] [0] 9.31/2.77 [d](x0) = [1 1 1]x0 + [1] 9.31/2.77 [0 0 0] [0], 9.31/2.77 9.31/2.77 [1 0 0] 9.31/2.77 [b](x0) = [0 0 0]x0 9.31/2.77 [0 0 0] 9.31/2.77 orientation: 9.31/2.77 [1 0 0] [1 0 0] 9.31/2.77 b(d(b(x1))) = [0 0 0]x1 >= [0 0 0]x1 = c(d(b(x1))) 9.31/2.77 [0 0 0] [0 0 0] 9.31/2.77 9.31/2.77 [2 1 1] [1] [1 0 0] [0] 9.31/2.77 a(d(x1)) = [1 1 1]x1 + [1] >= [1 0 1]x1 + [1] = d(c(x1)) 9.31/2.77 [0 0 0] [0] [0 0 0] [0] 9.31/2.77 9.31/2.77 [1 0 0] [1 0 0] 9.31/2.77 b(b(b(x1))) = [0 0 0]x1 >= [0 0 0]x1 = a(b(c(x1))) 9.31/2.77 [0 0 0] [0 0 0] 9.31/2.77 9.31/2.77 [1 0 0] [0] [1 0 0] 9.31/2.77 d(c(x1)) = [1 0 1]x1 + [1] >= [0 0 0]x1 = b(d(x1)) 9.31/2.77 [0 0 0] [0] [0 0 0] 9.31/2.77 9.31/2.77 [1 0 0] [0] [1 0 0] [0] 9.31/2.77 d(c(x1)) = [1 0 1]x1 + [1] >= [1 0 0]x1 + [1] = d(b(d(x1))) 9.31/2.77 [0 0 0] [0] [0 0 0] [0] 9.31/2.77 9.31/2.77 [1 0 1] [0] [1 0 0] 9.31/2.77 d(a(c(x1))) = [1 0 2]x1 + [1] >= [0 0 0]x1 = b(b(x1)) 9.31/2.77 [0 0 0] [0] [0 0 0] 9.31/2.77 problem: 9.31/2.77 b(d(b(x1))) -> c(d(b(x1))) 9.31/2.77 b(b(b(x1))) -> a(b(c(x1))) 9.31/2.77 d(c(x1)) -> b(d(x1)) 9.31/2.77 d(c(x1)) -> d(b(d(x1))) 9.31/2.77 d(a(c(x1))) -> b(b(x1)) 9.31/2.77 String Reversal Processor: 9.31/2.77 b(d(b(x1))) -> b(d(c(x1))) 9.31/2.77 b(b(b(x1))) -> c(b(a(x1))) 9.31/2.77 c(d(x1)) -> d(b(x1)) 9.31/2.77 c(d(x1)) -> d(b(d(x1))) 9.31/2.77 c(a(d(x1))) -> b(b(x1)) 9.31/2.77 Bounds Processor: 9.31/2.77 bound: 1 9.31/2.77 enrichment: match 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