details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	41.4005899429 seconds
cpu usage	164.082082654
max memory	8.2714624E8

stage attributes

key	value
output-size	4405
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: a(x1) -> x1 a(a(b(x1))) -> b(a(b(a(a(x1))))) b(b(x1)) -> b(x1) Proof: DP Processor: DPs: a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> b#(a(b(a(a(x1))))) TRS: a(x1) -> x1 a(a(b(x1))) -> b(a(b(a(a(x1))))) b(b(x1)) -> b(x1) TDG Processor: DPs: a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> b#(a(b(a(a(x1))))) TRS: a(x1) -> x1 a(a(b(x1))) -> b(a(b(a(a(x1))))) b(b(x1)) -> b(x1) graph: a#(a(b(x1))) -> a#(b(a(a(x1)))) -> a#(a(b(x1))) -> b#(a(b(a(a(x1))))) a#(a(b(x1))) -> a#(b(a(a(x1)))) -> a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> a#(b(a(a(x1)))) -> a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(b(a(a(x1)))) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(b(a(a(x1)))) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> b#(a(b(a(a(x1))))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> b#(a(b(a(a(x1))))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(x1) EDG Processor: DPs: a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> b#(a(b(a(a(x1))))) TRS: a(x1) -> x1 a(a(b(x1))) -> b(a(b(a(a(x1))))) b(b(x1)) -> b(x1) graph: a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> a#(a(x1)) -> a#(a(b(x1))) -> b#(a(b(a(a(x1))))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(x1) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> b#(a(a(x1))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> a#(b(a(a(x1)))) a#(a(b(x1))) -> a#(x1) -> a#(a(b(x1))) -> b#(a(b(a(a(x1))))) SCC Processor: #sccs: 1 #rules: 2 #arcs: 10/25 DPs: a#(a(b(x1))) -> a#(a(x1)) a#(a(b(x1))) -> a#(x1) TRS: a(x1) -> x1 a(a(b(x1))) -> b(a(b(a(a(x1))))) b(b(x1)) -> b(x1) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: a{#,0}(3) -> 1* b0(12) -> 13* b0(10) -> 11* a0(2) -> 3* a0(11) -> 12* a0(9) -> 10* f40() -> 2* popout

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

job log

popout

actions

all output return to SRS Standard