details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	20.2623 seconds
cpu usage	59.4237
user time	56.6604
system time	2.76327
max virtual memory	3.9032256E7
max residence set size	6457668.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 3727 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 61 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(a(c(c(b(b(x1)))))) -> b(b(a(a(b(b(a(a(x1)))))))) a(a(a(a(x1)))) -> a(a(b(b(a(a(x1)))))) The relative TRS consists of the following S rules: b(b(x1)) -> b(b(c(c(x1)))) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^3, +, *, >=, >) : <<< POL(a(x_1)) = [[0], [0], [0]] + [[1, 0, 2], [0, 0, 3], [0, 0, 1]] * x_1 >>> <<< POL(c(x_1)) = [[0], [0], [0]] + [[1, 0, 0], [0, 0, 0], [0, 1, 1]] * x_1 >>> <<< POL(b(x_1)) = [[0], [2], [0]] + [[1, 0, 0], [0, 2, 2], [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(c(c(b(b(x1)))))) -> b(b(a(a(b(b(a(a(x1)))))))) Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(a(a(a(x1)))) -> a(a(b(b(a(a(x1)))))) The relative TRS consists of the following S rules: b(b(x1)) -> b(b(c(c(x1)))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(a(x_1)) = [[2], [1]] + [[2, 2], [0, 2]] * x_1 >>> <<< POL(b(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> <<< POL(c(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: a(a(a(a(x1)))) -> a(a(b(b(a(a(x1)))))) Rules from S: none popout

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

job log

popout

actions

all output return to SRS Relative