details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.90703010559 seconds
cpu usage	8.665345556
max memory	1.085902848E9

stage attributes

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

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

job log

popout

actions

all output return to SRS Relat 19260