details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.8093149662 seconds
cpu usage	3.990009529
max memory	3.1307776E8

stage attributes

key	value
output-size	4442
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, 10 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(b(a(x1)))))))))))) -> a(a(b(a(b(a(b(a(a(b(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(b(a(a(b(a(b(a(x1)))))))))))) -> b(a(b(a(b(a(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(b(a(a(b(a(b(a(x1)))))))))))) -> b(a(b(a(b(a(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(b(a(a(b(a(b(x))))))))))) -> b(a(b(a(b(a(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(b(a(a(b(a(b(x))))))))))) -> b(a(b(a(b(a(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 2. This implies Q-termination of R. The following rules were used to construct the certificate: a(b(a(b(a(b(a(a(b(a(b(x))))))))))) -> b(a(b(a(b(a(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: 7, 8, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246 Node 7 is start node and node 8 is final node. Those nodes are connected through the following edges: * 7 to 59 labelled b_1(0)* 8 to 8 labelled #_1(0)* 59 to 60 labelled a_1(0)* 60 to 61 labelled b_1(0)* 61 to 62 labelled a_1(0)* 62 to 63 labelled b_1(0)* 63 to 64 labelled a_1(0)* 63 to 197 labelled b_1(1)* 64 to 65 labelled a_1(0)* 64 to 71 labelled b_1(1)* 65 to 66 labelled b_1(0)* 66 to 67 labelled a_1(0)* 66 to 71 labelled b_1(1)* 67 to 68 labelled b_1(0)* 68 to 69 labelled a_1(0)* 68 to 71 labelled b_1(1)* 69 to 70 labelled b_1(0)* 70 to 8 labelled a_1(0)* 70 to 71 labelled b_1(1)* 71 to 72 labelled a_1(1)* 72 to 73 labelled b_1(1)* 73 to 74 labelled a_1(1)* 74 to 75 labelled b_1(1)* 75 to 76 labelled a_1(1)* 75 to 235 labelled b_1(2)* 76 to 77 labelled a_1(1)* 76 to 71 labelled b_1(1)* 77 to 78 labelled b_1(1)* 78 to 79 labelled a_1(1)* 78 to 71 labelled b_1(1)* 79 to 80 labelled b_1(1)* 80 to 81 labelled a_1(1)* 80 to 71 labelled b_1(1)* 81 to 82 labelled b_1(1)* 82 to 8 labelled a_1(1)* 82 to 71 labelled b_1(1)* 197 to 198 labelled a_1(1)* 198 to 199 labelled b_1(1)* 199 to 200 labelled a_1(1)* 200 to 201 labelled b_1(1)* 201 to 202 labelled a_1(1)* 201 to 235 labelled b_1(2)* 202 to 203 labelled a_1(1)* 202 to 71 labelled b_1(1)* 203 to 204 labelled b_1(1)* 204 to 205 labelled a_1(1)* 205 to 206 labelled b_1(1)* 206 to 207 labelled a_1(1)* 207 to 208 labelled b_1(1)* 208 to 80 labelled a_1(1)* 208 to 235 labelled b_1(2)* 235 to 236 labelled a_1(2)* 236 to 237 labelled b_1(2)* 237 to 238 labelled a_1(2)* 238 to 239 labelled b_1(2)* 239 to 240 labelled a_1(2)* 239 to 235 labelled b_1(2)* 240 to 241 labelled a_1(2)* 240 to 71 labelled b_1(1)* 241 to 242 labelled b_1(2)* 242 to 243 labelled a_1(2)* 243 to 244 labelled b_1(2)* 244 to 245 labelled a_1(2)* 245 to 246 labelled b_1(2)* 246 to 80 labelled a_1(2)* 246 to 235 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