details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.63551 seconds
cpu usage	10.9187
user time	10.306
system time	0.612738
max virtual memory	7.702778E7
max residence set size	1250752.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/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) RootLabelingProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 177 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 89 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 97 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 44 ms] (12) RelTRS (13) RIsEmptyProof [EQUIVALENT, 1 ms] (14) 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)))) b(a(b(x1))) -> b(a(a(b(x1)))) The relative TRS consists of the following S rules: a(x1) -> a(a(a(x1))) 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)))) b(a(b(x1))) -> b(a(a(b(x1)))) The set of rules S is a(x1) -> a(a(a(x1))) 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)))) b(a(b(x1))) -> b(a(a(b(x1)))) The set of rules S is a(x1) -> a(a(a(x1))) 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)))) b(a(b(x1))) -> b(a(a(b(x1)))) The relative TRS consists of the following S rules: a(x1) -> a(a(a(x1))) 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)))) b_{a_1}(a_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(x1)))) b_{a_1}(a_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(x1)))) The relative TRS consists of the following S rules: a_{a_1}(x1) -> a_{a_1}(a_{a_1}(a_{a_1}(x1))) popout

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

job log

popout

actions

all output return to SRS Relative