details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.67922 seconds
cpu usage	3.89445
user time	3.72782
system time	0.16663
max virtual memory	1.887486E7
max residence set size	309528.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, 5 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(b(a(b(a(x1)))))))) -> a(a(b(a(b(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(b(a(b(a(a(b(a(x1)))))))) -> b(a(b(a(a(b(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(a(b(a(x1)))))))) -> b(a(b(a(a(b(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(a(b(x))))))) -> b(a(b(a(a(b(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(a(b(x))))))) -> b(a(b(a(a(b(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(a(b(x))))))) -> b(a(b(a(a(b(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: 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306 Node 281 is start node and node 282 is final node. Those nodes are connected through the following edges: * 281 to 283 labelled b_1(0)* 282 to 282 labelled #_1(0)* 283 to 284 labelled a_1(0)* 284 to 285 labelled b_1(0)* 285 to 286 labelled a_1(0)* 286 to 287 labelled a_1(0)* 287 to 288 labelled b_1(0)* 288 to 289 labelled a_1(0)* 289 to 290 labelled b_1(0)* 290 to 291 labelled a_1(0)* 290 to 295 labelled b_1(1)* 291 to 292 labelled b_1(0)* 292 to 293 labelled a_1(0)* 292 to 295 labelled b_1(1)* 293 to 294 labelled b_1(0)* 294 to 282 labelled a_1(0)* 294 to 295 labelled b_1(1)* 295 to 296 labelled a_1(1)* 296 to 297 labelled b_1(1)* 297 to 298 labelled a_1(1)* 298 to 299 labelled a_1(1)* 299 to 300 labelled b_1(1)* 300 to 301 labelled a_1(1)* 301 to 302 labelled b_1(1)* 302 to 303 labelled a_1(1)* 302 to 295 labelled b_1(1)* 303 to 304 labelled b_1(1)* 304 to 305 labelled a_1(1)* 304 to 295 labelled b_1(1)* 305 to 306 labelled b_1(1)* 306 to 282 labelled a_1(1)* 306 to 295 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