details

property	value
status	complete
benchmark	random-159.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	Waldmann_19

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.1600439548 seconds
cpu usage	41.502421963
max memory	4.4048384E9

stage attributes

key	value
output-size	7004
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) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 1250 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 57 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 0 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 33 ms] (10) RelTRS (11) SIsEmptyProof [EQUIVALENT, 0 ms] (12) QTRS (13) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: c(a(b(x1))) -> c(b(b(x1))) b(c(c(x1))) -> c(c(c(x1))) a(a(a(x1))) -> c(c(b(x1))) The relative TRS consists of the following S rules: c(b(b(x1))) -> c(c(c(x1))) c(a(c(x1))) -> a(a(b(x1))) b(c(b(x1))) -> b(b(b(x1))) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is c(a(b(x1))) -> c(b(b(x1))) b(c(c(x1))) -> c(c(c(x1))) a(a(a(x1))) -> c(c(b(x1))) The set of rules S is c(b(b(x1))) -> c(c(c(x1))) c(a(c(x1))) -> a(a(b(x1))) b(c(b(x1))) -> b(b(b(x1))) We have obtained the following relative TRS: The set of rules R is b(a(c(x1))) -> b(b(c(x1))) c(c(b(x1))) -> c(c(c(x1))) a(a(a(x1))) -> b(c(c(x1))) The set of rules S is b(b(c(x1))) -> c(c(c(x1))) c(a(c(x1))) -> b(a(a(x1))) b(c(b(x1))) -> b(b(b(x1))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(a(c(x1))) -> b(b(c(x1))) c(c(b(x1))) -> c(c(c(x1))) a(a(a(x1))) -> b(c(c(x1))) The relative TRS consists of the following S rules: b(b(c(x1))) -> c(c(c(x1))) c(a(c(x1))) -> b(a(a(x1))) b(c(b(x1))) -> b(b(b(x1))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^6, +, *, >=, >) : <<< POL(b(x_1)) = [[0], [0], [0], [0], [0], [0]] + [[1, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]] * x_1 popout

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

job log

popout

actions

all output return to SRS Relative