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	n050.star.cs.uiowa.edu
space	Secret_05_SRS

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.30983781815 seconds
cpu usage	7.737712116
max memory	8.04200448E8

stage attributes

key	value
output-size	7639
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: b(b(x1)) -> c(d(x1)) c(c(x1)) -> d(d(d(x1))) c(x1) -> g(x1) d(d(x1)) -> c(f(x1)) d(d(d(x1))) -> g(c(x1)) f(x1) -> a(g(x1)) g(x1) -> d(a(b(x1))) g(g(x1)) -> b(c(x1)) Proof: String Reversal Processor: b(b(x1)) -> d(c(x1)) c(c(x1)) -> d(d(d(x1))) c(x1) -> g(x1) d(d(x1)) -> f(c(x1)) d(d(d(x1))) -> c(g(x1)) f(x1) -> g(a(x1)) g(x1) -> b(a(d(x1))) g(g(x1)) -> c(b(x1)) Matrix Interpretation Processor: dim=2 interpretation: [1 0] [1] [f](x0) = [0 0]x0 + [1], [1 2] [0] [d](x0) = [0 0]x0 + [1], [1 2] [1] [g](x0) = [0 0]x0 + [1], [1 0] [a](x0) = [0 0]x0, [1 2] [1] [b](x0) = [0 0]x0 + [1], [1 2] [1] [c](x0) = [0 0]x0 + [1] orientation: [1 2] [4] [1 2] [3] b(b(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = d(c(x1)) [1 2] [4] [1 2] [4] c(c(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = d(d(d(x1))) [1 2] [1] [1 2] [1] c(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = g(x1) [1 2] [2] [1 2] [2] d(d(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = f(c(x1)) [1 2] [4] [1 2] [4] d(d(d(x1))) = [0 0]x1 + [1] >= [0 0]x1 + [1] = c(g(x1)) [1 0] [1] [1 0] [1] f(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = g(a(x1)) [1 2] [1] [1 2] [1] g(x1) = [0 0]x1 + [1] >= [0 0]x1 + [1] = b(a(d(x1))) [1 2] [4] [1 2] [4] g(g(x1)) = [0 0]x1 + [1] >= [0 0]x1 + [1] = c(b(x1)) problem: c(c(x1)) -> d(d(d(x1))) c(x1) -> g(x1) d(d(x1)) -> f(c(x1)) d(d(d(x1))) -> c(g(x1)) f(x1) -> g(a(x1)) g(x1) -> b(a(d(x1))) g(g(x1)) -> c(b(x1)) String Reversal Processor: c(c(x1)) -> d(d(d(x1))) c(x1) -> g(x1) d(d(x1)) -> c(f(x1)) d(d(d(x1))) -> g(c(x1)) f(x1) -> a(g(x1)) g(x1) -> d(a(b(x1))) g(g(x1)) -> b(c(x1)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [0] [f](x0) = [0 0 0]x0 + [1] [0 1 0] [0], [1 0 1] [0] [d](x0) = [0 0 0]x0 + [1] [0 1 0] [1], [1 0 1] [0] popout

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

job log

popout

actions

all output return to SRS Standard