details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.84291291237 seconds
cpu usage	4.096275078
max memory	3.08637696E8

stage attributes

key	value
output-size	3394
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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(a(a(a(x1))))))))) -> a(a(a(a(a(a(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(a(a(a(b(a(x1))))))))) -> b(a(b(a(a(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(a(a(b(a(x1))))))))) -> b(a(b(a(a(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(a(a(b(x)))))))) -> b(a(b(a(a(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(a(a(b(x)))))))) -> b(a(b(a(a(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(a(a(b(x)))))))) -> b(a(b(a(a(a(a(a(a(a(x)))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 410, 411, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438 Node 410 is start node and node 411 is final node. Those nodes are connected through the following edges: * 410 to 421 labelled b_1(0)* 411 to 411 labelled #_1(0)* 421 to 422 labelled a_1(0)* 422 to 423 labelled b_1(0)* 423 to 424 labelled a_1(0)* 423 to 430 labelled b_1(1)* 424 to 425 labelled a_1(0)* 424 to 430 labelled b_1(1)* 425 to 426 labelled a_1(0)* 425 to 430 labelled b_1(1)* 426 to 427 labelled a_1(0)* 426 to 430 labelled b_1(1)* 427 to 428 labelled a_1(0)* 427 to 430 labelled b_1(1)* 428 to 429 labelled a_1(0)* 428 to 430 labelled b_1(1)* 429 to 411 labelled a_1(0)* 429 to 430 labelled b_1(1)* 430 to 431 labelled a_1(1)* 431 to 432 labelled b_1(1)* 432 to 433 labelled a_1(1)* 432 to 430 labelled b_1(1)* 433 to 434 labelled a_1(1)* 433 to 430 labelled b_1(1)* 434 to 435 labelled a_1(1)* 434 to 430 labelled b_1(1)* 435 to 436 labelled a_1(1)* 435 to 430 labelled b_1(1)* 436 to 437 labelled a_1(1)* 436 to 430 labelled b_1(1)* 437 to 438 labelled a_1(1)* 437 to 430 labelled b_1(1)* 438 to 411 labelled a_1(1)* 438 to 430 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