expfmod (used to be hard to sample)

Percentage Accurate: 6.8% → 61.8%

Time: 11.0s

Alternatives: 8

Speedup: 4.1×

• could not determine a ground truth

  1. x = -3.941883554201523e+30

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

real(8) function code(x)
    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.8% 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

real(8) function code(x)
    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: 61.8% accurate, 0.3× 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}\\ t_2 := t\_0 \cdot t\_1\\ \mathbf{if}\;t\_2 \leq 2 \cdot 10^{-12}:\\ \;\;\;\;t\_1 \cdot \left(\left(\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), x\right)\right) \bmod 1\right)\\ \mathbf{elif}\;t\_2 \leq 2:\\ \;\;\;\;\frac{t\_0}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x))))
        (t_1 (exp (- x)))
        (t_2 (* t_0 t_1)))
   (if (<= t_2 2e-12)
     (* t_1 (fmod (fma x (* x (fma x 0.16666666666666666 0.5)) x) 1.0))
     (if (<= t_2 2.0) (/ t_0 (exp x)) (fmod 1.0 1.0)))))

C

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double t_1 = exp(-x);
	double t_2 = t_0 * t_1;
	double tmp;
	if (t_2 <= 2e-12) {
		tmp = t_1 * fmod(fma(x, (x * fma(x, 0.16666666666666666, 0.5)), x), 1.0);
	} else if (t_2 <= 2.0) {
		tmp = t_0 / exp(x);
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	t_1 = exp(Float64(-x))
	t_2 = Float64(t_0 * t_1)
	tmp = 0.0
	if (t_2 <= 2e-12)
		tmp = Float64(t_1 * rem(fma(x, Float64(x * fma(x, 0.16666666666666666, 0.5)), x), 1.0));
	elseif (t_2 <= 2.0)
		tmp = Float64(t_0 / exp(x));
	else
		tmp = rem(1.0, 1.0);
	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]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, If[LessEqual[t$95$2, 2e-12], N[(t$95$1 * N[With[{TMP1 = N[(x * N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$2, 2.0], N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision], N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 1.99999999999999996e-12

   1. Initial program 4.4%

      \[\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^{\mathsf{neg}\left(x\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 4.4%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 4.4

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

   8. Applied rewrites 4.4%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 47.6%

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

   if 1.99999999999999996e-12 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 90.1%

      \[\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^{\mathsf{neg}\left(x\right)}} \]

      2. lift-exp.f64 N/A

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

      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. un-div-inv N/A

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

      7. lower-/.f64 90.7

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

   4. Applied rewrites 90.7%

      \[\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 \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 0.0

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

   5. Applied rewrites 0.0%

      \[\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 1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 0.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \left(1 \bmod 1\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 59.5%

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

Alternative 2: 61.8% accurate, 0.3× 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 \cdot 10^{-12}:\\ \;\;\;\;t\_0 \cdot \left(\left(\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(x, 0.16666666666666666, 0.5\right), x\right)\right) \bmod 1\right)\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \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 2e-12)
     (* t_0 (fmod (fma x (* x (fma x 0.16666666666666666 0.5)) x) 1.0))
     (if (<= t_1 2.0) t_1 (fmod 1.0 1.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 <= 2e-12) {
		tmp = t_0 * fmod(fma(x, (x * fma(x, 0.16666666666666666, 0.5)), x), 1.0);
	} else if (t_1 <= 2.0) {
		tmp = t_1;
	} else {
		tmp = fmod(1.0, 1.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 <= 2e-12)
		tmp = Float64(t_0 * rem(fma(x, Float64(x * fma(x, 0.16666666666666666, 0.5)), x), 1.0));
	elseif (t_1 <= 2.0)
		tmp = t_1;
	else
		tmp = rem(1.0, 1.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, 2e-12], N[(t$95$0 * N[With[{TMP1 = N[(x * N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2.0], t$95$1, N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 1.99999999999999996e-12

   1. Initial program 4.4%

      \[\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^{\mathsf{neg}\left(x\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 4.4%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 4.4

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

   8. Applied rewrites 4.4%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 47.6%

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

   if 1.99999999999999996e-12 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 90.1%

      \[\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 \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 0.0

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

   5. Applied rewrites 0.0%

      \[\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 1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 0.0%

      \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \]

   9. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto \left(1 \bmod 1\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 59.4%

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

Alternative 3: 60.9% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x))))
   (if (<= (* (fmod (exp x) (sqrt (cos x))) t_0) 0.005)
     (* t_0 (fmod (fma x (* x (fma x 0.16666666666666666 0.5)) x) 1.0))
     (/ (fmod (+ x 1.0) 1.0) (exp x)))))

C

double code(double x) {
	double t_0 = exp(-x);
	double tmp;
	if ((fmod(exp(x), sqrt(cos(x))) * t_0) <= 0.005) {
		tmp = t_0 * fmod(fma(x, (x * fma(x, 0.16666666666666666, 0.5)), x), 1.0);
	} else {
		tmp = fmod((x + 1.0), 1.0) / exp(x);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(rem(exp(x), sqrt(cos(x))) * t_0) <= 0.005)
		tmp = Float64(t_0 * rem(fma(x, Float64(x * fma(x, 0.16666666666666666, 0.5)), x), 1.0));
	else
		tmp = Float64(rem(Float64(x + 1.0), 1.0) / exp(x));
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[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], 0.005], N[(t$95$0 * N[With[{TMP1 = N[(x * N[(x * N[(x * 0.16666666666666666 + 0.5), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], 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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 0.0050000000000000001

   1. Initial program 6.3%

      \[\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^{\mathsf{neg}\left(x\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 5.3%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 5.3

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

   8. Applied rewrites 5.3%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 47.5%

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

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

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

   5. Applied rewrites 9.3%

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

   6. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 95.9

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

   8. Applied rewrites 95.9%

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

      1. lift-*.f64 N/A

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

      2. lift-exp.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. exp-neg N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lift-exp.f64 95.9

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

   10. Applied rewrites 95.9%

       \[\leadsto \color{blue}{\frac{\left(\left(x + 1\right) \bmod 1\right)}{e^{x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 57.9%

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

Alternative 4: 25.4% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ (fmod (+ x 1.0) 1.0) (exp x)))

C

double code(double x) {
	return fmod((x + 1.0), 1.0) / exp(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod((x + 1.0d0), 1.0d0) / exp(x)
end function

Python

def code(x):
	return math.fmod((x + 1.0), 1.0) / math.exp(x)

Julia

function code(x)
	return Float64(rem(Float64(x + 1.0), 1.0) / exp(x))
end

Wolfram

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

Derivation

1. Initial program 7.2%

   \[\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^{\mathsf{neg}\left(x\right)} \]
4. Step-by-step derivation

5. Applied rewrites 6.2%

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

6. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 24.7

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

8. Applied rewrites 24.7%

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

   1. lift-*.f64 N/A

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

   2. lift-exp.f64 N/A

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

   3. lift-neg.f64 N/A

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

   4. exp-neg N/A

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

   5. un-div-inv N/A

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

   6. lower-/.f64 N/A

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

   7. lift-exp.f64 24.8

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

10. Applied rewrites 24.8%

    \[\leadsto \color{blue}{\frac{\left(\left(x + 1\right) \bmod 1\right)}{e^{x}}} \]
11. Add Preprocessing

Alternative 5: 25.4% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = exp(-x) * mod((x + 1.0d0), 1.0d0)
end function

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 7.2%

   \[\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^{\mathsf{neg}\left(x\right)} \]
4. Step-by-step derivation

5. Applied rewrites 6.2%

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

6. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 24.7

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

8. Applied rewrites 24.7%

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

9. Final simplification 24.7%

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

Alternative 6: 25.1% accurate, 3.5× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ (fmod (+ x 1.0) 1.0) (+ x 1.0)))

C

double code(double x) {
	return fmod((x + 1.0), 1.0) / (x + 1.0);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod((x + 1.0d0), 1.0d0) / (x + 1.0d0)
end function

Python

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

Julia

function code(x)
	return Float64(rem(Float64(x + 1.0), 1.0) / Float64(x + 1.0))
end

Wolfram

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

Derivation

1. Initial program 7.2%

   \[\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^{\mathsf{neg}\left(x\right)} \]
4. Step-by-step derivation

5. Applied rewrites 6.2%

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

6. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 24.7

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

8. Applied rewrites 24.7%

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

   1. lift-*.f64 N/A

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

   2. lift-exp.f64 N/A

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

   3. lift-neg.f64 N/A

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

   4. exp-neg N/A

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

   5. un-div-inv N/A

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

   6. lower-/.f64 N/A

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

   7. lift-exp.f64 24.8

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

10. Applied rewrites 24.8%

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

11. Taylor expanded in x around 0

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

    1. +-commutative N/A

       \[\leadsto \frac{\left(\left(x + 1\right) \bmod 1\right)}{\color{blue}{x + 1}} \]

    2. lower-+.f64 24.5

       \[\leadsto \frac{\left(\left(x + 1\right) \bmod 1\right)}{\color{blue}{x + 1}} \]

13. Applied rewrites 24.5%

    \[\leadsto \frac{\left(\left(x + 1\right) \bmod 1\right)}{\color{blue}{x + 1}} \]
14. Add Preprocessing

Alternative 7: 24.2% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x + 1\right) \bmod 1\right) \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

real(8) function code(x)
    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 rem(Float64(x + 1.0), 1.0)
end

Wolfram

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

Derivation

1. Initial program 7.2%

   \[\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.3

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

5. Applied rewrites 5.3%

   \[\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 1\right) \]
7. Step-by-step derivation

8. Applied rewrites 5.3%

   \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \]

9. Taylor expanded in x around 0

   \[\leadsto \left(\left(1 + x\right) \bmod 1\right) \]
10. Step-by-step derivation

11. Applied rewrites 23.8%

    \[\leadsto \left(\left(x + 1\right) \bmod 1\right) \]
12. Add Preprocessing

Alternative 8: 22.9% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(1.0d0, 1.0d0)
end function

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 7.2%

   \[\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.3

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

5. Applied rewrites 5.3%

   \[\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 1\right) \]
7. Step-by-step derivation

8. Applied rewrites 5.3%

   \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \]

9. Taylor expanded in x around 0

   \[\leadsto \left(1 \bmod 1\right) \]
10. Step-by-step derivation

11. Applied rewrites 22.4%

    \[\leadsto \left(1 \bmod 1\right) \]
12. Add Preprocessing

Reproduce

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