details

property	value
status	complete
benchmark	#3.49_rand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n009.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	ttt2-1.19
configuration	ttt2
runtime (wallclock)	4.04271 seconds
cpu usage	14.6325
user time	11.3268
system time	3.30571
max virtual memory	4087528.0
max residence set size	80784.0

stage attributes

key	value
starexec-result	YES

output

14.37/4.02 YES 14.37/4.02 14.37/4.02 Problem: 14.37/4.02 strict: 14.37/4.02 f(c(s(x),y)) -> f(c(x,s(y))) 14.37/4.02 f(c(s(x),s(y))) -> g(c(x,y)) 14.37/4.02 g(c(x,s(y))) -> g(c(s(x),y)) 14.37/4.02 g(c(s(x),s(y))) -> f(c(x,y)) 14.37/4.02 weak: 14.37/4.02 rand(x) -> x 14.37/4.02 rand(x) -> rand(s(x)) 14.37/4.02 14.37/4.02 Proof: 14.37/4.02 Matrix Interpretation Processor: dim=2 14.37/4.02 14.37/4.02 interpretation: 14.37/4.02 [2 0] [1] 14.37/4.02 [rand](x0) = [0 2]x0 + [0], 14.37/4.02 14.37/4.02 [2 1] 14.37/4.02 [g](x0) = [2 0]x0, 14.37/4.02 14.37/4.02 [2 1] 14.37/4.02 [f](x0) = [2 0]x0, 14.37/4.02 14.37/4.02 [1 0] [1 1] [0] 14.37/4.02 [c](x0, x1) = [0 2]x0 + [0 0]x1 + [2], 14.37/4.02 14.37/4.02 14.37/4.02 [s](x0) = x0 14.37/4.02 orientation: 14.37/4.02 [2 2] [2 2] [2] [2 2] [2 2] [2] 14.37/4.02 f(c(s(x),y)) = [2 0]x + [2 2]y + [0] >= [2 0]x + [2 2]y + [0] = f(c(x,s(y))) 14.37/4.02 14.37/4.02 [2 2] [2 2] [2] [2 2] [2 2] [2] 14.37/4.02 f(c(s(x),s(y))) = [2 0]x + [2 2]y + [0] >= [2 0]x + [2 2]y + [0] = g(c(x,y)) 14.37/4.02 14.37/4.02 [2 2] [2 2] [2] [2 2] [2 2] [2] 14.37/4.02 g(c(x,s(y))) = [2 0]x + [2 2]y + [0] >= [2 0]x + [2 2]y + [0] = g(c(s(x),y)) 14.37/4.02 14.37/4.02 [2 2] [2 2] [2] [2 2] [2 2] [2] 14.37/4.02 g(c(s(x),s(y))) = [2 0]x + [2 2]y + [0] >= [2 0]x + [2 2]y + [0] = f(c(x,y)) 14.37/4.02 14.37/4.02 [2 0] [1] 14.37/4.02 rand(x) = [0 2]x + [0] >= x = x 14.37/4.02 14.37/4.02 [2 0] [1] [2 0] [1] 14.37/4.02 rand(x) = [0 2]x + [0] >= [0 2]x + [0] = rand(s(x)) 14.37/4.02 problem: 14.37/4.02 strict: 14.37/4.02 f(c(s(x),y)) -> f(c(x,s(y))) 14.37/4.02 f(c(s(x),s(y))) -> g(c(x,y)) 14.37/4.02 g(c(x,s(y))) -> g(c(s(x),y)) 14.37/4.02 g(c(s(x),s(y))) -> f(c(x,y)) 14.37/4.02 weak: 14.37/4.02 rand(x) -> rand(s(x)) 14.37/4.02 Matrix Interpretation Processor: dim=2 14.37/4.02 14.37/4.02 interpretation: 14.37/4.02 [2 0] 14.37/4.02 [rand](x0) = [0 0]x0, 14.37/4.02 14.37/4.02 [1 1] 14.37/4.02 [g](x0) = [1 1]x0, 14.37/4.02 14.37/4.02 [1 1] 14.37/4.02 [f](x0) = [1 1]x0, 14.37/4.02 14.37/4.02 [2 1] [2 0] [1] 14.37/4.02 [c](x0, x1) = [0 0]x0 + [0 1]x1 + [0], 14.37/4.02 14.37/4.02 [0] 14.37/4.02 [s](x0) = x0 + [1] 14.37/4.02 orientation: 14.37/4.02 [2 1] [2 1] [2] [2 1] [2 1] [2] 14.37/4.02 f(c(s(x),y)) = [2 1]x + [2 1]y + [2] >= [2 1]x + [2 1]y + [2] = f(c(x,s(y))) 14.37/4.02 14.37/4.02 [2 1] [2 1] [3] [2 1] [2 1] [1] 14.37/4.02 f(c(s(x),s(y))) = [2 1]x + [2 1]y + [3] >= [2 1]x + [2 1]y + [1] = g(c(x,y)) 14.37/4.02 14.37/4.02 [2 1] [2 1] [2] [2 1] [2 1] [2] 14.37/4.02 g(c(x,s(y))) = [2 1]x + [2 1]y + [2] >= [2 1]x + [2 1]y + [2] = g(c(s(x),y)) 14.37/4.02 14.37/4.02 [2 1] [2 1] [3] [2 1] [2 1] [1] 14.37/4.02 g(c(s(x),s(y))) = [2 1]x + [2 1]y + [3] >= [2 1]x + [2 1]y + [1] = f(c(x,y)) 14.37/4.02 14.37/4.02 [2 0] [2 0] 14.37/4.02 rand(x) = [0 0]x >= [0 0]x = rand(s(x)) 14.37/4.02 problem: 14.37/4.02 strict: 14.37/4.02 f(c(s(x),y)) -> f(c(x,s(y))) 14.37/4.02 g(c(x,s(y))) -> g(c(s(x),y)) 14.37/4.02 weak: 14.37/4.02 rand(x) -> rand(s(x)) 14.37/4.02 Bounds Processor: 14.37/4.02 bound: 1 14.37/4.02 enrichment: match-rt 14.37/4.02 automaton: 14.37/4.02 final states: {6} 14.37/4.02 transitions: popout

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

job log

popout

actions

all output return to TRS_Relative 2019-03-21 03.54