details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.33861708641 seconds
cpu usage	4.052446431
max memory	3.22650112E8

stage attributes

key	value
output-size	3380
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(c(c(a(a(a(a(x1)))))))) -> a(a(a(a(a(b(c(c(a(a(b(c(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(c(c(b(a(x1)))))))) -> c(c(b(a(a(c(c(b(a(a(a(a(a(x1))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(c(c(b(a(x1)))))))) -> c(c(b(a(a(c(c(b(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(c(c(b(x))))))) -> c(c(b(a(a(c(c(b(a(a(a(a(x)))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(c(c(b(x))))))) -> c(c(b(a(a(c(c(b(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(c(c(b(x))))))) -> c(c(b(a(a(c(c(b(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483 Node 460 is start node and node 461 is final node. Those nodes are connected through the following edges: * 460 to 462 labelled c_1(0)* 461 to 461 labelled #_1(0)* 462 to 463 labelled c_1(0)* 463 to 464 labelled b_1(0)* 464 to 465 labelled a_1(0)* 465 to 466 labelled a_1(0)* 466 to 467 labelled c_1(0)* 467 to 468 labelled c_1(0)* 468 to 469 labelled b_1(0)* 469 to 470 labelled a_1(0)* 469 to 473 labelled c_1(1)* 470 to 471 labelled a_1(0)* 470 to 473 labelled c_1(1)* 471 to 472 labelled a_1(0)* 471 to 473 labelled c_1(1)* 472 to 461 labelled a_1(0)* 472 to 473 labelled c_1(1)* 473 to 474 labelled c_1(1)* 474 to 475 labelled b_1(1)* 475 to 476 labelled a_1(1)* 476 to 477 labelled a_1(1)* 477 to 478 labelled c_1(1)* 478 to 479 labelled c_1(1)* 479 to 480 labelled b_1(1)* 480 to 481 labelled a_1(1)* 480 to 473 labelled c_1(1)* 481 to 482 labelled a_1(1)* 481 to 473 labelled c_1(1)* 482 to 483 labelled a_1(1)* 482 to 473 labelled c_1(1)* 483 to 461 labelled a_1(1)* 483 to 473 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