details

property	value
status	complete
benchmark	abaaaa-aaaaababaabab.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.65371 seconds
cpu usage	3.85173
user time	3.69016
system time	0.161574
max virtual memory	1.9142372E7
max residence set size	304912.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(x1)))))) -> a(a(a(a(a(b(a(b(a(a(b(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(b(a(x1)))))) -> b(a(b(a(a(b(a(b(a(a(a(a(a(x1))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(b(a(x1)))))) -> b(a(b(a(a(b(a(b(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(b(x))))) -> b(a(b(a(a(b(a(b(a(a(a(a(x)))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(b(x))))) -> b(a(b(a(a(b(a(b(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(b(x))))) -> b(a(b(a(a(b(a(b(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507 Node 484 is start node and node 485 is final node. Those nodes are connected through the following edges: * 484 to 486 labelled b_1(0)* 485 to 485 labelled #_1(0)* 486 to 487 labelled a_1(0)* 487 to 488 labelled b_1(0)* 488 to 489 labelled a_1(0)* 489 to 490 labelled a_1(0)* 490 to 491 labelled b_1(0)* 491 to 492 labelled a_1(0)* 492 to 493 labelled b_1(0)* 493 to 494 labelled a_1(0)* 493 to 497 labelled b_1(1)* 494 to 495 labelled a_1(0)* 494 to 497 labelled b_1(1)* 495 to 496 labelled a_1(0)* 495 to 497 labelled b_1(1)* 496 to 485 labelled a_1(0)* 496 to 497 labelled b_1(1)* 497 to 498 labelled a_1(1)* 498 to 499 labelled b_1(1)* 499 to 500 labelled a_1(1)* 500 to 501 labelled a_1(1)* 501 to 502 labelled b_1(1)* 502 to 503 labelled a_1(1)* 503 to 504 labelled b_1(1)* 504 to 505 labelled a_1(1)* 504 to 497 labelled b_1(1)* 505 to 506 labelled a_1(1)* 505 to 497 labelled b_1(1)* 506 to 507 labelled a_1(1)* 506 to 497 labelled b_1(1)* 507 to 485 labelled a_1(1)* 507 to 497 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