details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.65929 seconds
cpu usage	4.02906
user time	3.83074
system time	0.198323
max virtual memory	1.8943708E7
max residence set size	326932.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(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(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(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(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(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(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: 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497 Node 474 is start node and node 475 is final node. Those nodes are connected through the following edges: * 474 to 476 labelled b_1(0)* 475 to 475 labelled #_1(0)* 476 to 477 labelled c_1(0)* 477 to 478 labelled b_1(0)* 478 to 479 labelled a_1(0)* 479 to 480 labelled b_1(0)* 480 to 481 labelled c_1(0)* 481 to 482 labelled b_1(0)* 482 to 483 labelled a_1(0)* 482 to 487 labelled b_1(1)* 483 to 484 labelled a_1(0)* 483 to 487 labelled b_1(1)* 484 to 485 labelled a_1(0)* 484 to 487 labelled b_1(1)* 485 to 486 labelled a_1(0)* 485 to 487 labelled b_1(1)* 486 to 475 labelled a_1(0)* 486 to 487 labelled b_1(1)* 487 to 488 labelled c_1(1)* 488 to 489 labelled b_1(1)* 489 to 490 labelled a_1(1)* 490 to 491 labelled b_1(1)* 491 to 492 labelled c_1(1)* 492 to 493 labelled b_1(1)* 493 to 494 labelled a_1(1)* 493 to 487 labelled b_1(1)* 494 to 495 labelled a_1(1)* 494 to 487 labelled b_1(1)* 495 to 496 labelled a_1(1)* 495 to 487 labelled b_1(1)* 496 to 497 labelled a_1(1)* 496 to 487 labelled b_1(1)* 497 to 475 labelled a_1(1)* 497 to 487 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