details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	3.29110693932 seconds
cpu usage	11.906353615
max memory	1.372758016E9

stage attributes

key	value
output-size	4717
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: strict: b(c(a(x1))) -> d(d(x1)) b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) weak: a(b(x1)) -> d(x1) d(x1) -> a(b(x1)) Proof: String Reversal Processor: strict: a(c(b(x1))) -> d(d(x1)) b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) weak: b(a(x1)) -> d(x1) d(x1) -> b(a(x1)) Matrix Interpretation Processor: dim=5 interpretation: [1 0 0 0 1] [0] [0 0 0 0 0] [0] [d](x0) = [0 0 1 0 1]x0 + [1] [0 0 0 0 0] [1] [0 0 0 0 0] [0], [1 0 0 0 0] [0] [0 0 0 0 0] [0] [b](x0) = [0 0 1 0 1]x0 + [1] [0 0 0 0 0] [1] [0 0 0 0 0] [0], [1 0 0 0 0] [0 0 1 0 0] [c](x0) = [0 0 0 0 0]x0 [0 0 0 0 0] [0 0 1 1 0] , [1 0 0 0 1] [0] [0 1 0 0 0] [0] [a](x0) = [0 0 1 0 1]x0 + [0] [0 0 0 0 0] [1] [0 0 0 0 0] [0] orientation: [1 0 1 0 1] [2] [1 0 0 0 1] [0] [0 0 1 0 1] [1] [0 0 0 0 0] [0] a(c(b(x1))) = [0 0 1 0 1]x1 + [2] >= [0 0 1 0 1]x1 + [2] = d(d(x1)) [0 0 0 0 0] [1] [0 0 0 0 0] [1] [0 0 0 0 0] [0] [0 0 0 0 0] [0] [1 0 0 0 0] [0] [1 0 0 0 0] [0 0 0 0 0] [0] [0 0 0 0 0] b(x1) = [0 0 1 0 1]x1 + [1] >= [0 0 0 0 0]x1 = c(c(x1)) [0 0 0 0 0] [1] [0 0 0 0 0] [0 0 0 0 0] [0] [0 0 0 0 0] [1 0 0 0 1] [0] [1 0 0 0 1] [0] [0 1 0 0 0] [0] [0 1 0 0 0] [0] a(a(x1)) = [0 0 1 0 1]x1 + [0] >= [0 0 1 0 1]x1 + [0] = a(x1) [0 0 0 0 0] [1] [0 0 0 0 0] [1] [0 0 0 0 0] [0] [0 0 0 0 0] [0] [1 0 0 0 1] [0] [1 0 0 0 1] [0] [0 0 0 0 0] [0] [0 0 0 0 0] [0] b(a(x1)) = [0 0 1 0 1]x1 + [1] >= [0 0 1 0 1]x1 + [1] = d(x1) [0 0 0 0 0] [1] [0 0 0 0 0] [1] [0 0 0 0 0] [0] [0 0 0 0 0] [0] [1 0 0 0 1] [0] [1 0 0 0 1] [0] [0 0 0 0 0] [0] [0 0 0 0 0] [0] d(x1) = [0 0 1 0 1]x1 + [1] >= [0 0 1 0 1]x1 + [1] = b(a(x1)) [0 0 0 0 0] [1] [0 0 0 0 0] [1] [0 0 0 0 0] [0] [0 0 0 0 0] [0] problem: strict: b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) weak: b(a(x1)) -> d(x1) d(x1) -> b(a(x1)) Arctic Interpretation Processor: dimension: 2 interpretation: [5 5] [d](x0) = [6 5]x0, [5 2] [b](x0) = [4 4]x0, [1 0] [c](x0) = [2 2]x0, popout

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

job log

popout

actions

all output return to SRS Relat 19260