expfmod (used to be hard to sample)

Percentage Accurate: 7.1% → 62.4%

Time: 21.1s

Alternatives: 16

Speedup: 5.0×

• could not determine a ground truth

  1. x = -8.39659540409539e+106

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.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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: 62.4% 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 := t\_0 \cdot e^{-x}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\log \left(\sqrt[3]{e}\right) + \log \left({\left(\sqrt[3]{e}\right)}^{2}\right)}\right)\right)\\ \mathbf{elif}\;t\_1 \leq 2:\\ \;\;\;\;e^{\mathsf{log1p}\left(\frac{t\_0}{e^{x}}\right)} + -1\\ \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 (* t_0 (exp (- x)))))
   (if (<= t_1 0.0)
     (fmod (exp x) (sqrt (+ (log (cbrt E)) (log (pow (cbrt E) 2.0)))))
     (if (<= t_1 2.0) (+ (exp (log1p (/ t_0 (exp x)))) -1.0) (fmod 1.0 1.0)))))

C

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

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	t_1 = Float64(t_0 * exp(Float64(-x)))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = rem(exp(x), sqrt(Float64(log(cbrt(exp(1))) + log((cbrt(exp(1)) ^ 2.0)))));
	elseif (t_1 <= 2.0)
		tmp = Float64(exp(log1p(Float64(t_0 / exp(x)))) + -1.0);
	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[(t$95$0 * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[E, 1/3], $MachinePrecision]], $MachinePrecision] + N[Log[N[Power[N[Power[E, 1/3], $MachinePrecision], 2.0], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision], If[LessEqual[t$95$1, 2.0], N[(N[Exp[N[Log[1 + N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] + -1.0), $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))) < 0.0

   1. Initial program 4.3%

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

      1. /-rgt-identity 4.3%

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

      2. associate-/r/ 4.3%

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

      3. exp-neg 4.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 4.3%

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

   3. Simplified 4.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-log-exp 4.3%

         \[\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 52.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 52.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 52.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 52.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 52.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 52.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 52.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 52.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 52.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 52.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}} \]

   13. Taylor expanded in x around 0 52.0%

       \[\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))) < 2

   1. Initial program 89.4%

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

      1. /-rgt-identity 89.4%

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

      2. associate-/r/ 89.2%

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

      3. exp-neg 89.5%

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

      4. remove-double-neg 89.5%

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

   3. Simplified 89.5%

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

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

   6. Applied egg-rr 88.8%

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

      1. expm1-log1p-u 89.1%

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

      2. expm1-undefine 90.0%

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

      3. rem-log-exp 90.5%

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

   8. Applied egg-rr 90.5%

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

   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.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

4. Final simplification 62.9%

   \[\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(\sqrt[3]{e}\right) + \log \left({\left(\sqrt[3]{e}\right)}^{2}\right)}\right)\right)\\ \mathbf{elif}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 2:\\ \;\;\;\;e^{\mathsf{log1p}\left(\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}\right)} + -1\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 62.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt[3]{e^{\cos x}}\\ \mathbf{if}\;\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{\log \left({t\_0}^{2}\right) + \log t\_0}\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = N[Power[N[Exp[N[Cos[x], $MachinePrecision]], $MachinePrecision], 1/3], $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] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[t$95$0, 2.0], $MachinePrecision]], $MachinePrecision] + N[Log[t$95$0], $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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

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

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

      \[\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}} \]

   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.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

Alternative 3: 61.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt[3]{e^{\cos x}}\\ \mathbf{if}\;\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{\log \left({t\_0}^{2}\right) + \log t\_0}\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
 (let* ((t_0 (cbrt (exp (cos x)))))
   (if (<= (* (fmod (exp x) (sqrt (cos x))) (exp (- x))) 2.0)
     (/
      (fmod (exp x) (sqrt (+ (log (pow t_0 2.0)) (log t_0))))
      (+ 1.0 (* x (+ 1.0 (* x 0.5)))))
     (fmod 1.0 1.0))))

C

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

Julia

function code(x)
	t_0 = cbrt(exp(cos(x)))
	tmp = 0.0
	if (Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) <= 2.0)
		tmp = Float64(rem(exp(x), sqrt(Float64(log((t_0 ^ 2.0)) + log(t_0)))) / 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_] := Block[{t$95$0 = N[Power[N[Exp[N[Cos[x], $MachinePrecision]], $MachinePrecision], 1/3], $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] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[t$95$0, 2.0], $MachinePrecision]], $MachinePrecision] + N[Log[t$95$0], $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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

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

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

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

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

      1. *-commutative 53.2%

         \[\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]{e^{\cos x}}\right)}\right)\right)}{1 + x \cdot \left(1 + \color{blue}{x \cdot 0.5}\right)} \]

   9. Simplified 53.2%

      \[\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]{e^{\cos x}}\right)}\right)\right)}{\color{blue}{1 + x \cdot \left(1 + x \cdot 0.5\right)}} \]

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

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0 0.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

Alternative 4: 61.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\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{\log \left({\left(\sqrt[3]{e^{\cos x}}\right)}^{2}\right) + \log \left(\sqrt[3]{e}\right)}\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_] := 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] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[N[Power[N[Exp[N[Cos[x], $MachinePrecision]], $MachinePrecision], 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[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 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

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

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

      \[\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 53.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 53.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 53.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}} \]

   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.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

Alternative 5: 61.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\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{\log \left(\sqrt[3]{e}\right) + \log \left({\left(\sqrt[3]{e}\right)}^{2}\right)}\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_] := 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] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[(N[Log[N[Power[E, 1/3], $MachinePrecision]], $MachinePrecision] + N[Log[N[Power[N[Power[E, 1/3], $MachinePrecision], 2.0], $MachinePrecision]], $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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

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

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

      \[\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 53.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 53.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 53.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 52.9%

       \[\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 53.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 52.9%

       \[\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 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.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

4. Final simplification 62.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\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{\log \left(\sqrt[3]{e}\right) + \log \left({\left(\sqrt[3]{e}\right)}^{2}\right)}\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 26.7% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\ \mathbf{if}\;t\_0 \cdot e^{-x} \leq 2:\\ \;\;\;\;e^{\mathsf{log1p}\left(\frac{t\_0}{e^{x}}\right)} + -1\\ \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)))))
   (if (<= (* t_0 (exp (- x))) 2.0)
     (+ (exp (log1p (/ t_0 (exp x)))) -1.0)
     (fmod 1.0 1.0))))

C

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

Python

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

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	tmp = 0.0
	if (Float64(t_0 * exp(Float64(-x))) <= 2.0)
		tmp = Float64(exp(log1p(Float64(t_0 / exp(x)))) + -1.0);
	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]}, If[LessEqual[N[(t$95$0 * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(N[Exp[N[Log[1 + N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], $MachinePrecision] + -1.0), $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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

   6. Applied egg-rr 8.5%

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

      1. expm1-log1p-u 8.5%

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

      2. expm1-undefine 8.5%

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

      3. rem-log-exp 8.6%

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

   8. Applied egg-rr 8.6%

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

   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.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

4. Final simplification 26.8%

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

Alternative 7: 26.8% 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 2:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(\mathsf{expm1}\left(\mathsf{log1p}\left(t\_0\right)\right)\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

function code(x)
	t_0 = sqrt(cos(x))
	tmp = 0.0
	if (Float64(rem(exp(x), t_0) * exp(Float64(-x))) <= 2.0)
		tmp = Float64(rem(exp(x), expm1(log1p(t_0))) / exp(x));
	else
		tmp = rem(1.0, 1.0);
	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], 2.0], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(Exp[N[Log[1 + t$95$0], $MachinePrecision]] - 1), $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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

      \[\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. expm1-log1p-u 8.5%

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

      2. expm1-undefine 8.5%

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

   6. Applied egg-rr 8.5%

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

      1. expm1-define 8.5%

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

   8. Simplified 8.5%

      \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \color{blue}{\left(\mathsf{expm1}\left(\mathsf{log1p}\left(\sqrt{\cos x}\right)\right)\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 0.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

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

C

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double tmp;
	if ((t_0 * exp(-x)) <= 2.0) {
		tmp = 1.0 / (exp(x) / 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)))
    if ((t_0 * exp(-x)) <= 2.0d0) then
        tmp = 1.0d0 / (exp(x) / 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)))
	tmp = 0
	if (t_0 * math.exp(-x)) <= 2.0:
		tmp = 1.0 / (math.exp(x) / t_0)
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	tmp = 0.0
	if (Float64(t_0 * exp(Float64(-x))) <= 2.0)
		tmp = Float64(1.0 / Float64(exp(x) / t_0));
	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]}, If[LessEqual[N[(t$95$0 * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(1.0 / N[(N[Exp[x], $MachinePrecision] / t$95$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 (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.5%

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

      1. exp-neg 8.5%

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

      2. div-inv 8.5%

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

      3. clear-num 8.5%

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

   4. Applied egg-rr 8.5%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in x around 0 0.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

Alternative 9: 26.8% 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)\\ \mathbf{if}\;t\_0 \cdot e^{-x} \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)))))
   (if (<= (* t_0 (exp (- x))) 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 tmp;
	if ((t_0 * exp(-x)) <= 2.0) {
		tmp = t_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) :: t_0
    real(8) :: tmp
    t_0 = mod(exp(x), sqrt(cos(x)))
    if ((t_0 * exp(-x)) <= 2.0d0) then
        tmp = t_0 / exp(x)
    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)))
	tmp = 0
	if (t_0 * math.exp(-x)) <= 2.0:
		tmp = t_0 / math.exp(x)
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	tmp = 0.0
	if (Float64(t_0 * exp(Float64(-x))) <= 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]}, If[LessEqual[N[(t$95$0 * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 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 2 regimes

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

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)}{e^{x}}} \]
   4. 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.1%

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

   4. Taylor expanded in x around 0 3.4%

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

   5. Taylor expanded in x around 0 5.0%

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

   6. Taylor expanded in x around 0 98.1%

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

Alternative 10: 26.5% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 500:\\ \;\;\;\;\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 500.0)
   (/ (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 <= 500.0) {
		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 <= 500.0d0) 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 <= 500.0:
		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 <= 500.0)
		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, 500.0], 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 < 500

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

      \[\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 500 < 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.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 + x \cdot \left(1 + x \cdot 0.5\right)\\ \mathbf{if}\;x \leq 200:\\ \;\;\;\;\frac{\left(t\_0 \bmod \left(1 + -0.25 \cdot {x}^{2}\right)\right)}{t\_0}\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (+ 1.0 (* x (+ 1.0 (* x 0.5))))))
   (if (<= x 200.0)
     (/ (fmod t_0 (+ 1.0 (* -0.25 (pow x 2.0)))) t_0)
     (fmod 1.0 1.0))))

C

double code(double x) {
	double t_0 = 1.0 + (x * (1.0 + (x * 0.5)));
	double tmp;
	if (x <= 200.0) {
		tmp = fmod(t_0, (1.0 + (-0.25 * pow(x, 2.0)))) / 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 = 1.0d0 + (x * (1.0d0 + (x * 0.5d0)))
    if (x <= 200.0d0) then
        tmp = mod(t_0, (1.0d0 + ((-0.25d0) * (x ** 2.0d0)))) / t_0
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

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

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = N[(1.0 + N[(x * N[(1.0 + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 200.0], N[(N[With[{TMP1 = t$95$0, TMP2 = N[(1.0 + N[(-0.25 * N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / t$95$0), $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 < 200

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

   6. Taylor expanded in x around 0 7.9%

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

      1. *-commutative 53.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]{e^{\cos x}}\right)}\right)\right)}{1 + x \cdot \left(1 + \color{blue}{x \cdot 0.5}\right)} \]

   8. Simplified 7.9%

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

   9. Taylor expanded in x around 0 8.1%

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

       1. *-commutative 53.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]{e^{\cos x}}\right)}\right)\right)}{1 + x \cdot \left(1 + \color{blue}{x \cdot 0.5}\right)} \]

   11. Simplified 8.1%

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

   if 200 < 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: 26.2% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 200:\\ \;\;\;\;\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 200.0)
   (/
    (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 <= 200.0) {
		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 <= 200.0d0) 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 <= 200.0:
		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 <= 200.0)
		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, 200.0], 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 < 200

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

      \[\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.0%

      \[\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.0%

         \[\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.0%

       \[\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 200 < 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 13: 26.0% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 200:\\ \;\;\;\;\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 200.0)
   (/ (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 <= 200.0) {
		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 <= 200.0d0) 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 <= 200.0:
		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 <= 200.0)
		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, 200.0], 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 < 200

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

   6. Taylor expanded in x around 0 7.9%

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

      1. *-commutative 53.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]{e^{\cos x}}\right)}\right)\right)}{1 + x \cdot \left(1 + \color{blue}{x \cdot 0.5}\right)} \]

   8. Simplified 7.9%

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

      1. unpow2 8.3%

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

   10. Applied egg-rr 7.9%

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

   if 200 < 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 14: 25.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 200:\\ \;\;\;\;\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 200.0)
   (/ (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 <= 200.0) {
		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 <= 200.0d0) 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 <= 200.0:
		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 <= 200.0)
		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, 200.0], 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 < 200

   1. Initial program 8.5%

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

      1. /-rgt-identity 8.5%

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

      2. associate-/r/ 8.5%

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

      3. exp-neg 8.5%

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

      4. remove-double-neg 8.5%

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

   3. Simplified 8.5%

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

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

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

      \[\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 + x}} \]
   9. Step-by-step derivation

      1. +-commutative 7.4%

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

   10. Simplified 7.4%

       \[\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 200 < 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 15: 24.6% accurate, 2.4× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 200.0) (fmod 1.0 (- 1.0 (* -0.25 (pow x 2.0)))) (fmod 1.0 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 200.0) {
		tmp = fmod(1.0, (1.0 - (-0.25 * pow(x, 2.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 <= 200.0d0) then
        tmp = mod(1.0d0, (1.0d0 - ((-0.25d0) * (x ** 2.0d0))))
    else
        tmp = mod(1.0d0, 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= 200.0:
		tmp = math.fmod(1.0, (1.0 - (-0.25 * math.pow(x, 2.0))))
	else:
		tmp = math.fmod(1.0, 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 200.0)
		tmp = rem(1.0, Float64(1.0 - Float64(-0.25 * (x ^ 2.0))));
	else
		tmp = rem(1.0, 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 200.0], N[With[{TMP1 = 1.0, TMP2 = N[(1.0 - N[(-0.25 * N[Power[x, 2.0], $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 < 200

   1. Initial program 8.5%

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

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

   4. Taylor expanded in x around 0 4.7%

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

   5. Taylor expanded in x around 0 5.1%

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

      1. unpow2 5.1%

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

      2. sqr-neg 5.1%

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

      3. neg-mul-1 5.1%

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

      4. associate-*l* 5.1%

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

      5. pow1 5.1%

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

      6. metadata-eval 5.1%

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

      7. add-sqr-sqrt 2.2%

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

      8. sqrt-unprod 5.1%

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

      9. sqr-neg 5.1%

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

      10. unpow2 5.1%

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

      11. sqrt-pow1 6.4%

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

      12. sqr-pow 6.4%

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

   7. Applied egg-rr 6.4%

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

      1. neg-mul-1 6.4%

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

   9. Simplified 6.4%

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

   if 200 < 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 25.1%

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

Alternative 16: 23.1% 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 6.8%

   \[\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.1%

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

4. Taylor expanded in x around 0 4.4%

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

5. Taylor expanded in x around 0 4.7%

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

6. Taylor expanded in x around 0 23.4%

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

Reproduce

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