details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.27270889282 seconds
cpu usage	6.306098041
max memory	6.59849216E8

stage attributes

key	value
output-size	3401
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) Strip Symbols Proof [SOUND, 0 ms] (4) QTRS (5) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(a(a(a(a(x1)))))))) -> a(a(a(a(a(a(a(b(a(a(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: a(a(a(a(a(a(b(a(x1)))))))) -> b(a(a(a(b(a(a(a(a(a(a(a(x1)))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(a(a(b(a(x1)))))))) -> b(a(a(a(b(a(a(a(a(a(a(a(x1)))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(a(a(a(a(a(b(x))))))) -> b(a(a(a(b(a(a(a(a(a(a(x))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(a(a(b(x))))))) -> b(a(a(a(b(a(a(a(a(a(a(x))))))))))) Q is empty. ---------------------------------------- (5) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R. The following rules were used to construct the certificate: a(a(a(a(a(a(b(x))))))) -> b(a(a(a(b(a(a(a(a(a(a(x))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518 Node 497 is start node and node 498 is final node. Those nodes are connected through the following edges: * 497 to 499 labelled b_1(0)* 498 to 498 labelled #_1(0)* 499 to 500 labelled a_1(0)* 500 to 501 labelled a_1(0)* 501 to 502 labelled a_1(0)* 502 to 503 labelled b_1(0)* 503 to 504 labelled a_1(0)* 503 to 509 labelled b_1(1)* 504 to 505 labelled a_1(0)* 504 to 509 labelled b_1(1)* 505 to 506 labelled a_1(0)* 505 to 509 labelled b_1(1)* 506 to 507 labelled a_1(0)* 506 to 509 labelled b_1(1)* 507 to 508 labelled a_1(0)* 507 to 509 labelled b_1(1)* 508 to 498 labelled a_1(0)* 508 to 509 labelled b_1(1)* 509 to 510 labelled a_1(1)* 510 to 511 labelled a_1(1)* 511 to 512 labelled a_1(1)* 512 to 513 labelled b_1(1)* 513 to 514 labelled a_1(1)* 513 to 509 labelled b_1(1)* 514 to 515 labelled a_1(1)* 514 to 509 labelled b_1(1)* 515 to 516 labelled a_1(1)* 515 to 509 labelled b_1(1)* 516 to 517 labelled a_1(1)* 516 to 509 labelled b_1(1)* 517 to 518 labelled a_1(1)* 517 to 509 labelled b_1(1)* 518 to 498 labelled a_1(1)* 518 to 509 labelled b_1(1) ---------------------------------------- (6) YES popout

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

job log

popout

actions

all output return to SRS Standard