details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78587198257 seconds
cpu usage	3.872469447
max memory	3.17825024E8

stage attributes

key	value
output-size	3454
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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(b(c(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(b(b(c(a(b(b(c(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(c(b(b(a(x1))))))))) -> c(b(b(a(c(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(c(b(b(a(x1))))))))) -> c(b(b(a(c(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(c(b(b(x)))))))) -> c(b(b(a(c(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(c(b(b(x)))))))) -> c(b(b(a(c(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(c(b(b(x)))))))) -> c(b(b(a(c(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: 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402 Node 379 is start node and node 380 is final node. Those nodes are connected through the following edges: * 379 to 381 labelled c_1(0)* 380 to 380 labelled #_1(0)* 381 to 382 labelled b_1(0)* 382 to 383 labelled b_1(0)* 383 to 384 labelled a_1(0)* 384 to 385 labelled c_1(0)* 385 to 386 labelled b_1(0)* 386 to 387 labelled b_1(0)* 387 to 388 labelled a_1(0)* 387 to 392 labelled c_1(1)* 388 to 389 labelled a_1(0)* 388 to 392 labelled c_1(1)* 389 to 390 labelled a_1(0)* 389 to 392 labelled c_1(1)* 390 to 391 labelled a_1(0)* 390 to 392 labelled c_1(1)* 391 to 380 labelled a_1(0)* 391 to 392 labelled c_1(1)* 392 to 393 labelled b_1(1)* 393 to 394 labelled b_1(1)* 394 to 395 labelled a_1(1)* 395 to 396 labelled c_1(1)* 396 to 397 labelled b_1(1)* 397 to 398 labelled b_1(1)* 398 to 399 labelled a_1(1)* 398 to 392 labelled c_1(1)* 399 to 400 labelled a_1(1)* 399 to 392 labelled c_1(1)* 400 to 401 labelled a_1(1)* 400 to 392 labelled c_1(1)* 401 to 402 labelled a_1(1)* 401 to 392 labelled c_1(1)* 402 to 380 labelled a_1(1)* 402 to 392 labelled c_1(1) ---------------------------------------- (6) YES popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Standard