details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.72991 seconds
cpu usage	4.04855
user time	3.84432
system time	0.204232
max virtual memory	1.9142144E7
max residence set size	334724.0

stage attributes

key	value
starexec-result	YES

output

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) 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(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(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(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(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(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(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: 435, 436, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473 Node 435 is start node and node 436 is final node. Those nodes are connected through the following edges: * 435 to 450 labelled b_1(0)* 436 to 436 labelled #_1(0)* 450 to 451 labelled a_1(0)* 451 to 452 labelled a_1(0)* 452 to 453 labelled a_1(0)* 453 to 454 labelled a_1(0)* 454 to 455 labelled a_1(0)* 455 to 456 labelled b_1(0)* 456 to 457 labelled a_1(0)* 456 to 462 labelled b_1(1)* 457 to 458 labelled a_1(0)* 457 to 462 labelled b_1(1)* 458 to 459 labelled a_1(0)* 458 to 462 labelled b_1(1)* 459 to 460 labelled a_1(0)* 459 to 462 labelled b_1(1)* 460 to 461 labelled a_1(0)* 460 to 462 labelled b_1(1)* 461 to 436 labelled a_1(0)* 461 to 462 labelled b_1(1)* 462 to 463 labelled a_1(1)* 463 to 464 labelled a_1(1)* 464 to 465 labelled a_1(1)* 465 to 466 labelled a_1(1)* 466 to 467 labelled a_1(1)* 467 to 468 labelled b_1(1)* 468 to 469 labelled a_1(1)* 468 to 462 labelled b_1(1)* 469 to 470 labelled a_1(1)* 469 to 462 labelled b_1(1)* 470 to 471 labelled a_1(1)* 470 to 462 labelled b_1(1)* 471 to 472 labelled a_1(1)* 471 to 462 labelled b_1(1)* 472 to 473 labelled a_1(1)* 472 to 462 labelled b_1(1)* 473 to 436 labelled a_1(1)* 473 to 462 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