details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	10.5009598732 seconds
cpu usage	20.939392738
max memory	1.33871616E9

stage attributes

key	value
output-size	6498
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 131 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 1 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 8 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 84 ms] (8) QDP (9) PisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(x1)) -> C(x1) b(c(x1)) -> A(x1) c(a(x1)) -> B(x1) A(C(x1)) -> b(x1) C(B(x1)) -> a(x1) B(A(x1)) -> c(x1) a(a(a(a(x1)))) -> A(A(A(x1))) A(A(A(A(x1)))) -> a(a(a(x1))) b(b(b(b(x1)))) -> B(B(B(x1))) B(B(B(B(x1)))) -> b(b(b(x1))) c(c(c(c(x1)))) -> C(C(C(x1))) C(C(C(C(x1)))) -> c(c(c(x1))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) A(c(c(c(x1)))) -> b(C(C(C(x1)))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) a(A(x1)) -> x1 A(a(x1)) -> x1 b(B(x1)) -> x1 B(b(x1)) -> x1 c(C(x1)) -> x1 C(c(x1)) -> x1 Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(A(x_1)) = 1 + x_1 POL(B(x_1)) = 1 + x_1 POL(C(x_1)) = 1 + x_1 POL(a(x_1)) = 1 + x_1 POL(b(x_1)) = 1 + x_1 POL(c(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a(b(x1)) -> C(x1) b(c(x1)) -> A(x1) c(a(x1)) -> B(x1) A(C(x1)) -> b(x1) C(B(x1)) -> a(x1) B(A(x1)) -> c(x1) a(a(a(a(x1)))) -> A(A(A(x1))) A(A(A(A(x1)))) -> a(a(a(x1))) b(b(b(b(x1)))) -> B(B(B(x1))) B(B(B(B(x1)))) -> b(b(b(x1))) c(c(c(c(x1)))) -> C(C(C(x1))) C(C(C(C(x1)))) -> c(c(c(x1))) a(A(x1)) -> x1 A(a(x1)) -> x1 b(B(x1)) -> x1 B(b(x1)) -> x1 c(C(x1)) -> x1 C(c(x1)) -> x1 ---------------------------------------- (2) Obligation: popout

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

job log

popout

actions

all output return to SRS Standard