details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.43928909302 seconds
cpu usage	6.868491325
max memory	6.7188736E8

stage attributes

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

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

job log

popout

actions

all output return to SRS Relative