details

property	value
status	complete
benchmark	z097.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n104.star.cs.uiowa.edu
space	Zantema_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.69024085999 seconds
cpu usage	3.916843003
max memory	2.88247808E8

stage attributes

key	value
output-size	5312
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: 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) RFCMatchBoundsTRSProof [EQUIVALENT, 1 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(a(b(b(x1))))) -> b(b(b(b(b(a(a(a(a(a(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: b(b(a(a(a(x1))))) -> a(a(a(a(a(b(b(b(b(b(x1)))))))))) Q is empty. ---------------------------------------- (3) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 3. This implies Q-termination of R. The following rules were used to construct the certificate: b(b(a(a(a(x1))))) -> a(a(a(a(a(b(b(b(b(b(x1)))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 2, 4, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 131, 132, 133, 134, 135, 136, 137, 138, 139, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175 Node 2 is start node and node 4 is final node. Those nodes are connected through the following edges: * 2 to 32 labelled a_1(0)* 4 to 4 labelled #_1(0)* 32 to 33 labelled a_1(0)* 33 to 34 labelled a_1(0)* 34 to 35 labelled a_1(0)* 35 to 36 labelled a_1(0)* 36 to 37 labelled b_1(0)* 36 to 77 labelled a_1(1)* 37 to 38 labelled b_1(0)* 37 to 50 labelled a_1(1)* 38 to 39 labelled b_1(0)* 38 to 50 labelled a_1(1)* 39 to 40 labelled b_1(0)* 39 to 41 labelled a_1(1)* 40 to 4 labelled b_1(0)* 40 to 41 labelled a_1(1)* 41 to 42 labelled a_1(1)* 42 to 43 labelled a_1(1)* 43 to 44 labelled a_1(1)* 44 to 45 labelled a_1(1)* 45 to 46 labelled b_1(1)* 45 to 104 labelled a_1(2)* 46 to 47 labelled b_1(1)* 46 to 86 labelled a_1(2)* 47 to 48 labelled b_1(1)* 47 to 86 labelled a_1(2)* 48 to 49 labelled b_1(1)* 48 to 41 labelled a_1(1)* 49 to 4 labelled b_1(1)* 49 to 41 labelled a_1(1)* 50 to 51 labelled a_1(1)* 51 to 52 labelled a_1(1)* 52 to 53 labelled a_1(1)* 53 to 54 labelled a_1(1)* 54 to 55 labelled b_1(1)* 55 to 56 labelled b_1(1)* 55 to 131 labelled a_1(2)* 56 to 57 labelled b_1(1)* 57 to 58 labelled b_1(1)* 57 to 113 labelled a_1(2)* 58 to 43 labelled b_1(1)* 77 to 78 labelled a_1(1)* 78 to 79 labelled a_1(1)* 79 to 80 labelled a_1(1)* 80 to 81 labelled a_1(1)* 81 to 82 labelled b_1(1)* 82 to 83 labelled b_1(1)* 83 to 84 labelled b_1(1)* 84 to 85 labelled b_1(1)* 85 to 52 labelled b_1(1)* 86 to 87 labelled a_1(2)* 87 to 88 labelled a_1(2)* 88 to 89 labelled a_1(2)* 89 to 90 labelled a_1(2)* 90 to 91 labelled b_1(2)* 91 to 92 labelled b_1(2)* 91 to 149 labelled a_1(3)* 92 to 93 labelled b_1(2)* 93 to 94 labelled b_1(2)* 93 to 113 labelled a_1(2)* 94 to 43 labelled b_1(2)* 104 to 105 labelled a_1(2)* 105 to 106 labelled a_1(2)* 106 to 107 labelled a_1(2)* 107 to 108 labelled a_1(2)* 108 to 109 labelled b_1(2)* 109 to 110 labelled b_1(2)* 110 to 111 labelled b_1(2)* 111 to 112 labelled b_1(2)* 112 to 88 labelled b_1(2)* 113 to 114 labelled a_1(2)* 114 to 115 labelled a_1(2)* 115 to 116 labelled a_1(2)* 116 to 117 labelled a_1(2)* 117 to 118 labelled b_1(2)* 118 to 119 labelled b_1(2)* 118 to 167 labelled a_1(3)* 119 to 120 labelled b_1(2)* 120 to 121 labelled b_1(2)* 120 to 158 labelled a_1(3)* 121 to 104 labelled b_1(2)* 131 to 132 labelled a_1(2)* 132 to 133 labelled a_1(2)* 133 to 134 labelled a_1(2)* 134 to 135 labelled a_1(2)* 135 to 136 labelled b_1(2)* 136 to 137 labelled b_1(2)* 137 to 138 labelled b_1(2)* 138 to 139 labelled b_1(2)* 139 to 115 labelled b_1(2)* 149 to 150 labelled a_1(3)* 150 to 151 labelled a_1(3)* 151 to 152 labelled a_1(3)* 152 to 153 labelled a_1(3)* 153 to 154 labelled b_1(3)* 154 to 155 labelled b_1(3)* 155 to 156 labelled b_1(3)* 156 to 157 labelled b_1(3)* 157 to 115 labelled b_1(3)* 158 to 159 labelled a_1(3)* 159 to 160 labelled a_1(3)* 160 to 161 labelled a_1(3)* 161 to 162 labelled a_1(3)* 162 to 163 labelled b_1(3)* 163 to 164 labelled b_1(3)* 164 to 165 labelled b_1(3)* 165 to 166 labelled b_1(3)* 166 to 107 labelled b_1(3)* 167 to 168 labelled a_1(3)* 168 to 169 labelled a_1(3)* 169 to 170 labelled a_1(3)* 170 to 171 labelled a_1(3)* 171 to 172 labelled b_1(3)* 172 to 173 labelled b_1(3)* 173 to 174 labelled b_1(3)* 174 to 175 labelled b_1(3)* 175 to 160 labelled b_1(3) ---------------------------------------- (4) YES popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Stand 10685