details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	120.616629839 seconds
cpu usage	479.014130402
max memory	8.89071616E9

stage attributes

key	value
output-size	2807
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 67.1 s] (4) RelTRS (5) RIsEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(a(a(b(x1)))) -> a(a(a(a(x1)))) a(b(b(a(x1)))) -> b(b(b(b(x1)))) The relative TRS consists of the following S rules: b(x1) -> b(b(b(x1))) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is b(a(a(b(x1)))) -> a(a(a(a(x1)))) a(b(b(a(x1)))) -> b(b(b(b(x1)))) The set of rules S is b(x1) -> b(b(b(x1))) We have obtained the following relative TRS: The set of rules R is b(a(a(b(x1)))) -> a(a(a(a(x1)))) a(b(b(a(x1)))) -> b(b(b(b(x1)))) The set of rules S is b(x1) -> b(b(b(x1))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(a(a(b(x1)))) -> a(a(a(a(x1)))) a(b(b(a(x1)))) -> b(b(b(b(x1)))) The relative TRS consists of the following S rules: b(x1) -> b(b(b(x1))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^6, +, *, >=, >) : <<< POL(b(x_1)) = [[0], [0], [1], [0], [0], [0]] + [[1, 0, 0, 1, 0, 0], [0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 1, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0], [0, 0, 0, 0, 1, 0]] * x_1 >>> <<< POL(a(x_1)) = [[0], [0], [0], [0], [1], [0]] + [[1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1], [0, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: b(a(a(b(x1)))) -> a(a(a(a(x1)))) a(b(b(a(x1)))) -> b(b(b(b(x1)))) Rules from S: none ---------------------------------------- (4) popout

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

job log

popout

actions

all output return to SRS Relat 19260