details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78929805756 seconds
cpu usage	3.956455235
max memory	2.4745984E8

stage attributes

key	value
output-size	3312
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(a(a(b(a(x1)))))) -> a(a(b(a(b(a(b(a(b(a(b(a(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(a(b(a(x1)))))) -> b(a(a(b(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(a(b(a(x1)))))) -> b(a(a(b(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(a(b(x))))) -> b(a(a(b(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(a(b(x))))) -> b(a(a(b(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(a(b(x))))) -> b(a(a(b(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: 358, 359, 360, 361, 362, 363, 364, 366, 367, 369, 371, 373, 375, 377, 395, 396, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407 Node 358 is start node and node 359 is final node. Those nodes are connected through the following edges: * 358 to 360 labelled b_1(0)* 359 to 359 labelled #_1(0)* 360 to 361 labelled a_1(0)* 361 to 362 labelled a_1(0)* 362 to 363 labelled b_1(0)* 363 to 364 labelled a_1(0)* 364 to 366 labelled b_1(0)* 366 to 367 labelled a_1(0)* 367 to 369 labelled b_1(0)* 369 to 371 labelled a_1(0)* 371 to 373 labelled b_1(0)* 373 to 375 labelled a_1(0)* 373 to 395 labelled b_1(1)* 375 to 377 labelled b_1(0)* 377 to 359 labelled a_1(0)* 377 to 395 labelled b_1(1)* 395 to 396 labelled a_1(1)* 396 to 398 labelled a_1(1)* 398 to 399 labelled b_1(1)* 399 to 400 labelled a_1(1)* 400 to 401 labelled b_1(1)* 401 to 402 labelled a_1(1)* 402 to 403 labelled b_1(1)* 403 to 404 labelled a_1(1)* 404 to 405 labelled b_1(1)* 405 to 406 labelled a_1(1)* 405 to 395 labelled b_1(1)* 406 to 407 labelled b_1(1)* 407 to 359 labelled a_1(1)* 407 to 395 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