details

property	value
status	complete
benchmark	#3.47_rand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n071.star.cs.uiowa.edu
space	INVY_15

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.11052298546 seconds
cpu usage	5.344726974
max memory	3.54484224E8

stage attributes

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

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

job log

popout

actions

all output return to TRS Relat 75837