details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78085 seconds
cpu usage	3.90722
user time	3.72492
system time	0.182299
max virtual memory	1.8944736E7
max residence set size	322744.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/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(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(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(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(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(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(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: 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407 Node 382 is start node and node 383 is final node. Those nodes are connected through the following edges: * 382 to 384 labelled b_1(0)* 383 to 383 labelled #_1(0)* 384 to 385 labelled a_1(0)* 385 to 386 labelled a_1(0)* 386 to 387 labelled a_1(0)* 387 to 388 labelled b_1(0)* 388 to 389 labelled a_1(0)* 389 to 390 labelled b_1(0)* 390 to 391 labelled a_1(0)* 390 to 396 labelled b_1(1)* 391 to 392 labelled a_1(0)* 391 to 396 labelled b_1(1)* 392 to 393 labelled a_1(0)* 392 to 396 labelled b_1(1)* 393 to 394 labelled a_1(0)* 393 to 396 labelled b_1(1)* 394 to 395 labelled a_1(0)* 394 to 396 labelled b_1(1)* 395 to 383 labelled a_1(0)* 395 to 396 labelled b_1(1)* 396 to 397 labelled a_1(1)* 397 to 398 labelled a_1(1)* 398 to 399 labelled a_1(1)* 399 to 400 labelled b_1(1)* 400 to 401 labelled a_1(1)* 401 to 402 labelled b_1(1)* 402 to 403 labelled a_1(1)* 402 to 396 labelled b_1(1)* 403 to 404 labelled a_1(1)* 403 to 396 labelled b_1(1)* 404 to 405 labelled a_1(1)* 404 to 396 labelled b_1(1)* 405 to 406 labelled a_1(1)* 405 to 396 labelled b_1(1)* 406 to 407 labelled a_1(1)* 406 to 396 labelled b_1(1)* 407 to 383 labelled a_1(1)* 407 to 396 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