details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.88101 seconds
cpu usage	4.08416
user time	3.88855
system time	0.195616
max virtual memory	1.91434E7
max residence set size	332844.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(b(a(a(a(a(a(x1)))))))) -> a(a(a(a(a(a(b(b(a(a(a(b(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(b(a(x1)))))))) -> b(b(a(a(a(b(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(b(a(x1)))))))) -> b(b(a(a(a(b(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(b(x))))))) -> b(b(a(a(a(b(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(b(x))))))) -> b(b(a(a(a(b(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(b(x))))))) -> b(b(a(a(a(b(b(a(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 365, 366, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410 Node 365 is start node and node 366 is final node. Those nodes are connected through the following edges: * 365 to 378 labelled b_1(0)* 366 to 366 labelled #_1(0)* 378 to 379 labelled b_1(0)* 379 to 380 labelled a_1(0)* 380 to 381 labelled a_1(0)* 381 to 382 labelled a_1(0)* 382 to 383 labelled b_1(0)* 383 to 384 labelled b_1(0)* 384 to 385 labelled a_1(0)* 384 to 400 labelled b_1(1)* 385 to 386 labelled a_1(0)* 385 to 400 labelled b_1(1)* 386 to 387 labelled a_1(0)* 386 to 400 labelled b_1(1)* 387 to 388 labelled a_1(0)* 387 to 400 labelled b_1(1)* 388 to 366 labelled a_1(0)* 388 to 400 labelled b_1(1)* 400 to 401 labelled b_1(1)* 401 to 402 labelled a_1(1)* 402 to 403 labelled a_1(1)* 403 to 404 labelled a_1(1)* 404 to 405 labelled b_1(1)* 405 to 406 labelled b_1(1)* 406 to 407 labelled a_1(1)* 406 to 400 labelled b_1(1)* 407 to 408 labelled a_1(1)* 407 to 400 labelled b_1(1)* 408 to 409 labelled a_1(1)* 408 to 400 labelled b_1(1)* 409 to 410 labelled a_1(1)* 409 to 400 labelled b_1(1)* 410 to 366 labelled a_1(1)* 410 to 400 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