Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487090168
details
property
value
status
complete
benchmark
abaaaaabaa-aaabaaabaaaaab.srs.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n144.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.70124 seconds
cpu usage
3.8939
user time
3.71852
system time
0.17537
max virtual memory
1.9141112E7
max residence set size
297644.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(b(a(a(x1)))))))))) -> a(a(a(b(a(a(a(b(a(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(b(a(a(a(a(a(b(a(x1)))))))))) -> b(a(a(a(a(a(b(a(a(a(b(a(a(a(x1)))))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(b(a(a(a(a(a(b(a(x1)))))))))) -> b(a(a(a(a(a(b(a(a(a(b(a(a(a(x1)))))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(a(b(a(a(a(a(a(b(x))))))))) -> b(a(a(a(a(a(b(a(a(a(b(a(a(x))))))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(b(a(a(a(a(a(b(x))))))))) -> b(a(a(a(a(a(b(a(a(a(b(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(b(a(a(a(a(a(b(x))))))))) -> b(a(a(a(a(a(b(a(a(a(b(a(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560 Node 535 is start node and node 536 is final node. Those nodes are connected through the following edges: * 535 to 537 labelled b_1(0)* 536 to 536 labelled #_1(0)* 537 to 538 labelled a_1(0)* 538 to 539 labelled a_1(0)* 539 to 540 labelled a_1(0)* 540 to 541 labelled a_1(0)* 541 to 542 labelled a_1(0)* 542 to 543 labelled b_1(0)* 543 to 544 labelled a_1(0)* 544 to 545 labelled a_1(0)* 544 to 549 labelled b_1(1)* 545 to 546 labelled a_1(0)* 546 to 547 labelled b_1(0)* 547 to 548 labelled a_1(0)* 547 to 549 labelled b_1(1)* 548 to 536 labelled a_1(0)* 548 to 549 labelled b_1(1)* 549 to 550 labelled a_1(1)* 550 to 551 labelled a_1(1)* 551 to 552 labelled a_1(1)* 552 to 553 labelled a_1(1)* 553 to 554 labelled a_1(1)* 554 to 555 labelled b_1(1)* 555 to 556 labelled a_1(1)* 556 to 557 labelled a_1(1)* 556 to 549 labelled b_1(1)* 557 to 558 labelled a_1(1)* 558 to 559 labelled b_1(1)* 559 to 560 labelled a_1(1)* 559 to 549 labelled b_1(1)* 560 to 536 labelled a_1(1)* 560 to 549 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