details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78257608414 seconds
cpu usage	4.246059933
max memory	3.70651136E8

stage attributes

key	value
output-size	3444
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: 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(a(b(a(a(b(a(b(a(x1)))))))))) -> a(a(b(a(b(a(b(a(b(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(b(a(b(a(a(b(a(b(a(x1)))))))))) -> b(a(b(a(a(b(a(b(a(b(a(b(a(a(x1)))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(b(a(b(a(a(b(a(b(a(x1)))))))))) -> b(a(b(a(a(b(a(b(a(b(a(b(a(a(x1)))))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(b(a(b(a(a(b(a(b(x))))))))) -> b(a(b(a(a(b(a(b(a(b(a(b(a(x))))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(b(a(a(b(a(b(x))))))))) -> b(a(b(a(a(b(a(b(a(b(a(b(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(b(a(b(a(a(b(a(b(x))))))))) -> b(a(b(a(a(b(a(b(a(b(a(b(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624 Node 599 is start node and node 600 is final node. Those nodes are connected through the following edges: * 599 to 601 labelled b_1(0)* 600 to 600 labelled #_1(0)* 601 to 602 labelled a_1(0)* 602 to 603 labelled b_1(0)* 603 to 604 labelled a_1(0)* 604 to 605 labelled a_1(0)* 605 to 606 labelled b_1(0)* 606 to 607 labelled a_1(0)* 607 to 608 labelled b_1(0)* 608 to 609 labelled a_1(0)* 608 to 613 labelled b_1(1)* 609 to 610 labelled b_1(0)* 610 to 611 labelled a_1(0)* 610 to 613 labelled b_1(1)* 611 to 612 labelled b_1(0)* 612 to 600 labelled a_1(0)* 612 to 613 labelled b_1(1)* 613 to 614 labelled a_1(1)* 614 to 615 labelled b_1(1)* 615 to 616 labelled a_1(1)* 616 to 617 labelled a_1(1)* 617 to 618 labelled b_1(1)* 618 to 619 labelled a_1(1)* 619 to 620 labelled b_1(1)* 620 to 621 labelled a_1(1)* 620 to 613 labelled b_1(1)* 621 to 622 labelled b_1(1)* 622 to 623 labelled a_1(1)* 622 to 613 labelled b_1(1)* 623 to 624 labelled b_1(1)* 624 to 600 labelled a_1(1)* 624 to 613 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