details

property	value
status	timeout (wallclock)
benchmark	abababaababa-ababaababaabab.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Wenzel_16

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	301.041123152 seconds
cpu usage	1123.38276965
max memory	1.6063627264E10

stage attributes

unavailable

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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) RootLabelingProof [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 8 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) SemLabProof [SOUND, 3313 ms] (8) QDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) AND (11) QDP (12) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (13) QDP (14) PisEmptyProof [EQUIVALENT, 0 ms] (15) YES (16) QDP (17) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (18) QDP (19) PisEmptyProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(b(a(b(a(a(b(a(b(a(x1)))))))))))) -> a(b(a(b(a(a(b(a(b(a(a(b(a(b(x1)))))))))))))) Q is empty. ---------------------------------------- (1) 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. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))))))) a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))))))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))))))))) -> A_{B_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))))))))) -> A_{B_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(x1)))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(x1)))))))))))) -> A_{B_1}(b_{a_1}(x1)) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))))))))) -> A_{B_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))))))))) -> A_{B_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1))))))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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}(x1)))) A_{B_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(x1)))))))))))) -> A_{B_1}(b_{b_1}(x1)) The TRS R consists of the following rules: a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(x1)))))))))))))) a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{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_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{a_1}(a_{a_1}(a_{b_1}(b_{a_1}(a_{b_1}(b_{b_1}(x1)))))))))))))) Q is empty. We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- popout

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

job log

popout

actions

all output return to SRS Standard