details

property	value
status	complete
benchmark	z086-variant.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n171.star.cs.uiowa.edu
space	Waldmann_06_SRS

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	8.28207707405 seconds
cpu usage	29.356108369
max memory	1.652887552E9

stage attributes

key	value
output-size	8209
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) DependencyPairsProof [EQUIVALENT, 0 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 243 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 221 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 418 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 646 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(c(c(x1)))) c(c(x1)) -> a(b(x1)) Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: A(a(x1)) -> B(c(x1)) A(a(x1)) -> C(x1) B(b(x1)) -> A(c(c(c(x1)))) B(b(x1)) -> C(c(c(x1))) B(b(x1)) -> C(c(x1)) B(b(x1)) -> C(x1) C(c(x1)) -> A(b(x1)) C(c(x1)) -> B(x1) The TRS R consists of the following rules: a(a(x1)) -> b(c(x1)) b(b(x1)) -> a(c(c(c(x1)))) c(c(x1)) -> a(b(x1)) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (3) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(b(x1)) -> C(c(c(x1))) B(b(x1)) -> C(c(x1)) B(b(x1)) -> C(x1) The remaining pairs can at least be oriented weakly. Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: <<< POL(A(x_1)) = [[0A]] + [[-I, 0A, -I]] * x_1 >>> <<< POL(a(x_1)) = [[0A], [0A], [1A]] + [[-I, 0A, 0A], [0A, 0A, -I], [1A, 0A, -I]] * x_1 >>> <<< POL(B(x_1)) = [[0A]] + [[0A, -I, -I]] * x_1 >>> <<< POL(c(x_1)) = [[0A], [1A], [0A]] + [[0A, -I, -I], [1A, 0A, -I], [0A, 1A, -I]] * x_1 >>> popout

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

job log

popout

actions

all output return to SRS Standard