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, 1507 ms]
(4) AND
    (5) IRSwT
        (6) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (7) IRSwT
        (8) TempFilterProof [SOUND, 46 ms]
        (9) IntTRS
        (10) PolynomialOrderProcessor [EQUIVALENT, 9 ms]
        (11) YES
    (12) IRSwT
        (13) IntTRSCompressionProof [EQUIVALENT, 0 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) IntTRSPeriodicNontermProof [COMPLETE, 4 ms]
        (22) NO


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

(0)
Obligation:
Rules:
f1_0_main_Load(arg1, arg2, arg3, arg4) -> f2097_0_flatten_NULL(arg1P, arg2P, arg3P, arg4P) :|: -1 <= arg1P - 1 && 0 <= arg1 - 1 && 0 <= arg2 - 1 && arg1P + 1 <= arg1
f1_0_main_Load(x, x1, x2, x3) -> f1795_0_main_InvokeMethod(x4, x5, x6, x7) :|: 2 <= x5 - 1 && 0 <= x4 - 1 && 0 <= x - 1 && x4 <= x
f456_0_createTree_Return(x8, x9, x10, x11) -> f1795_0_main_InvokeMethod(x12, x13, x15, x16) :|: x10 = x15 && x10 + 2 <= x9 && 2 <= x13 - 1 && 0 <= x12 - 1 && 2 <= x9 - 1 && 0 <= x8 - 1 && x13 <= x9 && x12 + 2 <= x9 && x12 <= x8
f1795_0_main_InvokeMethod(x17, x18, x19, x20) -> f2097_0_flatten_NULL(x21, x22, x23, x24) :|: x21 <= x18 && 0 <= x25 - 1 && 0 <= x17 - 1 && 2 <= x18 - 1 && 2 <= x21 - 1 && x19 + 2 <= x18
f1_0_main_Load(x26, x27, x28, x29) -> f1759_0_createTree_LE(x30, x31, x32, x33) :|: 1 = x33 && 2 <= x31 - 1 && 2 <= x30 - 1 && 0 <= x26 - 1 && x31 - 2 <= x26 && x30 - 2 <= x26 && -1 <= x27 - 1 && 0 <= x32 - 1
f1759_0_createTree_LE(x34, x35, x37, x38) -> f1759_0_createTree_LE(x39, x40, x41, x42) :|: x38 + 1 = x42 && x37 - 1 = x41 && 0 <= x40 - 1 && 2 <= x39 - 1 && 2 <= x35 - 1 && 2 <= x34 - 1 && x40 + 2 <= x35 && x39 <= x34 && 0 <= x37 - 1 && -1 <= x38 - 1
f1759_0_createTree_LE(x44, x45, x46, x47) -> f1759_0_createTree_LE(x48, x49, x50, x51) :|: 0 <= x46 - 1 && 0 <= x52 - 1 && -1 <= x47 - 1 && x48 <= x44 && x49 + 2 <= x45 && 2 <= x44 - 1 && 2 <= x45 - 1 && 2 <= x48 - 1 && 0 <= x49 - 1 && x46 - 1 = x50 && x47 + 1 = x51
f1759_0_createTree_LE(x53, x54, x55, x56) -> f1759_0_createTree_LE(x57, x58, x59, x60) :|: 0 <= x55 - 1 && 0 <= x61 - 1 && -1 <= x56 - 1 && 2 <= x53 - 1 && 1 <= x54 - 1 && 2 <= x57 - 1 && 2 <= x58 - 1 && x55 - 1 = x59 && x56 + 1 = x60
f1759_0_createTree_LE(x63, x64, x65, x66) -> f1759_0_createTree_LE(x67, x68, x69, x70) :|: x66 + 1 = x70 && x65 - 1 = x69 && 2 <= x68 - 1 && 2 <= x67 - 1 && 1 <= x64 - 1 && 2 <= x63 - 1 && 0 <= x65 - 1 && -1 <= x66 - 1
f1759_0_createTree_LE(x71, x72, x73, x74) -> f1759_0_createTree_LE(x75, x76, x77, x78) :|: x74 + 1 = x78 && x73 - 1 = x77 && 4 <= x76 - 1 && 4 <= x75 - 1 && 2 <= x72 - 1 && 2 <= x71 - 1 && x76 - 2 <= x72 && x76 - 2 <= x71 && x75 - 2 <= x72 && x75 - 2 <= x71 && 0 <= x73 - 1 && -1 <= x74 - 1
f1759_0_createTree_LE(x79, x80, x81, x82) -> f1759_0_createTree_LE(x83, x84, x85, x86) :|: 0 <= x81 - 1 && 0 <= x87 - 1 && -1 <= x82 - 1 && x83 - 2 <= x79 && x83 - 2 <= x80 && x84 - 2 <= x79 && x84 - 2 <= x80 && 2 <= x79 - 1 && 2 <= x80 - 1 && 4 <= x83 - 1 && 4 <= x84 - 1 && x81 - 1 = x85 && x82 + 1 = x86
f2097_0_flatten_NULL(x88, x89, x90, x91) -> f2097_0_flatten_NULL(x92, x93, x94, x95) :|: -1 <= x92 - 1 && 1 <= x88 - 1 && x92 + 2 <= x88
f2097_0_flatten_NULL(x96, x97, x98, x99) -> f2097_0_flatten_NULL(x100, x101, x102, x103) :|: 2 <= x100 - 1 && 2 <= x96 - 1 && x100 - 2 <= x96
__init(x104, x105, x106, x107) -> f1_0_main_Load(x108, x109, x110, x111) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3, arg4)

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

(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) -> f2097_0_flatten_NULL(arg1P, arg2P, arg3P, arg4P) :|: -1 <= arg1P - 1 && 0 <= arg1 - 1 && 0 <= arg2 - 1 && arg1P + 1 <= arg1
f1_0_main_Load(x, x1, x2, x3) -> f1795_0_main_InvokeMethod(x4, x5, x6, x7) :|: 2 <= x5 - 1 && 0 <= x4 - 1 && 0 <= x - 1 && x4 <= x
f456_0_createTree_Return(x8, x9, x10, x11) -> f1795_0_main_InvokeMethod(x12, x13, x15, x16) :|: x10 = x15 && x10 + 2 <= x9 && 2 <= x13 - 1 && 0 <= x12 - 1 && 2 <= x9 - 1 && 0 <= x8 - 1 && x13 <= x9 && x12 + 2 <= x9 && x12 <= x8
f1795_0_main_InvokeMethod(x17, x18, x19, x20) -> f2097_0_flatten_NULL(x21, x22, x23, x24) :|: x21 <= x18 && 0 <= x25 - 1 && 0 <= x17 - 1 && 2 <= x18 - 1 && 2 <= x21 - 1 && x19 + 2 <= x18
f1_0_main_Load(x26, x27, x28, x29) -> f1759_0_createTree_LE(x30, x31, x32, x33) :|: 1 = x33 && 2 <= x31 - 1 && 2 <= x30 - 1 && 0 <= x26 - 1 && x31 - 2 <= x26 && x30 - 2 <= x26 && -1 <= x27 - 1 && 0 <= x32 - 1
f1759_0_createTree_LE(x34, x35, x37, x38) -> f1759_0_createTree_LE(x39, x40, x41, x42) :|: x38 + 1 = x42 && x37 - 1 = x41 && 0 <= x40 - 1 && 2 <= x39 - 1 && 2 <= x35 - 1 && 2 <= x34 - 1 && x40 + 2 <= x35 && x39 <= x34 && 0 <= x37 - 1 && -1 <= x38 - 1
f1759_0_createTree_LE(x44, x45, x46, x47) -> f1759_0_createTree_LE(x48, x49, x50, x51) :|: 0 <= x46 - 1 && 0 <= x52 - 1 && -1 <= x47 - 1 && x48 <= x44 && x49 + 2 <= x45 && 2 <= x44 - 1 && 2 <= x45 - 1 && 2 <= x48 - 1 && 0 <= x49 - 1 && x46 - 1 = x50 && x47 + 1 = x51
f1759_0_createTree_LE(x53, x54, x55, x56) -> f1759_0_createTree_LE(x57, x58, x59, x60) :|: 0 <= x55 - 1 && 0 <= x61 - 1 && -1 <= x56 - 1 && 2 <= x53 - 1 && 1 <= x54 - 1 && 2 <= x57 - 1 && 2 <= x58 - 1 && x55 - 1 = x59 && x56 + 1 = x60
f1759_0_createTree_LE(x63, x64, x65, x66) -> f1759_0_createTree_LE(x67, x68, x69, x70) :|: x66 + 1 = x70 && x65 - 1 = x69 && 2 <= x68 - 1 && 2 <= x67 - 1 && 1 <= x64 - 1 && 2 <= x63 - 1 && 0 <= x65 - 1 && -1 <= x66 - 1
f1759_0_createTree_LE(x71, x72, x73, x74) -> f1759_0_createTree_LE(x75, x76, x77, x78) :|: x74 + 1 = x78 && x73 - 1 = x77 && 4 <= x76 - 1 && 4 <= x75 - 1 && 2 <= x72 - 1 && 2 <= x71 - 1 && x76 - 2 <= x72 && x76 - 2 <= x71 && x75 - 2 <= x72 && x75 - 2 <= x71 && 0 <= x73 - 1 && -1 <= x74 - 1
f1759_0_createTree_LE(x79, x80, x81, x82) -> f1759_0_createTree_LE(x83, x84, x85, x86) :|: 0 <= x81 - 1 && 0 <= x87 - 1 && -1 <= x82 - 1 && x83 - 2 <= x79 && x83 - 2 <= x80 && x84 - 2 <= x79 && x84 - 2 <= x80 && 2 <= x79 - 1 && 2 <= x80 - 1 && 4 <= x83 - 1 && 4 <= x84 - 1 && x81 - 1 = x85 && x82 + 1 = x86
f2097_0_flatten_NULL(x88, x89, x90, x91) -> f2097_0_flatten_NULL(x92, x93, x94, x95) :|: -1 <= x92 - 1 && 1 <= x88 - 1 && x92 + 2 <= x88
f2097_0_flatten_NULL(x96, x97, x98, x99) -> f2097_0_flatten_NULL(x100, x101, x102, x103) :|: 2 <= x100 - 1 && 2 <= x96 - 1 && x100 - 2 <= x96
__init(x104, x105, x106, x107) -> f1_0_main_Load(x108, x109, x110, x111) :|: 0 <= 0
Start term: __init(arg1, arg2, arg3, arg4)

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

(3) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1_0_main_Load(arg1, arg2, arg3, arg4) -> f2097_0_flatten_NULL(arg1P, arg2P, arg3P, arg4P) :|: -1 <= arg1P - 1 && 0 <= arg1 - 1 && 0 <= arg2 - 1 && arg1P + 1 <= arg1
(2) f1_0_main_Load(x, x1, x2, x3) -> f1795_0_main_InvokeMethod(x4, x5, x6, x7) :|: 2 <= x5 - 1 && 0 <= x4 - 1 && 0 <= x - 1 && x4 <= x
(3) f456_0_createTree_Return(x8, x9, x10, x11) -> f1795_0_main_InvokeMethod(x12, x13, x15, x16) :|: x10 = x15 && x10 + 2 <= x9 && 2 <= x13 - 1 && 0 <= x12 - 1 && 2 <= x9 - 1 && 0 <= x8 - 1 && x13 <= x9 && x12 + 2 <= x9 && x12 <= x8
(4) f1795_0_main_InvokeMethod(x17, x18, x19, x20) -> f2097_0_flatten_NULL(x21, x22, x23, x24) :|: x21 <= x18 && 0 <= x25 - 1 && 0 <= x17 - 1 && 2 <= x18 - 1 && 2 <= x21 - 1 && x19 + 2 <= x18
(5) f1_0_main_Load(x26, x27, x28, x29) -> f1759_0_createTree_LE(x30, x31, x32, x33) :|: 1 = x33 && 2 <= x31 - 1 && 2 <= x30 - 1 && 0 <= x26 - 1 && x31 - 2 <= x26 && x30 - 2 <= x26 && -1 <= x27 - 1 && 0 <= x32 - 1
(6) f1759_0_createTree_LE(x34, x35, x37, x38) -> f1759_0_createTree_LE(x39, x40, x41, x42) :|: x38 + 1 = x42 && x37 - 1 = x41 && 0 <= x40 - 1 && 2 <= x39 - 1 && 2 <= x35 - 1 && 2 <= x34 - 1 && x40 + 2 <= x35 && x39 <= x34 && 0 <= x37 - 1 && -1 <= x38 - 1
(7) f1759_0_createTree_LE(x44, x45, x46, x47) -> f1759_0_createTree_LE(x48, x49, x50, x51) :|: 0 <= x46 - 1 && 0 <= x52 - 1 && -1 <= x47 - 1 && x48 <= x44 && x49 + 2 <= x45 && 2 <= x44 - 1 && 2 <= x45 - 1 && 2 <= x48 - 1 && 0 <= x49 - 1 && x46 - 1 = x50 && x47 + 1 = x51
(8) f1759_0_createTree_LE(x53, x54, x55, x56) -> f1759_0_createTree_LE(x57, x58, x59, x60) :|: 0 <= x55 - 1 && 0 <= x61 - 1 && -1 <= x56 - 1 && 2 <= x53 - 1 && 1 <= x54 - 1 && 2 <= x57 - 1 && 2 <= x58 - 1 && x55 - 1 = x59 && x56 + 1 = x60
(9) f1759_0_createTree_LE(x63, x64, x65, x66) -> f1759_0_createTree_LE(x67, x68, x69, x70) :|: x66 + 1 = x70 && x65 - 1 = x69 && 2 <= x68 - 1 && 2 <= x67 - 1 && 1 <= x64 - 1 && 2 <= x63 - 1 && 0 <= x65 - 1 && -1 <= x66 - 1
(10) f1759_0_createTree_LE(x71, x72, x73, x74) -> f1759_0_createTree_LE(x75, x76, x77, x78) :|: x74 + 1 = x78 && x73 - 1 = x77 && 4 <= x76 - 1 && 4 <= x75 - 1 && 2 <= x72 - 1 && 2 <= x71 - 1 && x76 - 2 <= x72 && x76 - 2 <= x71 && x75 - 2 <= x72 && x75 - 2 <= x71 && 0 <= x73 - 1 && -1 <= x74 - 1
(11) f1759_0_createTree_LE(x79, x80, x81, x82) -> f1759_0_createTree_LE(x83, x84, x85, x86) :|: 0 <= x81 - 1 && 0 <= x87 - 1 && -1 <= x82 - 1 && x83 - 2 <= x79 && x83 - 2 <= x80 && x84 - 2 <= x79 && x84 - 2 <= x80 && 2 <= x79 - 1 && 2 <= x80 - 1 && 4 <= x83 - 1 && 4 <= x84 - 1 && x81 - 1 = x85 && x82 + 1 = x86
(12) f2097_0_flatten_NULL(x88, x89, x90, x91) -> f2097_0_flatten_NULL(x92, x93, x94, x95) :|: -1 <= x92 - 1 && 1 <= x88 - 1 && x92 + 2 <= x88
(13) f2097_0_flatten_NULL(x96, x97, x98, x99) -> f2097_0_flatten_NULL(x100, x101, x102, x103) :|: 2 <= x100 - 1 && 2 <= x96 - 1 && x100 - 2 <= x96
(14) __init(x104, x105, x106, x107) -> f1_0_main_Load(x108, x109, x110, x111) :|: 0 <= 0

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

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

(4)
Complex Obligation (AND)

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

(5)
Obligation:

Termination digraph:
Nodes:
(1) f1759_0_createTree_LE(x34, x35, x37, x38) -> f1759_0_createTree_LE(x39, x40, x41, x42) :|: x38 + 1 = x42 && x37 - 1 = x41 && 0 <= x40 - 1 && 2 <= x39 - 1 && 2 <= x35 - 1 && 2 <= x34 - 1 && x40 + 2 <= x35 && x39 <= x34 && 0 <= x37 - 1 && -1 <= x38 - 1
(2) f1759_0_createTree_LE(x44, x45, x46, x47) -> f1759_0_createTree_LE(x48, x49, x50, x51) :|: 0 <= x46 - 1 && 0 <= x52 - 1 && -1 <= x47 - 1 && x48 <= x44 && x49 + 2 <= x45 && 2 <= x44 - 1 && 2 <= x45 - 1 && 2 <= x48 - 1 && 0 <= x49 - 1 && x46 - 1 = x50 && x47 + 1 = x51
(3) f1759_0_createTree_LE(x53, x54, x55, x56) -> f1759_0_createTree_LE(x57, x58, x59, x60) :|: 0 <= x55 - 1 && 0 <= x61 - 1 && -1 <= x56 - 1 && 2 <= x53 - 1 && 1 <= x54 - 1 && 2 <= x57 - 1 && 2 <= x58 - 1 && x55 - 1 = x59 && x56 + 1 = x60
(4) f1759_0_createTree_LE(x63, x64, x65, x66) -> f1759_0_createTree_LE(x67, x68, x69, x70) :|: x66 + 1 = x70 && x65 - 1 = x69 && 2 <= x68 - 1 && 2 <= x67 - 1 && 1 <= x64 - 1 && 2 <= x63 - 1 && 0 <= x65 - 1 && -1 <= x66 - 1
(5) f1759_0_createTree_LE(x71, x72, x73, x74) -> f1759_0_createTree_LE(x75, x76, x77, x78) :|: x74 + 1 = x78 && x73 - 1 = x77 && 4 <= x76 - 1 && 4 <= x75 - 1 && 2 <= x72 - 1 && 2 <= x71 - 1 && x76 - 2 <= x72 && x76 - 2 <= x71 && x75 - 2 <= x72 && x75 - 2 <= x71 && 0 <= x73 - 1 && -1 <= x74 - 1
(6) f1759_0_createTree_LE(x79, x80, x81, x82) -> f1759_0_createTree_LE(x83, x84, x85, x86) :|: 0 <= x81 - 1 && 0 <= x87 - 1 && -1 <= x82 - 1 && x83 - 2 <= x79 && x83 - 2 <= x80 && x84 - 2 <= x79 && x84 - 2 <= x80 && 2 <= x79 - 1 && 2 <= x80 - 1 && 4 <= x83 - 1 && 4 <= x84 - 1 && x81 - 1 = x85 && x82 + 1 = x86

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

This digraph is fully evaluated!

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

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

(7)
Obligation:
Rules:
f1759_0_createTree_LE(x53:0, x54:0, x55:0, x56:0) -> f1759_0_createTree_LE(x57:0, x58:0, x55:0 - 1, x56:0 + 1) :|: x57:0 > 2 && x58:0 > 2 && x54:0 > 1 && x53:0 > 2 && x56:0 > -1 && x61:0 > 0 && x55:0 > 0
f1759_0_createTree_LE(x44:0, x45:0, x46:0, x47:0) -> f1759_0_createTree_LE(x48:0, x49:0, x46:0 - 1, x47:0 + 1) :|: x48:0 > 2 && x49:0 > 0 && x45:0 > 2 && x44:0 > 2 && x49:0 + 2 <= x45:0 && x48:0 <= x44:0 && x47:0 > -1 && x52:0 > 0 && x46:0 > 0
f1759_0_createTree_LE(x63:0, x64:0, x65:0, x66:0) -> f1759_0_createTree_LE(x67:0, x68:0, x65:0 - 1, x66:0 + 1) :|: x65:0 > 0 && x66:0 > -1 && x63:0 > 2 && x64:0 > 1 && x68:0 > 2 && x67:0 > 2
f1759_0_createTree_LE(x71:0, x72:0, x73:0, x74:0) -> f1759_0_createTree_LE(x75:0, x76:0, x73:0 - 1, x74:0 + 1) :|: x73:0 > 0 && x74:0 > -1 && x75:0 - 2 <= x71:0 && x75:0 - 2 <= x72:0 && x76:0 - 2 <= x71:0 && x76:0 - 2 <= x72:0 && x71:0 > 2 && x72:0 > 2 && x76:0 > 4 && x75:0 > 4
f1759_0_createTree_LE(x79:0, x80:0, x81:0, x82:0) -> f1759_0_createTree_LE(x83:0, x84:0, x81:0 - 1, x82:0 + 1) :|: x83:0 > 4 && x84:0 > 4 && x80:0 > 2 && x79:0 > 2 && x84:0 - 2 <= x80:0 && x84:0 - 2 <= x79:0 && x83:0 - 2 <= x80:0 && x83:0 - 2 <= x79:0 && x82:0 > -1 && x87:0 > 0 && x81:0 > 0
f1759_0_createTree_LE(x34:0, x35:0, x37:0, x38:0) -> f1759_0_createTree_LE(x39:0, x40:0, x37:0 - 1, x38:0 + 1) :|: x37:0 > 0 && x38:0 > -1 && x39:0 <= x34:0 && x40:0 + 2 <= x35:0 && x34:0 > 2 && x35:0 > 2 && x40:0 > 0 && x39:0 > 2

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

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

(9)
Obligation:
Rules:
f1759_0_createTree_LE(x53:0, x54:0, x55:0, x56:0) -> f1759_0_createTree_LE(x57:0, x58:0, c, c1) :|: c1 = x56:0 + 1 && c = x55:0 - 1 && (x57:0 > 2 && x58:0 > 2 && x54:0 > 1 && x53:0 > 2 && x56:0 > -1 && x61:0 > 0 && x55:0 > 0)
f1759_0_createTree_LE(x44:0, x45:0, x46:0, x47:0) -> f1759_0_createTree_LE(x48:0, x49:0, c2, c3) :|: c3 = x47:0 + 1 && c2 = x46:0 - 1 && (x48:0 > 2 && x49:0 > 0 && x45:0 > 2 && x44:0 > 2 && x49:0 + 2 <= x45:0 && x48:0 <= x44:0 && x47:0 > -1 && x52:0 > 0 && x46:0 > 0)
f1759_0_createTree_LE(x63:0, x64:0, x65:0, x66:0) -> f1759_0_createTree_LE(x67:0, x68:0, c4, c5) :|: c5 = x66:0 + 1 && c4 = x65:0 - 1 && (x65:0 > 0 && x66:0 > -1 && x63:0 > 2 && x64:0 > 1 && x68:0 > 2 && x67:0 > 2)
f1759_0_createTree_LE(x71:0, x72:0, x73:0, x74:0) -> f1759_0_createTree_LE(x75:0, x76:0, c6, c7) :|: c7 = x74:0 + 1 && c6 = x73:0 - 1 && (x73:0 > 0 && x74:0 > -1 && x75:0 - 2 <= x71:0 && x75:0 - 2 <= x72:0 && x76:0 - 2 <= x71:0 && x76:0 - 2 <= x72:0 && x71:0 > 2 && x72:0 > 2 && x76:0 > 4 && x75:0 > 4)
f1759_0_createTree_LE(x79:0, x80:0, x81:0, x82:0) -> f1759_0_createTree_LE(x83:0, x84:0, c8, c9) :|: c9 = x82:0 + 1 && c8 = x81:0 - 1 && (x83:0 > 4 && x84:0 > 4 && x80:0 > 2 && x79:0 > 2 && x84:0 - 2 <= x80:0 && x84:0 - 2 <= x79:0 && x83:0 - 2 <= x80:0 && x83:0 - 2 <= x79:0 && x82:0 > -1 && x87:0 > 0 && x81:0 > 0)
f1759_0_createTree_LE(x34:0, x35:0, x37:0, x38:0) -> f1759_0_createTree_LE(x39:0, x40:0, c10, c11) :|: c11 = x38:0 + 1 && c10 = x37:0 - 1 && (x37:0 > 0 && x38:0 > -1 && x39:0 <= x34:0 && x40:0 + 2 <= x35:0 && x34:0 > 2 && x35:0 > 2 && x40:0 > 0 && x39:0 > 2)

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

(10) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f1759_0_createTree_LE(x, x1, x2, x3)] = x2

The following rules are decreasing:
f1759_0_createTree_LE(x53:0, x54:0, x55:0, x56:0) -> f1759_0_createTree_LE(x57:0, x58:0, c, c1) :|: c1 = x56:0 + 1 && c = x55:0 - 1 && (x57:0 > 2 && x58:0 > 2 && x54:0 > 1 && x53:0 > 2 && x56:0 > -1 && x61:0 > 0 && x55:0 > 0)
f1759_0_createTree_LE(x44:0, x45:0, x46:0, x47:0) -> f1759_0_createTree_LE(x48:0, x49:0, c2, c3) :|: c3 = x47:0 + 1 && c2 = x46:0 - 1 && (x48:0 > 2 && x49:0 > 0 && x45:0 > 2 && x44:0 > 2 && x49:0 + 2 <= x45:0 && x48:0 <= x44:0 && x47:0 > -1 && x52:0 > 0 && x46:0 > 0)
f1759_0_createTree_LE(x63:0, x64:0, x65:0, x66:0) -> f1759_0_createTree_LE(x67:0, x68:0, c4, c5) :|: c5 = x66:0 + 1 && c4 = x65:0 - 1 && (x65:0 > 0 && x66:0 > -1 && x63:0 > 2 && x64:0 > 1 && x68:0 > 2 && x67:0 > 2)
f1759_0_createTree_LE(x71:0, x72:0, x73:0, x74:0) -> f1759_0_createTree_LE(x75:0, x76:0, c6, c7) :|: c7 = x74:0 + 1 && c6 = x73:0 - 1 && (x73:0 > 0 && x74:0 > -1 && x75:0 - 2 <= x71:0 && x75:0 - 2 <= x72:0 && x76:0 - 2 <= x71:0 && x76:0 - 2 <= x72:0 && x71:0 > 2 && x72:0 > 2 && x76:0 > 4 && x75:0 > 4)
f1759_0_createTree_LE(x79:0, x80:0, x81:0, x82:0) -> f1759_0_createTree_LE(x83:0, x84:0, c8, c9) :|: c9 = x82:0 + 1 && c8 = x81:0 - 1 && (x83:0 > 4 && x84:0 > 4 && x80:0 > 2 && x79:0 > 2 && x84:0 - 2 <= x80:0 && x84:0 - 2 <= x79:0 && x83:0 - 2 <= x80:0 && x83:0 - 2 <= x79:0 && x82:0 > -1 && x87:0 > 0 && x81:0 > 0)
f1759_0_createTree_LE(x34:0, x35:0, x37:0, x38:0) -> f1759_0_createTree_LE(x39:0, x40:0, c10, c11) :|: c11 = x38:0 + 1 && c10 = x37:0 - 1 && (x37:0 > 0 && x38:0 > -1 && x39:0 <= x34:0 && x40:0 + 2 <= x35:0 && x34:0 > 2 && x35:0 > 2 && x40:0 > 0 && x39:0 > 2)
The following rules are bounded:
f1759_0_createTree_LE(x53:0, x54:0, x55:0, x56:0) -> f1759_0_createTree_LE(x57:0, x58:0, c, c1) :|: c1 = x56:0 + 1 && c = x55:0 - 1 && (x57:0 > 2 && x58:0 > 2 && x54:0 > 1 && x53:0 > 2 && x56:0 > -1 && x61:0 > 0 && x55:0 > 0)
f1759_0_createTree_LE(x44:0, x45:0, x46:0, x47:0) -> f1759_0_createTree_LE(x48:0, x49:0, c2, c3) :|: c3 = x47:0 + 1 && c2 = x46:0 - 1 && (x48:0 > 2 && x49:0 > 0 && x45:0 > 2 && x44:0 > 2 && x49:0 + 2 <= x45:0 && x48:0 <= x44:0 && x47:0 > -1 && x52:0 > 0 && x46:0 > 0)
f1759_0_createTree_LE(x63:0, x64:0, x65:0, x66:0) -> f1759_0_createTree_LE(x67:0, x68:0, c4, c5) :|: c5 = x66:0 + 1 && c4 = x65:0 - 1 && (x65:0 > 0 && x66:0 > -1 && x63:0 > 2 && x64:0 > 1 && x68:0 > 2 && x67:0 > 2)
f1759_0_createTree_LE(x71:0, x72:0, x73:0, x74:0) -> f1759_0_createTree_LE(x75:0, x76:0, c6, c7) :|: c7 = x74:0 + 1 && c6 = x73:0 - 1 && (x73:0 > 0 && x74:0 > -1 && x75:0 - 2 <= x71:0 && x75:0 - 2 <= x72:0 && x76:0 - 2 <= x71:0 && x76:0 - 2 <= x72:0 && x71:0 > 2 && x72:0 > 2 && x76:0 > 4 && x75:0 > 4)
f1759_0_createTree_LE(x79:0, x80:0, x81:0, x82:0) -> f1759_0_createTree_LE(x83:0, x84:0, c8, c9) :|: c9 = x82:0 + 1 && c8 = x81:0 - 1 && (x83:0 > 4 && x84:0 > 4 && x80:0 > 2 && x79:0 > 2 && x84:0 - 2 <= x80:0 && x84:0 - 2 <= x79:0 && x83:0 - 2 <= x80:0 && x83:0 - 2 <= x79:0 && x82:0 > -1 && x87:0 > 0 && x81:0 > 0)
f1759_0_createTree_LE(x34:0, x35:0, x37:0, x38:0) -> f1759_0_createTree_LE(x39:0, x40:0, c10, c11) :|: c11 = x38:0 + 1 && c10 = x37:0 - 1 && (x37:0 > 0 && x38:0 > -1 && x39:0 <= x34:0 && x40:0 + 2 <= x35:0 && x34:0 > 2 && x35:0 > 2 && x40:0 > 0 && x39:0 > 2)

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

(11)
YES

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f2097_0_flatten_NULL(x88, x89, x90, x91) -> f2097_0_flatten_NULL(x92, x93, x94, x95) :|: -1 <= x92 - 1 && 1 <= x88 - 1 && x92 + 2 <= x88
(2) f2097_0_flatten_NULL(x96, x97, x98, x99) -> f2097_0_flatten_NULL(x100, x101, x102, x103) :|: 2 <= x100 - 1 && 2 <= x96 - 1 && x100 - 2 <= x96

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

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f2097_0_flatten_NULL(x96:0, x97:0, x98:0, x99:0) -> f2097_0_flatten_NULL(x100:0, x101:0, x102:0, x103:0) :|: x100:0 > 2 && x96:0 > 2 && x96:0 >= x100:0 - 2
f2097_0_flatten_NULL(x88:0, x89:0, x90:0, x91:0) -> f2097_0_flatten_NULL(x92:0, x93:0, x94:0, x95:0) :|: x92:0 > -1 && x88:0 > 1 && x92:0 + 2 <= x88:0

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

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

   f2097_0_flatten_NULL(x1, x2, x3, x4) -> f2097_0_flatten_NULL(x1)

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

(16)
Obligation:
Rules:
f2097_0_flatten_NULL(x96:0) -> f2097_0_flatten_NULL(x100:0) :|: x100:0 > 2 && x96:0 > 2 && x96:0 >= x100:0 - 2
f2097_0_flatten_NULL(x88:0) -> f2097_0_flatten_NULL(x92:0) :|: x92:0 > -1 && x88:0 > 1 && x92:0 + 2 <= x88:0

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

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

(18)
Obligation:
Rules:
f2097_0_flatten_NULL(x96:0) -> f2097_0_flatten_NULL(x100:0) :|: x100:0 > 2 && x96:0 > 2 && x96:0 >= x100:0 - 2
f2097_0_flatten_NULL(x88:0) -> f2097_0_flatten_NULL(x92:0) :|: x92:0 > -1 && x88:0 > 1 && x92:0 + 2 <= x88:0

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

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

(20)
Obligation:
Rules:
f2097_0_flatten_NULL(x88:0:0) -> f2097_0_flatten_NULL(x92:0:0) :|: x92:0:0 > -1 && x88:0:0 > 1 && x92:0:0 + 2 <= x88:0:0
f2097_0_flatten_NULL(x96:0:0) -> f2097_0_flatten_NULL(x100:0:0) :|: x100:0:0 > 2 && x96:0:0 > 2 && x96:0:0 >= x100:0:0 - 2

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

(21) IntTRSPeriodicNontermProof (COMPLETE)
Normalized system to the following form:
f(pc, x88:0:0) -> f(1, x92:0:0) :|: pc = 1 && (x92:0:0 > -1 && x88:0:0 > 1 && x92:0:0 + 2 <= x88:0:0)
f(pc, x96:0:0) -> f(1, x100:0:0) :|: pc = 1 && (x100:0:0 > 2 && x96:0:0 > 2 && x96:0:0 >= x100:0:0 - 2)
Witness term starting non-terminating reduction: f(1, 5)
----------------------------------------

(22)
NO