details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.6846 seconds
cpu usage	3.53294
user time	3.379
system time	0.153938
max virtual memory	1.8943936E7
max residence set size	268820.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/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(a(a(a(a(a(x1))))))) -> a(a(a(a(a(a(b(a(b(a(a(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(a(a(a(a(b(a(x1))))))) -> b(a(a(a(a(b(a(b(a(a(a(a(a(a(x1)))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(a(b(a(x1))))))) -> b(a(a(a(a(b(a(b(a(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(a(b(x)))))) -> b(a(a(a(a(b(a(b(a(a(a(a(a(x))))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(a(b(x)))))) -> b(a(a(a(a(b(a(b(a(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(a(b(x)))))) -> b(a(a(a(a(b(a(b(a(a(a(a(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 271, 274, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318 Node 271 is start node and node 274 is final node. Those nodes are connected through the following edges: * 271 to 295 labelled b_1(0)* 274 to 274 labelled #_1(0)* 295 to 296 labelled a_1(0)* 296 to 297 labelled a_1(0)* 297 to 298 labelled a_1(0)* 298 to 299 labelled a_1(0)* 299 to 300 labelled b_1(0)* 300 to 301 labelled a_1(0)* 301 to 302 labelled b_1(0)* 302 to 303 labelled a_1(0)* 302 to 307 labelled b_1(1)* 303 to 304 labelled a_1(0)* 303 to 307 labelled b_1(1)* 304 to 305 labelled a_1(0)* 304 to 307 labelled b_1(1)* 305 to 306 labelled a_1(0)* 305 to 307 labelled b_1(1)* 306 to 274 labelled a_1(0)* 306 to 307 labelled b_1(1)* 307 to 308 labelled a_1(1)* 308 to 309 labelled a_1(1)* 309 to 310 labelled a_1(1)* 310 to 311 labelled a_1(1)* 311 to 312 labelled b_1(1)* 312 to 313 labelled a_1(1)* 313 to 314 labelled b_1(1)* 314 to 315 labelled a_1(1)* 314 to 307 labelled b_1(1)* 315 to 316 labelled a_1(1)* 315 to 307 labelled b_1(1)* 316 to 317 labelled a_1(1)* 316 to 307 labelled b_1(1)* 317 to 318 labelled a_1(1)* 317 to 307 labelled b_1(1)* 318 to 274 labelled a_1(1)* 318 to 307 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 Standard