details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	6.82091116905 seconds
cpu usage	22.868998112
max memory	1.480491008E9

stage attributes

key	value
output-size	8387
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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 135 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 59 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 43 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPOrderProof [EQUIVALENT, 24 ms] (14) QDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(x1) a(b(x1)) -> c(a(x1)) b(c(x1)) -> c(b(a(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: a(a(x1)) -> b(x1) b(a(x1)) -> a(c(x1)) c(b(x1)) -> a(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: A(a(x1)) -> B(x1) B(a(x1)) -> A(c(x1)) B(a(x1)) -> C(x1) C(b(x1)) -> A(b(c(x1))) C(b(x1)) -> B(c(x1)) C(b(x1)) -> C(x1) The TRS R consists of the following rules: a(a(x1)) -> b(x1) b(a(x1)) -> a(c(x1)) c(b(x1)) -> a(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. C(b(x1)) -> A(b(c(x1))) The remaining pairs can at least be oriented weakly. Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]: popout

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

job log

popout

actions

all output return to SRS Standard