details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.45353388786 seconds
cpu usage	6.962317684
max memory	7.76818688E8

stage attributes

key	value
output-size	3495
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(x1))))))) -> a(a(a(a(a(a(b(a(a(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: a(a(a(a(a(b(a(x1))))))) -> b(a(b(a(a(a(a(b(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(b(a(x1))))))) -> b(a(b(a(a(a(a(b(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(b(x)))))) -> b(a(b(a(a(a(a(b(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(b(x)))))) -> b(a(b(a(a(a(a(b(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(b(x)))))) -> b(a(b(a(a(a(a(b(a(a(a(a(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 486, 487, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563 Node 486 is start node and node 487 is final node. Those nodes are connected through the following edges: * 486 to 540 labelled b_1(0)* 487 to 487 labelled #_1(0)* 540 to 541 labelled a_1(0)* 541 to 542 labelled b_1(0)* 542 to 543 labelled a_1(0)* 543 to 544 labelled a_1(0)* 544 to 545 labelled a_1(0)* 545 to 546 labelled a_1(0)* 546 to 547 labelled b_1(0)* 547 to 548 labelled a_1(0)* 547 to 552 labelled b_1(1)* 548 to 549 labelled a_1(0)* 548 to 552 labelled b_1(1)* 549 to 550 labelled a_1(0)* 549 to 552 labelled b_1(1)* 550 to 551 labelled a_1(0)* 550 to 552 labelled b_1(1)* 551 to 487 labelled a_1(0)* 551 to 552 labelled b_1(1)* 552 to 553 labelled a_1(1)* 553 to 554 labelled b_1(1)* 554 to 555 labelled a_1(1)* 555 to 556 labelled a_1(1)* 556 to 557 labelled a_1(1)* 557 to 558 labelled a_1(1)* 558 to 559 labelled b_1(1)* 559 to 560 labelled a_1(1)* 559 to 552 labelled b_1(1)* 560 to 561 labelled a_1(1)* 560 to 552 labelled b_1(1)* 561 to 562 labelled a_1(1)* 561 to 552 labelled b_1(1)* 562 to 563 labelled a_1(1)* 562 to 552 labelled b_1(1)* 563 to 487 labelled a_1(1)* 563 to 552 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