YES proof of prog.inttrs # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given IRSwT could be proven: (0) IRSwT (1) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (2) IRSwT (3) IRSwTTerminationDigraphProof [EQUIVALENT, 640 ms] (4) AND (5) IRSwT (6) IntTRSCompressionProof [EQUIVALENT, 33 ms] (7) IRSwT (8) TempFilterProof [SOUND, 63 ms] (9) IntTRS (10) PolynomialOrderProcessor [EQUIVALENT, 24 ms] (11) YES (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 8 ms] (14) IRSwT (15) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (16) IRSwT (17) FilterProof [EQUIVALENT, 0 ms] (18) IntTRS (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IntTRS (21) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Rules: f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6) -> f672_0_main_GE(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P) :|: 2 = arg5P && 0 = arg3P && 1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg1P <= arg1 && -1 <= arg6P - 1 && 1 <= arg2 - 1 && -1 <= arg4P - 1 f672_0_main_GE(x, x1, x2, x3, x4, x5) -> f672_0_main_GE(x7, x8, x9, x10, x11, x12) :|: -1 <= x4 - 1 && x2 <= x3 - 1 && 0 <= x3 - 1 && 1 <= x13 - 1 && -1 <= x14 - 1 && x4 <= x13 - 1 && x7 <= x && x7 <= x1 && 0 <= x - 1 && 0 <= x1 - 1 && 0 <= x7 - 1 && 3 <= x8 - 1 && x5 + 2 <= x1 && x2 + 1 = x9 && x3 = x10 && x4 + 1 = x11 f672_0_main_GE(x15, x17, x18, x19, x20, x21) -> f672_0_main_GE(x22, x23, x24, x25, x26, x27) :|: -1 <= x20 - 1 && x18 <= x19 - 1 && 0 <= x19 - 1 && 1 <= x29 - 1 && -1 <= x30 - 1 && x20 <= x29 - 1 && x22 <= x15 && x22 <= x17 && 0 <= x15 - 1 && 0 <= x17 - 1 && 0 <= x22 - 1 && 2 <= x23 - 1 && x21 + 2 <= x17 && x18 + 1 = x24 && x19 = x25 && x20 + 1 = x26 f672_0_main_GE(x31, x32, x33, x34, x35, x36) -> f765_0_insert_GT(x37, x39, x40, x41, x42, x43) :|: -1 <= x35 - 1 && x33 <= x34 - 1 && 0 <= x34 - 1 && 1 <= x44 - 1 && -1 <= x39 - 1 && x35 <= x44 - 1 && x37 <= x32 && 0 <= x31 - 1 && 0 <= x32 - 1 && 0 <= x37 - 1 && x36 + 2 <= x32 && x36 = x40 f765_0_insert_GT(x45, x46, x47, x48, x49, x51) -> f765_0_insert_GT(x52, x53, x54, x55, x56, x57) :|: x46 = x53 && x54 + 4 <= x45 && x47 + 2 <= x45 && 0 <= x52 - 1 && 2 <= x45 - 1 && x47 <= x46 - 1 && x52 + 2 <= x45 f765_0_insert_GT(x58, x59, x60, x61, x62, x63) -> f765_0_insert_GT(x64, x65, x66, x67, x68, x69) :|: x59 = x65 && x66 + 4 <= x58 && x60 + 2 <= x58 && 0 <= x64 - 1 && 2 <= x58 - 1 && x59 <= x60 && x64 + 2 <= x58 __init(x70, x71, x72, x73, x74, x75) -> f1_0_main_Load(x76, x77, x78, x79, x80, x81) :|: 0 <= 0 Start term: __init(arg1, arg2, arg3, arg4, arg5, arg6) ---------------------------------------- (1) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (2) Obligation: Rules: f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6) -> f672_0_main_GE(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P) :|: 2 = arg5P && 0 = arg3P && 1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg1P <= arg1 && -1 <= arg6P - 1 && 1 <= arg2 - 1 && -1 <= arg4P - 1 f672_0_main_GE(x, x1, x2, x3, x4, x5) -> f672_0_main_GE(x7, x8, x9, x10, x11, x12) :|: -1 <= x4 - 1 && x2 <= x3 - 1 && 0 <= x3 - 1 && 1 <= x13 - 1 && -1 <= x14 - 1 && x4 <= x13 - 1 && x7 <= x && x7 <= x1 && 0 <= x - 1 && 0 <= x1 - 1 && 0 <= x7 - 1 && 3 <= x8 - 1 && x5 + 2 <= x1 && x2 + 1 = x9 && x3 = x10 && x4 + 1 = x11 f672_0_main_GE(x15, x17, x18, x19, x20, x21) -> f672_0_main_GE(x22, x23, x24, x25, x26, x27) :|: -1 <= x20 - 1 && x18 <= x19 - 1 && 0 <= x19 - 1 && 1 <= x29 - 1 && -1 <= x30 - 1 && x20 <= x29 - 1 && x22 <= x15 && x22 <= x17 && 0 <= x15 - 1 && 0 <= x17 - 1 && 0 <= x22 - 1 && 2 <= x23 - 1 && x21 + 2 <= x17 && x18 + 1 = x24 && x19 = x25 && x20 + 1 = x26 f672_0_main_GE(x31, x32, x33, x34, x35, x36) -> f765_0_insert_GT(x37, x39, x40, x41, x42, x43) :|: -1 <= x35 - 1 && x33 <= x34 - 1 && 0 <= x34 - 1 && 1 <= x44 - 1 && -1 <= x39 - 1 && x35 <= x44 - 1 && x37 <= x32 && 0 <= x31 - 1 && 0 <= x32 - 1 && 0 <= x37 - 1 && x36 + 2 <= x32 && x36 = x40 f765_0_insert_GT(x45, x46, x47, x48, x49, x51) -> f765_0_insert_GT(x52, x53, x54, x55, x56, x57) :|: x46 = x53 && x54 + 4 <= x45 && x47 + 2 <= x45 && 0 <= x52 - 1 && 2 <= x45 - 1 && x47 <= x46 - 1 && x52 + 2 <= x45 f765_0_insert_GT(x58, x59, x60, x61, x62, x63) -> f765_0_insert_GT(x64, x65, x66, x67, x68, x69) :|: x59 = x65 && x66 + 4 <= x58 && x60 + 2 <= x58 && 0 <= x64 - 1 && 2 <= x58 - 1 && x59 <= x60 && x64 + 2 <= x58 __init(x70, x71, x72, x73, x74, x75) -> f1_0_main_Load(x76, x77, x78, x79, x80, x81) :|: 0 <= 0 Start term: __init(arg1, arg2, arg3, arg4, arg5, arg6) ---------------------------------------- (3) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6) -> f672_0_main_GE(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P) :|: 2 = arg5P && 0 = arg3P && 1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg1P <= arg1 && -1 <= arg6P - 1 && 1 <= arg2 - 1 && -1 <= arg4P - 1 (2) f672_0_main_GE(x, x1, x2, x3, x4, x5) -> f672_0_main_GE(x7, x8, x9, x10, x11, x12) :|: -1 <= x4 - 1 && x2 <= x3 - 1 && 0 <= x3 - 1 && 1 <= x13 - 1 && -1 <= x14 - 1 && x4 <= x13 - 1 && x7 <= x && x7 <= x1 && 0 <= x - 1 && 0 <= x1 - 1 && 0 <= x7 - 1 && 3 <= x8 - 1 && x5 + 2 <= x1 && x2 + 1 = x9 && x3 = x10 && x4 + 1 = x11 (3) f672_0_main_GE(x15, x17, x18, x19, x20, x21) -> f672_0_main_GE(x22, x23, x24, x25, x26, x27) :|: -1 <= x20 - 1 && x18 <= x19 - 1 && 0 <= x19 - 1 && 1 <= x29 - 1 && -1 <= x30 - 1 && x20 <= x29 - 1 && x22 <= x15 && x22 <= x17 && 0 <= x15 - 1 && 0 <= x17 - 1 && 0 <= x22 - 1 && 2 <= x23 - 1 && x21 + 2 <= x17 && x18 + 1 = x24 && x19 = x25 && x20 + 1 = x26 (4) f672_0_main_GE(x31, x32, x33, x34, x35, x36) -> f765_0_insert_GT(x37, x39, x40, x41, x42, x43) :|: -1 <= x35 - 1 && x33 <= x34 - 1 && 0 <= x34 - 1 && 1 <= x44 - 1 && -1 <= x39 - 1 && x35 <= x44 - 1 && x37 <= x32 && 0 <= x31 - 1 && 0 <= x32 - 1 && 0 <= x37 - 1 && x36 + 2 <= x32 && x36 = x40 (5) f765_0_insert_GT(x45, x46, x47, x48, x49, x51) -> f765_0_insert_GT(x52, x53, x54, x55, x56, x57) :|: x46 = x53 && x54 + 4 <= x45 && x47 + 2 <= x45 && 0 <= x52 - 1 && 2 <= x45 - 1 && x47 <= x46 - 1 && x52 + 2 <= x45 (6) f765_0_insert_GT(x58, x59, x60, x61, x62, x63) -> f765_0_insert_GT(x64, x65, x66, x67, x68, x69) :|: x59 = x65 && x66 + 4 <= x58 && x60 + 2 <= x58 && 0 <= x64 - 1 && 2 <= x58 - 1 && x59 <= x60 && x64 + 2 <= x58 (7) __init(x70, x71, x72, x73, x74, x75) -> f1_0_main_Load(x76, x77, x78, x79, x80, x81) :|: 0 <= 0 Arcs: (1) -> (2), (3), (4) (2) -> (2), (3), (4) (3) -> (2), (3), (4) (4) -> (5), (6) (5) -> (5), (6) (6) -> (5), (6) (7) -> (1) This digraph is fully evaluated! ---------------------------------------- (4) Complex Obligation (AND) ---------------------------------------- (5) Obligation: Termination digraph: Nodes: (1) f672_0_main_GE(x, x1, x2, x3, x4, x5) -> f672_0_main_GE(x7, x8, x9, x10, x11, x12) :|: -1 <= x4 - 1 && x2 <= x3 - 1 && 0 <= x3 - 1 && 1 <= x13 - 1 && -1 <= x14 - 1 && x4 <= x13 - 1 && x7 <= x && x7 <= x1 && 0 <= x - 1 && 0 <= x1 - 1 && 0 <= x7 - 1 && 3 <= x8 - 1 && x5 + 2 <= x1 && x2 + 1 = x9 && x3 = x10 && x4 + 1 = x11 (2) f672_0_main_GE(x15, x17, x18, x19, x20, x21) -> f672_0_main_GE(x22, x23, x24, x25, x26, x27) :|: -1 <= x20 - 1 && x18 <= x19 - 1 && 0 <= x19 - 1 && 1 <= x29 - 1 && -1 <= x30 - 1 && x20 <= x29 - 1 && x22 <= x15 && x22 <= x17 && 0 <= x15 - 1 && 0 <= x17 - 1 && 0 <= x22 - 1 && 2 <= x23 - 1 && x21 + 2 <= x17 && x18 + 1 = x24 && x19 = x25 && x20 + 1 = x26 Arcs: (1) -> (1), (2) (2) -> (1), (2) This digraph is fully evaluated! ---------------------------------------- (6) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (7) Obligation: Rules: f672_0_main_GE(x15:0, x17:0, x18:0, x19:0, x20:0, x21:0) -> f672_0_main_GE(x22:0, x23:0, x18:0 + 1, x19:0, x20:0 + 1, x27:0) :|: x23:0 > 2 && x21:0 + 2 <= x17:0 && x22:0 > 0 && x17:0 > 0 && x15:0 > 0 && x22:0 <= x17:0 && x22:0 <= x15:0 && x29:0 - 1 >= x20:0 && x30:0 > -1 && x29:0 > 1 && x19:0 > 0 && x19:0 - 1 >= x18:0 && x20:0 > -1 f672_0_main_GE(x:0, x1:0, x2:0, x10:0, x4:0, x5:0) -> f672_0_main_GE(x7:0, x8:0, x2:0 + 1, x10:0, x4:0 + 1, x12:0) :|: x8:0 > 3 && x5:0 + 2 <= x1:0 && x7:0 > 0 && x1:0 > 0 && x:0 > 0 && x7:0 <= x1:0 && x:0 >= x7:0 && x4:0 <= x13:0 - 1 && x14:0 > -1 && x13:0 > 1 && x10:0 > 0 && x2:0 <= x10:0 - 1 && x4:0 > -1 ---------------------------------------- (8) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f672_0_main_GE(INTEGER, INTEGER, INTEGER, INTEGER, INTEGER, VARIABLE) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (9) Obligation: Rules: f672_0_main_GE(x15:0, x17:0, x18:0, x19:0, x20:0, x21:0) -> f672_0_main_GE(x22:0, x23:0, c, x19:0, c1, x27:0) :|: c1 = x20:0 + 1 && c = x18:0 + 1 && (x23:0 > 2 && x21:0 + 2 <= x17:0 && x22:0 > 0 && x17:0 > 0 && x15:0 > 0 && x22:0 <= x17:0 && x22:0 <= x15:0 && x29:0 - 1 >= x20:0 && x30:0 > -1 && x29:0 > 1 && x19:0 > 0 && x19:0 - 1 >= x18:0 && x20:0 > -1) f672_0_main_GE(x:0, x1:0, x2:0, x10:0, x4:0, x5:0) -> f672_0_main_GE(x7:0, x8:0, c2, x10:0, c3, x12:0) :|: c3 = x4:0 + 1 && c2 = x2:0 + 1 && (x8:0 > 3 && x5:0 + 2 <= x1:0 && x7:0 > 0 && x1:0 > 0 && x:0 > 0 && x7:0 <= x1:0 && x:0 >= x7:0 && x4:0 <= x13:0 - 1 && x14:0 > -1 && x13:0 > 1 && x10:0 > 0 && x2:0 <= x10:0 - 1 && x4:0 > -1) ---------------------------------------- (10) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f672_0_main_GE(x, x1, x2, x3, x4, x5)] = -1 - x2 + x3 The following rules are decreasing: f672_0_main_GE(x15:0, x17:0, x18:0, x19:0, x20:0, x21:0) -> f672_0_main_GE(x22:0, x23:0, c, x19:0, c1, x27:0) :|: c1 = x20:0 + 1 && c = x18:0 + 1 && (x23:0 > 2 && x21:0 + 2 <= x17:0 && x22:0 > 0 && x17:0 > 0 && x15:0 > 0 && x22:0 <= x17:0 && x22:0 <= x15:0 && x29:0 - 1 >= x20:0 && x30:0 > -1 && x29:0 > 1 && x19:0 > 0 && x19:0 - 1 >= x18:0 && x20:0 > -1) f672_0_main_GE(x:0, x1:0, x2:0, x10:0, x4:0, x5:0) -> f672_0_main_GE(x7:0, x8:0, c2, x10:0, c3, x12:0) :|: c3 = x4:0 + 1 && c2 = x2:0 + 1 && (x8:0 > 3 && x5:0 + 2 <= x1:0 && x7:0 > 0 && x1:0 > 0 && x:0 > 0 && x7:0 <= x1:0 && x:0 >= x7:0 && x4:0 <= x13:0 - 1 && x14:0 > -1 && x13:0 > 1 && x10:0 > 0 && x2:0 <= x10:0 - 1 && x4:0 > -1) The following rules are bounded: f672_0_main_GE(x15:0, x17:0, x18:0, x19:0, x20:0, x21:0) -> f672_0_main_GE(x22:0, x23:0, c, x19:0, c1, x27:0) :|: c1 = x20:0 + 1 && c = x18:0 + 1 && (x23:0 > 2 && x21:0 + 2 <= x17:0 && x22:0 > 0 && x17:0 > 0 && x15:0 > 0 && x22:0 <= x17:0 && x22:0 <= x15:0 && x29:0 - 1 >= x20:0 && x30:0 > -1 && x29:0 > 1 && x19:0 > 0 && x19:0 - 1 >= x18:0 && x20:0 > -1) f672_0_main_GE(x:0, x1:0, x2:0, x10:0, x4:0, x5:0) -> f672_0_main_GE(x7:0, x8:0, c2, x10:0, c3, x12:0) :|: c3 = x4:0 + 1 && c2 = x2:0 + 1 && (x8:0 > 3 && x5:0 + 2 <= x1:0 && x7:0 > 0 && x1:0 > 0 && x:0 > 0 && x7:0 <= x1:0 && x:0 >= x7:0 && x4:0 <= x13:0 - 1 && x14:0 > -1 && x13:0 > 1 && x10:0 > 0 && x2:0 <= x10:0 - 1 && x4:0 > -1) ---------------------------------------- (11) YES ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) f765_0_insert_GT(x45, x46, x47, x48, x49, x51) -> f765_0_insert_GT(x52, x53, x54, x55, x56, x57) :|: x46 = x53 && x54 + 4 <= x45 && x47 + 2 <= x45 && 0 <= x52 - 1 && 2 <= x45 - 1 && x47 <= x46 - 1 && x52 + 2 <= x45 (2) f765_0_insert_GT(x58, x59, x60, x61, x62, x63) -> f765_0_insert_GT(x64, x65, x66, x67, x68, x69) :|: x59 = x65 && x66 + 4 <= x58 && x60 + 2 <= x58 && 0 <= x64 - 1 && 2 <= x58 - 1 && x59 <= x60 && x64 + 2 <= x58 Arcs: (1) -> (1), (2) (2) -> (1), (2) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: f765_0_insert_GT(x45:0, x46:0, x47:0, x48:0, x49:0, x51:0) -> f765_0_insert_GT(x52:0, x46:0, x54:0, x55:0, x56:0, x57:0) :|: x47:0 <= x46:0 - 1 && x52:0 + 2 <= x45:0 && x45:0 > 2 && x52:0 > 0 && x54:0 + 4 <= x45:0 && x47:0 + 2 <= x45:0 f765_0_insert_GT(x58:0, x59:0, x60:0, x61:0, x62:0, x63:0) -> f765_0_insert_GT(x64:0, x59:0, x66:0, x67:0, x68:0, x69:0) :|: x60:0 >= x59:0 && x64:0 + 2 <= x58:0 && x58:0 > 2 && x64:0 > 0 && x66:0 + 4 <= x58:0 && x60:0 + 2 <= x58:0 ---------------------------------------- (15) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f765_0_insert_GT(x1, x2, x3, x4, x5, x6) -> f765_0_insert_GT(x1, x2, x3) ---------------------------------------- (16) Obligation: Rules: f765_0_insert_GT(x45:0, x46:0, x47:0) -> f765_0_insert_GT(x52:0, x46:0, x54:0) :|: x47:0 <= x46:0 - 1 && x52:0 + 2 <= x45:0 && x45:0 > 2 && x52:0 > 0 && x54:0 + 4 <= x45:0 && x47:0 + 2 <= x45:0 f765_0_insert_GT(x58:0, x59:0, x60:0) -> f765_0_insert_GT(x64:0, x59:0, x66:0) :|: x60:0 >= x59:0 && x64:0 + 2 <= x58:0 && x58:0 > 2 && x64:0 > 0 && x66:0 + 4 <= x58:0 && x60:0 + 2 <= x58:0 ---------------------------------------- (17) FilterProof (EQUIVALENT) Used the following sort dictionary for filtering: f765_0_insert_GT(INTEGER, INTEGER, INTEGER) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (18) Obligation: Rules: f765_0_insert_GT(x45:0, x46:0, x47:0) -> f765_0_insert_GT(x52:0, x46:0, x54:0) :|: x47:0 <= x46:0 - 1 && x52:0 + 2 <= x45:0 && x45:0 > 2 && x52:0 > 0 && x54:0 + 4 <= x45:0 && x47:0 + 2 <= x45:0 f765_0_insert_GT(x58:0, x59:0, x60:0) -> f765_0_insert_GT(x64:0, x59:0, x66:0) :|: x60:0 >= x59:0 && x64:0 + 2 <= x58:0 && x58:0 > 2 && x64:0 > 0 && x66:0 + 4 <= x58:0 && x60:0 + 2 <= x58:0 ---------------------------------------- (19) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (20) Obligation: Rules: f765_0_insert_GT(x58:0:0, x59:0:0, x60:0:0) -> f765_0_insert_GT(x64:0:0, x59:0:0, x66:0:0) :|: x66:0:0 + 4 <= x58:0:0 && x60:0:0 + 2 <= x58:0:0 && x64:0:0 > 0 && x58:0:0 > 2 && x64:0:0 + 2 <= x58:0:0 && x60:0:0 >= x59:0:0 f765_0_insert_GT(x45:0:0, x46:0:0, x47:0:0) -> f765_0_insert_GT(x52:0:0, x46:0:0, x54:0:0) :|: x54:0:0 + 4 <= x45:0:0 && x47:0:0 + 2 <= x45:0:0 && x52:0:0 > 0 && x45:0:0 > 2 && x52:0:0 + 2 <= x45:0:0 && x47:0:0 <= x46:0:0 - 1 ---------------------------------------- (21) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f765_0_insert_GT(x, x1, x2)] = x The following rules are decreasing: f765_0_insert_GT(x58:0:0, x59:0:0, x60:0:0) -> f765_0_insert_GT(x64:0:0, x59:0:0, x66:0:0) :|: x66:0:0 + 4 <= x58:0:0 && x60:0:0 + 2 <= x58:0:0 && x64:0:0 > 0 && x58:0:0 > 2 && x64:0:0 + 2 <= x58:0:0 && x60:0:0 >= x59:0:0 f765_0_insert_GT(x45:0:0, x46:0:0, x47:0:0) -> f765_0_insert_GT(x52:0:0, x46:0:0, x54:0:0) :|: x54:0:0 + 4 <= x45:0:0 && x47:0:0 + 2 <= x45:0:0 && x52:0:0 > 0 && x45:0:0 > 2 && x52:0:0 + 2 <= x45:0:0 && x47:0:0 <= x46:0:0 - 1 The following rules are bounded: f765_0_insert_GT(x58:0:0, x59:0:0, x60:0:0) -> f765_0_insert_GT(x64:0:0, x59:0:0, x66:0:0) :|: x66:0:0 + 4 <= x58:0:0 && x60:0:0 + 2 <= x58:0:0 && x64:0:0 > 0 && x58:0:0 > 2 && x64:0:0 + 2 <= x58:0:0 && x60:0:0 >= x59:0:0 f765_0_insert_GT(x45:0:0, x46:0:0, x47:0:0) -> f765_0_insert_GT(x52:0:0, x46:0:0, x54:0:0) :|: x54:0:0 + 4 <= x45:0:0 && x47:0:0 + 2 <= x45:0:0 && x52:0:0 > 0 && x45:0:0 > 2 && x52:0:0 + 2 <= x45:0:0 && x47:0:0 <= x46:0:0 - 1 ---------------------------------------- (22) YES