Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487517663
details
property
value
status
complete
benchmark
abcbaaaaa-aaaaaabcbabcb.srs.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n031.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.82891106606 seconds
cpu usage
3.927833525
max memory
2.99737088E8
stage attributes
key
value
output-size
3454
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, 3 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(c(b(a(a(a(a(a(x1))))))))) -> a(a(a(a(a(a(b(c(b(a(b(c(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(c(b(a(x1))))))))) -> b(c(b(a(b(c(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(c(b(a(x1))))))))) -> b(c(b(a(b(c(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(c(b(x)))))))) -> b(c(b(a(b(c(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(c(b(x)))))))) -> b(c(b(a(b(c(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(c(b(x)))))))) -> b(c(b(a(b(c(b(a(a(a(a(a(x)))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425 Node 402 is start node and node 403 is final node. Those nodes are connected through the following edges: * 402 to 404 labelled b_1(0)* 403 to 403 labelled #_1(0)* 404 to 405 labelled c_1(0)* 405 to 406 labelled b_1(0)* 406 to 407 labelled a_1(0)* 407 to 408 labelled b_1(0)* 408 to 409 labelled c_1(0)* 409 to 410 labelled b_1(0)* 410 to 411 labelled a_1(0)* 410 to 415 labelled b_1(1)* 411 to 412 labelled a_1(0)* 411 to 415 labelled b_1(1)* 412 to 413 labelled a_1(0)* 412 to 415 labelled b_1(1)* 413 to 414 labelled a_1(0)* 413 to 415 labelled b_1(1)* 414 to 403 labelled a_1(0)* 414 to 415 labelled b_1(1)* 415 to 416 labelled c_1(1)* 416 to 417 labelled b_1(1)* 417 to 418 labelled a_1(1)* 418 to 419 labelled b_1(1)* 419 to 420 labelled c_1(1)* 420 to 421 labelled b_1(1)* 421 to 422 labelled a_1(1)* 421 to 415 labelled b_1(1)* 422 to 423 labelled a_1(1)* 422 to 415 labelled b_1(1)* 423 to 424 labelled a_1(1)* 423 to 415 labelled b_1(1)* 424 to 425 labelled a_1(1)* 424 to 415 labelled b_1(1)* 425 to 403 labelled a_1(1)* 425 to 415 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