2log (problem 3.3.6)

Percentage Accurate: 23.7% → 99.3%

Time: 6.8s

Alternatives: 9

Speedup: 17.3×

Specification

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

Math

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

FPCore

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

C

double code(double N) {
	return log((N + 1.0)) - log(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 = log((n + 1.0d0)) - log(n)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 23.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double N) {
	return log((N + 1.0)) - log(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 = log((n + 1.0d0)) - log(n)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.3% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log N + \mathsf{log1p}\left(N\right)\\ t_1 := {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\\ \mathbf{if}\;N \leq 1550:\\ \;\;\;\;\frac{\log \left({\left(\frac{N - -1}{N}\right)}^{\left(\mathsf{fma}\left(t\_0, \log N, t\_1\right)\right)}\right)}{\mathsf{fma}\left(\log N, t\_0, t\_1\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{\mathsf{fma}\left(0.3333333333333333, N, -0.25\right)}{N \cdot N} - 0.5}{N} - -1}{N}\\ \end{array} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (let* ((t_0 (+ (log N) (log1p N))) (t_1 (pow (log1p N) 2.0)))
   (if (<= N 1550.0)
     (/
      (log (pow (/ (- N -1.0) N) (fma t_0 (log N) t_1)))
      (fma (log N) t_0 t_1))
     (/
      (- (/ (- (/ (fma 0.3333333333333333 N -0.25) (* N N)) 0.5) N) -1.0)
      N))))

C

double code(double N) {
	double t_0 = log(N) + log1p(N);
	double t_1 = pow(log1p(N), 2.0);
	double tmp;
	if (N <= 1550.0) {
		tmp = log(pow(((N - -1.0) / N), fma(t_0, log(N), t_1))) / fma(log(N), t_0, t_1);
	} else {
		tmp = ((((fma(0.3333333333333333, N, -0.25) / (N * N)) - 0.5) / N) - -1.0) / N;
	}
	return tmp;
}

Julia

function code(N)
	t_0 = Float64(log(N) + log1p(N))
	t_1 = log1p(N) ^ 2.0
	tmp = 0.0
	if (N <= 1550.0)
		tmp = Float64(log((Float64(Float64(N - -1.0) / N) ^ fma(t_0, log(N), t_1))) / fma(log(N), t_0, t_1));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(fma(0.3333333333333333, N, -0.25) / Float64(N * N)) - 0.5) / N) - -1.0) / N);
	end
	return tmp
end

Wolfram

code[N_] := Block[{t$95$0 = N[(N[Log[N], $MachinePrecision] + N[Log[1 + N], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[Power[N[Log[1 + N], $MachinePrecision], 2.0], $MachinePrecision]}, If[LessEqual[N, 1550.0], N[(N[Log[N[Power[N[(N[(N - -1.0), $MachinePrecision] / N), $MachinePrecision], N[(t$95$0 * N[Log[N], $MachinePrecision] + t$95$1), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] / N[(N[Log[N], $MachinePrecision] * t$95$0 + t$95$1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(N[(N[(0.3333333333333333 * N + -0.25), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision] / N), $MachinePrecision] - -1.0), $MachinePrecision] / N), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if N < 1550

   1. Initial program 90.1%

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

      1. lift--.f64 N/A

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

      2. flip3-- N/A

         \[\leadsto \color{blue}{\frac{{\log \left(N + 1\right)}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{\log \left(N + 1\right)}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)}} \]

      4. lower--.f64 N/A

         \[\leadsto \frac{\color{blue}{{\log \left(N + 1\right)}^{3} - {\log N}^{3}}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      5. lower-pow.f64 N/A

         \[\leadsto \frac{\color{blue}{{\log \left(N + 1\right)}^{3}} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      6. lift-log.f64 N/A

         \[\leadsto \frac{{\color{blue}{\log \left(N + 1\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      7. lift-+.f64 N/A

         \[\leadsto \frac{{\log \color{blue}{\left(N + 1\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      8. +-commutative N/A

         \[\leadsto \frac{{\log \color{blue}{\left(1 + N\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      9. lower-log1p.f64 N/A

         \[\leadsto \frac{{\color{blue}{\left(\mathsf{log1p}\left(N\right)\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      10. lower-pow.f64 N/A

          \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - \color{blue}{{\log N}^{3}}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

      11. +-commutative N/A

          \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\color{blue}{\left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right) + \log \left(N + 1\right) \cdot \log \left(N + 1\right)}} \]

      12. distribute-rgt-out N/A

          \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\color{blue}{\log N \cdot \left(\log N + \log \left(N + 1\right)\right)} + \log \left(N + 1\right) \cdot \log \left(N + 1\right)} \]

      13. +-commutative N/A

          \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\log N \cdot \color{blue}{\left(\log \left(N + 1\right) + \log N\right)} + \log \left(N + 1\right) \cdot \log \left(N + 1\right)} \]

      14. lower-fma.f64 N/A

          \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\color{blue}{\mathsf{fma}\left(\log N, \log \left(N + 1\right) + \log N, \log \left(N + 1\right) \cdot \log \left(N + 1\right)\right)}} \]

   4. Applied rewrites 90.8%

      \[\leadsto \color{blue}{\frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)}} \]
   5. Step-by-step derivation

      1. lift--.f64 N/A

         \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      2. lift-pow.f64 N/A

         \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{3}} - {\log N}^{3}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      3. lift-pow.f64 N/A

         \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - \color{blue}{{\log N}^{3}}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      4. difference-cubes N/A

         \[\leadsto \frac{\color{blue}{\left(\mathsf{log1p}\left(N\right) \cdot \mathsf{log1p}\left(N\right) + \left(\log N \cdot \log N + \mathsf{log1p}\left(N\right) \cdot \log N\right)\right) \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      5. distribute-rgt-in N/A

         \[\leadsto \frac{\left(\mathsf{log1p}\left(N\right) \cdot \mathsf{log1p}\left(N\right) + \color{blue}{\log N \cdot \left(\log N + \mathsf{log1p}\left(N\right)\right)}\right) \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      6. lift-+.f64 N/A

         \[\leadsto \frac{\left(\mathsf{log1p}\left(N\right) \cdot \mathsf{log1p}\left(N\right) + \log N \cdot \color{blue}{\left(\log N + \mathsf{log1p}\left(N\right)\right)}\right) \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      7. unpow2 N/A

         \[\leadsto \frac{\left(\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{2}} + \log N \cdot \left(\log N + \mathsf{log1p}\left(N\right)\right)\right) \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      8. lift-pow.f64 N/A

         \[\leadsto \frac{\left(\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{2}} + \log N \cdot \left(\log N + \mathsf{log1p}\left(N\right)\right)\right) \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      9. +-commutative N/A

         \[\leadsto \frac{\color{blue}{\left(\log N \cdot \left(\log N + \mathsf{log1p}\left(N\right)\right) + {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      10. lift-fma.f64 N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \cdot \left(\mathsf{log1p}\left(N\right) - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      11. lift-log1p.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right) \cdot \left(\color{blue}{\log \left(1 + N\right)} - \log N\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      12. lift-log.f64 N/A

          \[\leadsto \frac{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right) \cdot \left(\log \left(1 + N\right) - \color{blue}{\log N}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      13. diff-log N/A

          \[\leadsto \frac{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right) \cdot \color{blue}{\log \left(\frac{1 + N}{N}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      14. log-pow-rev N/A

          \[\leadsto \frac{\color{blue}{\log \left({\left(\frac{1 + N}{N}\right)}^{\left(\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)\right)}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

      15. lower-log.f64 N/A

          \[\leadsto \frac{\color{blue}{\log \left({\left(\frac{1 + N}{N}\right)}^{\left(\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)\right)}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   6. Applied rewrites 93.6%

      \[\leadsto \frac{\color{blue}{\log \left({\left(\frac{N - -1}{N}\right)}^{\left(\mathsf{fma}\left(\log N + \mathsf{log1p}\left(N\right), \log N, {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)\right)}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   if 1550 < N

   1. Initial program 18.2%

      \[\log \left(N + 1\right) - \log N \]
   2. Add Preprocessing

   3. Taylor expanded in N around inf

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

   5. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\frac{\frac{\frac{\frac{-0.25}{N} + 0.3333333333333333}{N} - 0.5}{N} - -1}{N}} \]

   6. Taylor expanded in N around 0

      \[\leadsto \frac{\frac{\frac{\frac{1}{3} \cdot N - \frac{1}{4}}{{N}^{2}} - \frac{1}{2}}{N} - -1}{N} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.7%

      \[\leadsto \frac{\frac{\frac{\mathsf{fma}\left(0.3333333333333333, N, -0.25\right)}{N \cdot N} - 0.5}{N} - -1}{N} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;N \leq 1550:\\ \;\;\;\;\log \left(\frac{N - -1}{N}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\frac{\mathsf{fma}\left(0.3333333333333333, N, -0.25\right)}{N \cdot N} - 0.5}{N} - -1}{N}\\ \end{array} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (if (<= N 1550.0)
   (log (/ (- N -1.0) N))
   (/ (- (/ (- (/ (fma 0.3333333333333333 N -0.25) (* N N)) 0.5) N) -1.0) N)))

C

double code(double N) {
	double tmp;
	if (N <= 1550.0) {
		tmp = log(((N - -1.0) / N));
	} else {
		tmp = ((((fma(0.3333333333333333, N, -0.25) / (N * N)) - 0.5) / N) - -1.0) / N;
	}
	return tmp;
}

Julia

function code(N)
	tmp = 0.0
	if (N <= 1550.0)
		tmp = log(Float64(Float64(N - -1.0) / N));
	else
		tmp = Float64(Float64(Float64(Float64(Float64(fma(0.3333333333333333, N, -0.25) / Float64(N * N)) - 0.5) / N) - -1.0) / N);
	end
	return tmp
end

Wolfram

code[N_] := If[LessEqual[N, 1550.0], N[Log[N[(N[(N - -1.0), $MachinePrecision] / N), $MachinePrecision]], $MachinePrecision], N[(N[(N[(N[(N[(N[(0.3333333333333333 * N + -0.25), $MachinePrecision] / N[(N * N), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision] / N), $MachinePrecision] - -1.0), $MachinePrecision] / N), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if N < 1550

   1. Initial program 90.1%

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

      1. lift--.f64 N/A

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

      2. lift-log.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. diff-log N/A

         \[\leadsto \color{blue}{\log \left(\frac{N + 1}{N}\right)} \]

      5. lower-log.f64 N/A

         \[\leadsto \color{blue}{\log \left(\frac{N + 1}{N}\right)} \]

      6. lower-/.f64 93.5

         \[\leadsto \log \color{blue}{\left(\frac{N + 1}{N}\right)} \]

      7. lift-+.f64 N/A

         \[\leadsto \log \left(\frac{\color{blue}{N + 1}}{N}\right) \]

      8. metadata-eval N/A

         \[\leadsto \log \left(\frac{N + \color{blue}{1 \cdot 1}}{N}\right) \]

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

         \[\leadsto \log \left(\frac{\color{blue}{N - \left(\mathsf{neg}\left(1\right)\right) \cdot 1}}{N}\right) \]

      10. metadata-eval N/A

          \[\leadsto \log \left(\frac{N - \color{blue}{-1} \cdot 1}{N}\right) \]

      11. metadata-eval N/A

          \[\leadsto \log \left(\frac{N - \color{blue}{-1}}{N}\right) \]

      12. metadata-eval N/A

          \[\leadsto \log \left(\frac{N - \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}}{N}\right) \]

      13. lower--.f64 N/A

          \[\leadsto \log \left(\frac{\color{blue}{N - \left(\mathsf{neg}\left(1\right)\right)}}{N}\right) \]

      14. metadata-eval 93.5

          \[\leadsto \log \left(\frac{N - \color{blue}{-1}}{N}\right) \]

   4. Applied rewrites 93.5%

      \[\leadsto \color{blue}{\log \left(\frac{N - -1}{N}\right)} \]

   if 1550 < N

   1. Initial program 18.2%

      \[\log \left(N + 1\right) - \log N \]
   2. Add Preprocessing

   3. Taylor expanded in N around inf

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

   5. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\frac{\frac{\frac{\frac{-0.25}{N} + 0.3333333333333333}{N} - 0.5}{N} - -1}{N}} \]

   6. Taylor expanded in N around 0

      \[\leadsto \frac{\frac{\frac{\frac{1}{3} \cdot N - \frac{1}{4}}{{N}^{2}} - \frac{1}{2}}{N} - -1}{N} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.7%

      \[\leadsto \frac{\frac{\frac{\mathsf{fma}\left(0.3333333333333333, N, -0.25\right)}{N \cdot N} - 0.5}{N} - -1}{N} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 96.5% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{\frac{\mathsf{fma}\left(0.3333333333333333, N, -0.25\right)}{N \cdot N} - 0.5}{N} - -1}{N} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ (- (/ (- (/ (fma 0.3333333333333333 N -0.25) (* N N)) 0.5) N) -1.0) N))

C

double code(double N) {
	return ((((fma(0.3333333333333333, N, -0.25) / (N * N)) - 0.5) / N) - -1.0) / N;
}

Julia

function code(N)
	return Float64(Float64(Float64(Float64(Float64(fma(0.3333333333333333, N, -0.25) / Float64(N * N)) - 0.5) / N) - -1.0) / N)
end

Wolfram

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

Derivation

1. Initial program 23.6%

   \[\log \left(N + 1\right) - \log N \]
2. Add Preprocessing

3. Taylor expanded in N around inf

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

5. Applied rewrites 96.6%

   \[\leadsto \color{blue}{\frac{\frac{\frac{\frac{-0.25}{N} + 0.3333333333333333}{N} - 0.5}{N} - -1}{N}} \]

6. Taylor expanded in N around 0

   \[\leadsto \frac{\frac{\frac{\frac{1}{3} \cdot N - \frac{1}{4}}{{N}^{2}} - \frac{1}{2}}{N} - -1}{N} \]
7. Step-by-step derivation

8. Applied rewrites 96.6%

   \[\leadsto \frac{\frac{\frac{\mathsf{fma}\left(0.3333333333333333, N, -0.25\right)}{N \cdot N} - 0.5}{N} - -1}{N} \]
9. Add Preprocessing

Alternative 4: 95.2% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{\frac{0.3333333333333333}{N} - 0.5}{N} - -1}{N} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ (- (/ (- (/ 0.3333333333333333 N) 0.5) N) -1.0) N))

C

double code(double N) {
	return ((((0.3333333333333333 / N) - 0.5) / N) - -1.0) / 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 = ((((0.3333333333333333d0 / n) - 0.5d0) / n) - (-1.0d0)) / n
end function

Java

public static double code(double N) {
	return ((((0.3333333333333333 / N) - 0.5) / N) - -1.0) / N;
}

Python

def code(N):
	return ((((0.3333333333333333 / N) - 0.5) / N) - -1.0) / N

Julia

function code(N)
	return Float64(Float64(Float64(Float64(Float64(0.3333333333333333 / N) - 0.5) / N) - -1.0) / N)
end

MATLAB

function tmp = code(N)
	tmp = ((((0.3333333333333333 / N) - 0.5) / N) - -1.0) / N;
end

Wolfram

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

Derivation

1. Initial program 23.6%

   \[\log \left(N + 1\right) - \log N \]
2. Add Preprocessing

3. Taylor expanded in N around inf

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

5. Applied rewrites 96.6%

   \[\leadsto \color{blue}{\frac{\frac{\frac{\frac{-0.25}{N} + 0.3333333333333333}{N} - 0.5}{N} - -1}{N}} \]

6. Taylor expanded in N around inf

   \[\leadsto \frac{\frac{\frac{\frac{1}{3}}{N} - \frac{1}{2}}{N} - -1}{N} \]
7. Step-by-step derivation

8. Applied rewrites 95.3%

   \[\leadsto \frac{\frac{\frac{0.3333333333333333}{N} - 0.5}{N} - -1}{N} \]
9. Add Preprocessing

Alternative 5: 94.9% accurate, 6.1× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\frac{0.3333333333333333}{N} - 0.5\right) + N}{N \cdot N} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (/ (+ (- (/ 0.3333333333333333 N) 0.5) N) (* N N)))

C

double code(double N) {
	return (((0.3333333333333333 / N) - 0.5) + 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 = (((0.3333333333333333d0 / n) - 0.5d0) + n) / (n * n)
end function

Java

public static double code(double N) {
	return (((0.3333333333333333 / N) - 0.5) + N) / (N * N);
}

Python

def code(N):
	return (((0.3333333333333333 / N) - 0.5) + N) / (N * N)

Julia

function code(N)
	return Float64(Float64(Float64(Float64(0.3333333333333333 / N) - 0.5) + N) / Float64(N * N))
end

MATLAB

function tmp = code(N)
	tmp = (((0.3333333333333333 / N) - 0.5) + N) / (N * N);
end

Wolfram

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

Derivation

1. Initial program 23.6%

   \[\log \left(N + 1\right) - \log N \]
2. Add Preprocessing

3. Taylor expanded in N around inf

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

5. Applied rewrites 95.1%

   \[\leadsto \color{blue}{\frac{\left(\frac{0.3333333333333333}{N} - 0.5\right) + N}{N \cdot N}} \]
6. Add Preprocessing

Alternative 6: 92.6% accurate, 8.0× speedup

Math

\[\begin{array}{l} \\ \frac{\frac{-0.5}{N} - -1}{N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (/ (- (/ -0.5 N) -1.0) N))

C

double code(double N) {
	return ((-0.5 / N) - -1.0) / 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 = (((-0.5d0) / n) - (-1.0d0)) / n
end function

Java

public static double code(double N) {
	return ((-0.5 / N) - -1.0) / N;
}

Python

def code(N):
	return ((-0.5 / N) - -1.0) / N

Julia

function code(N)
	return Float64(Float64(Float64(-0.5 / N) - -1.0) / N)
end

MATLAB

function tmp = code(N)
	tmp = ((-0.5 / N) - -1.0) / N;
end

Wolfram

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

Derivation

1. Initial program 23.6%

   \[\log \left(N + 1\right) - \log N \]
2. Add Preprocessing

3. Taylor expanded in N around inf

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

5. Applied rewrites 96.6%

   \[\leadsto \color{blue}{\frac{\frac{\frac{\frac{-0.25}{N} + 0.3333333333333333}{N} - 0.5}{N} - -1}{N}} \]

6. Taylor expanded in N around inf

   \[\leadsto \frac{\frac{\frac{-1}{2}}{N} - -1}{N} \]
7. Step-by-step derivation

8. Applied rewrites 92.4%

   \[\leadsto \frac{\frac{-0.5}{N} - -1}{N} \]
9. Add Preprocessing

Alternative 7: 92.3% accurate, 10.4× speedup

Math

\[\begin{array}{l} \\ \frac{-0.5 + N}{N \cdot N} \end{array} \]

FPCore

(FPCore (N) :precision binary64 (/ (+ -0.5 N) (* N N)))

C

double code(double N) {
	return (-0.5 + 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 = ((-0.5d0) + n) / (n * n)
end function

Java

public static double code(double N) {
	return (-0.5 + N) / (N * N);
}

Python

def code(N):
	return (-0.5 + N) / (N * N)

Julia

function code(N)
	return Float64(Float64(-0.5 + N) / Float64(N * N))
end

MATLAB

function tmp = code(N)
	tmp = (-0.5 + N) / (N * N);
end

Wolfram

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

Derivation

1. Initial program 23.6%

   \[\log \left(N + 1\right) - \log N \]
2. Add Preprocessing

3. Taylor expanded in N around inf

   \[\leadsto \color{blue}{\frac{1 - \frac{1}{2} \cdot \frac{1}{N}}{N}} \]
4. Step-by-step derivation

5. Applied rewrites 92.2%

   \[\leadsto \color{blue}{\frac{-0.5 + N}{N \cdot N}} \]
6. Add Preprocessing

Alternative 8: 84.6% accurate, 17.3× speedup

Math

\[\begin{array}{l} \\ \frac{1}{N} \end{array} \]

FPCore

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

C

double code(double N) {
	return 1.0 / 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 = 1.0d0 / n
end function

Java

public static double code(double N) {
	return 1.0 / N;
}

Python

def code(N):
	return 1.0 / N

Julia

function code(N)
	return Float64(1.0 / N)
end

MATLAB

function tmp = code(N)
	tmp = 1.0 / N;
end

Wolfram

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

Derivation

1. Initial program 23.6%

   \[\log \left(N + 1\right) - \log N \]
2. Add Preprocessing

3. Taylor expanded in N around inf

   \[\leadsto \color{blue}{\frac{1}{N}} \]
4. Step-by-step derivation

5. Applied rewrites 84.6%

   \[\leadsto \color{blue}{\frac{1}{N}} \]
6. Add Preprocessing

Alternative 9: 3.3% accurate, 207.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (N) :precision binary64 0.0)

C

double code(double N) {
	return 0.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 = 0.0d0
end function

Java

public static double code(double N) {
	return 0.0;
}

Python

def code(N):
	return 0.0

Julia

function code(N)
	return 0.0
end

MATLAB

function tmp = code(N)
	tmp = 0.0;
end

Wolfram

code[N_] := 0.0

Derivation

1. Initial program 23.6%

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

   1. lift--.f64 N/A

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

   2. flip3-- N/A

      \[\leadsto \color{blue}{\frac{{\log \left(N + 1\right)}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)}} \]

   3. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{{\log \left(N + 1\right)}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)}} \]

   4. lower--.f64 N/A

      \[\leadsto \frac{\color{blue}{{\log \left(N + 1\right)}^{3} - {\log N}^{3}}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   5. lower-pow.f64 N/A

      \[\leadsto \frac{\color{blue}{{\log \left(N + 1\right)}^{3}} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   6. lift-log.f64 N/A

      \[\leadsto \frac{{\color{blue}{\log \left(N + 1\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   7. lift-+.f64 N/A

      \[\leadsto \frac{{\log \color{blue}{\left(N + 1\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   8. +-commutative N/A

      \[\leadsto \frac{{\log \color{blue}{\left(1 + N\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   9. lower-log1p.f64 N/A

      \[\leadsto \frac{{\color{blue}{\left(\mathsf{log1p}\left(N\right)\right)}}^{3} - {\log N}^{3}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   10. lower-pow.f64 N/A

       \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - \color{blue}{{\log N}^{3}}}{\log \left(N + 1\right) \cdot \log \left(N + 1\right) + \left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right)} \]

   11. +-commutative N/A

       \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\color{blue}{\left(\log N \cdot \log N + \log \left(N + 1\right) \cdot \log N\right) + \log \left(N + 1\right) \cdot \log \left(N + 1\right)}} \]

   12. distribute-rgt-out N/A

       \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\color{blue}{\log N \cdot \left(\log N + \log \left(N + 1\right)\right)} + \log \left(N + 1\right) \cdot \log \left(N + 1\right)} \]

   13. +-commutative N/A

       \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\log N \cdot \color{blue}{\left(\log \left(N + 1\right) + \log N\right)} + \log \left(N + 1\right) \cdot \log \left(N + 1\right)} \]

   14. lower-fma.f64 N/A

       \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\color{blue}{\mathsf{fma}\left(\log N, \log \left(N + 1\right) + \log N, \log \left(N + 1\right) \cdot \log \left(N + 1\right)\right)}} \]

4. Applied rewrites 23.5%

   \[\leadsto \color{blue}{\frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)}} \]
5. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - {\log N}^{3}}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   2. lift-pow.f64 N/A

      \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - \color{blue}{{\log N}^{3}}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   3. sqr-pow N/A

      \[\leadsto \frac{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} - \color{blue}{{\log N}^{\left(\frac{3}{2}\right)} \cdot {\log N}^{\left(\frac{3}{2}\right)}}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

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

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{3} + \left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   5. lift-pow.f64 N/A

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{3}} + \left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   6. unpow3 N/A

      \[\leadsto \frac{\color{blue}{\left(\mathsf{log1p}\left(N\right) \cdot \mathsf{log1p}\left(N\right)\right) \cdot \mathsf{log1p}\left(N\right)} + \left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   7. unpow2 N/A

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{2}} \cdot \mathsf{log1p}\left(N\right) + \left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   8. lift-pow.f64 N/A

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{log1p}\left(N\right)\right)}^{2}} \cdot \mathsf{log1p}\left(N\right) + \left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   9. lower-fma.f64 N/A

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   10. lower-*.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \color{blue}{\left(\mathsf{neg}\left({\log N}^{\left(\frac{3}{2}\right)}\right)\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   11. lower-neg.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \color{blue}{\left(-{\log N}^{\left(\frac{3}{2}\right)}\right)} \cdot {\log N}^{\left(\frac{3}{2}\right)}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   12. lower-pow.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \left(-\color{blue}{{\log N}^{\left(\frac{3}{2}\right)}}\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   13. metadata-eval N/A

       \[\leadsto \frac{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \left(-{\log N}^{\color{blue}{\frac{3}{2}}}\right) \cdot {\log N}^{\left(\frac{3}{2}\right)}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   14. lower-pow.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \left(-{\log N}^{\frac{3}{2}}\right) \cdot \color{blue}{{\log N}^{\left(\frac{3}{2}\right)}}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

   15. metadata-eval 25.7

       \[\leadsto \frac{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \left(-{\log N}^{1.5}\right) \cdot {\log N}^{\color{blue}{1.5}}\right)}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

6. Applied rewrites 25.7%

   \[\leadsto \frac{\color{blue}{\mathsf{fma}\left({\left(\mathsf{log1p}\left(N\right)\right)}^{2}, \mathsf{log1p}\left(N\right), \left(-{\log N}^{1.5}\right) \cdot {\log N}^{1.5}\right)}}{\mathsf{fma}\left(\log N, \log N + \mathsf{log1p}\left(N\right), {\left(\mathsf{log1p}\left(N\right)\right)}^{2}\right)} \]

7. Taylor expanded in N around -inf

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

9. Applied rewrites 3.3%

   \[\leadsto \color{blue}{0} \]
10. Add Preprocessing

Developer Target 1: 96.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \left(\left(\frac{1}{N} + \frac{-1}{2 \cdot {N}^{2}}\right) + \frac{1}{3 \cdot {N}^{3}}\right) + \frac{-1}{4 \cdot {N}^{4}} \end{array} \]

FPCore

(FPCore (N)
 :precision binary64
 (+
  (+ (+ (/ 1.0 N) (/ -1.0 (* 2.0 (pow N 2.0)))) (/ 1.0 (* 3.0 (pow N 3.0))))
  (/ -1.0 (* 4.0 (pow N 4.0)))))

C

double code(double N) {
	return (((1.0 / N) + (-1.0 / (2.0 * pow(N, 2.0)))) + (1.0 / (3.0 * pow(N, 3.0)))) + (-1.0 / (4.0 * pow(N, 4.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 = (((1.0d0 / n) + ((-1.0d0) / (2.0d0 * (n ** 2.0d0)))) + (1.0d0 / (3.0d0 * (n ** 3.0d0)))) + ((-1.0d0) / (4.0d0 * (n ** 4.0d0)))
end function

Java

public static double code(double N) {
	return (((1.0 / N) + (-1.0 / (2.0 * Math.pow(N, 2.0)))) + (1.0 / (3.0 * Math.pow(N, 3.0)))) + (-1.0 / (4.0 * Math.pow(N, 4.0)));
}

Python

def code(N):
	return (((1.0 / N) + (-1.0 / (2.0 * math.pow(N, 2.0)))) + (1.0 / (3.0 * math.pow(N, 3.0)))) + (-1.0 / (4.0 * math.pow(N, 4.0)))

Julia

function code(N)
	return Float64(Float64(Float64(Float64(1.0 / N) + Float64(-1.0 / Float64(2.0 * (N ^ 2.0)))) + Float64(1.0 / Float64(3.0 * (N ^ 3.0)))) + Float64(-1.0 / Float64(4.0 * (N ^ 4.0))))
end

MATLAB

function tmp = code(N)
	tmp = (((1.0 / N) + (-1.0 / (2.0 * (N ^ 2.0)))) + (1.0 / (3.0 * (N ^ 3.0)))) + (-1.0 / (4.0 * (N ^ 4.0)));
end

Wolfram

code[N_] := N[(N[(N[(N[(1.0 / N), $MachinePrecision] + N[(-1.0 / N[(2.0 * N[Power[N, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[(3.0 * N[Power[N, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(-1.0 / N[(4.0 * N[Power[N, 4.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025022 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  :precision binary64
  :pre (and (> N 1.0) (< N 1e+40))

  :alt
  (! :herbie-platform default (+ (/ 1 N) (/ -1 (* 2 (pow N 2))) (/ 1 (* 3 (pow N 3))) (/ -1 (* 4 (pow N 4)))))

  (- (log (+ N 1.0)) (log N)))