Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487518761
details
property
value
status
complete
benchmark
abbaaaa-aaaaabbaabb.srs.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n116.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.24432396889 seconds
cpu usage
4.135243508
max memory
2.82976256E8
stage attributes
key
value
output-size
3194
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, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(b(a(a(a(a(x1))))))) -> a(a(a(a(a(b(b(a(a(b(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(b(b(a(x1))))))) -> b(b(a(a(b(b(a(a(a(a(a(x1))))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(a(a(a(b(b(a(x1))))))) -> b(b(a(a(b(b(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(b(b(x)))))) -> b(b(a(a(b(b(a(a(a(a(x)))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(a(b(b(x)))))) -> b(b(a(a(b(b(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(b(b(x)))))) -> b(b(a(a(b(b(a(a(a(a(x)))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 409, 410, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448 Node 409 is start node and node 410 is final node. Those nodes are connected through the following edges: * 409 to 431 labelled b_1(0)* 410 to 410 labelled #_1(0)* 431 to 432 labelled b_1(0)* 432 to 433 labelled a_1(0)* 433 to 434 labelled a_1(0)* 434 to 435 labelled b_1(0)* 435 to 436 labelled b_1(0)* 436 to 437 labelled a_1(0)* 436 to 440 labelled b_1(1)* 437 to 438 labelled a_1(0)* 437 to 440 labelled b_1(1)* 438 to 439 labelled a_1(0)* 438 to 440 labelled b_1(1)* 439 to 410 labelled a_1(0)* 439 to 440 labelled b_1(1)* 440 to 441 labelled b_1(1)* 441 to 442 labelled a_1(1)* 442 to 443 labelled a_1(1)* 443 to 444 labelled b_1(1)* 444 to 445 labelled b_1(1)* 445 to 446 labelled a_1(1)* 445 to 440 labelled b_1(1)* 446 to 447 labelled a_1(1)* 446 to 440 labelled b_1(1)* 447 to 448 labelled a_1(1)* 447 to 440 labelled b_1(1)* 448 to 410 labelled a_1(1)* 448 to 440 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