details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.81614303589 seconds
cpu usage	4.445836409
max memory	4.4404736E8

stage attributes

key	value
output-size	4160
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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(b(b(a(a(b(a(x1))))))))))) -> a(b(a(a(b(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(a(b(b(a(a(b(b(a(x1))))))))))) -> b(a(a(b(b(a(a(b(b(a(a(b(a(x1))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(b(a(a(b(b(a(a(b(b(a(x1))))))))))) -> b(a(a(b(b(a(a(b(b(a(a(b(a(x1))))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(b(a(a(b(b(a(a(b(b(x)))))))))) -> b(a(a(b(b(a(a(b(b(a(a(b(x)))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(b(b(a(a(b(b(x)))))))))) -> b(a(a(b(b(a(a(b(b(a(a(b(x)))))))))))) Q is empty. ---------------------------------------- (5) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. This implies Q-termination of R. The following rules were used to construct the certificate: a(b(a(a(b(b(a(a(b(b(x)))))))))) -> b(a(a(b(b(a(a(b(b(a(a(b(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517 Node 472 is start node and node 473 is final node. Those nodes are connected through the following edges: * 472 to 474 labelled b_1(0)* 473 to 473 labelled #_1(0)* 474 to 475 labelled a_1(0)* 475 to 476 labelled a_1(0)* 476 to 477 labelled b_1(0)* 477 to 478 labelled b_1(0)* 478 to 479 labelled a_1(0)* 479 to 480 labelled a_1(0)* 480 to 481 labelled b_1(0)* 481 to 482 labelled b_1(0)* 482 to 483 labelled a_1(0)* 482 to 496 labelled b_1(1)* 483 to 484 labelled a_1(0)* 483 to 485 labelled b_1(1)* 484 to 473 labelled b_1(0)* 485 to 486 labelled a_1(1)* 486 to 487 labelled a_1(1)* 487 to 488 labelled b_1(1)* 488 to 489 labelled b_1(1)* 489 to 490 labelled a_1(1)* 490 to 491 labelled a_1(1)* 491 to 492 labelled b_1(1)* 492 to 493 labelled b_1(1)* 493 to 494 labelled a_1(1)* 493 to 507 labelled b_1(2)* 494 to 495 labelled a_1(1)* 494 to 485 labelled b_1(1)* 495 to 473 labelled b_1(1)* 496 to 497 labelled a_1(1)* 497 to 498 labelled a_1(1)* 498 to 499 labelled b_1(1)* 499 to 500 labelled b_1(1)* 500 to 501 labelled a_1(1)* 501 to 502 labelled a_1(1)* 502 to 503 labelled b_1(1)* 503 to 504 labelled b_1(1)* 504 to 505 labelled a_1(1)* 504 to 507 labelled b_1(2)* 505 to 506 labelled a_1(1)* 505 to 485 labelled b_1(1)* 506 to 493 labelled b_1(1)* 507 to 508 labelled a_1(2)* 508 to 509 labelled a_1(2)* 509 to 510 labelled b_1(2)* 510 to 511 labelled b_1(2)* 511 to 512 labelled a_1(2)* 512 to 513 labelled a_1(2)* 513 to 514 labelled b_1(2)* 514 to 515 labelled b_1(2)* 515 to 516 labelled a_1(2)* 515 to 507 labelled b_1(2)* 516 to 517 labelled a_1(2)* 516 to 485 labelled b_1(1)* 517 to 493 labelled b_1(2) ---------------------------------------- (6) YES popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Stand 10685