/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES After renaming modulo { a->0, b->1 }, it remains to prove termination of the 3-rule system { 0 0 1 0 -> 0 1 0 1 , 1 1 0 1 -> 0 1 1 0 , 1 1 0 1 -> 0 0 0 0 } The length-preserving system was inverted. After renaming modulo { 0->0, 1->1 }, it remains to prove termination of the 3-rule system { 0 1 0 1 -> 0 0 1 0 , 0 1 1 0 -> 1 1 0 1 , 0 0 0 0 -> 1 1 0 1 } Applying the dependency pairs transformation. After renaming modulo { (0,true)->0, (1,false)->1, (0,false)->2 }, it remains to prove termination of the 8-rule system { 0 1 2 1 -> 0 2 1 2 , 0 1 2 1 -> 0 1 2 , 0 1 2 1 -> 0 , 0 1 1 2 -> 0 1 , 0 2 2 2 -> 0 1 , 2 1 2 1 ->= 2 2 1 2 , 2 1 1 2 ->= 1 1 2 1 , 2 2 2 2 ->= 1 1 2 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 2: 0 is interpreted by / \ | 1 0 | | 0 1 | \ / 1 is interpreted by / \ | 1 1 | | 0 1 | \ / 2 is interpreted by / \ | 1 1 | | 0 1 | \ / After renaming modulo { 0->0, 1->1, 2->2 }, it remains to prove termination of the 4-rule system { 0 1 2 1 -> 0 2 1 2 , 2 1 2 1 ->= 2 2 1 2 , 2 1 1 2 ->= 1 1 2 1 , 2 2 2 2 ->= 1 1 2 1 } The system was filtered by the following matrix interpretation of type E_J with J = {1,...,2} and dimension 5: 0 is interpreted by / \ | 1 0 1 0 0 | | 0 1 0 0 0 | | 0 0 0 0 0 | | 0 0 0 0 0 | | 0 0 0 0 0 | \ / 1 is interpreted by / \ | 1 0 0 0 0 | | 0 1 0 0 0 | | 0 0 0 1 0 | | 0 0 0 0 0 | | 0 1 0 0 0 | \ / 2 is interpreted by / \ | 1 0 0 0 0 | | 0 1 0 0 0 | | 0 0 0 0 0 | | 0 0 0 0 1 | | 0 1 0 0 0 | \ / After renaming modulo { 2->0, 1->1 }, it remains to prove termination of the 3-rule system { 0 1 0 1 ->= 0 0 1 0 , 0 1 1 0 ->= 1 1 0 1 , 0 0 0 0 ->= 1 1 0 1 } The system is trivially terminating.