details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.72027 seconds
cpu usage	4.07715
user time	3.90074
system time	0.176414
max virtual memory	1.9141116E7
max residence set size	349208.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(a(b(b(a(a(b(a(b(a(b(a(x1)))))))))))) -> a(a(b(a(b(a(b(a(a(b(b(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(b(a(b(a(b(a(a(b(b(a(a(x1)))))))))))) -> b(a(a(b(b(a(a(b(a(b(a(b(a(a(x1)))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(b(a(b(a(b(a(a(b(b(a(a(x1)))))))))))) -> b(a(a(b(b(a(a(b(a(b(a(b(a(a(x1)))))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(b(a(b(a(b(a(a(b(b(a(x))))))))))) -> b(a(a(b(b(a(a(b(a(b(a(b(a(x))))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(b(a(b(a(a(b(b(a(x))))))))))) -> b(a(a(b(b(a(a(b(a(b(a(b(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(b(a(b(a(b(a(a(b(b(a(x))))))))))) -> b(a(a(b(b(a(a(b(a(b(a(b(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374 Node 349 is start node and node 350 is final node. Those nodes are connected through the following edges: * 349 to 351 labelled b_1(0)* 350 to 350 labelled #_1(0)* 351 to 352 labelled a_1(0)* 352 to 353 labelled a_1(0)* 353 to 354 labelled b_1(0)* 354 to 355 labelled b_1(0)* 355 to 356 labelled a_1(0)* 356 to 357 labelled a_1(0)* 356 to 363 labelled b_1(1)* 357 to 358 labelled b_1(0)* 358 to 359 labelled a_1(0)* 358 to 363 labelled b_1(1)* 359 to 360 labelled b_1(0)* 360 to 361 labelled a_1(0)* 360 to 363 labelled b_1(1)* 361 to 362 labelled b_1(0)* 362 to 350 labelled a_1(0)* 362 to 363 labelled b_1(1)* 363 to 364 labelled a_1(1)* 364 to 365 labelled a_1(1)* 365 to 366 labelled b_1(1)* 366 to 367 labelled b_1(1)* 367 to 368 labelled a_1(1)* 368 to 369 labelled a_1(1)* 368 to 363 labelled b_1(1)* 369 to 370 labelled b_1(1)* 370 to 371 labelled a_1(1)* 370 to 363 labelled b_1(1)* 371 to 372 labelled b_1(1)* 372 to 373 labelled a_1(1)* 372 to 363 labelled b_1(1)* 373 to 374 labelled b_1(1)* 374 to 350 labelled a_1(1)* 374 to 363 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