Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487517951
details
property
value
status
complete
benchmark
abaaaa-aaaaabaabaab.srs.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.63789105415 seconds
cpu usage
3.693326165
max memory
2.75677184E8
stage attributes
key
value
output-size
3256
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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, 7 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(a(a(x1)))))) -> a(a(a(a(a(b(a(a(b(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(b(a(x1)))))) -> b(a(a(b(a(a(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(a(x1)))))) -> b(a(a(b(a(a(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(x))))) -> b(a(a(b(a(a(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(x))))) -> b(a(a(b(a(a(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(x))))) -> b(a(a(b(a(a(b(a(a(a(a(x))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188 Node 167 is start node and node 168 is final node. Those nodes are connected through the following edges: * 167 to 169 labelled b_1(0)* 168 to 168 labelled #_1(0)* 169 to 170 labelled a_1(0)* 170 to 171 labelled a_1(0)* 171 to 172 labelled b_1(0)* 172 to 173 labelled a_1(0)* 173 to 174 labelled a_1(0)* 174 to 175 labelled b_1(0)* 175 to 176 labelled a_1(0)* 175 to 179 labelled b_1(1)* 176 to 177 labelled a_1(0)* 176 to 179 labelled b_1(1)* 177 to 178 labelled a_1(0)* 177 to 179 labelled b_1(1)* 178 to 168 labelled a_1(0)* 178 to 179 labelled b_1(1)* 179 to 180 labelled a_1(1)* 180 to 181 labelled a_1(1)* 181 to 182 labelled b_1(1)* 182 to 183 labelled a_1(1)* 183 to 184 labelled a_1(1)* 184 to 185 labelled b_1(1)* 185 to 186 labelled a_1(1)* 185 to 179 labelled b_1(1)* 186 to 187 labelled a_1(1)* 186 to 179 labelled b_1(1)* 187 to 188 labelled a_1(1)* 187 to 179 labelled b_1(1)* 188 to 168 labelled a_1(1)* 188 to 179 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