2atan (example 3.5)

Percentage Accurate: 8.7% → 99.6%

Time: 4.8s

Alternatives: 6

Speedup: 1.9×

Specification

\[N > 1 \land N < 10^{+100}\]

Math

\[\begin{array}{l} \\ \tan^{-1} \left(N + 1\right) - \tan^{-1} N \end{array} \]

FPCore

(FPCore (N) :precision binary64 (- (atan (+ N 1.0)) (atan N)))

C

double code(double N) {
	return atan((N + 1.0)) - atan(N);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n)
use fmin_fmax_functions
    real(8), intent (in) :: n
    code = atan((n + 1.0d0)) - atan(n)
end function

Java

public static double code(double N) {
	return Math.atan((N + 1.0)) - Math.atan(N);
}

Python

def code(N):
	return math.atan((N + 1.0)) - math.atan(N)

Julia

function code(N)
	return Float64(atan(Float64(N + 1.0)) - atan(N))
end

MATLAB

function tmp = code(N)
	tmp = atan((N + 1.0)) - atan(N);
end

Wolfram

code[N_] := N[(N[ArcTan[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[ArcTan[N], $MachinePrecision]), $MachinePrecision]

Initial Program: 8.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \tan^{-1} \left(N + 1\right) - \tan^{-1} N \end{array} \]

FPCore

(FPCore (N) :precision binary64 (- (atan (+ N 1.0)) (atan N)))

C

double code(double N) {
	return atan((N + 1.0)) - atan(N);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n)
use fmin_fmax_functions
    real(8), intent (in) :: n
    code = atan((n + 1.0d0)) - atan(n)
end function

Java

public static double code(double N) {
	return Math.atan((N + 1.0)) - Math.atan(N);
}

Python

def code(N):
	return math.atan((N + 1.0)) - math.atan(N)

Julia

function code(N)
	return Float64(atan(Float64(N + 1.0)) - atan(N))
end

MATLAB

function tmp = code(N)
	tmp = atan((N + 1.0)) - atan(N);
end

Wolfram

code[N_] := N[(N[ArcTan[N[(N + 1.0), $MachinePrecision]], $MachinePrecision] - N[ArcTan[N], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 (fma (+ 1.0 N) N 1.0)))

C

double code(double N) {
	return atan2(1.0, fma((1.0 + N), N, 1.0));
}

Julia

function code(N)
	return atan(1.0, fma(Float64(1.0 + N), N, 1.0))
end

Wolfram

code[N_] := N[ArcTan[1.0 / N[(N[(1.0 + N), $MachinePrecision] * N + 1.0), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 7.7%

   \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right) - \tan^{-1} N} \]

   2. lift-atan.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right)} - \tan^{-1} N \]

   3. lift-atan.f64 N/A

      \[\leadsto \tan^{-1} \left(N + 1\right) - \color{blue}{\tan^{-1} N} \]

   4. diff-atan N/A

      \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}} \]

   5. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(N + 1\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   6. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(1 + N\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   7. associate--l+ N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1 + \left(N - N\right)}}{1 + \left(N + 1\right) \cdot N} \]

   8. +-inverses N/A

      \[\leadsto \tan^{-1}_* \frac{1 + \color{blue}{0}}{1 + \left(N + 1\right) \cdot N} \]

   9. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N} \]

   10. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N + 1}} \]

   11. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   12. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right)} + 1} \]

   13. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N + \left(N + 1\right)}} \]

   14. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(1 + N\right)}} \]

   15. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1 \cdot 1} + N\right)} \]

   16. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + \color{blue}{N \cdot 1}\right)} \]

   17. lower-atan2.f64 N/A

       \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + N \cdot 1\right)}} \]

   18. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1} + N \cdot 1\right)} \]

   19. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 + \color{blue}{N}\right)} \]

   20. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(N + 1\right)}} \]

   21. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right) + 1}} \]

   22. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N} + 1} \]

   23. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   24. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N + 1, N, 1\right)}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)}} \]
5. Add Preprocessing

Alternative 2: 99.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{\mathsf{fma}\left(N, N, 1\right) + N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 (+ (fma N N 1.0) N)))

C

double code(double N) {
	return atan2(1.0, (fma(N, N, 1.0) + N));
}

Julia

function code(N)
	return atan(1.0, Float64(fma(N, N, 1.0) + N))
end

Wolfram

code[N_] := N[ArcTan[1.0 / N[(N[(N * N + 1.0), $MachinePrecision] + N), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 7.7%

   \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right) - \tan^{-1} N} \]

   2. lift-atan.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right)} - \tan^{-1} N \]

   3. lift-atan.f64 N/A

      \[\leadsto \tan^{-1} \left(N + 1\right) - \color{blue}{\tan^{-1} N} \]

   4. diff-atan N/A

      \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}} \]

   5. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(N + 1\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   6. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(1 + N\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   7. associate--l+ N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1 + \left(N - N\right)}}{1 + \left(N + 1\right) \cdot N} \]

   8. +-inverses N/A

      \[\leadsto \tan^{-1}_* \frac{1 + \color{blue}{0}}{1 + \left(N + 1\right) \cdot N} \]

   9. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N} \]

   10. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N + 1}} \]

   11. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   12. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right)} + 1} \]

   13. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N + \left(N + 1\right)}} \]

   14. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(1 + N\right)}} \]

   15. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1 \cdot 1} + N\right)} \]

   16. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + \color{blue}{N \cdot 1}\right)} \]

   17. lower-atan2.f64 N/A

       \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + N \cdot 1\right)}} \]

   18. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1} + N \cdot 1\right)} \]

   19. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 + \color{blue}{N}\right)} \]

   20. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(N + 1\right)}} \]

   21. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right) + 1}} \]

   22. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N} + 1} \]

   23. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   24. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N + 1, N, 1\right)}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)}} \]
5. Step-by-step derivation

   1. lift-fma.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(1 + N\right) \cdot N + 1}} \]

   2. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{1 + \left(1 + N\right) \cdot N}} \]

   3. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{1 \cdot 1} + \left(1 + N\right) \cdot N} \]

   4. *-rgt-identity N/A

      \[\leadsto \tan^{-1}_* \frac{1}{1 \cdot 1 + \color{blue}{\left(\left(1 + N\right) \cdot N\right) \cdot 1}} \]

   5. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{1} + \left(\left(1 + N\right) \cdot N\right) \cdot 1} \]

   6. *-rgt-identity N/A

      \[\leadsto \tan^{-1}_* \frac{1}{1 + \color{blue}{\left(1 + N\right) \cdot N}} \]

   7. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{1}{1 + \color{blue}{\left(1 + N\right)} \cdot N} \]

   8. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{1}{1 + \color{blue}{\left(N + 1\right)} \cdot N} \]

   9. distribute-lft1-in N/A

      \[\leadsto \tan^{-1}_* \frac{1}{1 + \color{blue}{\left(N \cdot N + N\right)}} \]

   10. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(1 + N \cdot N\right) + N}} \]

   11. lower-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(1 + N \cdot N\right) + N}} \]

   12. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + 1\right)} + N} \]

   13. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N, N, 1\right)} + N} \]

6. Applied rewrites 99.6%

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N, N, 1\right) + N}} \]
7. Add Preprocessing

Alternative 3: 96.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{\mathsf{fma}\left(N, N, N\right)} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 (fma N N N)))

C

double code(double N) {
	return atan2(1.0, fma(N, N, N));
}

Julia

function code(N)
	return atan(1.0, fma(N, N, N))
end

Wolfram

code[N_] := N[ArcTan[1.0 / N[(N * N + N), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 7.7%

   \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right) - \tan^{-1} N} \]

   2. lift-atan.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right)} - \tan^{-1} N \]

   3. lift-atan.f64 N/A

      \[\leadsto \tan^{-1} \left(N + 1\right) - \color{blue}{\tan^{-1} N} \]

   4. diff-atan N/A

      \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}} \]

   5. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(N + 1\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   6. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(1 + N\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   7. associate--l+ N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1 + \left(N - N\right)}}{1 + \left(N + 1\right) \cdot N} \]

   8. +-inverses N/A

      \[\leadsto \tan^{-1}_* \frac{1 + \color{blue}{0}}{1 + \left(N + 1\right) \cdot N} \]

   9. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N} \]

   10. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N + 1}} \]

   11. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   12. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right)} + 1} \]

   13. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N + \left(N + 1\right)}} \]

   14. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(1 + N\right)}} \]

   15. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1 \cdot 1} + N\right)} \]

   16. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + \color{blue}{N \cdot 1}\right)} \]

   17. lower-atan2.f64 N/A

       \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + N \cdot 1\right)}} \]

   18. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1} + N \cdot 1\right)} \]

   19. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 + \color{blue}{N}\right)} \]

   20. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(N + 1\right)}} \]

   21. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right) + 1}} \]

   22. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N} + 1} \]

   23. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   24. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N + 1, N, 1\right)}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)}} \]

5. Taylor expanded in N around inf

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{{N}^{2} \cdot \left(1 + \frac{1}{N}\right)}} \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{1}{{N}^{2} \cdot \color{blue}{\left(\frac{1}{N} + 1\right)}} \]

   2. distribute-lft-in N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{{N}^{2} \cdot \frac{1}{N} + {N}^{2} \cdot 1}} \]

   3. unpow2 N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N\right)} \cdot \frac{1}{N} + {N}^{2} \cdot 1} \]

   4. associate-*l* N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot \left(N \cdot \frac{1}{N}\right)} + {N}^{2} \cdot 1} \]

   5. rgt-mult-inverse N/A

      \[\leadsto \tan^{-1}_* \frac{1}{N \cdot \color{blue}{1} + {N}^{2} \cdot 1} \]

   6. *-rgt-identity N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N} + {N}^{2} \cdot 1} \]

   7. *-rgt-identity N/A

      \[\leadsto \tan^{-1}_* \frac{1}{N + \color{blue}{{N}^{2}}} \]

   8. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{{N}^{2} + N}} \]

   9. unpow2 N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N} + N} \]

   10. lower-fma.f64 97.2

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N, N, N\right)}} \]

7. Applied rewrites 97.2%

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N, N, N\right)}} \]
8. Add Preprocessing

Alternative 4: 93.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{N \cdot N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 (* N N)))

C

double code(double N) {
	return atan2(1.0, (N * N));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n)
use fmin_fmax_functions
    real(8), intent (in) :: n
    code = atan2(1.0d0, (n * n))
end function

Java

public static double code(double N) {
	return Math.atan2(1.0, (N * N));
}

Python

def code(N):
	return math.atan2(1.0, (N * N))

Julia

function code(N)
	return atan(1.0, Float64(N * N))
end

MATLAB

function tmp = code(N)
	tmp = atan2(1.0, (N * N));
end

Wolfram

code[N_] := N[ArcTan[1.0 / N[(N * N), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 7.7%

   \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right) - \tan^{-1} N} \]

   2. lift-atan.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right)} - \tan^{-1} N \]

   3. lift-atan.f64 N/A

      \[\leadsto \tan^{-1} \left(N + 1\right) - \color{blue}{\tan^{-1} N} \]

   4. diff-atan N/A

      \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}} \]

   5. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(N + 1\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   6. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(1 + N\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   7. associate--l+ N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1 + \left(N - N\right)}}{1 + \left(N + 1\right) \cdot N} \]

   8. +-inverses N/A

      \[\leadsto \tan^{-1}_* \frac{1 + \color{blue}{0}}{1 + \left(N + 1\right) \cdot N} \]

   9. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N} \]

   10. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N + 1}} \]

   11. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   12. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right)} + 1} \]

   13. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N + \left(N + 1\right)}} \]

   14. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(1 + N\right)}} \]

   15. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1 \cdot 1} + N\right)} \]

   16. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + \color{blue}{N \cdot 1}\right)} \]

   17. lower-atan2.f64 N/A

       \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + N \cdot 1\right)}} \]

   18. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1} + N \cdot 1\right)} \]

   19. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 + \color{blue}{N}\right)} \]

   20. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(N + 1\right)}} \]

   21. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right) + 1}} \]

   22. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N} + 1} \]

   23. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   24. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N + 1, N, 1\right)}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)}} \]

5. Taylor expanded in N around inf

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{{N}^{2}}} \]
6. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N}} \]

   2. lower-*.f64 93.8

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N}} \]

7. Applied rewrites 93.8%

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N}} \]
8. Add Preprocessing

Alternative 5: 7.9% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{N - -1} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 (- N -1.0)))

C

double code(double N) {
	return atan2(1.0, (N - -1.0));
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n)
use fmin_fmax_functions
    real(8), intent (in) :: n
    code = atan2(1.0d0, (n - (-1.0d0)))
end function

Java

public static double code(double N) {
	return Math.atan2(1.0, (N - -1.0));
}

Python

def code(N):
	return math.atan2(1.0, (N - -1.0))

Julia

function code(N)
	return atan(1.0, Float64(N - -1.0))
end

MATLAB

function tmp = code(N)
	tmp = atan2(1.0, (N - -1.0));
end

Wolfram

code[N_] := N[ArcTan[1.0 / N[(N - -1.0), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 7.7%

   \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right) - \tan^{-1} N} \]

   2. lift-atan.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right)} - \tan^{-1} N \]

   3. lift-atan.f64 N/A

      \[\leadsto \tan^{-1} \left(N + 1\right) - \color{blue}{\tan^{-1} N} \]

   4. diff-atan N/A

      \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}} \]

   5. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(N + 1\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   6. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(1 + N\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   7. associate--l+ N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1 + \left(N - N\right)}}{1 + \left(N + 1\right) \cdot N} \]

   8. +-inverses N/A

      \[\leadsto \tan^{-1}_* \frac{1 + \color{blue}{0}}{1 + \left(N + 1\right) \cdot N} \]

   9. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N} \]

   10. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N + 1}} \]

   11. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   12. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right)} + 1} \]

   13. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N + \left(N + 1\right)}} \]

   14. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(1 + N\right)}} \]

   15. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1 \cdot 1} + N\right)} \]

   16. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + \color{blue}{N \cdot 1}\right)} \]

   17. lower-atan2.f64 N/A

       \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + N \cdot 1\right)}} \]

   18. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1} + N \cdot 1\right)} \]

   19. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 + \color{blue}{N}\right)} \]

   20. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(N + 1\right)}} \]

   21. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right) + 1}} \]

   22. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N} + 1} \]

   23. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   24. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N + 1, N, 1\right)}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)}} \]

5. Taylor expanded in N around 0

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{1 + N}} \]
6. Step-by-step derivation

   1. *-rgt-identity N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(1 + N\right) \cdot 1}} \]

   2. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot 1} \]

   3. distribute-lft1-in N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot 1 + 1}} \]

   4. rgt-mult-inverse N/A

      \[\leadsto \tan^{-1}_* \frac{1}{N \cdot 1 + \color{blue}{N \cdot \frac{1}{N}}} \]

   5. *-rgt-identity N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N} + N \cdot \frac{1}{N}} \]

   6. *-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{1}{N + \color{blue}{\frac{1}{N} \cdot N}} \]

   7. cancel-sign-sub N/A

      \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N - \left(\mathsf{neg}\left(\frac{1}{N}\right)\right) \cdot N}} \]

   8. distribute-lft-neg-out N/A

      \[\leadsto \tan^{-1}_* \frac{1}{N - \color{blue}{\left(\mathsf{neg}\left(\frac{1}{N} \cdot N\right)\right)}} \]

   9. lft-mult-inverse N/A

      \[\leadsto \tan^{-1}_* \frac{1}{N - \left(\mathsf{neg}\left(\color{blue}{1}\right)\right)} \]

   10. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N - \color{blue}{-1}} \]

   11. lower--.f64 7.9

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N - -1}} \]

7. Applied rewrites 7.9%

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N - -1}} \]
8. Add Preprocessing

Alternative 6: 6.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{1} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 1.0))

C

double code(double N) {
	return atan2(1.0, 1.0);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(n)
use fmin_fmax_functions
    real(8), intent (in) :: n
    code = atan2(1.0d0, 1.0d0)
end function

Java

public static double code(double N) {
	return Math.atan2(1.0, 1.0);
}

Python

def code(N):
	return math.atan2(1.0, 1.0)

Julia

function code(N)
	return atan(1.0, 1.0)
end

MATLAB

function tmp = code(N)
	tmp = atan2(1.0, 1.0);
end

Wolfram

code[N_] := N[ArcTan[1.0 / 1.0], $MachinePrecision]

Derivation

1. Initial program 7.7%

   \[\tan^{-1} \left(N + 1\right) - \tan^{-1} N \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right) - \tan^{-1} N} \]

   2. lift-atan.f64 N/A

      \[\leadsto \color{blue}{\tan^{-1} \left(N + 1\right)} - \tan^{-1} N \]

   3. lift-atan.f64 N/A

      \[\leadsto \tan^{-1} \left(N + 1\right) - \color{blue}{\tan^{-1} N} \]

   4. diff-atan N/A

      \[\leadsto \color{blue}{\tan^{-1}_* \frac{\left(N + 1\right) - N}{1 + \left(N + 1\right) \cdot N}} \]

   5. lift-+.f64 N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(N + 1\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   6. +-commutative N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{\left(1 + N\right)} - N}{1 + \left(N + 1\right) \cdot N} \]

   7. associate--l+ N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1 + \left(N - N\right)}}{1 + \left(N + 1\right) \cdot N} \]

   8. +-inverses N/A

      \[\leadsto \tan^{-1}_* \frac{1 + \color{blue}{0}}{1 + \left(N + 1\right) \cdot N} \]

   9. metadata-eval N/A

      \[\leadsto \tan^{-1}_* \frac{\color{blue}{1}}{1 + \left(N + 1\right) \cdot N} \]

   10. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N + 1}} \]

   11. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   12. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right)} + 1} \]

   13. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{N \cdot N + \left(N + 1\right)}} \]

   14. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(1 + N\right)}} \]

   15. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1 \cdot 1} + N\right)} \]

   16. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + \color{blue}{N \cdot 1}\right)} \]

   17. lower-atan2.f64 N/A

       \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{N \cdot N + \left(1 \cdot 1 + N \cdot 1\right)}} \]

   18. metadata-eval N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(\color{blue}{1} + N \cdot 1\right)} \]

   19. *-rgt-identity N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \left(1 + \color{blue}{N}\right)} \]

   20. +-commutative N/A

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + \color{blue}{\left(N + 1\right)}} \]

   21. associate-+r+ N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N \cdot N + N\right) + 1}} \]

   22. distribute-lft1-in N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right) \cdot N} + 1} \]

   23. lift-+.f64 N/A

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\left(N + 1\right)} \cdot N + 1} \]

   24. lower-fma.f64 99.6

       \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{\mathsf{fma}\left(N + 1, N, 1\right)}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\tan^{-1}_* \frac{1}{\mathsf{fma}\left(1 + N, N, 1\right)}} \]

5. Taylor expanded in N around 0

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{1}} \]
6. Step-by-step derivation

7. Applied rewrites 6.3%

   \[\leadsto \tan^{-1}_* \frac{1}{\color{blue}{1}} \]
8. Add Preprocessing

Developer Target 1: 99.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \tan^{-1}_* \frac{1}{\mathsf{fma}\left(N, 1 + N, 1\right)} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (atan2 1.0 (fma N (+ 1.0 N) 1.0)))

C

double code(double N) {
	return atan2(1.0, fma(N, (1.0 + N), 1.0));
}

Julia

function code(N)
	return atan(1.0, fma(N, Float64(1.0 + N), 1.0))
end

Wolfram

code[N_] := N[ArcTan[1.0 / N[(N * N[(1.0 + N), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]

Reproduce

herbie shell --seed 2024359 
(FPCore (N)
  :name "2atan (example 3.5)"
  :precision binary64
  :pre (and (> N 1.0) (< N 1e+100))

  :alt
  (! :herbie-platform default (atan2 1 (fma N (+ 1 N) 1)))

  (- (atan (+ N 1.0)) (atan N)))