NO
proof of prog.inttrs
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given IRSwT could be disproven:

(0) IRSwT
(1) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(2) IRSwT
(3) IRSwTTerminationDigraphProof [EQUIVALENT, 3159 ms]
(4) AND
    (5) IRSwT
        (6) IntTRSCompressionProof [EQUIVALENT, 37 ms]
        (7) IRSwT
        (8) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (9) IRSwT
        (10) TempFilterProof [SOUND, 109 ms]
        (11) IntTRS
        (12) PolynomialOrderProcessor [EQUIVALENT, 17 ms]
        (13) AND
            (14) IntTRS
                (15) RankingReductionPairProof [EQUIVALENT, 0 ms]
                (16) YES
            (17) IntTRS
                (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
                (19) IntTRS
                (20) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
                (21) YES
    (22) IRSwT
        (23) IntTRSCompressionProof [EQUIVALENT, 8 ms]
        (24) IRSwT
        (25) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (26) IRSwT
        (27) TempFilterProof [SOUND, 49 ms]
        (28) IntTRS
        (29) RankingReductionPairProof [EQUIVALENT, 29 ms]
        (30) YES
    (31) IRSwT
        (32) IntTRSCompressionProof [EQUIVALENT, 8 ms]
        (33) IRSwT
        (34) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (35) IRSwT
        (36) FilterProof [EQUIVALENT, 0 ms]
        (37) IntTRS
        (38) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (39) IntTRS
        (40) IntTRSPeriodicNontermProof [COMPLETE, 6 ms]
        (41) NO
    (42) IRSwT
        (43) IntTRSCompressionProof [EQUIVALENT, 8 ms]
        (44) IRSwT
        (45) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (46) IRSwT
        (47) FilterProof [EQUIVALENT, 0 ms]
        (48) IntTRS
        (49) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (50) IntTRS
        (51) IntTRSPeriodicNontermProof [COMPLETE, 6 ms]
        (52) NO


----------------------------------------

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3, arg4, arg5, arg6) -> f686_0_main_InvokeMethod(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P) :|: -1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg1P <= arg1
f120_0_createList_Return(x, x1, x2, x3, x4, x5) -> f686_0_main_InvokeMethod(x6, x7, x8, x9, x10, x11) :|: -1 <= x7 - 1 && 0 <= x6 - 1 && 0 <= x - 1 && x7 + 1 <= x && x6 <= x
f1_0_main_Load(x12, x13, x14, x15, x16, x17) -> f922_0_createList_GE(x18, x19, x20, x21, x22, x23) :|: 0 = x22 && 0 = x21 && 0 = x20 && 0 = x19 && 0 = x13 && -1 <= x18 - 1 && 0 <= x12 - 1 && x18 + 1 <= x12
f1_0_main_Load(x24, x25, x26, x27, x28, x29) -> f922_0_createList_GE(x30, x31, x32, x33, x34, x35) :|: 1 = x34 && x25 = x33 && 0 = x32 && 0 = x31 && -1 <= x30 - 1 && 0 <= x24 - 1 && 0 <= x25 - 1 && x30 + 1 <= x24
f1_0_main_Load(x36, x37, x38, x39, x40, x41) -> f922_0_createList_GE(x42, x44, x45, x46, x47, x48) :|: 1 = x47 && x37 = x46 && 0 = x44 && -1 <= x42 - 1 && 0 <= x36 - 1 && x42 + 1 <= x36 && 0 <= x37 - 1 && -1 <= x45 - 1
f922_0_createList_GE(x49, x50, x51, x52, x53, x54) -> f922_0_createList_GE(x55, x56, x57, x58, x59, x60) :|: x53 = x59 && x52 = x58 && x51 = x57 && x50 + 1 = x56 && 1 <= x55 - 1 && -1 <= x49 - 1 && x55 - 2 <= x49 && -1 <= x52 - 1 && x50 <= x51 - 1 && x52 <= x53
f922_0_createList_GE(x61, x62, x63, x64, x65, x66) -> f922_0_createList_GE(x67, x68, x69, x70, x71, x72) :|: x65 = x71 && x64 = x70 && x63 = x69 && x62 + 1 = x68 && 4 <= x67 - 1 && 0 <= x61 - 1 && -1 <= x64 - 1 && x62 <= x63 - 1 && x64 <= x65
f922_0_createList_GE(x73, x74, x75, x76, x77, x78) -> f1114_0_createList_NULL(x79, x80, x81, x82, x83, x84) :|: x77 + 1 = x84 && x76 = x83 && x74 = x81 && x75 = x79 && -1 <= x82 - 1 && 1 <= x80 - 1 && -1 <= x73 - 1 && x82 <= x73 && -1 <= x77 - 1 && x77 <= x76 - 1 && x74 <= x75 - 1 && -1 <= x76 - 1
f922_0_createList_GE(x85, x86, x87, x88, x89, x90) -> f1114_0_createList_NULL(x91, x92, x93, x94, x95, x96) :|: -1 <= x88 - 1 && x86 <= x87 - 1 && x89 <= x88 - 1 && -1 <= x97 - 1 && -1 <= x89 - 1 && x94 <= x85 && -1 <= x85 - 1 && 1 <= x92 - 1 && -1 <= x94 - 1 && x87 = x91 && x86 = x93 && x88 = x95 && x89 + 1 = x96
f1114_0_createList_NULL(x98, x99, x100, x101, x102, x103) -> f922_0_createList_GE(x104, x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x98 = x106 && x100 + 1 = x105 && 1 <= x104 - 1 && -1 <= x101 - 1 && 1 <= x99 - 1 && x104 - 2 <= x101 && x104 <= x99
f1114_0_createList_NULL(x110, x111, x112, x113, x114, x115) -> f922_0_createList_GE(x116, x117, x118, x119, x120, x121) :|: x115 = x120 && x114 = x119 && x110 = x118 && x112 + 1 = x117 && 4 <= x116 - 1 && 0 <= x113 - 1 && 2 <= x111 - 1
f686_0_main_InvokeMethod(x122, x123, x124, x125, x126, x127) -> f744_0_getFirst_NONNULL(x128, x129, x130, x131, x132, x133) :|: x130 + 2 <= x123 && -1 <= x129 - 1 && 0 <= x128 - 1 && 0 <= x123 - 1 && 0 <= x122 - 1 && x128 <= x123
f744_0_getFirst_NONNULL(x134, x135, x136, x137, x138, x139) -> f744_0_getFirst_NONNULL(x140, x141, x142, x143, x144, x145) :|: x136 + 2 <= x134 && -1 <= x141 - 1 && 0 <= x140 - 1 && 0 <= x135 - 1 && 2 <= x134 - 1
f686_0_main_InvokeMethod(x146, x147, x148, x149, x150, x151) -> f1184_0_copyR_NULL(x152, x153, x154, x155, x156, x157) :|: -1 <= x154 - 1 && 1 <= x153 - 1 && 1 <= x152 - 1 && 0 <= x147 - 1 && 0 <= x146 - 1 && x154 + 1 <= x147 && x154 + 1 <= x146
f1184_0_copyR_NULL(x158, x159, x160, x161, x162, x163) -> f1184_0_copyR_NULL(x164, x165, x166, x167, x168, x169) :|: 1 <= x166 - 1 && 1 <= x165 - 1 && 0 <= x164 - 1 && -1 <= x160 - 1 && 1 <= x159 - 1 && 2 <= x158 - 1 && x166 - 2 <= x160 && x166 <= x159 && x166 + 1 <= x158
f1184_0_copyR_NULL(x170, x171, x172, x173, x174, x175) -> f1184_0_copyR_NULL(x176, x177, x178, x179, x180, x181) :|: 4 <= x178 - 1 && 1 <= x177 - 1 && 0 <= x176 - 1 && 0 <= x172 - 1 && 2 <= x171 - 1 && 2 <= x170 - 1
__init(x182, x183, x184, x185, x186, x187) -> f1_0_main_Load(x188, x189, x190, x191, x192, x193) :|: 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) -> f686_0_main_InvokeMethod(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P) :|: -1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg1P <= arg1
f120_0_createList_Return(x, x1, x2, x3, x4, x5) -> f686_0_main_InvokeMethod(x6, x7, x8, x9, x10, x11) :|: -1 <= x7 - 1 && 0 <= x6 - 1 && 0 <= x - 1 && x7 + 1 <= x && x6 <= x
f1_0_main_Load(x12, x13, x14, x15, x16, x17) -> f922_0_createList_GE(x18, x19, x20, x21, x22, x23) :|: 0 = x22 && 0 = x21 && 0 = x20 && 0 = x19 && 0 = x13 && -1 <= x18 - 1 && 0 <= x12 - 1 && x18 + 1 <= x12
f1_0_main_Load(x24, x25, x26, x27, x28, x29) -> f922_0_createList_GE(x30, x31, x32, x33, x34, x35) :|: 1 = x34 && x25 = x33 && 0 = x32 && 0 = x31 && -1 <= x30 - 1 && 0 <= x24 - 1 && 0 <= x25 - 1 && x30 + 1 <= x24
f1_0_main_Load(x36, x37, x38, x39, x40, x41) -> f922_0_createList_GE(x42, x44, x45, x46, x47, x48) :|: 1 = x47 && x37 = x46 && 0 = x44 && -1 <= x42 - 1 && 0 <= x36 - 1 && x42 + 1 <= x36 && 0 <= x37 - 1 && -1 <= x45 - 1
f922_0_createList_GE(x49, x50, x51, x52, x53, x54) -> f922_0_createList_GE(x55, x56, x57, x58, x59, x60) :|: x53 = x59 && x52 = x58 && x51 = x57 && x50 + 1 = x56 && 1 <= x55 - 1 && -1 <= x49 - 1 && x55 - 2 <= x49 && -1 <= x52 - 1 && x50 <= x51 - 1 && x52 <= x53
f922_0_createList_GE(x61, x62, x63, x64, x65, x66) -> f922_0_createList_GE(x67, x68, x69, x70, x71, x72) :|: x65 = x71 && x64 = x70 && x63 = x69 && x62 + 1 = x68 && 4 <= x67 - 1 && 0 <= x61 - 1 && -1 <= x64 - 1 && x62 <= x63 - 1 && x64 <= x65
f922_0_createList_GE(x73, x74, x75, x76, x77, x78) -> f1114_0_createList_NULL(x79, x80, x81, x82, x83, x84) :|: x77 + 1 = x84 && x76 = x83 && x74 = x81 && x75 = x79 && -1 <= x82 - 1 && 1 <= x80 - 1 && -1 <= x73 - 1 && x82 <= x73 && -1 <= x77 - 1 && x77 <= x76 - 1 && x74 <= x75 - 1 && -1 <= x76 - 1
f922_0_createList_GE(x85, x86, x87, x88, x89, x90) -> f1114_0_createList_NULL(x91, x92, x93, x94, x95, x96) :|: -1 <= x88 - 1 && x86 <= x87 - 1 && x89 <= x88 - 1 && -1 <= x97 - 1 && -1 <= x89 - 1 && x94 <= x85 && -1 <= x85 - 1 && 1 <= x92 - 1 && -1 <= x94 - 1 && x87 = x91 && x86 = x93 && x88 = x95 && x89 + 1 = x96
f1114_0_createList_NULL(x98, x99, x100, x101, x102, x103) -> f922_0_createList_GE(x104, x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x98 = x106 && x100 + 1 = x105 && 1 <= x104 - 1 && -1 <= x101 - 1 && 1 <= x99 - 1 && x104 - 2 <= x101 && x104 <= x99
f1114_0_createList_NULL(x110, x111, x112, x113, x114, x115) -> f922_0_createList_GE(x116, x117, x118, x119, x120, x121) :|: x115 = x120 && x114 = x119 && x110 = x118 && x112 + 1 = x117 && 4 <= x116 - 1 && 0 <= x113 - 1 && 2 <= x111 - 1
f686_0_main_InvokeMethod(x122, x123, x124, x125, x126, x127) -> f744_0_getFirst_NONNULL(x128, x129, x130, x131, x132, x133) :|: x130 + 2 <= x123 && -1 <= x129 - 1 && 0 <= x128 - 1 && 0 <= x123 - 1 && 0 <= x122 - 1 && x128 <= x123
f744_0_getFirst_NONNULL(x134, x135, x136, x137, x138, x139) -> f744_0_getFirst_NONNULL(x140, x141, x142, x143, x144, x145) :|: x136 + 2 <= x134 && -1 <= x141 - 1 && 0 <= x140 - 1 && 0 <= x135 - 1 && 2 <= x134 - 1
f686_0_main_InvokeMethod(x146, x147, x148, x149, x150, x151) -> f1184_0_copyR_NULL(x152, x153, x154, x155, x156, x157) :|: -1 <= x154 - 1 && 1 <= x153 - 1 && 1 <= x152 - 1 && 0 <= x147 - 1 && 0 <= x146 - 1 && x154 + 1 <= x147 && x154 + 1 <= x146
f1184_0_copyR_NULL(x158, x159, x160, x161, x162, x163) -> f1184_0_copyR_NULL(x164, x165, x166, x167, x168, x169) :|: 1 <= x166 - 1 && 1 <= x165 - 1 && 0 <= x164 - 1 && -1 <= x160 - 1 && 1 <= x159 - 1 && 2 <= x158 - 1 && x166 - 2 <= x160 && x166 <= x159 && x166 + 1 <= x158
f1184_0_copyR_NULL(x170, x171, x172, x173, x174, x175) -> f1184_0_copyR_NULL(x176, x177, x178, x179, x180, x181) :|: 4 <= x178 - 1 && 1 <= x177 - 1 && 0 <= x176 - 1 && 0 <= x172 - 1 && 2 <= x171 - 1 && 2 <= x170 - 1
__init(x182, x183, x184, x185, x186, x187) -> f1_0_main_Load(x188, x189, x190, x191, x192, x193) :|: 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) -> f686_0_main_InvokeMethod(arg1P, arg2P, arg3P, arg4P, arg5P, arg6P) :|: -1 <= arg2P - 1 && 0 <= arg1P - 1 && 0 <= arg1 - 1 && arg1P <= arg1
(2) f120_0_createList_Return(x, x1, x2, x3, x4, x5) -> f686_0_main_InvokeMethod(x6, x7, x8, x9, x10, x11) :|: -1 <= x7 - 1 && 0 <= x6 - 1 && 0 <= x - 1 && x7 + 1 <= x && x6 <= x
(3) f1_0_main_Load(x12, x13, x14, x15, x16, x17) -> f922_0_createList_GE(x18, x19, x20, x21, x22, x23) :|: 0 = x22 && 0 = x21 && 0 = x20 && 0 = x19 && 0 = x13 && -1 <= x18 - 1 && 0 <= x12 - 1 && x18 + 1 <= x12
(4) f1_0_main_Load(x24, x25, x26, x27, x28, x29) -> f922_0_createList_GE(x30, x31, x32, x33, x34, x35) :|: 1 = x34 && x25 = x33 && 0 = x32 && 0 = x31 && -1 <= x30 - 1 && 0 <= x24 - 1 && 0 <= x25 - 1 && x30 + 1 <= x24
(5) f1_0_main_Load(x36, x37, x38, x39, x40, x41) -> f922_0_createList_GE(x42, x44, x45, x46, x47, x48) :|: 1 = x47 && x37 = x46 && 0 = x44 && -1 <= x42 - 1 && 0 <= x36 - 1 && x42 + 1 <= x36 && 0 <= x37 - 1 && -1 <= x45 - 1
(6) f922_0_createList_GE(x49, x50, x51, x52, x53, x54) -> f922_0_createList_GE(x55, x56, x57, x58, x59, x60) :|: x53 = x59 && x52 = x58 && x51 = x57 && x50 + 1 = x56 && 1 <= x55 - 1 && -1 <= x49 - 1 && x55 - 2 <= x49 && -1 <= x52 - 1 && x50 <= x51 - 1 && x52 <= x53
(7) f922_0_createList_GE(x61, x62, x63, x64, x65, x66) -> f922_0_createList_GE(x67, x68, x69, x70, x71, x72) :|: x65 = x71 && x64 = x70 && x63 = x69 && x62 + 1 = x68 && 4 <= x67 - 1 && 0 <= x61 - 1 && -1 <= x64 - 1 && x62 <= x63 - 1 && x64 <= x65
(8) f922_0_createList_GE(x73, x74, x75, x76, x77, x78) -> f1114_0_createList_NULL(x79, x80, x81, x82, x83, x84) :|: x77 + 1 = x84 && x76 = x83 && x74 = x81 && x75 = x79 && -1 <= x82 - 1 && 1 <= x80 - 1 && -1 <= x73 - 1 && x82 <= x73 && -1 <= x77 - 1 && x77 <= x76 - 1 && x74 <= x75 - 1 && -1 <= x76 - 1
(9) f922_0_createList_GE(x85, x86, x87, x88, x89, x90) -> f1114_0_createList_NULL(x91, x92, x93, x94, x95, x96) :|: -1 <= x88 - 1 && x86 <= x87 - 1 && x89 <= x88 - 1 && -1 <= x97 - 1 && -1 <= x89 - 1 && x94 <= x85 && -1 <= x85 - 1 && 1 <= x92 - 1 && -1 <= x94 - 1 && x87 = x91 && x86 = x93 && x88 = x95 && x89 + 1 = x96
(10) f1114_0_createList_NULL(x98, x99, x100, x101, x102, x103) -> f922_0_createList_GE(x104, x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x98 = x106 && x100 + 1 = x105 && 1 <= x104 - 1 && -1 <= x101 - 1 && 1 <= x99 - 1 && x104 - 2 <= x101 && x104 <= x99
(11) f1114_0_createList_NULL(x110, x111, x112, x113, x114, x115) -> f922_0_createList_GE(x116, x117, x118, x119, x120, x121) :|: x115 = x120 && x114 = x119 && x110 = x118 && x112 + 1 = x117 && 4 <= x116 - 1 && 0 <= x113 - 1 && 2 <= x111 - 1
(12) f686_0_main_InvokeMethod(x122, x123, x124, x125, x126, x127) -> f744_0_getFirst_NONNULL(x128, x129, x130, x131, x132, x133) :|: x130 + 2 <= x123 && -1 <= x129 - 1 && 0 <= x128 - 1 && 0 <= x123 - 1 && 0 <= x122 - 1 && x128 <= x123
(13) f744_0_getFirst_NONNULL(x134, x135, x136, x137, x138, x139) -> f744_0_getFirst_NONNULL(x140, x141, x142, x143, x144, x145) :|: x136 + 2 <= x134 && -1 <= x141 - 1 && 0 <= x140 - 1 && 0 <= x135 - 1 && 2 <= x134 - 1
(14) f686_0_main_InvokeMethod(x146, x147, x148, x149, x150, x151) -> f1184_0_copyR_NULL(x152, x153, x154, x155, x156, x157) :|: -1 <= x154 - 1 && 1 <= x153 - 1 && 1 <= x152 - 1 && 0 <= x147 - 1 && 0 <= x146 - 1 && x154 + 1 <= x147 && x154 + 1 <= x146
(15) f1184_0_copyR_NULL(x158, x159, x160, x161, x162, x163) -> f1184_0_copyR_NULL(x164, x165, x166, x167, x168, x169) :|: 1 <= x166 - 1 && 1 <= x165 - 1 && 0 <= x164 - 1 && -1 <= x160 - 1 && 1 <= x159 - 1 && 2 <= x158 - 1 && x166 - 2 <= x160 && x166 <= x159 && x166 + 1 <= x158
(16) f1184_0_copyR_NULL(x170, x171, x172, x173, x174, x175) -> f1184_0_copyR_NULL(x176, x177, x178, x179, x180, x181) :|: 4 <= x178 - 1 && 1 <= x177 - 1 && 0 <= x176 - 1 && 0 <= x172 - 1 && 2 <= x171 - 1 && 2 <= x170 - 1
(17) __init(x182, x183, x184, x185, x186, x187) -> f1_0_main_Load(x188, x189, x190, x191, x192, x193) :|: 0 <= 0

Arcs:
(1) -> (12), (14)
(2) -> (12), (14)
(5) -> (6), (7), (8), (9)
(6) -> (6), (7)
(7) -> (6), (7)
(8) -> (10), (11)
(9) -> (10), (11)
(10) -> (6), (7), (8), (9)
(11) -> (6), (7), (8), (9)
(12) -> (13)
(13) -> (13)
(14) -> (15), (16)
(15) -> (15), (16)
(16) -> (15), (16)
(17) -> (1), (3), (4), (5)

This digraph is fully evaluated!
----------------------------------------

(4)
Complex Obligation (AND)

----------------------------------------

(5)
Obligation:

Termination digraph:
Nodes:
(1) f922_0_createList_GE(x73, x74, x75, x76, x77, x78) -> f1114_0_createList_NULL(x79, x80, x81, x82, x83, x84) :|: x77 + 1 = x84 && x76 = x83 && x74 = x81 && x75 = x79 && -1 <= x82 - 1 && 1 <= x80 - 1 && -1 <= x73 - 1 && x82 <= x73 && -1 <= x77 - 1 && x77 <= x76 - 1 && x74 <= x75 - 1 && -1 <= x76 - 1
(2) f1114_0_createList_NULL(x98, x99, x100, x101, x102, x103) -> f922_0_createList_GE(x104, x105, x106, x107, x108, x109) :|: x103 = x108 && x102 = x107 && x98 = x106 && x100 + 1 = x105 && 1 <= x104 - 1 && -1 <= x101 - 1 && 1 <= x99 - 1 && x104 - 2 <= x101 && x104 <= x99
(3) f922_0_createList_GE(x85, x86, x87, x88, x89, x90) -> f1114_0_createList_NULL(x91, x92, x93, x94, x95, x96) :|: -1 <= x88 - 1 && x86 <= x87 - 1 && x89 <= x88 - 1 && -1 <= x97 - 1 && -1 <= x89 - 1 && x94 <= x85 && -1 <= x85 - 1 && 1 <= x92 - 1 && -1 <= x94 - 1 && x87 = x91 && x86 = x93 && x88 = x95 && x89 + 1 = x96
(4) f1114_0_createList_NULL(x110, x111, x112, x113, x114, x115) -> f922_0_createList_GE(x116, x117, x118, x119, x120, x121) :|: x115 = x120 && x114 = x119 && x110 = x118 && x112 + 1 = x117 && 4 <= x116 - 1 && 0 <= x113 - 1 && 2 <= x111 - 1

Arcs:
(1) -> (2), (4)
(2) -> (1), (3)
(3) -> (2), (4)
(4) -> (1), (3)

This digraph is fully evaluated!

----------------------------------------

(6) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(7)
Obligation:
Rules:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, x112:0 + 1, x110:0, x114:0, x115:0, x121:0) :|: x113:0 > 0 && x116:0 > 4 && x111:0 > 2
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0, x90:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, x89:0 + 1) :|: x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, x100:0 + 1, x106:0, x102:0, x103:0, x109:0) :|: x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0, x78:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, x77:0 + 1) :|: x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1

----------------------------------------

(8) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f922_0_createList_GE(x1, x2, x3, x4, x5, x6) -> f922_0_createList_GE(x1, x2, x3, x4, x5)

----------------------------------------

(9)
Obligation:
Rules:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, x112:0 + 1, x110:0, x114:0, x115:0) :|: x113:0 > 0 && x116:0 > 4 && x111:0 > 2
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, x89:0 + 1) :|: x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, x100:0 + 1, x106:0, x102:0, x103:0) :|: x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, x77:0 + 1) :|: x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1

----------------------------------------

(10) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f1114_0_createList_NULL(VARIABLE, INTEGER, VARIABLE, INTEGER, VARIABLE, VARIABLE)
f922_0_createList_GE(INTEGER, INTEGER, VARIABLE, VARIABLE, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(11)
Obligation:
Rules:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, c, x110:0, x114:0, x115:0) :|: c = x112:0 + 1 && (x113:0 > 0 && x116:0 > 4 && x111:0 > 2)
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, c1) :|: c1 = x89:0 + 1 && (x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1)
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, c3) :|: c3 = x77:0 + 1 && (x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1)

----------------------------------------

(12) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1114_0_createList_NULL(x, x1, x2, x3, x4, x5)] = -1 + x - x2 + x4 - x5
[f922_0_createList_GE(x6, x7, x8, x9, x10)] = -2 - x10 - x7 + x8 + x9

The following rules are decreasing:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, c, x110:0, x114:0, x115:0) :|: c = x112:0 + 1 && (x113:0 > 0 && x116:0 > 4 && x111:0 > 2)
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)
The following rules are bounded:
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, c1) :|: c1 = x89:0 + 1 && (x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1)
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, c3) :|: c3 = x77:0 + 1 && (x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1)

----------------------------------------

(13)
Complex Obligation (AND)

----------------------------------------

(14)
Obligation:
Rules:
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, c1) :|: c1 = x89:0 + 1 && (x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1)
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, c3) :|: c3 = x77:0 + 1 && (x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1)

----------------------------------------

(15) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f922_0_createList_GE ] = 0
[ f1114_0_createList_NULL ] = -1/2*f1114_0_createList_NULL_2

The following rules are decreasing:
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, c1) :|: c1 = x89:0 + 1 && (x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1)
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, c3) :|: c3 = x77:0 + 1 && (x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1)

The following rules are bounded:
f922_0_createList_GE(x85:0, x86:0, x87:0, x88:0, x89:0) -> f1114_0_createList_NULL(x87:0, x92:0, x86:0, x94:0, x88:0, c1) :|: c1 = x89:0 + 1 && (x92:0 > 1 && x94:0 > -1 && x85:0 > -1 && x94:0 <= x85:0 && x89:0 > -1 && x97:0 > -1 && x89:0 <= x88:0 - 1 && x87:0 - 1 >= x86:0 && x88:0 > -1)
f922_0_createList_GE(x73:0, x74:0, x75:0, x76:0, x77:0) -> f1114_0_createList_NULL(x75:0, x80:0, x74:0, x82:0, x76:0, c3) :|: c3 = x77:0 + 1 && (x75:0 - 1 >= x74:0 && x76:0 > -1 && x77:0 <= x76:0 - 1 && x77:0 > -1 && x82:0 <= x73:0 && x73:0 > -1 && x82:0 > -1 && x80:0 > 1)


----------------------------------------

(16)
YES

----------------------------------------

(17)
Obligation:
Rules:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, c, x110:0, x114:0, x115:0) :|: c = x112:0 + 1 && (x113:0 > 0 && x116:0 > 4 && x111:0 > 2)
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)

----------------------------------------

(18) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1114_0_createList_NULL(x, x1, x2, x3, x4, x5)] = x3
[f922_0_createList_GE(x6, x7, x8, x9, x10)] = 0

The following rules are decreasing:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, c, x110:0, x114:0, x115:0) :|: c = x112:0 + 1 && (x113:0 > 0 && x116:0 > 4 && x111:0 > 2)
The following rules are bounded:
f1114_0_createList_NULL(x110:0, x111:0, x112:0, x113:0, x114:0, x115:0) -> f922_0_createList_GE(x116:0, c, x110:0, x114:0, x115:0) :|: c = x112:0 + 1 && (x113:0 > 0 && x116:0 > 4 && x111:0 > 2)
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)

----------------------------------------

(19)
Obligation:
Rules:
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)

----------------------------------------

(20) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1114_0_createList_NULL(x, x1, x2, x3, x4, x5)] = 1
[f922_0_createList_GE(x6, x7, x8, x9, x10)] = 0

The following rules are decreasing:
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)
The following rules are bounded:
f1114_0_createList_NULL(x106:0, x99:0, x100:0, x101:0, x102:0, x103:0) -> f922_0_createList_GE(x104:0, c2, x106:0, x102:0, x103:0) :|: c2 = x100:0 + 1 && (x104:0 - 2 <= x101:0 && x99:0 >= x104:0 && x99:0 > 1 && x104:0 > 1 && x101:0 > -1)

----------------------------------------

(21)
YES

----------------------------------------

(22)
Obligation:

Termination digraph:
Nodes:
(1) f922_0_createList_GE(x49, x50, x51, x52, x53, x54) -> f922_0_createList_GE(x55, x56, x57, x58, x59, x60) :|: x53 = x59 && x52 = x58 && x51 = x57 && x50 + 1 = x56 && 1 <= x55 - 1 && -1 <= x49 - 1 && x55 - 2 <= x49 && -1 <= x52 - 1 && x50 <= x51 - 1 && x52 <= x53
(2) f922_0_createList_GE(x61, x62, x63, x64, x65, x66) -> f922_0_createList_GE(x67, x68, x69, x70, x71, x72) :|: x65 = x71 && x64 = x70 && x63 = x69 && x62 + 1 = x68 && 4 <= x67 - 1 && 0 <= x61 - 1 && -1 <= x64 - 1 && x62 <= x63 - 1 && x64 <= x65

Arcs:
(1) -> (1), (2)
(2) -> (1), (2)

This digraph is fully evaluated!

----------------------------------------

(23) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(24)
Obligation:
Rules:
f922_0_createList_GE(x49:0, x50:0, x51:0, x52:0, x53:0, x54:0) -> f922_0_createList_GE(x55:0, x50:0 + 1, x51:0, x52:0, x53:0, x60:0) :|: x51:0 - 1 >= x50:0 && x53:0 >= x52:0 && x52:0 > -1 && x55:0 - 2 <= x49:0 && x55:0 > 1 && x49:0 > -1
f922_0_createList_GE(x61:0, x62:0, x63:0, x64:0, x65:0, x66:0) -> f922_0_createList_GE(x67:0, x62:0 + 1, x63:0, x64:0, x65:0, x72:0) :|: x63:0 - 1 >= x62:0 && x65:0 >= x64:0 && x64:0 > -1 && x67:0 > 4 && x61:0 > 0

----------------------------------------

(25) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f922_0_createList_GE(x1, x2, x3, x4, x5, x6) -> f922_0_createList_GE(x1, x2, x3, x4, x5)

----------------------------------------

(26)
Obligation:
Rules:
f922_0_createList_GE(x49:0, x50:0, x51:0, x52:0, x53:0) -> f922_0_createList_GE(x55:0, x50:0 + 1, x51:0, x52:0, x53:0) :|: x51:0 - 1 >= x50:0 && x53:0 >= x52:0 && x52:0 > -1 && x55:0 - 2 <= x49:0 && x55:0 > 1 && x49:0 > -1
f922_0_createList_GE(x61:0, x62:0, x63:0, x64:0, x65:0) -> f922_0_createList_GE(x67:0, x62:0 + 1, x63:0, x64:0, x65:0) :|: x63:0 - 1 >= x62:0 && x65:0 >= x64:0 && x64:0 > -1 && x67:0 > 4 && x61:0 > 0

----------------------------------------

(27) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f922_0_createList_GE(INTEGER, INTEGER, INTEGER, INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(28)
Obligation:
Rules:
f922_0_createList_GE(x49:0, x50:0, x51:0, x52:0, x53:0) -> f922_0_createList_GE(x55:0, c, x51:0, x52:0, x53:0) :|: c = x50:0 + 1 && (x51:0 - 1 >= x50:0 && x53:0 >= x52:0 && x52:0 > -1 && x55:0 - 2 <= x49:0 && x55:0 > 1 && x49:0 > -1)
f922_0_createList_GE(x61:0, x62:0, x63:0, x64:0, x65:0) -> f922_0_createList_GE(x67:0, c1, x63:0, x64:0, x65:0) :|: c1 = x62:0 + 1 && (x63:0 - 1 >= x62:0 && x65:0 >= x64:0 && x64:0 > -1 && x67:0 > 4 && x61:0 > 0)

----------------------------------------

(29) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f922_0_createList_GE ] = f922_0_createList_GE_3 + -1*f922_0_createList_GE_2

The following rules are decreasing:
f922_0_createList_GE(x49:0, x50:0, x51:0, x52:0, x53:0) -> f922_0_createList_GE(x55:0, c, x51:0, x52:0, x53:0) :|: c = x50:0 + 1 && (x51:0 - 1 >= x50:0 && x53:0 >= x52:0 && x52:0 > -1 && x55:0 - 2 <= x49:0 && x55:0 > 1 && x49:0 > -1)
f922_0_createList_GE(x61:0, x62:0, x63:0, x64:0, x65:0) -> f922_0_createList_GE(x67:0, c1, x63:0, x64:0, x65:0) :|: c1 = x62:0 + 1 && (x63:0 - 1 >= x62:0 && x65:0 >= x64:0 && x64:0 > -1 && x67:0 > 4 && x61:0 > 0)

The following rules are bounded:
f922_0_createList_GE(x49:0, x50:0, x51:0, x52:0, x53:0) -> f922_0_createList_GE(x55:0, c, x51:0, x52:0, x53:0) :|: c = x50:0 + 1 && (x51:0 - 1 >= x50:0 && x53:0 >= x52:0 && x52:0 > -1 && x55:0 - 2 <= x49:0 && x55:0 > 1 && x49:0 > -1)
f922_0_createList_GE(x61:0, x62:0, x63:0, x64:0, x65:0) -> f922_0_createList_GE(x67:0, c1, x63:0, x64:0, x65:0) :|: c1 = x62:0 + 1 && (x63:0 - 1 >= x62:0 && x65:0 >= x64:0 && x64:0 > -1 && x67:0 > 4 && x61:0 > 0)


----------------------------------------

(30)
YES

----------------------------------------

(31)
Obligation:

Termination digraph:
Nodes:
(1) f1184_0_copyR_NULL(x158, x159, x160, x161, x162, x163) -> f1184_0_copyR_NULL(x164, x165, x166, x167, x168, x169) :|: 1 <= x166 - 1 && 1 <= x165 - 1 && 0 <= x164 - 1 && -1 <= x160 - 1 && 1 <= x159 - 1 && 2 <= x158 - 1 && x166 - 2 <= x160 && x166 <= x159 && x166 + 1 <= x158
(2) f1184_0_copyR_NULL(x170, x171, x172, x173, x174, x175) -> f1184_0_copyR_NULL(x176, x177, x178, x179, x180, x181) :|: 4 <= x178 - 1 && 1 <= x177 - 1 && 0 <= x176 - 1 && 0 <= x172 - 1 && 2 <= x171 - 1 && 2 <= x170 - 1

Arcs:
(1) -> (1), (2)
(2) -> (1), (2)

This digraph is fully evaluated!

----------------------------------------

(32) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(33)
Obligation:
Rules:
f1184_0_copyR_NULL(x158:0, x159:0, x160:0, x161:0, x162:0, x163:0) -> f1184_0_copyR_NULL(x164:0, x165:0, x166:0, x167:0, x168:0, x169:0) :|: x166:0 <= x159:0 && x166:0 + 1 <= x158:0 && x166:0 - 2 <= x160:0 && x158:0 > 2 && x159:0 > 1 && x160:0 > -1 && x164:0 > 0 && x165:0 > 1 && x166:0 > 1
f1184_0_copyR_NULL(x170:0, x171:0, x172:0, x173:0, x174:0, x175:0) -> f1184_0_copyR_NULL(x176:0, x177:0, x178:0, x179:0, x180:0, x181:0) :|: x171:0 > 2 && x170:0 > 2 && x172:0 > 0 && x176:0 > 0 && x177:0 > 1 && x178:0 > 4

----------------------------------------

(34) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f1184_0_copyR_NULL(x1, x2, x3, x4, x5, x6) -> f1184_0_copyR_NULL(x1, x2, x3)

----------------------------------------

(35)
Obligation:
Rules:
f1184_0_copyR_NULL(x158:0, x159:0, x160:0) -> f1184_0_copyR_NULL(x164:0, x165:0, x166:0) :|: x166:0 <= x159:0 && x166:0 + 1 <= x158:0 && x166:0 - 2 <= x160:0 && x158:0 > 2 && x159:0 > 1 && x160:0 > -1 && x164:0 > 0 && x165:0 > 1 && x166:0 > 1
f1184_0_copyR_NULL(x170:0, x171:0, x172:0) -> f1184_0_copyR_NULL(x176:0, x177:0, x178:0) :|: x171:0 > 2 && x170:0 > 2 && x172:0 > 0 && x176:0 > 0 && x177:0 > 1 && x178:0 > 4

----------------------------------------

(36) FilterProof (EQUIVALENT)
Used the following sort dictionary for filtering: 
f1184_0_copyR_NULL(INTEGER, INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(37)
Obligation:
Rules:
f1184_0_copyR_NULL(x158:0, x159:0, x160:0) -> f1184_0_copyR_NULL(x164:0, x165:0, x166:0) :|: x166:0 <= x159:0 && x166:0 + 1 <= x158:0 && x166:0 - 2 <= x160:0 && x158:0 > 2 && x159:0 > 1 && x160:0 > -1 && x164:0 > 0 && x165:0 > 1 && x166:0 > 1
f1184_0_copyR_NULL(x170:0, x171:0, x172:0) -> f1184_0_copyR_NULL(x176:0, x177:0, x178:0) :|: x171:0 > 2 && x170:0 > 2 && x172:0 > 0 && x176:0 > 0 && x177:0 > 1 && x178:0 > 4

----------------------------------------

(38) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(39)
Obligation:
Rules:
f1184_0_copyR_NULL(x158:0:0, x159:0:0, x160:0:0) -> f1184_0_copyR_NULL(x164:0:0, x165:0:0, x166:0:0) :|: x165:0:0 > 1 && x166:0:0 > 1 && x164:0:0 > 0 && x160:0:0 > -1 && x159:0:0 > 1 && x158:0:0 > 2 && x166:0:0 - 2 <= x160:0:0 && x166:0:0 + 1 <= x158:0:0 && x166:0:0 <= x159:0:0
f1184_0_copyR_NULL(x170:0:0, x171:0:0, x172:0:0) -> f1184_0_copyR_NULL(x176:0:0, x177:0:0, x178:0:0) :|: x177:0:0 > 1 && x178:0:0 > 4 && x176:0:0 > 0 && x172:0:0 > 0 && x170:0:0 > 2 && x171:0:0 > 2

----------------------------------------

(40) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x158:0:0, x159:0:0, x160:0:0) -> f(1, x164:0:0, x165:0:0, x166:0:0) :|: pc = 1 && (x165:0:0 > 1 && x166:0:0 > 1 && x164:0:0 > 0 && x160:0:0 > -1 && x159:0:0 > 1 && x158:0:0 > 2 && x166:0:0 - 2 <= x160:0:0 && x166:0:0 + 1 <= x158:0:0 && x166:0:0 <= x159:0:0)
f(pc, x170:0:0, x171:0:0, x172:0:0) -> f(1, x176:0:0, x177:0:0, x178:0:0) :|: pc = 1 && (x177:0:0 > 1 && x178:0:0 > 4 && x176:0:0 > 0 && x172:0:0 > 0 && x170:0:0 > 2 && x171:0:0 > 2)
Witness term starting non-terminating reduction: f(1, 7, 4, 4)
----------------------------------------

(41)
NO

----------------------------------------

(42)
Obligation:

Termination digraph:
Nodes:
(1) f744_0_getFirst_NONNULL(x134, x135, x136, x137, x138, x139) -> f744_0_getFirst_NONNULL(x140, x141, x142, x143, x144, x145) :|: x136 + 2 <= x134 && -1 <= x141 - 1 && 0 <= x140 - 1 && 0 <= x135 - 1 && 2 <= x134 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

----------------------------------------

(43) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(44)
Obligation:
Rules:
f744_0_getFirst_NONNULL(x134:0, x135:0, x136:0, x137:0, x138:0, x139:0) -> f744_0_getFirst_NONNULL(x140:0, x141:0, x142:0, x143:0, x144:0, x145:0) :|: x135:0 > 0 && x134:0 > 2 && x140:0 > 0 && x141:0 > -1 && x136:0 + 2 <= x134:0

----------------------------------------

(45) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f744_0_getFirst_NONNULL(x1, x2, x3, x4, x5, x6) -> f744_0_getFirst_NONNULL(x1, x2, x3)

----------------------------------------

(46)
Obligation:
Rules:
f744_0_getFirst_NONNULL(x134:0, x135:0, x136:0) -> f744_0_getFirst_NONNULL(x140:0, x141:0, x142:0) :|: x135:0 > 0 && x134:0 > 2 && x140:0 > 0 && x141:0 > -1 && x136:0 + 2 <= x134:0

----------------------------------------

(47) FilterProof (EQUIVALENT)
Used the following sort dictionary for filtering: 
f744_0_getFirst_NONNULL(INTEGER, INTEGER, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(48)
Obligation:
Rules:
f744_0_getFirst_NONNULL(x134:0, x135:0, x136:0) -> f744_0_getFirst_NONNULL(x140:0, x141:0, x142:0) :|: x135:0 > 0 && x134:0 > 2 && x140:0 > 0 && x141:0 > -1 && x136:0 + 2 <= x134:0

----------------------------------------

(49) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(50)
Obligation:
Rules:
f744_0_getFirst_NONNULL(x134:0:0, x135:0:0, x136:0:0) -> f744_0_getFirst_NONNULL(x140:0:0, x141:0:0, x142:0:0) :|: x141:0:0 > -1 && x136:0:0 + 2 <= x134:0:0 && x140:0:0 > 0 && x134:0:0 > 2 && x135:0:0 > 0

----------------------------------------

(51) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x134:0:0, x135:0:0, x136:0:0) -> f(1, x140:0:0, x141:0:0, x142:0:0) :|: pc = 1 && (x141:0:0 > -1 && x136:0:0 + 2 <= x134:0:0 && x140:0:0 > 0 && x134:0:0 > 2 && x135:0:0 > 0)
Witness term starting non-terminating reduction: f(1, 15, 15, -8)
----------------------------------------

(52)
NO