details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.47057986259 seconds
cpu usage	18.122929824
max memory	2.702790656E9

stage attributes

key	value
output-size	13745
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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) RootLabelingProof [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 13 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) QDPOrderProof [EQUIVALENT, 35 ms] (11) QDP (12) QDPOrderProof [EQUIVALENT, 98 ms] (13) QDP (14) PisEmptyProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) QDPOrderProof [EQUIVALENT, 213 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(b(a(b(x1)))) -> b(a(b(b(b(b(x1)))))) b(a(b(b(x1)))) -> b(b(b(x1))) b(b(b(x1))) -> b(b(a(a(b(a(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(a(b(b(x1)))) -> b(b(b(b(a(b(x1)))))) b(b(a(b(x1)))) -> b(b(b(x1))) b(b(b(x1))) -> b(a(b(a(a(b(b(x1))))))) Q is empty. ---------------------------------------- (3) 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. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))) b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))) b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{b_1}(x1))) b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))) -> b_{b_1}(b_{b_1}(b_{a_1}(x1))) b_{b_1}(b_{b_1}(b_{b_1}(x1))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{b_1}(x1))))))) b_{b_1}(b_{b_1}(b_{a_1}(x1))) -> b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(x1))))))) Q is empty. ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: popout

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

job log

popout

actions

all output return to SRS Standard