details

property	value
status	complete
benchmark	zr06.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n095.star.cs.uiowa.edu
space	Mixed_relative_SRS

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.13550305367 seconds
cpu usage	7.617736263
max memory	4.97127424E8

stage attributes

key	value
output-size	4379
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) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 103 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 37 ms] (8) RelTRS (9) RIsEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(b(a(x1))) -> a(b(b(a(x1)))) The relative TRS consists of the following S rules: b(x1) -> b(b(b(x1))) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is a(b(a(x1))) -> a(b(b(a(x1)))) The set of rules S is b(x1) -> b(b(b(x1))) We have obtained the following relative TRS: The set of rules R is a(b(a(x1))) -> a(b(b(a(x1)))) The set of rules S is b(x1) -> b(b(b(x1))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a(b(a(x1))) -> a(b(b(a(x1)))) The relative TRS consists of the following S rules: b(x1) -> b(b(b(x1))) ---------------------------------------- (3) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled ---------------------------------------- (4) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: a_{b_1}(b_{a_1}(a_{a_1}(x1))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1)))) a_{b_1}(b_{a_1}(a_{b_1}(x1))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) The relative TRS consists of the following S rules: b_{a_1}(x1) -> b_{b_1}(b_{b_1}(b_{a_1}(x1))) b_{b_1}(x1) -> b_{b_1}(b_{b_1}(b_{b_1}(x1))) ---------------------------------------- (5) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Matrix interpretation [MATRO] to (N^2, +, *, >=, >) : popout

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

job log

popout

actions

all output return to SRS Relat 19260