details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.01697 seconds
cpu usage	2.94533
user time	1.89749
system time	1.04784
max virtual memory	3000952.0
max residence set size	60844.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: strict: f(x,0()) -> s(x) g(x) -> h(x,gen()) h(0(),x) -> f(x,x) a() -> b() weak: gen() -> s(gen()) Proof: Matrix Interpretation Processor: dim=2 interpretation: [1] [gen] = [1], [2 0] [1 0] [2] [f](x0, x1) = [0 0]x0 + [0 0]x1 + [0], [2 0] [3] [g](x0) = [0 0]x0 + [0], [2 0] [3 0] [h](x0, x1) = [0 0]x0 + [0 0]x1, [1] [0] = [0], [0] [b] = [0], [0] [a] = [0], [1 0] [s](x0) = [0 0]x0 orientation: [2 0] [3] [1 0] f(x,0()) = [0 0]x + [0] >= [0 0]x = s(x) [2 0] [3] [2 0] [3] g(x) = [0 0]x + [0] >= [0 0]x + [0] = h(x,gen()) [3 0] [2] [3 0] [2] h(0(),x) = [0 0]x + [0] >= [0 0]x + [0] = f(x,x) [0] [0] a() = [0] >= [0] = b() [1] [1] gen() = [1] >= [0] = s(gen()) problem: strict: g(x) -> h(x,gen()) h(0(),x) -> f(x,x) a() -> b() weak: gen() -> s(gen()) Matrix Interpretation Processor: dim=2 interpretation: [0] [gen] = [2], [2 0] [1 0] [f](x0, x1) = [0 1]x0 + [0 0]x1, [3 0] [0] [g](x0) = [0 0]x0 + [2], [2 0] [3 0] [h](x0, x1) = [0 0]x0 + [0 1]x1, [0] [0] = [0], [0] [b] = [0], [1] [a] = [0], [2 0] [s](x0) = [0 1]x0 orientation: [3 0] [0] [2 0] [0] g(x) = [0 0]x + [2] >= [0 0]x + [2] = h(x,gen()) [3 0] [3 0] h(0(),x) = [0 1]x >= [0 1]x = f(x,x) [1] [0] a() = [0] >= [0] = b() [0] [0] gen() = [2] >= [2] = s(gen()) problem: strict: popout

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

job log

popout

actions

all output return to TRS Relative