details

property	value
status	complete
benchmark	random-228.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.07543992996 seconds
cpu usage	8.283756665
max memory	9.38819584E8

stage attributes

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

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

job log

popout

actions

all output return to SRS Relative