details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.06529283524 seconds
cpu usage	4.907531423
max memory	3.87428352E8

stage attributes

key	value
output-size	7563
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) FlatCCProof [EQUIVALENT, 0 ms] (2) RelTRS (3) RootLabelingProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 16 ms] (6) RelTRS (7) RIsEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(b(c(x1))) -> b(a(a(x1))) a(c(c(x1))) -> a(a(b(x1))) The relative TRS consists of the following S rules: a(c(b(x1))) -> c(a(b(x1))) a(c(c(x1))) -> c(c(b(x1))) a(a(a(x1))) -> a(b(a(x1))) a(b(a(x1))) -> a(b(c(x1))) ---------------------------------------- (1) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: b(b(c(x1))) -> b(a(a(x1))) a(c(c(x1))) -> a(a(b(x1))) The relative TRS consists of the following S rules: a(a(a(x1))) -> a(b(a(x1))) a(b(a(x1))) -> a(b(c(x1))) b(a(c(b(x1)))) -> b(c(a(b(x1)))) c(a(c(b(x1)))) -> c(c(a(b(x1)))) a(a(c(b(x1)))) -> a(c(a(b(x1)))) b(a(c(c(x1)))) -> b(c(c(b(x1)))) c(a(c(c(x1)))) -> c(c(c(b(x1)))) a(a(c(c(x1)))) -> a(c(c(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: b_{b_1}(b_{c_1}(c_{b_1}(x1))) -> b_{a_1}(a_{a_1}(a_{b_1}(x1))) b_{b_1}(b_{c_1}(c_{c_1}(x1))) -> b_{a_1}(a_{a_1}(a_{c_1}(x1))) b_{b_1}(b_{c_1}(c_{a_1}(x1))) -> b_{a_1}(a_{a_1}(a_{a_1}(x1))) a_{c_1}(c_{c_1}(c_{b_1}(x1))) -> a_{a_1}(a_{b_1}(b_{b_1}(x1))) a_{c_1}(c_{c_1}(c_{c_1}(x1))) -> a_{a_1}(a_{b_1}(b_{c_1}(x1))) a_{c_1}(c_{c_1}(c_{a_1}(x1))) -> a_{a_1}(a_{b_1}(b_{a_1}(x1))) The relative TRS consists of the following S rules: a_{a_1}(a_{a_1}(a_{b_1}(x1))) -> a_{b_1}(b_{a_1}(a_{b_1}(x1))) a_{a_1}(a_{a_1}(a_{c_1}(x1))) -> a_{b_1}(b_{a_1}(a_{c_1}(x1))) a_{a_1}(a_{a_1}(a_{a_1}(x1))) -> a_{b_1}(b_{a_1}(a_{a_1}(x1))) a_{b_1}(b_{a_1}(a_{b_1}(x1))) -> a_{b_1}(b_{c_1}(c_{b_1}(x1))) a_{b_1}(b_{a_1}(a_{c_1}(x1))) -> a_{b_1}(b_{c_1}(c_{c_1}(x1))) a_{b_1}(b_{a_1}(a_{a_1}(x1))) -> a_{b_1}(b_{c_1}(c_{a_1}(x1))) b_{a_1}(a_{c_1}(c_{b_1}(b_{b_1}(x1)))) -> b_{c_1}(c_{a_1}(a_{b_1}(b_{b_1}(x1)))) b_{a_1}(a_{c_1}(c_{b_1}(b_{c_1}(x1)))) -> b_{c_1}(c_{a_1}(a_{b_1}(b_{c_1}(x1)))) popout

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

job log

popout

actions

all output return to SRS Relative