expfmod (used to be hard to sample)

Percentage Accurate: 6.6% → 27.2%

Time: 14.1s

Alternatives: 10

Speedup: 1.9×

• could not determine a ground truth

  1. x = -1.0783965533617513e+102

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: 6.6% 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: 27.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\cos x}\\ t_1 := e^{-x}\\ \mathbf{if}\;\left(\left(e^{x}\right) \bmod t\_0\right) \cdot t\_1 \leq 2:\\ \;\;\;\;\left(\left({t\_1}^{-1}\right) \bmod t\_0\right) \cdot \left(\cosh x - \sinh x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (cos x))) (t_1 (exp (- x))))
   (if (<= (* (fmod (exp x) t_0) t_1) 2.0)
     (* (fmod (pow t_1 -1.0) t_0) (- (cosh x) (sinh x)))
     (* (fmod 1.0 (fma (* x x) -0.25 1.0)) t_1))))

C

double code(double x) {
	double t_0 = sqrt(cos(x));
	double t_1 = exp(-x);
	double tmp;
	if ((fmod(exp(x), t_0) * t_1) <= 2.0) {
		tmp = fmod(pow(t_1, -1.0), t_0) * (cosh(x) - sinh(x));
	} else {
		tmp = fmod(1.0, fma((x * x), -0.25, 1.0)) * t_1;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = sqrt(cos(x))
	t_1 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(rem(exp(x), t_0) * t_1) <= 2.0)
		tmp = Float64(rem((t_1 ^ -1.0), t_0) * Float64(cosh(x) - sinh(x)));
	else
		tmp = Float64(rem(1.0, fma(Float64(x * x), -0.25, 1.0)) * t_1);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = t$95$0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$1), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[Power[t$95$1, -1.0], $MachinePrecision], TMP2 = t$95$0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[Cosh[x], $MachinePrecision] - N[Sinh[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(x * x), $MachinePrecision] * -0.25 + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$1), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 9.6%

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

      1. lift-exp.f64 N/A

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

      2. remove-double-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. exp-neg N/A

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

      5. lift-exp.f64 N/A

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

      6. lower-/.f64 9.6

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

   4. Applied rewrites 9.6%

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

      1. lift-exp.f64 N/A

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

      2. lift-neg.f64 N/A

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

      3. sinh---cosh-rev N/A

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

      4. lower--.f64 N/A

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

      5. lower-cosh.f64 N/A

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

      6. lower-sinh.f64 9.6

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

   6. Applied rewrites 9.6%

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

   if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.0%

      \[\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 98.0%

      \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 98.0

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

   8. Applied rewrites 98.0%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 26.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 2:\\ \;\;\;\;\left(\left({\left(e^{-x}\right)}^{-1}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \left(\cosh x - \sinh x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 27.2% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (cos x))) (t_1 (exp (- x))))
   (if (<= (* (fmod (exp x) t_0) t_1) 2.0)
     (* (fmod (pow t_1 -1.0) t_0) t_1)
     (* (fmod 1.0 (fma (* x x) -0.25 1.0)) t_1))))

C

double code(double x) {
	double t_0 = sqrt(cos(x));
	double t_1 = exp(-x);
	double tmp;
	if ((fmod(exp(x), t_0) * t_1) <= 2.0) {
		tmp = fmod(pow(t_1, -1.0), t_0) * t_1;
	} else {
		tmp = fmod(1.0, fma((x * x), -0.25, 1.0)) * t_1;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = sqrt(cos(x))
	t_1 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(rem(exp(x), t_0) * t_1) <= 2.0)
		tmp = Float64(rem((t_1 ^ -1.0), t_0) * t_1);
	else
		tmp = Float64(rem(1.0, fma(Float64(x * x), -0.25, 1.0)) * t_1);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = t$95$0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$1), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[Power[t$95$1, -1.0], $MachinePrecision], TMP2 = t$95$0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$1), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(x * x), $MachinePrecision] * -0.25 + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$1), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 9.6%

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

      1. lift-exp.f64 N/A

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

      2. remove-double-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. exp-neg N/A

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

      5. lift-exp.f64 N/A

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

      6. lower-/.f64 9.6

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

   4. Applied rewrites 9.6%

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

   if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.0%

      \[\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 98.0%

      \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 98.0

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

   8. Applied rewrites 98.0%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 26.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 2:\\ \;\;\;\;\left(\left({\left(e^{-x}\right)}^{-1}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 27.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\ t_1 := e^{-x}\\ \mathbf{if}\;t\_0 \cdot t\_1 \leq 2:\\ \;\;\;\;\frac{t\_0}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x)))) (t_1 (exp (- x))))
   (if (<= (* t_0 t_1) 2.0)
     (/ t_0 (exp x))
     (* (fmod 1.0 (fma (* x x) -0.25 1.0)) t_1))))

C

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double t_1 = exp(-x);
	double tmp;
	if ((t_0 * t_1) <= 2.0) {
		tmp = t_0 / exp(x);
	} else {
		tmp = fmod(1.0, fma((x * x), -0.25, 1.0)) * t_1;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	t_1 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(t_0 * t_1) <= 2.0)
		tmp = Float64(t_0 / exp(x));
	else
		tmp = Float64(rem(1.0, fma(Float64(x * x), -0.25, 1.0)) * t_1);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(t$95$0 * t$95$1), $MachinePrecision], 2.0], N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(x * x), $MachinePrecision] * -0.25 + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$1), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 9.6%

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

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. exp-neg N/A

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

      5. lift-exp.f64 N/A

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

      6. associate-*r/ N/A

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

      7. *-rgt-identity N/A

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

      8. lower-/.f64 9.6

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

   4. Applied rewrites 9.6%

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

   if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.0%

      \[\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 98.0%

      \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 98.0

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

   8. Applied rewrites 98.0%

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

Alternative 4: 27.3% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x))) (t_1 (* (fmod (exp x) (sqrt (cos x))) t_0)))
   (if (<= t_1 2.0) t_1 (* (fmod 1.0 (fma (* x x) -0.25 1.0)) t_0))))

C

double code(double x) {
	double t_0 = exp(-x);
	double t_1 = fmod(exp(x), sqrt(cos(x))) * t_0;
	double tmp;
	if (t_1 <= 2.0) {
		tmp = t_1;
	} else {
		tmp = fmod(1.0, fma((x * x), -0.25, 1.0)) * t_0;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = exp(Float64(-x))
	t_1 = Float64(rem(exp(x), sqrt(cos(x))) * t_0)
	tmp = 0.0
	if (t_1 <= 2.0)
		tmp = t_1;
	else
		tmp = Float64(rem(1.0, fma(Float64(x * x), -0.25, 1.0)) * t_0);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$1 = N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[t$95$1, 2.0], t$95$1, N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(x * x), $MachinePrecision] * -0.25 + 1.0), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 9.6%

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

   if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.0%

      \[\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 98.0%

      \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
   7. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 98.0

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

   8. Applied rewrites 98.0%

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

Alternative 5: 26.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \frac{\left(\left(1 + x\right) \bmod \left(\mathsf{fma}\left(-0.25, x \cdot x, 1\right)\right)\right)}{e^{x}} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (/ (fmod (+ 1.0 x) (fma -0.25 (* x x) 1.0)) (exp x)))

C

double code(double x) {
	return fmod((1.0 + x), fma(-0.25, (x * x), 1.0)) / exp(x);
}

Julia

function code(x)
	return Float64(rem(Float64(1.0 + x), fma(-0.25, Float64(x * x), 1.0)) / exp(x))
end

Wolfram

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

Derivation

1. Initial program 7.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}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 22.8%

   \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
7. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 22.8

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

8. Applied rewrites 22.8%

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

9. Taylor expanded in x around 0

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

    1. lower-+.f64 24.5

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

11. Applied rewrites 24.5%

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

    1. lift-*.f64 N/A

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

    2. lift-exp.f64 N/A

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

    3. lift-neg.f64 N/A

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

    4. exp-neg N/A

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

    5. lift-exp.f64 N/A

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

    6. associate-*r/ N/A

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

    7. lower-/.f64 N/A

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

    8. lower-*.f64 24.5

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

13. Applied rewrites 24.5%

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

14. Final simplification 24.5%

    \[\leadsto \frac{\left(\left(1 + x\right) \bmod \left(\mathsf{fma}\left(-0.25, x \cdot x, 1\right)\right)\right)}{e^{x}} \]
15. Add Preprocessing

Alternative 6: 26.3% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 7.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}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 22.8%

   \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
7. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 22.8

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

8. Applied rewrites 22.8%

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

9. Taylor expanded in x around 0

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

    1. lower-+.f64 24.5

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

11. Applied rewrites 24.5%

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

Alternative 7: 24.3% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 7.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}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 22.8%

   \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
7. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 22.8

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

8. Applied rewrites 22.8%

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

Alternative 8: 5.2% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 7.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 \color{blue}{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)} \]
4. Step-by-step derivation

   1. lower-fmod.f64 N/A

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

   2. lower-exp.f64 N/A

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

   3. lower-sqrt.f64 N/A

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

   4. lower-cos.f64 5.4

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

5. Applied rewrites 5.4%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 5.4%

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

Alternative 9: 3.9% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \left(1 \bmod \left(\mathsf{fma}\left(-0.010416666666666666 \cdot \left(x \cdot x\right) - 0.25, x \cdot x, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x, 0.5\right) \cdot x - 1, x, 1\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (*
  (fmod 1.0 (fma (- (* -0.010416666666666666 (* x x)) 0.25) (* x x) 1.0))
  (fma (- (* (fma -0.16666666666666666 x 0.5) x) 1.0) x 1.0)))

C

double code(double x) {
	return fmod(1.0, fma(((-0.010416666666666666 * (x * x)) - 0.25), (x * x), 1.0)) * fma(((fma(-0.16666666666666666, x, 0.5) * x) - 1.0), x, 1.0);
}

Julia

function code(x)
	return Float64(rem(1.0, fma(Float64(Float64(-0.010416666666666666 * Float64(x * x)) - 0.25), Float64(x * x), 1.0)) * fma(Float64(Float64(fma(-0.16666666666666666, x, 0.5) * x) - 1.0), x, 1.0))
end

Wolfram

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

Derivation

1. Initial program 7.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}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 22.8%

   \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
7. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 22.8

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

8. Applied rewrites 22.8%

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

9. Taylor expanded in x around 0

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

    1. +-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \color{blue}{\left(x \cdot \left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1\right) + 1\right)} \]

    2. *-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \left(\color{blue}{\left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1\right) \cdot x} + 1\right) \]

    3. lower-fma.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \color{blue}{\mathsf{fma}\left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1, x, 1\right)} \]

    4. lower--.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1}, x, 1\right) \]

    5. *-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) \cdot x} - 1, x, 1\right) \]

    6. lower-*.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) \cdot x} - 1, x, 1\right) \]

    7. +-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{-1}{6} \cdot x + \frac{1}{2}\right)} \cdot x - 1, x, 1\right) \]

    8. lower-fma.f64 4.4

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

11. Applied rewrites 4.4%

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

12. Taylor expanded in x around 0

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

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

       \[\leadsto \left(1 \bmod \color{blue}{\left(1 - \left(\mathsf{neg}\left({x}^{2}\right)\right) \cdot \left(\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}\right)\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

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

       \[\leadsto \left(1 \bmod \color{blue}{\left(1 + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left({x}^{2}\right)\right)\right)\right) \cdot \left(\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}\right)\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    3. +-commutative N/A

       \[\leadsto \left(1 \bmod \color{blue}{\left(\left(\mathsf{neg}\left(\left(\mathsf{neg}\left({x}^{2}\right)\right)\right)\right) \cdot \left(\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}\right) + 1\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    4. remove-double-neg N/A

       \[\leadsto \left(1 \bmod \left(\color{blue}{{x}^{2}} \cdot \left(\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}\right) + 1\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    5. *-commutative N/A

       \[\leadsto \left(1 \bmod \left(\color{blue}{\left(\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}\right) \cdot {x}^{2}} + 1\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    6. lower-fma.f64 N/A

       \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}, {x}^{2}, 1\right)\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    7. lower--.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(\color{blue}{\frac{-1}{96} \cdot {x}^{2} - \frac{1}{4}}, {x}^{2}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    8. lower-*.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(\color{blue}{\frac{-1}{96} \cdot {x}^{2}} - \frac{1}{4}, {x}^{2}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    9. unpow2 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(\frac{-1}{96} \cdot \color{blue}{\left(x \cdot x\right)} - \frac{1}{4}, {x}^{2}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    10. lower-*.f64 N/A

        \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(\frac{-1}{96} \cdot \color{blue}{\left(x \cdot x\right)} - \frac{1}{4}, {x}^{2}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    11. unpow2 N/A

        \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(\frac{-1}{96} \cdot \left(x \cdot x\right) - \frac{1}{4}, \color{blue}{x \cdot x}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, x, \frac{1}{2}\right) \cdot x - 1, x, 1\right) \]

    12. lower-*.f64 4.4

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

14. Applied rewrites 4.4%

    \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(-0.010416666666666666 \cdot \left(x \cdot x\right) - 0.25, x \cdot x, 1\right)\right)}\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x, 0.5\right) \cdot x - 1, x, 1\right) \]
15. Add Preprocessing

Alternative 10: 3.9% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x, 0.5\right) \cdot x - 1, x, 1\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (*
  (fmod 1.0 (fma (* x x) -0.25 1.0))
  (fma (- (* (fma -0.16666666666666666 x 0.5) x) 1.0) x 1.0)))

C

double code(double x) {
	return fmod(1.0, fma((x * x), -0.25, 1.0)) * fma(((fma(-0.16666666666666666, x, 0.5) * x) - 1.0), x, 1.0);
}

Julia

function code(x)
	return Float64(rem(1.0, fma(Float64(x * x), -0.25, 1.0)) * fma(Float64(Float64(fma(-0.16666666666666666, x, 0.5) * x) - 1.0), x, 1.0))
end

Wolfram

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

Derivation

1. Initial program 7.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}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
4. Step-by-step derivation

5. Applied rewrites 22.8%

   \[\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 \color{blue}{\left(1 + \frac{-1}{4} \cdot {x}^{2}\right)}\right) \cdot e^{-x} \]
7. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. lower-*.f64 22.8

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

8. Applied rewrites 22.8%

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

9. Taylor expanded in x around 0

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

    1. +-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \color{blue}{\left(x \cdot \left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1\right) + 1\right)} \]

    2. *-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \left(\color{blue}{\left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1\right) \cdot x} + 1\right) \]

    3. lower-fma.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \color{blue}{\mathsf{fma}\left(x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1, x, 1\right)} \]

    4. lower--.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) - 1}, x, 1\right) \]

    5. *-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) \cdot x} - 1, x, 1\right) \]

    6. lower-*.f64 N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{1}{2} + \frac{-1}{6} \cdot x\right) \cdot x} - 1, x, 1\right) \]

    7. +-commutative N/A

       \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot \mathsf{fma}\left(\color{blue}{\left(\frac{-1}{6} \cdot x + \frac{1}{2}\right)} \cdot x - 1, x, 1\right) \]

    8. lower-fma.f64 4.4

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

11. Applied rewrites 4.4%

    \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x, 0.5\right) \cdot x - 1, x, 1\right)} \]
12. Add Preprocessing

Reproduce

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