details

property	value
status	complete
benchmark	abcbaaaaa-aaaaaabcbaabcb.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.69296 seconds
cpu usage	4.03187
user time	3.86865
system time	0.163216
max virtual memory	1.9076376E7
max residence set size	323220.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(c(b(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(b(c(b(a(a(b(c(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(c(b(a(x1))))))))) -> b(c(b(a(a(b(c(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(c(b(a(x1))))))))) -> b(c(b(a(a(b(c(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(c(b(x)))))))) -> b(c(b(a(a(b(c(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(c(b(x)))))))) -> b(c(b(a(a(b(c(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(c(b(x)))))))) -> b(c(b(a(a(b(c(b(a(a(a(a(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486 Node 461 is start node and node 462 is final node. Those nodes are connected through the following edges: * 461 to 463 labelled b_1(0)* 462 to 462 labelled #_1(0)* 463 to 464 labelled c_1(0)* 464 to 465 labelled b_1(0)* 465 to 466 labelled a_1(0)* 466 to 467 labelled a_1(0)* 467 to 468 labelled b_1(0)* 468 to 469 labelled c_1(0)* 469 to 470 labelled b_1(0)* 470 to 471 labelled a_1(0)* 470 to 475 labelled b_1(1)* 471 to 472 labelled a_1(0)* 471 to 475 labelled b_1(1)* 472 to 473 labelled a_1(0)* 472 to 475 labelled b_1(1)* 473 to 474 labelled a_1(0)* 473 to 475 labelled b_1(1)* 474 to 462 labelled a_1(0)* 474 to 475 labelled b_1(1)* 475 to 476 labelled c_1(1)* 476 to 477 labelled b_1(1)* 477 to 478 labelled a_1(1)* 478 to 479 labelled a_1(1)* 479 to 480 labelled b_1(1)* 480 to 481 labelled c_1(1)* 481 to 482 labelled b_1(1)* 482 to 483 labelled a_1(1)* 482 to 475 labelled b_1(1)* 483 to 484 labelled a_1(1)* 483 to 475 labelled b_1(1)* 484 to 485 labelled a_1(1)* 484 to 475 labelled b_1(1)* 485 to 486 labelled a_1(1)* 485 to 475 labelled b_1(1)* 486 to 462 labelled a_1(1)* 486 to 475 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