details

property	value
status	complete
benchmark	abaaaaaaaa-aaaaaaaaabaaab.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n091.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.77019476891 seconds
cpu usage	4.077951964
max memory	2.40021504E8

stage attributes

key	value
output-size	3711
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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(a(a(a(a(x1)))))))))) -> a(a(a(a(a(a(a(a(a(b(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(a(a(a(a(a(a(b(a(x1)))))))))) -> b(a(a(a(b(a(a(a(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(a(a(a(b(a(x1)))))))))) -> b(a(a(a(b(a(a(a(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(a(a(a(b(x))))))))) -> b(a(a(a(b(a(a(a(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(a(a(a(b(x))))))))) -> b(a(a(a(b(a(a(a(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(a(a(a(b(x))))))))) -> b(a(a(a(b(a(a(a(a(a(a(a(a(x))))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 71, 72, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157 Node 71 is start node and node 72 is final node. Those nodes are connected through the following edges: * 71 to 134 labelled b_1(0)* 72 to 72 labelled #_1(0)* 134 to 135 labelled a_1(0)* 135 to 136 labelled a_1(0)* 136 to 137 labelled a_1(0)* 137 to 138 labelled b_1(0)* 138 to 139 labelled a_1(0)* 138 to 146 labelled b_1(1)* 139 to 140 labelled a_1(0)* 139 to 146 labelled b_1(1)* 140 to 141 labelled a_1(0)* 140 to 146 labelled b_1(1)* 141 to 142 labelled a_1(0)* 141 to 146 labelled b_1(1)* 142 to 143 labelled a_1(0)* 142 to 146 labelled b_1(1)* 143 to 144 labelled a_1(0)* 143 to 146 labelled b_1(1)* 144 to 145 labelled a_1(0)* 144 to 146 labelled b_1(1)* 145 to 72 labelled a_1(0)* 145 to 146 labelled b_1(1)* 146 to 147 labelled a_1(1)* 147 to 148 labelled a_1(1)* 148 to 149 labelled a_1(1)* 149 to 150 labelled b_1(1)* 150 to 151 labelled a_1(1)* 150 to 146 labelled b_1(1)* 151 to 152 labelled a_1(1)* 151 to 146 labelled b_1(1)* 152 to 153 labelled a_1(1)* 152 to 146 labelled b_1(1)* 153 to 154 labelled a_1(1)* 153 to 146 labelled b_1(1)* 154 to 155 labelled a_1(1)* 154 to 146 labelled b_1(1)* 155 to 156 labelled a_1(1)* 155 to 146 labelled b_1(1)* 156 to 157 labelled a_1(1)* 156 to 146 labelled b_1(1)* 157 to 72 labelled a_1(1)* 157 to 146 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 Stand 10685