details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.186 seconds
cpu usage	43.9489
user time	42.3279
system time	1.62102
max virtual memory	5.9441116E7
max residence set size	4503548.0

stage attributes

key	value
starexec-result	YES

output

41.38/11.51 YES 43.72/12.10 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 43.72/12.10 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 43.72/12.10 43.72/12.10 43.72/12.10 Termination w.r.t. Q of the given QTRS could be proven: 43.72/12.10 43.72/12.10 (0) QTRS 43.72/12.10 (1) QTRSRRRProof [EQUIVALENT, 106 ms] 43.72/12.10 (2) QTRS 43.72/12.10 (3) Overlay + Local Confluence [EQUIVALENT, 26 ms] 43.72/12.10 (4) QTRS 43.72/12.10 (5) DependencyPairsProof [EQUIVALENT, 83 ms] 43.72/12.10 (6) QDP 43.72/12.10 (7) MRRProof [EQUIVALENT, 683 ms] 43.72/12.10 (8) QDP 43.72/12.10 (9) PisEmptyProof [EQUIVALENT, 0 ms] 43.72/12.10 (10) YES 43.72/12.10 43.72/12.10 43.72/12.10 ---------------------------------------- 43.72/12.10 43.72/12.10 (0) 43.72/12.10 Obligation: 43.72/12.10 Q restricted rewrite system: 43.72/12.10 The TRS R consists of the following rules: 43.72/12.10 43.72/12.10 a(a(b(b(x1)))) -> C(C(x1)) 43.72/12.10 b(b(c(c(x1)))) -> A(A(x1)) 43.72/12.10 c(c(a(a(x1)))) -> B(B(x1)) 43.72/12.10 A(A(C(C(x1)))) -> b(b(x1)) 43.72/12.10 C(C(B(B(x1)))) -> a(a(x1)) 43.72/12.10 B(B(A(A(x1)))) -> c(c(x1)) 43.72/12.10 a(a(a(a(a(a(a(a(a(a(x1)))))))))) -> A(A(A(A(A(A(x1)))))) 43.72/12.10 A(A(A(A(A(A(A(A(x1)))))))) -> a(a(a(a(a(a(a(a(x1)))))))) 43.72/12.10 b(b(b(b(b(b(b(b(b(b(x1)))))))))) -> B(B(B(B(B(B(x1)))))) 43.72/12.10 B(B(B(B(B(B(B(B(x1)))))))) -> b(b(b(b(b(b(b(b(x1)))))))) 43.72/12.10 c(c(c(c(c(c(c(c(c(c(x1)))))))))) -> C(C(C(C(C(C(x1)))))) 43.72/12.10 C(C(C(C(C(C(C(C(x1)))))))) -> c(c(c(c(c(c(c(c(x1)))))))) 43.72/12.10 B(B(a(a(a(a(a(a(a(a(x1)))))))))) -> c(c(A(A(A(A(A(A(x1)))))))) 43.72/12.10 A(A(A(A(A(A(b(b(x1)))))))) -> a(a(a(a(a(a(a(a(C(C(x1)))))))))) 43.72/12.10 C(C(b(b(b(b(b(b(b(b(x1)))))))))) -> a(a(B(B(B(B(B(B(x1)))))))) 43.72/12.10 B(B(B(B(B(B(c(c(x1)))))))) -> b(b(b(b(b(b(b(b(A(A(x1)))))))))) 43.72/12.10 A(A(c(c(c(c(c(c(c(c(x1)))))))))) -> b(b(C(C(C(C(C(C(x1)))))))) 43.72/12.10 C(C(C(C(C(C(a(a(x1)))))))) -> c(c(c(c(c(c(c(c(B(B(x1)))))))))) 43.72/12.10 a(a(A(A(x1)))) -> x1 43.72/12.10 A(A(a(a(x1)))) -> x1 43.72/12.10 b(b(B(B(x1)))) -> x1 43.72/12.10 B(B(b(b(x1)))) -> x1 43.72/12.10 c(c(C(C(x1)))) -> x1 43.72/12.10 C(C(c(c(x1)))) -> x1 43.72/12.10 43.72/12.10 Q is empty. 43.72/12.10 43.72/12.10 ---------------------------------------- 43.72/12.10 43.72/12.10 (1) QTRSRRRProof (EQUIVALENT) 43.72/12.10 Used ordering: 43.72/12.10 Polynomial interpretation [POLO]: 43.72/12.10 43.72/12.10 POL(A(x_1)) = 3 + x_1 43.72/12.10 POL(B(x_1)) = 3 + x_1 43.72/12.10 POL(C(x_1)) = 3 + x_1 43.72/12.10 POL(a(x_1)) = 2 + x_1 43.72/12.10 POL(b(x_1)) = 2 + x_1 43.72/12.10 POL(c(x_1)) = 2 + x_1 43.72/12.10 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 43.72/12.10 43.72/12.10 a(a(b(b(x1)))) -> C(C(x1)) 43.72/12.10 b(b(c(c(x1)))) -> A(A(x1)) 43.72/12.10 c(c(a(a(x1)))) -> B(B(x1)) 43.72/12.10 A(A(C(C(x1)))) -> b(b(x1)) 43.72/12.10 C(C(B(B(x1)))) -> a(a(x1)) 43.72/12.10 B(B(A(A(x1)))) -> c(c(x1)) 43.72/12.10 a(a(a(a(a(a(a(a(a(a(x1)))))))))) -> A(A(A(A(A(A(x1)))))) 43.72/12.10 A(A(A(A(A(A(A(A(x1)))))))) -> a(a(a(a(a(a(a(a(x1)))))))) 43.72/12.10 b(b(b(b(b(b(b(b(b(b(x1)))))))))) -> B(B(B(B(B(B(x1)))))) 43.72/12.10 B(B(B(B(B(B(B(B(x1)))))))) -> b(b(b(b(b(b(b(b(x1)))))))) 43.72/12.10 c(c(c(c(c(c(c(c(c(c(x1)))))))))) -> C(C(C(C(C(C(x1)))))) 43.72/12.10 C(C(C(C(C(C(C(C(x1)))))))) -> c(c(c(c(c(c(c(c(x1)))))))) 43.72/12.10 a(a(A(A(x1)))) -> x1 43.72/12.10 A(A(a(a(x1)))) -> x1 43.72/12.10 b(b(B(B(x1)))) -> x1 43.72/12.10 B(B(b(b(x1)))) -> x1 43.72/12.10 c(c(C(C(x1)))) -> x1 43.72/12.10 C(C(c(c(x1)))) -> x1 43.72/12.10 43.72/12.10 43.72/12.10 43.72/12.10 43.72/12.10 ---------------------------------------- 43.72/12.10 43.72/12.10 (2) 43.72/12.10 Obligation: 43.72/12.10 Q restricted rewrite system: 43.72/12.10 The TRS R consists of the following rules: 43.72/12.10 43.72/12.10 B(B(a(a(a(a(a(a(a(a(x1)))))))))) -> c(c(A(A(A(A(A(A(x1)))))))) 43.72/12.10 A(A(A(A(A(A(b(b(x1)))))))) -> a(a(a(a(a(a(a(a(C(C(x1)))))))))) 43.72/12.10 C(C(b(b(b(b(b(b(b(b(x1)))))))))) -> a(a(B(B(B(B(B(B(x1)))))))) popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29