details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	25.7749 seconds
cpu usage	97.9118
user time	95.0227
system time	2.8891
max virtual memory	6.1630584E7
max residence set size	4999684.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 2 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 1254 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 1589 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 914 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 351 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c(c(c(c(x1)))) -> b(b(b(b(x1)))) b(b(x1)) -> x1 b(b(x1)) -> c(b(c(x1))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: c(c(c(c(x1)))) -> b(b(b(b(x1)))) b(b(x1)) -> x1 b(b(x1)) -> c(b(c(x1))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: C(c(c(c(x1)))) -> B(b(b(b(x1)))) C(c(c(c(x1)))) -> B(b(b(x1))) C(c(c(c(x1)))) -> B(b(x1)) C(c(c(c(x1)))) -> B(x1) B(b(x1)) -> C(b(c(x1))) B(b(x1)) -> B(c(x1)) B(b(x1)) -> C(x1) The TRS R consists of the following rules: c(c(c(c(x1)))) -> b(b(b(b(x1)))) b(b(x1)) -> x1 b(b(x1)) -> c(b(c(x1))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) QDPOrderProof (EQUIVALENT) We use the reduction pair processor [LPAR04,JAR06]. The following pairs can be oriented strictly and are deleted. B(b(x1)) -> C(b(c(x1))) The remaining pairs can at least be oriented weakly. Used ordering: Matrix interpretation [MATRO] with arctic integers [ARCTIC,STERNAGEL_THIEMANN_RTA14]: <<< POL(C(x_1)) = [[0A]] + [[-1A, -1A, -I]] * x_1 >>> <<< POL(c(x_1)) = [[0A], [0A], [-I]] + [[-1A, 0A, -1A], [-1A, 1A, 0A], [-1A, -I, -I]] * x_1 >>> popout

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

job log

popout

actions

all output return to SRS Standard