details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.24799394608 seconds
cpu usage	21.448065
max memory	2.443948032E9

stage attributes

key	value
output-size	5948
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: 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, 4 ms] (4) QDP (5) QDPOrderProof [EQUIVALENT, 164 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 56 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: b(b(x1)) -> a(a(a(x1))) b(a(b(x1))) -> a(x1) b(a(a(x1))) -> b(a(b(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: b(b(x1)) -> a(a(a(x1))) b(a(b(x1))) -> a(x1) a(a(b(x1))) -> b(a(b(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: B(b(x1)) -> A(a(a(x1))) B(b(x1)) -> A(a(x1)) B(b(x1)) -> A(x1) B(a(b(x1))) -> A(x1) A(a(b(x1))) -> B(a(b(x1))) The TRS R consists of the following rules: b(b(x1)) -> a(a(a(x1))) b(a(b(x1))) -> a(x1) a(a(b(x1))) -> b(a(b(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)) -> A(x1) B(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(B(x_1)) = [[0A]] + [[-I, -I, 0A]] * x_1 >>> popout

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

job log

popout

actions

all output return to SRS Standard