details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.63651204109 seconds
cpu usage	11.287129067
max memory	1.303064576E9

stage attributes

key	value
output-size	4819
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) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 83 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 38 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: b(c(a(x1))) -> d(d(x1)) b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) The relative TRS consists of the following S rules: a(b(x1)) -> d(x1) d(x1) -> a(b(x1)) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is b(c(a(x1))) -> d(d(x1)) b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) The set of rules S is a(b(x1)) -> d(x1) d(x1) -> a(b(x1)) We have obtained the following relative TRS: The set of rules R is a(c(b(x1))) -> d(d(x1)) b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) The set of rules S is b(a(x1)) -> d(x1) d(x1) -> b(a(x1)) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(c(b(x1))) -> d(d(x1)) b(x1) -> c(c(x1)) a(a(x1)) -> a(x1) The relative TRS consists of the following S rules: b(a(x1)) -> d(x1) d(x1) -> b(a(x1)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^3, +, *, >=, >) : <<< POL(a(x_1)) = [[0], [1], [1]] + [[1, 1, 0], [0, 0, 0], [0, 0, 0]] * x_1 >>> <<< POL(c(x_1)) = [[0], [0], [0]] + [[1, 0, 0], [0, 0, 2], [0, 0, 0]] * x_1 >>> <<< POL(b(x_1)) = [[0], [0], [0]] + [[1, 0, 0], [0, 0, 0], [0, 1, 0]] * x_1 popout

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

job log

popout

actions

all output return to SRS Relat 19260