details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.76153206825 seconds
cpu usage	3.986699907
max memory	2.49810944E8

stage attributes

key	value
output-size	3376
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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(b(a(a(a(a(x1)))))))) -> a(a(a(a(a(b(b(b(a(a(b(b(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(b(b(b(a(x1)))))))) -> b(b(b(a(a(b(b(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(b(b(b(a(x1)))))))) -> b(b(b(a(a(b(b(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(b(b(b(x))))))) -> b(b(b(a(a(b(b(b(a(a(a(a(x)))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(b(b(b(x))))))) -> b(b(b(a(a(b(b(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(b(b(b(x))))))) -> b(b(b(a(a(b(b(b(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 496, 497, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531 Node 496 is start node and node 497 is final node. Those nodes are connected through the following edges: * 496 to 510 labelled b_1(0)* 497 to 497 labelled #_1(0)* 510 to 511 labelled b_1(0)* 511 to 512 labelled b_1(0)* 512 to 513 labelled a_1(0)* 513 to 514 labelled a_1(0)* 514 to 515 labelled b_1(0)* 515 to 516 labelled b_1(0)* 516 to 517 labelled b_1(0)* 517 to 518 labelled a_1(0)* 517 to 521 labelled b_1(1)* 518 to 519 labelled a_1(0)* 518 to 521 labelled b_1(1)* 519 to 520 labelled a_1(0)* 519 to 521 labelled b_1(1)* 520 to 497 labelled a_1(0)* 520 to 521 labelled b_1(1)* 521 to 522 labelled b_1(1)* 522 to 523 labelled b_1(1)* 523 to 524 labelled a_1(1)* 524 to 525 labelled a_1(1)* 525 to 526 labelled b_1(1)* 526 to 527 labelled b_1(1)* 527 to 528 labelled b_1(1)* 528 to 529 labelled a_1(1)* 528 to 521 labelled b_1(1)* 529 to 530 labelled a_1(1)* 529 to 521 labelled b_1(1)* 530 to 531 labelled a_1(1)* 530 to 521 labelled b_1(1)* 531 to 497 labelled a_1(1)* 531 to 521 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 Stand 10685