details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.16214299202 seconds
cpu usage	21.661746351
max memory	1.965068288E9

stage attributes

key	value
output-size	3010
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, 679 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RIsEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(b(a(x1))) -> c(c(c(x1))) c(c(c(x1))) -> a(c(a(x1))) The relative TRS consists of the following S rules: a(x1) -> b(c(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], [1], [0], [0], [0]] + [[1, 1, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 1, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0]] * x_1 >>> <<< POL(b(x_1)) = [[0], [0], [0], [0], [0], [0]] + [[1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]] * x_1 >>> <<< POL(c(x_1)) = [[0], [0], [0], [0], [0], [1]] + [[1, 0, 0, 0, 1, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0], [0, 0, 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(b(a(x1))) -> c(c(c(x1))) Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: c(c(c(x1))) -> a(c(a(x1))) The relative TRS consists of the following S rules: a(x1) -> b(c(b(x1))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(c(x_1)) = [[0], [1]] + [[1, 2], [0, 0]] * x_1 >>> <<< POL(a(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> <<< POL(b(x_1)) = [[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: popout

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

job log

popout

actions

all output return to SRS Relat 19260