expfmod (used to be hard to sample)

Percentage Accurate: 7.4% → 63.0%

Time: 19.4s

Alternatives: 13

Speedup: 5.0×

• could not determine a ground truth

  1. x = -3.5852710244992752e+267

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: 7.4% 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: 63.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-310}:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\log \left({\left(\sqrt[3]{e}\right)}^{2}\right) + \log \left(\sqrt[3]{e}\right)}\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{{\left(\sqrt[3]{\log \left(\left(x + 1\right) \bmod \left(\sqrt{\cos x}\right)\right)}\right)}^{3}}}{e^{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -5e-310)
   (/
    (fmod (exp x) (sqrt (+ (log (pow (cbrt E) 2.0)) (log (cbrt E)))))
    (exp x))
   (/ (exp (pow (cbrt (log (fmod (+ x 1.0) (sqrt (cos x))))) 3.0)) (exp x))))

C

double code(double x) {
	double tmp;
	if (x <= -5e-310) {
		tmp = fmod(exp(x), sqrt((log(pow(cbrt(((double) M_E)), 2.0)) + log(cbrt(((double) M_E)))))) / exp(x);
	} else {
		tmp = exp(pow(cbrt(log(fmod((x + 1.0), sqrt(cos(x))))), 3.0)) / exp(x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= -5e-310)
		tmp = Float64(rem(exp(x), sqrt(Float64(log((cbrt(exp(1)) ^ 2.0)) + log(cbrt(exp(1)))))) / exp(x));
	else
		tmp = Float64(exp((cbrt(log(rem(Float64(x + 1.0), sqrt(cos(x))))) ^ 3.0)) / exp(x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -5e-310], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[N[Power[E, 1/3], $MachinePrecision], 2.0], $MachinePrecision]], $MachinePrecision] + N[Log[N[Power[E, 1/3], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision], N[(N[Exp[N[Power[N[Power[N[Log[N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.999999999999985e-310

   1. Initial program 11.6%

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

      1. /-rgt-identity 11.6%

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

      2. associate-/r/ 11.5%

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

      3. exp-neg 11.6%

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

      4. remove-double-neg 11.6%

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

   3. Simplified 11.6%

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

      1. add-log-exp 11.6%

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

      2. add-cube-cbrt 100.0%

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

      3. log-prod 100.0%

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

      4. pow2 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around 0 100.0%

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

      1. exp-1-e 100.0%

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

   9. Simplified 100.0%

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

   10. Taylor expanded in x around 0 100.0%

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

       1. exp-1-e 100.0%

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

   12. Simplified 100.0%

       \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\log \left({\color{blue}{\left(\sqrt[3]{e}\right)}}^{2}\right) + \log \left(\sqrt[3]{e}\right)}\right)\right)}{e^{x}} \]

   if -4.999999999999985e-310 < x

   1. Initial program 4.8%

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

      1. /-rgt-identity 4.8%

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

      2. associate-/r/ 4.8%

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

      3. exp-neg 4.8%

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

      4. remove-double-neg 4.8%

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

   3. Simplified 4.8%

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

      1. add-exp-log 4.8%

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

   6. Applied egg-rr 4.8%

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

      1. add-cube-cbrt 4.8%

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

      2. pow3 4.8%

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

   8. Applied egg-rr 4.8%

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

   9. Taylor expanded in x around 0 36.1%

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

       1. +-commutative 36.1%

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

   11. Simplified 36.1%

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

Alternative 2: 62.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{\cos x}\\ \mathbf{if}\;\left(\left(e^{x}\right) \bmod t\_0\right) \cdot e^{-x} \leq 0:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\log \left({\left(\sqrt[3]{e}\right)}^{2}\right) + \log \left(\sqrt[3]{e}\right)}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{{\left(\sqrt[3]{\log \left(\left(x + 1\right) \bmod t\_0\right)}\right)}^{3}}}{e^{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (cos x))))
   (if (<= (* (fmod (exp x) t_0) (exp (- x))) 0.0)
     (fmod (exp x) (sqrt (+ (log (pow (cbrt E) 2.0)) (log (cbrt E)))))
     (/ (exp (pow (cbrt (log (fmod (+ x 1.0) t_0))) 3.0)) (exp x)))))

C

double code(double x) {
	double t_0 = sqrt(cos(x));
	double tmp;
	if ((fmod(exp(x), t_0) * exp(-x)) <= 0.0) {
		tmp = fmod(exp(x), sqrt((log(pow(cbrt(((double) M_E)), 2.0)) + log(cbrt(((double) M_E))))));
	} else {
		tmp = exp(pow(cbrt(log(fmod((x + 1.0), t_0))), 3.0)) / exp(x);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = sqrt(cos(x))
	tmp = 0.0
	if (Float64(rem(exp(x), t_0) * exp(Float64(-x))) <= 0.0)
		tmp = rem(exp(x), sqrt(Float64(log((cbrt(exp(1)) ^ 2.0)) + log(cbrt(exp(1))))));
	else
		tmp = Float64(exp((cbrt(log(rem(Float64(x + 1.0), t_0))) ^ 3.0)) / exp(x));
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = t$95$0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 0.0], N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[N[Power[E, 1/3], $MachinePrecision], 2.0], $MachinePrecision]], $MachinePrecision] + N[Log[N[Power[E, 1/3], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], N[(N[Exp[N[Power[N[Power[N[Log[N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = t$95$0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]], $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.0

   1. Initial program 4.4%

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

      1. /-rgt-identity 4.4%

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

      2. associate-/r/ 4.4%

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

      3. exp-neg 4.4%

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

      4. remove-double-neg 4.4%

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

   3. Simplified 4.4%

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

      1. add-log-exp 4.4%

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

      2. add-cube-cbrt 46.5%

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

      3. log-prod 46.5%

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

      4. pow2 46.5%

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

   6. Applied egg-rr 46.5%

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

   7. Taylor expanded in x around 0 46.5%

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

      1. exp-1-e 46.5%

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

   9. Simplified 46.5%

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

   10. Taylor expanded in x around 0 46.5%

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

       1. exp-1-e 46.5%

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

   12. Simplified 46.5%

       \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\log \left({\color{blue}{\left(\sqrt[3]{e}\right)}}^{2}\right) + \log \left(\sqrt[3]{e}\right)}\right)\right)}{e^{x}} \]

   13. Taylor expanded in x around 0 46.5%

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

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

   1. Initial program 15.7%

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

      1. /-rgt-identity 15.7%

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

      2. associate-/r/ 15.6%

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

      3. exp-neg 15.7%

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

      4. remove-double-neg 15.7%

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

   3. Simplified 15.7%

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

      1. add-exp-log 15.7%

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

   6. Applied egg-rr 15.7%

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

      1. add-cube-cbrt 15.7%

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

      2. pow3 15.7%

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

   8. Applied egg-rr 15.7%

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

   9. Taylor expanded in x around 0 93.0%

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

       1. +-commutative 93.0%

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

   11. Simplified 93.0%

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

4. Final simplification 58.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 0:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\log \left({\left(\sqrt[3]{e}\right)}^{2}\right) + \log \left(\sqrt[3]{e}\right)}\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{e^{{\left(\sqrt[3]{\log \left(\left(x + 1\right) \bmod \left(\sqrt{\cos x}\right)\right)}\right)}^{3}}}{e^{x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 27.4% 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) \cdot e^{-x}\\ \mathbf{if}\;t\_0 \leq 2:\\ \;\;\;\;t\_0\\ \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))) (exp (- x)))))
   (if (<= t_0 2.0) t_0 (fmod 1.0 1.0))))

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = mod(exp(x), sqrt(cos(x))) * exp(-x)
    if (t_0 <= 2.0d0) then
        tmp = t_0
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	t_0 = math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)
	tmp = 0
	if t_0 <= 2.0:
		tmp = t_0
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, 2.0], t$95$0, N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $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.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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 4: 26.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (/ (exp (pow (cbrt (log (fmod (+ x 1.0) (sqrt (cos x))))) 3.0)) (exp x)))

C

double code(double x) {
	return exp(pow(cbrt(log(fmod((x + 1.0), sqrt(cos(x))))), 3.0)) / exp(x);
}

Julia

function code(x)
	return Float64(exp((cbrt(log(rem(Float64(x + 1.0), sqrt(cos(x))))) ^ 3.0)) / exp(x))
end

Wolfram

code[x_] := N[(N[Exp[N[Power[N[Power[N[Log[N[With[{TMP1 = N[(x + 1.0), $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 7.3%

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

   1. /-rgt-identity 7.3%

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

   2. associate-/r/ 7.2%

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

   3. exp-neg 7.3%

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

   4. remove-double-neg 7.3%

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

3. Simplified 7.3%

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

   1. add-exp-log 7.2%

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

6. Applied egg-rr 7.2%

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

   1. add-cube-cbrt 7.2%

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

   2. pow3 7.2%

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

8. Applied egg-rr 7.2%

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

9. Taylor expanded in x around 0 26.6%

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

    1. +-commutative 26.6%

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

11. Simplified 26.6%

    \[\leadsto \frac{e^{{\left(\sqrt[3]{\log \left(\color{blue}{\left(x + 1\right)} \bmod \left(\sqrt{\cos x}\right)\right)}\right)}^{3}}}{e^{x}} \]
12. Add Preprocessing

Alternative 5: 26.2% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 7.3%

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

   1. /-rgt-identity 7.3%

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

   2. associate-/r/ 7.2%

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

   3. exp-neg 7.3%

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

   4. remove-double-neg 7.3%

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

3. Simplified 7.3%

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

   1. add-exp-log 7.2%

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

6. Applied egg-rr 7.2%

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

7. Taylor expanded in x around 0 26.6%

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

   1. +-commutative 26.6%

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

9. Simplified 26.6%

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

Alternative 6: 27.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1) (/ (fmod (exp x) (sqrt (cos x))) (exp x)) (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), sqrt(cos(x))) / exp(x);
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), sqrt(cos(x))) / exp(x)
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), math.sqrt(math.cos(x))) / math.exp(x)
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = Float64(rem(exp(x), sqrt(cos(x))) / exp(x));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 0.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] / 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 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 7: 27.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1)
   (/ (fmod (exp x) (+ 1.0 (* -0.25 (* x x)))) (exp x))
   (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), (1.0 + (-0.25 * (x * x)))) / exp(x);
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x)))) / exp(x)
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x)))) / math.exp(x)
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = Float64(rem(exp(x), Float64(1.0 + Float64(-0.25 * Float64(x * x)))) / exp(x));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 0.1], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(1.0 + N[(-0.25 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / 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 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

   5. Taylor expanded in x around 0 8.9%

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

      1. unpow2 8.9%

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

   7. Applied egg-rr 8.9%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 8: 26.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1) (/ (fmod (exp x) 1.0) (exp x)) (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), 1.0) / exp(x);
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), 1.0d0) / exp(x)
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), 1.0) / math.exp(x)
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = Float64(rem(exp(x), 1.0) / exp(x));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 0.1], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / 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 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

      1. add-log-exp 9.1%

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

      2. add-cube-cbrt 48.6%

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

      3. log-prod 48.6%

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

      4. pow2 48.6%

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

   6. Applied egg-rr 48.6%

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

   7. Taylor expanded in x around 0 48.3%

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

      1. exp-1-e 48.3%

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

   9. Simplified 48.3%

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

   10. Taylor expanded in x around 0 48.3%

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

       1. exp-1-e 48.3%

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

   12. Simplified 48.3%

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

       1. div-inv 48.3%

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

       2. sum-log 48.3%

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

       3. unpow2 48.3%

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

       4. add-cube-cbrt 8.8%

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

       5. log-E 8.8%

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

       6. metadata-eval 8.8%

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

       7. rec-exp 8.8%

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

   14. Applied egg-rr 8.8%

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

       1. exp-neg 8.8%

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

       2. associate-*r/ 8.8%

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

       3. *-rgt-identity 8.8%

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

   16. Simplified 8.8%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 9: 26.7% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)}{1 + x \cdot \left(1 + x \cdot \left(0.5 + x \cdot 0.16666666666666666\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1)
   (/
    (fmod (exp x) (+ 1.0 (* -0.25 (* x x))))
    (+ 1.0 (* x (+ 1.0 (* x (+ 0.5 (* x 0.16666666666666666)))))))
   (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), (1.0 + (-0.25 * (x * x)))) / (1.0 + (x * (1.0 + (x * (0.5 + (x * 0.16666666666666666))))));
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x)))) / (1.0d0 + (x * (1.0d0 + (x * (0.5d0 + (x * 0.16666666666666666d0))))))
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x)))) / (1.0 + (x * (1.0 + (x * (0.5 + (x * 0.16666666666666666))))))
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = Float64(rem(exp(x), Float64(1.0 + Float64(-0.25 * Float64(x * x)))) / Float64(1.0 + Float64(x * Float64(1.0 + Float64(x * Float64(0.5 + Float64(x * 0.16666666666666666)))))));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

   5. Taylor expanded in x around 0 8.9%

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

      1. unpow2 8.9%

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

   7. Applied egg-rr 8.9%

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

   8. Taylor expanded in x around 0 8.4%

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

      1. *-commutative 8.4%

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

   10. Simplified 8.4%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 10: 26.6% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)}{1 + x \cdot \left(1 + x \cdot 0.5\right)}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1)
   (/ (fmod (exp x) (+ 1.0 (* -0.25 (* x x)))) (+ 1.0 (* x (+ 1.0 (* x 0.5)))))
   (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), (1.0 + (-0.25 * (x * x)))) / (1.0 + (x * (1.0 + (x * 0.5))));
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x)))) / (1.0d0 + (x * (1.0d0 + (x * 0.5d0))))
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x)))) / (1.0 + (x * (1.0 + (x * 0.5))))
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

   5. Taylor expanded in x around 0 8.9%

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

      1. unpow2 8.9%

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

   7. Applied egg-rr 8.9%

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

   8. Taylor expanded in x around 0 8.2%

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

      1. *-commutative 8.2%

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

   10. Simplified 8.2%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 11: 26.3% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1)
   (/ (fmod (exp x) (+ 1.0 (* -0.25 (* x x)))) (+ x 1.0))
   (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), (1.0 + (-0.25 * (x * x)))) / (x + 1.0);
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x)))) / (x + 1.0d0)
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x)))) / (x + 1.0)
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = Float64(rem(exp(x), Float64(1.0 + Float64(-0.25 * Float64(x * x)))) / Float64(x + 1.0));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

   5. Taylor expanded in x around 0 8.9%

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

      1. unpow2 8.9%

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

   7. Applied egg-rr 8.9%

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

   8. Taylor expanded in x around 0 7.9%

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

      1. +-commutative 7.9%

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

   10. Simplified 7.9%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

Alternative 12: 25.6% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.1:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot \left(x \cdot x\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.1) (fmod (exp x) (+ 1.0 (* -0.25 (* x x)))) (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 0.1) {
		tmp = fmod(exp(x), (1.0 + (-0.25 * (x * x))));
	} else {
		tmp = fmod(1.0, 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.1d0) then
        tmp = mod(exp(x), (1.0d0 + ((-0.25d0) * (x * x))))
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 0.1:
		tmp = math.fmod(math.exp(x), (1.0 + (-0.25 * (x * x))))
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.1)
		tmp = rem(exp(x), Float64(1.0 + Float64(-0.25 * Float64(x * x))));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 0.10000000000000001

   1. Initial program 9.1%

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

      1. /-rgt-identity 9.1%

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

      2. associate-/r/ 9.1%

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

      3. exp-neg 9.1%

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

      4. remove-double-neg 9.1%

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

   3. Simplified 9.1%

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

   5. Taylor expanded in x around 0 8.9%

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

      1. unpow2 8.9%

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

   7. Applied egg-rr 8.9%

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

   8. Taylor expanded in x around 0 7.4%

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

   if 0.10000000000000001 < 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 0.0%

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

   4. Taylor expanded in x around 0 3.1%

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

   5. Taylor expanded in x around 0 3.1%

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

   6. Taylor expanded in x around 0 100.0%

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

4. Final simplification 26.2%

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

Alternative 13: 23.4% accurate, 5.0× 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.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 5.9%

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

4. Taylor expanded in x around 0 4.3%

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

5. Taylor expanded in x around 0 4.6%

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

6. Taylor expanded in x around 0 23.8%

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

Reproduce

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