details

property	value
status	complete
benchmark	size-12-alpha-3-num-213.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	Waldmann_07_size12

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	42.5766971111 seconds
cpu usage	168.677126851
max memory	1.473404928E9

stage attributes

key	value
output-size	3662
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: a(x1) -> x1 a(b(x1)) -> b(b(b(a(a(c(x1)))))) b(x1) -> x1 c(c(x1)) -> x1 Proof: String Reversal Processor: a(x1) -> x1 b(a(x1)) -> c(a(a(b(b(b(x1)))))) b(x1) -> x1 c(c(x1)) -> x1 DP Processor: DPs: b#(a(x1)) -> b#(x1) b#(a(x1)) -> b#(b(x1)) b#(a(x1)) -> b#(b(b(x1))) b#(a(x1)) -> a#(b(b(b(x1)))) b#(a(x1)) -> a#(a(b(b(b(x1))))) b#(a(x1)) -> c#(a(a(b(b(b(x1)))))) TRS: a(x1) -> x1 b(a(x1)) -> c(a(a(b(b(b(x1)))))) b(x1) -> x1 c(c(x1)) -> x1 TDG Processor: DPs: b#(a(x1)) -> b#(x1) b#(a(x1)) -> b#(b(x1)) b#(a(x1)) -> b#(b(b(x1))) b#(a(x1)) -> a#(b(b(b(x1)))) b#(a(x1)) -> a#(a(b(b(b(x1))))) b#(a(x1)) -> c#(a(a(b(b(b(x1)))))) TRS: a(x1) -> x1 b(a(x1)) -> c(a(a(b(b(b(x1)))))) b(x1) -> x1 c(c(x1)) -> x1 graph: b#(a(x1)) -> b#(b(b(x1))) -> b#(a(x1)) -> c#(a(a(b(b(b(x1)))))) b#(a(x1)) -> b#(b(b(x1))) -> b#(a(x1)) -> a#(a(b(b(b(x1))))) b#(a(x1)) -> b#(b(b(x1))) -> b#(a(x1)) -> a#(b(b(b(x1)))) b#(a(x1)) -> b#(b(b(x1))) -> b#(a(x1)) -> b#(b(b(x1))) b#(a(x1)) -> b#(b(b(x1))) -> b#(a(x1)) -> b#(b(x1)) b#(a(x1)) -> b#(b(b(x1))) -> b#(a(x1)) -> b#(x1) b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> c#(a(a(b(b(b(x1)))))) b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> a#(a(b(b(b(x1))))) b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> a#(b(b(b(x1)))) b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(b(b(x1))) b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(b(x1)) b#(a(x1)) -> b#(b(x1)) -> b#(a(x1)) -> b#(x1) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> c#(a(a(b(b(b(x1)))))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> a#(a(b(b(b(x1))))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> a#(b(b(b(x1)))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(b(b(x1))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(b(x1)) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(x1) SCC Processor: #sccs: 1 #rules: 3 #arcs: 18/36 DPs: b#(a(x1)) -> b#(b(b(x1))) b#(a(x1)) -> b#(x1) b#(a(x1)) -> b#(b(x1)) TRS: a(x1) -> x1 b(a(x1)) -> c(a(a(b(b(b(x1)))))) b(x1) -> x1 c(c(x1)) -> x1 Arctic Interpretation Processor: dimension: 2 usable rules: a(x1) -> x1 b(a(x1)) -> c(a(a(b(b(b(x1)))))) b(x1) -> x1 c(c(x1)) -> x1 interpretation: [b#](x0) = [0 1]x0 + [0], [0 1 ] [1 ] [b](x0) = [-& 0 ]x0 + [-&], [0 0] [0] [a](x0) = [0 1]x0 + [1], [-& 0 ] [0] [c](x0) = [0 -&]x0 + [0] orientation: b#(a(x1)) = [1 2]x1 + [2] >= [0 1]x1 + [1] = b#(b(b(x1))) b#(a(x1)) = [1 2]x1 + [2] >= [0 1]x1 + [0] = b#(x1) popout

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

job log

popout

actions

all output return to SRS Standard