Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487090150
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
n143.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.78016 seconds
cpu usage
4.26378
user time
4.06064
system time
0.203138
max virtual memory
1.8943252E7
max residence set size
376568.0
stage attributes
key
value
starexec-result
YES
output
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, 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(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: 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702 Node 653 is start node and node 654 is final node. Those nodes are connected through the following edges: * 653 to 655 labelled b_1(0)* 654 to 654 labelled #_1(0)* 655 to 656 labelled a_1(0)* 656 to 657 labelled b_1(0)* 657 to 658 labelled a_1(0)* 658 to 659 labelled b_1(0)* 659 to 660 labelled a_1(0)* 659 to 679 labelled b_1(1)* 660 to 661 labelled a_1(0)* 660 to 667 labelled b_1(1)* 661 to 662 labelled b_1(0)* 662 to 663 labelled a_1(0)* 662 to 667 labelled b_1(1)* 663 to 664 labelled b_1(0)* 664 to 665 labelled a_1(0)* 664 to 667 labelled b_1(1)* 665 to 666 labelled b_1(0)* 666 to 654 labelled a_1(0)* 666 to 667 labelled b_1(1)* 667 to 668 labelled a_1(1)* 668 to 669 labelled b_1(1)* 669 to 670 labelled a_1(1)* 670 to 671 labelled b_1(1)* 671 to 672 labelled a_1(1)* 671 to 691 labelled b_1(2)* 672 to 673 labelled a_1(1)* 672 to 667 labelled b_1(1)* 673 to 674 labelled b_1(1)* 674 to 675 labelled a_1(1)* 674 to 667 labelled b_1(1)* 675 to 676 labelled b_1(1)* 676 to 677 labelled a_1(1)* 676 to 667 labelled b_1(1)* 677 to 678 labelled b_1(1)* 678 to 654 labelled a_1(1)* 678 to 667 labelled b_1(1)* 679 to 680 labelled a_1(1)* 680 to 681 labelled b_1(1)* 681 to 682 labelled a_1(1)* 682 to 683 labelled b_1(1)* 683 to 684 labelled a_1(1)* 683 to 691 labelled b_1(2)* 684 to 685 labelled a_1(1)* 684 to 667 labelled b_1(1)* 685 to 686 labelled b_1(1)* 686 to 687 labelled a_1(1)* 687 to 688 labelled b_1(1)* 688 to 689 labelled a_1(1)* 689 to 690 labelled b_1(1)* 690 to 676 labelled a_1(1)* 690 to 691 labelled b_1(2)* 691 to 692 labelled a_1(2)* 692 to 693 labelled b_1(2)* 693 to 694 labelled a_1(2)* 694 to 695 labelled b_1(2)* 695 to 696 labelled a_1(2)* 695 to 691 labelled b_1(2)* 696 to 697 labelled a_1(2)* 696 to 667 labelled b_1(1)* 697 to 698 labelled b_1(2)* 698 to 699 labelled a_1(2)* 699 to 700 labelled b_1(2)* 700 to 701 labelled a_1(2)* 701 to 702 labelled b_1(2)* 702 to 676 labelled a_1(2)* 702 to 691 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