details

property	value
status	complete
benchmark	#3.53a_rand.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	INVY_15

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.11415195465 seconds
cpu usage	5.010173253
max memory	4.39652352E8

stage attributes

key	value
output-size	2942
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) RelTRSRRRProof [EQUIVALENT, 16 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 11 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: g(x, y) -> x g(x, y) -> y f(s(x), y, y) -> f(y, x, s(x)) 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(g(x_1, x_2)) = [[1], [0]] + [[1, 0], [0, 2]] * x_1 + [[1, 0], [0, 1]] * x_2 >>> <<< POL(f(x_1, x_2, x_3)) = [[0], [0]] + [[2, 0], [0, 0]] * x_1 + [[1, 0], [0, 0]] * x_2 + [[1, 0], [0, 0]] * x_3 >>> <<< POL(s(x_1)) = [[0], [0]] + [[1, 0], [0, 0]] * x_1 >>> <<< POL(rand(x_1)) = [[3], [3]] + [[2, 0], [0, 2]] * x_1 >>> With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: g(x, y) -> x g(x, y) -> y Rules from S: rand(x) -> x ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(s(x), y, y) -> f(y, x, s(x)) 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, x_3)) = [[0], [0]] + [[1, 1], [0, 1]] * x_1 + [[1, 1], [0, 0]] * x_2 + [[1, 0], [0, 1]] * x_3 >>> <<< POL(s(x_1)) = [[0], [1]] + [[1, 0], [1, 1]] * x_1 >>> popout

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

job log

popout

actions

all output return to TRS Relative