expfmod (used to be hard to sample)

Percentage Accurate: 7.1% → 82.2%

Time: 8.7s

Alternatives: 8

Speedup: 3.9×

• could not determine a ground truth

  1. x = -1.1767352660032323e+108

Specification

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}

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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Initial Program: 7.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}

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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Alternative 1: 82.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\left(\left(\frac{\frac{1}{x}}{x} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310)
   (*
    (fmod (exp x) (* (* (- (/ (/ 1.0 x) x) 0.25) x) x))
    (fma (fma 0.5 x -1.0) x 1.0))
   (* (fmod x (sqrt (cos x))) (exp (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = fmod(exp(x), (((((1.0 / x) / x) - 0.25) * x) * x)) * fma(fma(0.5, x, -1.0), x, 1.0);
	} else {
		tmp = fmod(x, sqrt(cos(x))) * exp(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(rem(exp(x), Float64(Float64(Float64(Float64(Float64(1.0 / x) / x) - 0.25) * x) * x)) * fma(fma(0.5, x, -1.0), x, 1.0));
	else
		tmp = Float64(rem(x, sqrt(cos(x))) * exp(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(N[(N[(N[(N[(1.0 / x), $MachinePrecision] / x), $MachinePrecision] - 0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[(0.5 * x + -1.0), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = x, TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 6.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\left(1 + x \cdot \left(\frac{1}{2} \cdot x - 1\right)\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 5.8%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 5.8%

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   9. Taylor expanded in x around inf

      \[\leadsto \left(\left(e^{x}\right) \bmod \left({x}^{2} \cdot \color{blue}{\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right)}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 50.5%

       \[\leadsto \left(\left(e^{x}\right) \bmod \left(\left(\left(\frac{\frac{1}{x}}{x} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   if -1.999999999999994e-310 < x

   1. Initial program 5.7%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 32.5%

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.3%

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 82.2% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\left(\left(\frac{\frac{1}{x}}{x} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \bmod 1\right) \cdot e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310)
   (*
    (fmod (exp x) (* (* (- (/ (/ 1.0 x) x) 0.25) x) x))
    (fma (fma 0.5 x -1.0) x 1.0))
   (* (fmod x 1.0) (exp (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = fmod(exp(x), (((((1.0 / x) / x) - 0.25) * x) * x)) * fma(fma(0.5, x, -1.0), x, 1.0);
	} else {
		tmp = fmod(x, 1.0) * exp(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(rem(exp(x), Float64(Float64(Float64(Float64(Float64(1.0 / x) / x) - 0.25) * x) * x)) * fma(fma(0.5, x, -1.0), x, 1.0));
	else
		tmp = Float64(rem(x, 1.0) * exp(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(N[(N[(N[(N[(1.0 / x), $MachinePrecision] / x), $MachinePrecision] - 0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[(0.5 * x + -1.0), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 6.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\left(1 + x \cdot \left(\frac{1}{2} \cdot x - 1\right)\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 5.8%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 5.8%

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   9. Taylor expanded in x around inf

      \[\leadsto \left(\left(e^{x}\right) \bmod \left({x}^{2} \cdot \color{blue}{\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right)}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 50.5%

       \[\leadsto \left(\left(e^{x}\right) \bmod \left(\left(\left(\frac{\frac{1}{x}}{x} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   if -1.999999999999994e-310 < x

   1. Initial program 5.7%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 32.5%

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.3%

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
   10. Step-by-step derivation

   11. Applied rewrites 98.3%

       \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 62.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod 1\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x, 0.5\right), x, -1\right), x, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \bmod 1\right) \cdot e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310)
   (*
    (fmod (exp x) 1.0)
    (fma (fma (fma -0.16666666666666666 x 0.5) x -1.0) x 1.0))
   (* (fmod x 1.0) (exp (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = fmod(exp(x), 1.0) * fma(fma(fma(-0.16666666666666666, x, 0.5), x, -1.0), x, 1.0);
	} else {
		tmp = fmod(x, 1.0) * exp(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(rem(exp(x), 1.0) * fma(fma(fma(-0.16666666666666666, x, 0.5), x, -1.0), x, 1.0));
	else
		tmp = Float64(rem(x, 1.0) * exp(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[(N[(-0.16666666666666666 * x + 0.5), $MachinePrecision] * x + -1.0), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 6.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{1}\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 6.6%

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{1}\right) \cdot e^{-x} \]

   6. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \cdot \color{blue}{\left(1 + x \cdot \left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 6.1%

      \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x, 0.5\right), x, -1\right), x, 1\right)} \]

   if -1.999999999999994e-310 < x

   1. Initial program 5.7%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 32.5%

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.3%

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
   10. Step-by-step derivation

   11. Applied rewrites 98.3%

       \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 62.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, 1\right), x, 1\right)\right) \bmod 1\right) \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(x \bmod 1\right) \cdot t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x))))
   (if (<= x -2e-310)
     (* (fmod (fma (fma 0.5 x 1.0) x 1.0) 1.0) t_0)
     (* (fmod x 1.0) t_0))))

C

double code(double x) {
	double t_0 = exp(-x);
	double tmp;
	if (x <= -2e-310) {
		tmp = fmod(fma(fma(0.5, x, 1.0), x, 1.0), 1.0) * t_0;
	} else {
		tmp = fmod(x, 1.0) * t_0;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = exp(Float64(-x))
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(rem(fma(fma(0.5, x, 1.0), x, 1.0), 1.0) * t_0);
	else
		tmp = Float64(rem(x, 1.0) * t_0);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[x, -2e-310], N[(N[With[{TMP1 = N[(N[(0.5 * x + 1.0), $MachinePrecision] * x + 1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 6.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 5.4%

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   7. Step-by-step derivation

   8. Applied rewrites 2.2%

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
   10. Step-by-step derivation

   11. Applied rewrites 2.2%

       \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]

   12. Taylor expanded in x around 0

       \[\leadsto \left(\color{blue}{\left(1 + x \cdot \left(1 + \frac{1}{2} \cdot x\right)\right)} \bmod 1\right) \cdot e^{-x} \]
   13. Step-by-step derivation

   14. Applied rewrites 5.9%

       \[\leadsto \left(\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, 1\right), x, 1\right)\right)} \bmod 1\right) \cdot e^{-x} \]

   if -1.999999999999994e-310 < x

   1. Initial program 5.7%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 32.5%

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.3%

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
   10. Step-by-step derivation

   11. Applied rewrites 98.3%

       \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 62.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod 1\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \bmod 1\right) \cdot e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310)
   (* (fmod (exp x) 1.0) (fma (fma 0.5 x -1.0) x 1.0))
   (* (fmod x 1.0) (exp (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = fmod(exp(x), 1.0) * fma(fma(0.5, x, -1.0), x, 1.0);
	} else {
		tmp = fmod(x, 1.0) * exp(-x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(rem(exp(x), 1.0) * fma(fma(0.5, x, -1.0), x, 1.0));
	else
		tmp = Float64(rem(x, 1.0) * exp(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[(0.5 * x + -1.0), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 6.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\left(1 + x \cdot \left(\frac{1}{2} \cdot x - 1\right)\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 5.8%

      \[\leadsto \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)} \]

   6. Taylor expanded in x around 0

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{1}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 5.8%

      \[\leadsto \left(\left(e^{x}\right) \bmod \color{blue}{1}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   if -1.999999999999994e-310 < x

   1. Initial program 5.7%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   4. Step-by-step derivation

   5. Applied rewrites 32.5%

      \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.3%

      \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
   10. Step-by-step derivation

   11. Applied rewrites 98.3%

       \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 60.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \left(x \bmod 1\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod x 1.0) (exp (- x))))

C

double code(double x) {
	return fmod(x, 1.0) * exp(-x);
}

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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = mod(x, 1.0d0) * exp(-x)
end function

Python

def code(x):
	return math.fmod(x, 1.0) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(x, 1.0) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 6.1%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 20.8%

   \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

6. Taylor expanded in x around inf

   \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
7. Step-by-step derivation

8. Applied rewrites 57.0%

   \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

9. Taylor expanded in x around 0

   \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
10. Step-by-step derivation

11. Applied rewrites 57.0%

    \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
12. Add Preprocessing

Alternative 7: 59.7% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ \left(x \bmod 1\right) \cdot 1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod x 1.0) 1.0))

C

double code(double x) {
	return fmod(x, 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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = mod(x, 1.0d0) * 1.0d0
end function

Python

def code(x):
	return math.fmod(x, 1.0) * 1.0

Julia

function code(x)
	return Float64(rem(x, 1.0) * 1.0)
end

Wolfram

code[x_] := N[(N[With[{TMP1 = x, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * 1.0), $MachinePrecision]

Derivation

1. Initial program 6.1%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 20.8%

   \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

6. Taylor expanded in x around inf

   \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
7. Step-by-step derivation

8. Applied rewrites 57.0%

   \[\leadsto \left(x \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

9. Taylor expanded in x around 0

   \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]
10. Step-by-step derivation

11. Applied rewrites 57.0%

    \[\leadsto \left(x \bmod \color{blue}{1}\right) \cdot e^{-x} \]

12. Taylor expanded in x around 0

    \[\leadsto \left(x \bmod 1\right) \cdot \color{blue}{1} \]
13. Step-by-step derivation

14. Applied rewrites 56.2%

    \[\leadsto \left(x \bmod 1\right) \cdot \color{blue}{1} \]
15. Add Preprocessing

Alternative 8: 23.2% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ \left(1 \bmod 1\right) \cdot 1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod 1.0 1.0) 1.0))

C

double code(double x) {
	return fmod(1.0, 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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = mod(1.0d0, 1.0d0) * 1.0d0
end function

Python

def code(x):
	return math.fmod(1.0, 1.0) * 1.0

Julia

function code(x)
	return Float64(rem(1.0, 1.0) * 1.0)
end

Wolfram

code[x_] := N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * 1.0), $MachinePrecision]

Derivation

1. Initial program 6.1%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 19.5%

   \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

6. Taylor expanded in x around 0

   \[\leadsto \left(1 \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{1} \]
7. Step-by-step derivation

8. Applied rewrites 4.4%

   \[\leadsto \left(1 \bmod \left(\sqrt{\cos x}\right)\right) \cdot \color{blue}{1} \]

9. Taylor expanded in x around 0

   \[\leadsto \left(1 \bmod \color{blue}{1}\right) \cdot 1 \]
10. Step-by-step derivation

11. Applied rewrites 19.3%

    \[\leadsto \left(1 \bmod \color{blue}{1}\right) \cdot 1 \]
12. Add Preprocessing

Reproduce

herbie shell --seed 2025018 
(FPCore (x)
  :name "expfmod (used to be hard to sample)"
  :precision binary64
  (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))