details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.19538593292 seconds
cpu usage	5.967678242
max memory	7.24238336E8

stage attributes

key	value
output-size	4641
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 5 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 2 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(b(x1))) -> a(b(x1)) a(a(x1)) -> a(b(a(x1))) a(a(a(x1))) -> a(b(b(x1))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(b(x1))) -> b(a(x1)) a(a(x1)) -> a(b(a(x1))) a(a(a(x1))) -> b(b(a(x1))) Q is empty. ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] As Q is empty the flat context closure was sound AND complete. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(b(x1))) -> b(a(x1)) a(a(x1)) -> a(b(a(x1))) b(a(a(a(x1)))) -> b(b(b(a(x1)))) a(a(a(a(x1)))) -> a(b(b(a(x1)))) Q is empty. ---------------------------------------- (5) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled As Q is empty the root labeling was sound AND complete. ---------------------------------------- (6) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{b_1}(x1)) b_{b_1}(b_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{a_1}(x1)) a_{a_1}(a_{b_1}(x1)) -> a_{b_1}(b_{a_1}(a_{b_1}(x1))) a_{a_1}(a_{a_1}(x1)) -> a_{b_1}(b_{a_1}(a_{a_1}(x1))) b_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) b_{a_1}(a_{a_1}(a_{a_1}(a_{a_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{a_1}(a_{a_1}(x1)))) a_{a_1}(a_{a_1}(a_{a_1}(a_{b_1}(x1)))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(x1)))) popout

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

job log

popout

actions

all output return to SRS Standard