details

property	value
status	complete
benchmark	babbabbaba-ababbabbabba.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n056.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	90.3519868851 seconds
cpu usage	308.298954382
max memory	1.609035776E10

stage attributes

key	value
output-size	10095
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished 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, 1 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 7846 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 6818 ms] (12) QDP (13) PisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(b(b(a(b(b(a(b(a(x1)))))))))) -> a(b(a(b(b(a(b(b(a(b(b(a(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: a(b(a(b(b(a(b(b(a(b(x1)))))))))) -> a(b(b(a(b(b(a(b(b(a(b(a(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: a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))))))))) a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_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: A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))) -> A_{B_1}(b_{a_1}(a_{a_1}(x1))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))) -> A_{B_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))) -> A_{B_1}(b_{a_1}(a_{b_1}(x1))) A_{B_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))) -> A_{B_1}(x1) The TRS R consists of the following rules: a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))) -> a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(b_{a_1}(a_{b_1}(b_{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 Standard