details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.90186715126 seconds
cpu usage	4.166886451
max memory	3.74337536E8

stage attributes

key	value
output-size	4138
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, 4 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(b(c(a(c(a(b(c(a(x1)))))))))) -> a(b(c(a(c(a(b(b(c(a(c(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(c(b(a(c(a(c(b(b(a(x1)))))))))) -> b(a(c(a(c(b(b(a(c(a(c(b(a(x1))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(c(b(a(c(a(c(b(b(a(x1)))))))))) -> b(a(c(a(c(b(b(a(c(a(c(b(a(x1))))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(c(b(a(c(a(c(b(b(x))))))))) -> b(a(c(a(c(b(b(a(c(a(c(b(x)))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(c(b(a(c(a(c(b(b(x))))))))) -> b(a(c(a(c(b(b(a(c(a(c(b(x)))))))))))) Q is empty. ---------------------------------------- (5) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. This implies Q-termination of R. The following rules were used to construct the certificate: a(c(b(a(c(a(c(b(b(x))))))))) -> b(a(c(a(c(b(b(a(c(a(c(b(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438 Node 393 is start node and node 394 is final node. Those nodes are connected through the following edges: * 393 to 395 labelled b_1(0)* 394 to 394 labelled #_1(0)* 395 to 396 labelled a_1(0)* 396 to 397 labelled c_1(0)* 397 to 398 labelled a_1(0)* 398 to 399 labelled c_1(0)* 399 to 400 labelled b_1(0)* 400 to 401 labelled b_1(0)* 401 to 402 labelled a_1(0)* 401 to 417 labelled b_1(1)* 402 to 403 labelled c_1(0)* 403 to 404 labelled a_1(0)* 403 to 406 labelled b_1(1)* 404 to 405 labelled c_1(0)* 405 to 394 labelled b_1(0)* 406 to 407 labelled a_1(1)* 407 to 408 labelled c_1(1)* 408 to 409 labelled a_1(1)* 409 to 410 labelled c_1(1)* 410 to 411 labelled b_1(1)* 411 to 412 labelled b_1(1)* 412 to 413 labelled a_1(1)* 412 to 428 labelled b_1(2)* 413 to 414 labelled c_1(1)* 414 to 415 labelled a_1(1)* 414 to 406 labelled b_1(1)* 415 to 416 labelled c_1(1)* 416 to 394 labelled b_1(1)* 417 to 418 labelled a_1(1)* 418 to 419 labelled c_1(1)* 419 to 420 labelled a_1(1)* 420 to 421 labelled c_1(1)* 421 to 422 labelled b_1(1)* 422 to 423 labelled b_1(1)* 423 to 424 labelled a_1(1)* 423 to 428 labelled b_1(2)* 424 to 425 labelled c_1(1)* 425 to 426 labelled a_1(1)* 425 to 406 labelled b_1(1)* 426 to 427 labelled c_1(1)* 427 to 412 labelled b_1(1)* 428 to 429 labelled a_1(2)* 429 to 430 labelled c_1(2)* 430 to 431 labelled a_1(2)* 431 to 432 labelled c_1(2)* 432 to 433 labelled b_1(2)* 433 to 434 labelled b_1(2)* 434 to 435 labelled a_1(2)* 434 to 428 labelled b_1(2)* 435 to 436 labelled c_1(2)* 436 to 437 labelled a_1(2)* 436 to 406 labelled b_1(1)* 437 to 438 labelled c_1(2)* 438 to 412 labelled b_1(2) ---------------------------------------- (6) YES popout

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

job log

popout

actions

all output return to SRS Standard