details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	5.25808787346 seconds
cpu usage	17.647064575
max memory	1.252532224E9

stage attributes

key	value
output-size	6537
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 15 ms] (2) QDP (3) QDPOrderProof [EQUIVALENT, 105 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 48 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 43 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(x1) -> x1 a(b(x1)) -> c(b(a(x1))) b(x1) -> a(x1) c(c(x1)) -> 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(b(x1)) -> C(b(a(x1))) A(b(x1)) -> B(a(x1)) A(b(x1)) -> A(x1) B(x1) -> A(x1) C(c(x1)) -> B(x1) The TRS R consists of the following rules: a(x1) -> x1 a(b(x1)) -> c(b(a(x1))) b(x1) -> a(x1) c(c(x1)) -> 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. A(b(x1)) -> A(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, -I, 0A]] * x_1 >>> <<< POL(b(x_1)) = [[-I], [0A], [1A]] + [[0A, -I, 1A], [0A, 0A, 0A], [0A, -I, 1A]] * x_1 >>> <<< POL(C(x_1)) = [[-I]] + [[0A, -I, -I]] * x_1 >>> <<< POL(a(x_1)) = [[-I], [0A], [-I]] + [[0A, -I, 1A], [0A, 0A, 0A], [-I, -I, 0A]] * x_1 >>> <<< POL(B(x_1)) = [[0A]] + [[0A, -I, 0A]] * x_1 >>> popout

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

job log

popout

actions

all output return to SRS Standard