details

property	value
status	complete
benchmark	rt3-1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n086.star.cs.uiowa.edu
space	Relative_05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.21679711342 seconds
cpu usage	5.841603727
max memory	5.21285632E8

stage attributes

key	value
output-size	2816
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, 53 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 13 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: f(g(x), y, z) -> f(x, y, g(z)) The relative TRS consists of the following S rules: f(x, y, g(z)) -> f(x, g(y), z) f(x, a, z) -> f(x, g(a), z) f(x, y, z) -> f(x, y, g(z)) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(f(x_1, x_2, x_3)) = [[0], [0]] + [[1, 0], [1, 0]] * x_1 + [[1, 1], [0, 0]] * x_2 + [[1, 0], [1, 0]] * x_3 >>> <<< POL(g(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> <<< POL(a) = [[0], [1]] >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: none Rules from S: f(x, a, z) -> f(x, g(a), z) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(g(x), y, z) -> f(x, y, g(z)) The relative TRS consists of the following S rules: f(x, y, g(z)) -> f(x, g(y), z) f(x, y, z) -> f(x, y, g(z)) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : <<< POL(f(x_1, x_2, x_3)) = [[0], [0]] + [[1, 1], [1, 1]] * x_1 + [[1, 0], [1, 0]] * x_2 + [[1, 0], [1, 0]] * x_3 >>> <<< POL(g(x_1)) = [[0], [1]] + [[1, 0], [0, 1]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: f(g(x), y, z) -> f(x, y, g(z)) Rules from S: popout

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

job log

popout

actions

all output return to TRS Relat 75837