Certification Problem

Input (TPDB SRS_Standard/Secret_07_SRS/dj)

The rewrite relation of the following TRS is considered.

1(0(x1)) 0(0(0(1(x1)))) (1)
0(1(x1)) 1(x1) (2)
1(1(x1)) 0(0(0(0(x1)))) (3)
0(0(x1)) 0(x1) (4)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by NaTT @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
1#(1(x1)) 0#(0(0(x1))) (5)
1#(0(x1)) 0#(0(1(x1))) (6)
1#(0(x1)) 0#(1(x1)) (7)
1#(0(x1)) 0#(0(0(1(x1)))) (8)
1#(1(x1)) 0#(0(x1)) (9)
1#(1(x1)) 0#(0(0(0(x1)))) (10)
1#(0(x1)) 1#(x1) (11)
1#(1(x1)) 0#(x1) (12)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.