details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	10.9031 seconds
cpu usage	82.6575
user time	80.3977
system time	2.25975
max virtual memory	5810916.0
max residence set size	78268.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: a(x1) -> x1 a(a(x1)) -> a(b(c(x1))) b(x1) -> x1 c(b(x1)) -> b(a(c(x1))) Proof: DP Processor: DPs: a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1)) a#(a(x1)) -> a#(b(c(x1))) c#(b(x1)) -> c#(x1) c#(b(x1)) -> a#(c(x1)) c#(b(x1)) -> b#(a(c(x1))) TRS: a(x1) -> x1 a(a(x1)) -> a(b(c(x1))) b(x1) -> x1 c(b(x1)) -> b(a(c(x1))) TDG Processor: DPs: a#(a(x1)) -> c#(x1) a#(a(x1)) -> b#(c(x1)) a#(a(x1)) -> a#(b(c(x1))) c#(b(x1)) -> c#(x1) c#(b(x1)) -> a#(c(x1)) c#(b(x1)) -> b#(a(c(x1))) TRS: a(x1) -> x1 a(a(x1)) -> a(b(c(x1))) b(x1) -> x1 c(b(x1)) -> b(a(c(x1))) graph: c#(b(x1)) -> c#(x1) -> c#(b(x1)) -> b#(a(c(x1))) c#(b(x1)) -> c#(x1) -> c#(b(x1)) -> a#(c(x1)) c#(b(x1)) -> c#(x1) -> c#(b(x1)) -> c#(x1) c#(b(x1)) -> a#(c(x1)) -> a#(a(x1)) -> a#(b(c(x1))) c#(b(x1)) -> a#(c(x1)) -> a#(a(x1)) -> b#(c(x1)) c#(b(x1)) -> a#(c(x1)) -> a#(a(x1)) -> c#(x1) a#(a(x1)) -> c#(x1) -> c#(b(x1)) -> b#(a(c(x1))) a#(a(x1)) -> c#(x1) -> c#(b(x1)) -> a#(c(x1)) a#(a(x1)) -> c#(x1) -> c#(b(x1)) -> c#(x1) a#(a(x1)) -> a#(b(c(x1))) -> a#(a(x1)) -> a#(b(c(x1))) a#(a(x1)) -> a#(b(c(x1))) -> a#(a(x1)) -> b#(c(x1)) a#(a(x1)) -> a#(b(c(x1))) -> a#(a(x1)) -> c#(x1) SCC Processor: #sccs: 1 #rules: 4 #arcs: 12/36 DPs: c#(b(x1)) -> c#(x1) c#(b(x1)) -> a#(c(x1)) a#(a(x1)) -> c#(x1) a#(a(x1)) -> a#(b(c(x1))) TRS: a(x1) -> x1 a(a(x1)) -> a(b(c(x1))) b(x1) -> x1 c(b(x1)) -> b(a(c(x1))) Root-Labeling Processor: DPs: c{#,(f6)}(f6(b)(b(f6)(x1))) -> c{#,(f6)}(f6(f6)(x1)) c{#,(f6)}(f6(b)(b(a)(x1))) -> c{#,(f6)}(f6(a)(x1)) c{#,(f6)}(f6(b)(b(b)(x1))) -> c{#,(f6)}(f6(b)(x1)) c{#,(f6)}(f6(b)(b(c)(x1))) -> c{#,(f6)}(f6(c)(x1)) c{#,(f6)}(f6(b)(b(f6)(x1))) -> a{#,(f6)}(f6(c)(c(f6)(x1))) c{#,(f6)}(f6(b)(b(a)(x1))) -> a{#,(f6)}(f6(c)(c(a)(x1))) c{#,(f6)}(f6(b)(b(b)(x1))) -> a{#,(f6)}(f6(c)(c(b)(x1))) c{#,(f6)}(f6(b)(b(c)(x1))) -> a{#,(f6)}(f6(c)(c(c)(x1))) a{#,(f6)}(f6(a)(a(f6)(x1))) -> c{#,(f6)}(f6(f6)(x1)) a{#,(f6)}(f6(a)(a(a)(x1))) -> c{#,(f6)}(f6(a)(x1)) a{#,(f6)}(f6(a)(a(b)(x1))) -> c{#,(f6)}(f6(b)(x1)) a{#,(f6)}(f6(a)(a(c)(x1))) -> c{#,(f6)}(f6(c)(x1)) a{#,(f6)}(f6(a)(a(f6)(x1))) -> a{#,(f6)}(f6(b)(b(c)(c(f6)(x1)))) a{#,(f6)}(f6(a)(a(a)(x1))) -> a{#,(f6)}(f6(b)(b(c)(c(a)(x1)))) a{#,(f6)}(f6(a)(a(b)(x1))) -> a{#,(f6)}(f6(b)(b(c)(c(b)(x1)))) a{#,(f6)}(f6(a)(a(c)(x1))) -> a{#,(f6)}(f6(b)(b(c)(c(c)(x1)))) TRS: f6(a)(a(f6)(x1)) -> f6(f6)(x1) f6(a)(a(a)(x1)) -> f6(a)(x1) f6(a)(a(b)(x1)) -> f6(b)(x1) f6(a)(a(c)(x1)) -> f6(c)(x1) a(a)(a(f6)(x1)) -> a(f6)(x1) a(a)(a(a)(x1)) -> a(a)(x1) a(a)(a(b)(x1)) -> a(b)(x1) a(a)(a(c)(x1)) -> a(c)(x1) b(a)(a(f6)(x1)) -> b(f6)(x1) b(a)(a(a)(x1)) -> b(a)(x1) b(a)(a(b)(x1)) -> b(b)(x1) b(a)(a(c)(x1)) -> b(c)(x1) c(a)(a(f6)(x1)) -> c(f6)(x1) c(a)(a(a)(x1)) -> c(a)(x1) c(a)(a(b)(x1)) -> c(b)(x1) c(a)(a(c)(x1)) -> c(c)(x1) a(a)(a(f6)(x1)) -> a(b)(b(c)(c(f6)(x1))) a(a)(a(a)(x1)) -> a(b)(b(c)(c(a)(x1))) a(a)(a(b)(x1)) -> a(b)(b(c)(c(b)(x1))) popout

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

job log

popout

actions

all output return to SRS Standard