details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.73225498199 seconds
cpu usage	20.147758476
max memory	1.854849024E9

stage attributes

key	value
output-size	1918
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) RelTRSRRRProof [EQUIVALENT, 837 ms] (2) RelTRS (3) RIsEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(b(b(x1)))) -> x1 The relative TRS consists of the following S rules: b(a(x1)) -> a(b(a(b(x1)))) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^6, +, *, >=, >) : <<< POL(a(x_1)) = [[0], [0], [0], [0], [0], [0]] + [[1, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0], [0, 0, 0, 1, 1, 0], [0, 0, 0, 1, 0, 1], [0, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0]] * x_1 >>> <<< POL(b(x_1)) = [[0], [1], [0], [0], [0], [0]] + [[1, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 1, 1], [0, 1, 0, 0, 0, 0]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: a(a(b(b(x1)))) -> x1 Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: R is empty. The relative TRS consists of the following S rules: b(a(x1)) -> a(b(a(b(x1)))) ---------------------------------------- (3) RIsEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (4) YES popout

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

job log

popout

actions

all output return to SRS Relat 19260