details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.21292591095 seconds
cpu usage	5.536556231
max memory	4.39795712E8

stage attributes

key	value
output-size	4003
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, 132 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: top(left(car(x, y), car(old, z))) -> top(right(y, car(old, z))) top(left(car(x, car(old, y)), z)) -> top(right(car(old, y), z)) top(right(x, car(y, car(old, z)))) -> top(left(x, car(old, z))) top(right(car(old, x), car(y, z))) -> top(left(car(old, x), z)) top(left(bot, car(old, x))) -> top(right(bot, car(old, x))) top(right(car(old, x), bot)) -> top(left(car(old, x), bot)) The relative TRS consists of the following S rules: top(left(car(x, y), z)) -> top(left(y, z)) top(right(x, car(y, z))) -> top(right(x, z)) bot -> car(new, bot) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(top(x_1)) = [[0], [1]] + [[1, 1], [1, 0]] * x_1 >>> <<< POL(left(x_1, x_2)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 + [[1, 1], [0, 1]] * x_2 >>> <<< POL(car(x_1, x_2)) = [[0], [0]] + [[1, 0], [1, 1]] * x_1 + [[1, 1], [1, 1]] * x_2 >>> <<< POL(old) = [[0], [1]] >>> <<< POL(right(x_1, x_2)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 + [[1, 1], [0, 0]] * x_2 >>> <<< POL(bot) = [[0], [0]] >>> <<< POL(new) = [[0], [0]] >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: top(left(car(x, y), car(old, z))) -> top(right(y, car(old, z))) top(left(car(x, car(old, y)), z)) -> top(right(car(old, y), z)) top(left(bot, car(old, x))) -> top(right(bot, car(old, x))) Rules from S: none ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: top(right(x, car(y, car(old, z)))) -> top(left(x, car(old, z))) top(right(car(old, x), car(y, z))) -> top(left(car(old, x), z)) top(right(car(old, x), bot)) -> top(left(car(old, x), bot)) popout

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

job log

popout

actions

all output return to TRS Relat 75837