details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.70015 seconds
cpu usage	3.99427
user time	3.80222
system time	0.192048
max virtual memory	1.9075804E7
max residence set size	328644.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(b(b(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(b(b(b(a(b(b(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(b(b(a(x1))))))))) -> b(b(b(a(b(b(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(b(b(a(x1))))))))) -> b(b(b(a(b(b(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(b(b(x)))))))) -> b(b(b(a(b(b(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(b(b(x)))))))) -> b(b(b(a(b(b(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(b(b(x)))))))) -> b(b(b(a(b(b(b(a(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519 Node 496 is start node and node 497 is final node. Those nodes are connected through the following edges: * 496 to 498 labelled b_1(0)* 497 to 497 labelled #_1(0)* 498 to 499 labelled b_1(0)* 499 to 500 labelled b_1(0)* 500 to 501 labelled a_1(0)* 501 to 502 labelled b_1(0)* 502 to 503 labelled b_1(0)* 503 to 504 labelled b_1(0)* 504 to 505 labelled a_1(0)* 504 to 509 labelled b_1(1)* 505 to 506 labelled a_1(0)* 505 to 509 labelled b_1(1)* 506 to 507 labelled a_1(0)* 506 to 509 labelled b_1(1)* 507 to 508 labelled a_1(0)* 507 to 509 labelled b_1(1)* 508 to 497 labelled a_1(0)* 508 to 509 labelled b_1(1)* 509 to 510 labelled b_1(1)* 510 to 511 labelled b_1(1)* 511 to 512 labelled a_1(1)* 512 to 513 labelled b_1(1)* 513 to 514 labelled b_1(1)* 514 to 515 labelled b_1(1)* 515 to 516 labelled a_1(1)* 515 to 509 labelled b_1(1)* 516 to 517 labelled a_1(1)* 516 to 509 labelled b_1(1)* 517 to 518 labelled a_1(1)* 517 to 509 labelled b_1(1)* 518 to 519 labelled a_1(1)* 518 to 509 labelled b_1(1)* 519 to 497 labelled a_1(1)* 519 to 509 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