2atan (example 3.5)

Percentage Accurate: 8.8% → 99.6%

Time: 2.7s

Alternatives: 7

Speedup: 1.4×

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.8% 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, 0.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(Float64(N - -1.0), N, 1.0))
end

Wolfram

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

Derivation

1. Initial program 8.8%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-atan.f64 N/A

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

   4. lift-atan.f64 N/A

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

   5. diff-atan N/A

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

   6. lower-atan2.f64 N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval N/A

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

   9. fp-cancel-sign-sub-inv N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. metadata-eval N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. metadata-eval N/A

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

   18. metadata-eval N/A

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

   19. lower--.f64 19.2

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

3. Applied rewrites 19.2%

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

4. Taylor expanded in N around 0

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

6. Applied rewrites 99.6%

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

Alternative 2: 99.6% accurate, 0.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 8.8%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-atan.f64 N/A

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

   4. lift-atan.f64 N/A

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

   5. diff-atan N/A

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

   6. lower-atan2.f64 N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval N/A

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

   9. fp-cancel-sign-sub-inv N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. metadata-eval N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. metadata-eval N/A

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

   18. metadata-eval N/A

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

   19. lower--.f64 19.2

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

3. Applied rewrites 19.2%

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

4. Taylor expanded in N around 0

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

6. Applied rewrites 99.6%

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

7. Taylor expanded in N around inf

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

   1. +-commutative N/A

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

   2. associate-+r+ N/A

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

   3. pow2 N/A

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

   4. lower-atan2.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. lift-fma.f64 99.6

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

9. Applied rewrites 99.6%

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

Alternative 3: 98.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;N \leq 12000:\\ \;\;\;\;\tan^{-1} \left(N + 1\right) - \tan^{-1} N\\ \mathbf{else}:\\ \;\;\;\;\tan^{-1}_* \frac{1}{N \cdot N + N}\\ \end{array} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (if (<= N 12000.0) (- (atan (+ N 1.0)) (atan N)) (atan2 1.0 (+ (* N N) N))))

C

double code(double N) {
	double tmp;
	if (N <= 12000.0) {
		tmp = atan((N + 1.0)) - atan(N);
	} else {
		tmp = atan2(1.0, ((N * N) + N));
	}
	return tmp;
}

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
    real(8) :: tmp
    if (n <= 12000.0d0) then
        tmp = atan((n + 1.0d0)) - atan(n)
    else
        tmp = atan2(1.0d0, ((n * n) + n))
    end if
    code = tmp
end function

Java

public static double code(double N) {
	double tmp;
	if (N <= 12000.0) {
		tmp = Math.atan((N + 1.0)) - Math.atan(N);
	} else {
		tmp = Math.atan2(1.0, ((N * N) + N));
	}
	return tmp;
}

Python

def code(N):
	tmp = 0
	if N <= 12000.0:
		tmp = math.atan((N + 1.0)) - math.atan(N)
	else:
		tmp = math.atan2(1.0, ((N * N) + N))
	return tmp

Julia

function code(N)
	tmp = 0.0
	if (N <= 12000.0)
		tmp = Float64(atan(Float64(N + 1.0)) - atan(N));
	else
		tmp = atan(1.0, Float64(Float64(N * N) + N));
	end
	return tmp
end

MATLAB

function tmp_2 = code(N)
	tmp = 0.0;
	if (N <= 12000.0)
		tmp = atan((N + 1.0)) - atan(N);
	else
		tmp = atan2(1.0, ((N * N) + N));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if N < 12000

   1. Initial program 81.7%

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

   if 12000 < N

   1. Initial program 5.6%

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-atan.f64 N/A

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

      4. lift-atan.f64 N/A

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

      5. diff-atan N/A

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

      6. lower-atan2.f64 N/A

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

      7. lower--.f64 N/A

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

      8. metadata-eval N/A

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

      9. fp-cancel-sign-sub-inv N/A

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. lower--.f64 N/A

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

      13. +-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. metadata-eval N/A

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

      16. fp-cancel-sign-sub-inv N/A

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

      17. metadata-eval N/A

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

      18. metadata-eval N/A

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

      19. lower--.f64 15.7

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

   3. Applied rewrites 15.7%

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

   4. Taylor expanded in N around 0

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

   6. Applied rewrites 99.6%

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

   7. Taylor expanded in N around inf

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. pow2 N/A

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

      4. lower-atan2.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lift-fma.f64 99.6

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

   9. Applied rewrites 99.6%

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

   10. Taylor expanded in N around inf

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

       1. pow2 N/A

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

       2. lift-*.f64 98.8

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

   12. Applied rewrites 98.8%

       \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + N} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 96.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double N) {
	return atan2(1.0, ((N * 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) + n))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 8.8%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-atan.f64 N/A

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

   4. lift-atan.f64 N/A

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

   5. diff-atan N/A

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

   6. lower-atan2.f64 N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval N/A

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

   9. fp-cancel-sign-sub-inv N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. metadata-eval N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. metadata-eval N/A

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

   18. metadata-eval N/A

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

   19. lower--.f64 19.2

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

3. Applied rewrites 19.2%

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

4. Taylor expanded in N around 0

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

6. Applied rewrites 99.6%

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

7. Taylor expanded in N around inf

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

   1. +-commutative N/A

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

   2. associate-+r+ N/A

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

   3. pow2 N/A

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

   4. lower-atan2.f64 N/A

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

   5. +-commutative N/A

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

   6. lower-+.f64 N/A

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

   7. lift-fma.f64 99.6

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

9. Applied rewrites 99.6%

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

10. Taylor expanded in N around inf

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

    1. pow2 N/A

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

    2. lift-*.f64 96.3

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

12. Applied rewrites 96.3%

    \[\leadsto \tan^{-1}_* \frac{1}{N \cdot N + N} \]
13. Add Preprocessing

Alternative 5: 93.2% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 8.8%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-atan.f64 N/A

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

   4. lift-atan.f64 N/A

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

   5. diff-atan N/A

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

   6. lower-atan2.f64 N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval N/A

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

   9. fp-cancel-sign-sub-inv N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. metadata-eval N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. metadata-eval N/A

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

   18. metadata-eval N/A

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

   19. lower--.f64 19.2

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

3. Applied rewrites 19.2%

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

4. Taylor expanded in N around 0

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

6. Applied rewrites 99.6%

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

7. Taylor expanded in N around inf

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

9. Applied rewrites 93.2%

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

Alternative 6: 93.2% accurate, 1.4× 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 8.8%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-atan.f64 N/A

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

   4. lift-atan.f64 N/A

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

   5. diff-atan N/A

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

   6. lower-atan2.f64 N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval N/A

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

   9. fp-cancel-sign-sub-inv N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. metadata-eval N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. metadata-eval N/A

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

   18. metadata-eval N/A

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

   19. lower--.f64 19.2

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

3. Applied rewrites 19.2%

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

4. Taylor expanded in N around 0

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

6. Applied rewrites 99.6%

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

7. Taylor expanded in N around inf

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

   1. pow2 N/A

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

   2. lift-*.f64 93.2

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

9. Applied rewrites 93.2%

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

Alternative 7: 6.3% accurate, 2.3× 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 8.8%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-atan.f64 N/A

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

   4. lift-atan.f64 N/A

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

   5. diff-atan N/A

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

   6. lower-atan2.f64 N/A

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

   7. lower--.f64 N/A

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

   8. metadata-eval N/A

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

   9. fp-cancel-sign-sub-inv N/A

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

   10. metadata-eval N/A

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

   11. metadata-eval N/A

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

   12. lower--.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. metadata-eval N/A

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

   16. fp-cancel-sign-sub-inv N/A

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

   17. metadata-eval N/A

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

   18. metadata-eval N/A

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

   19. lower--.f64 19.2

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

3. Applied rewrites 19.2%

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

4. Taylor expanded in N around 0

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

6. Applied rewrites 99.6%

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

7. Taylor expanded in N around inf

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

   1. pow2 N/A

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

   2. lift-*.f64 93.2

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

9. Applied rewrites 93.2%

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

10. Taylor expanded in N around 0

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

    1. flip3-- 6.3

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

    2. metadata-eval 6.3

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

    3. metadata-eval 6.3

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

    4. *-commutative 6.3

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

    5. mul-1-neg 6.3

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

12. Applied rewrites 6.3%

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

Reproduce

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