expfmod (used to be hard to sample)

Percentage Accurate: 13.9% → 96.6%

Time: 1.5min

Alternatives: 12

Speedup: 5.0×

• could not determine a ground truth

  1. x = -1.0168281968244994e+307

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: 13.9% 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: 96.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\ t_1 := e^{-x}\\ t_2 := t\_0 \cdot t\_1\\ \mathbf{if}\;t\_2 \leq 0 \lor \neg \left(t\_2 \leq 2\right):\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;e^{\mathsf{log1p}\left(\mathsf{expm1}\left(\log t\_0 - x\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x))))
        (t_1 (exp (- x)))
        (t_2 (* t_0 t_1)))
   (if (or (<= t_2 0.0) (not (<= t_2 2.0)))
     t_1
     (exp (log1p (expm1 (- (log t_0) x)))))))

C

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double t_1 = exp(-x);
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 2.0)) {
		tmp = t_1;
	} else {
		tmp = exp(log1p(expm1((log(t_0) - x))));
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.fmod(math.exp(x), math.sqrt(math.cos(x)))
	t_1 = math.exp(-x)
	t_2 = t_0 * t_1
	tmp = 0
	if (t_2 <= 0.0) or not (t_2 <= 2.0):
		tmp = t_1
	else:
		tmp = math.exp(math.log1p(math.expm1((math.log(t_0) - x))))
	return tmp

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	t_1 = exp(Float64(-x))
	t_2 = Float64(t_0 * t_1)
	tmp = 0.0
	if ((t_2 <= 0.0) || !(t_2 <= 2.0))
		tmp = t_1;
	else
		tmp = exp(log1p(expm1(Float64(log(t_0) - x))));
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, If[Or[LessEqual[t$95$2, 0.0], N[Not[LessEqual[t$95$2, 2.0]], $MachinePrecision]], t$95$1, N[Exp[N[Log[1 + N[(Exp[N[(N[Log[t$95$0], $MachinePrecision] - x), $MachinePrecision]] - 1), $MachinePrecision]], $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 or 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.2%

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

      1. /-rgt-identity 0.2%

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

      2. associate-/r/ 0.2%

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

      3. exp-neg 0.2%

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

      4. remove-double-neg 0.2%

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

   3. Simplified 0.2%

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

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

      2. div-exp 0.2%

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

   6. Applied egg-rr 0.2%

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

   7. Taylor expanded in x around inf 99.6%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.6%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.6%

      \[\leadsto e^{\color{blue}{-x}} \]

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

   1. Initial program 85.4%

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

      1. /-rgt-identity 85.4%

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

      2. associate-/r/ 85.3%

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

      3. exp-neg 85.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 85.5%

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

   3. Simplified 85.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-exp-log 85.5%

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

      2. div-exp 85.5%

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

   6. Applied egg-rr 85.5%

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

      1. log1p-expm1-u 86.0%

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

   8. Applied egg-rr 86.0%

      \[\leadsto e^{\color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\log \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) - x\right)\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.6%

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

Alternative 2: 96.3% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

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 65.3%

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

      1. /-rgt-identity 65.3%

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

      2. associate-/r/ 65.2%

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

      3. exp-neg 65.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 65.3%

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

   3. Simplified 65.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 65.2%

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

      2. add-cube-cbrt 87.0%

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

      3. log-prod 87.0%

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

      4. pow2 87.0%

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

   6. Applied egg-rr 87.0%

      \[\leadsto \frac{\left(\left(e^{x}\right) \bmod \color{blue}{\left(\log \left({\left(\sqrt[3]{e^{\sqrt{\cos x}}}\right)}^{2}\right) + \log \left(\sqrt[3]{e^{\sqrt{\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. Step-by-step derivation

      1. /-rgt-identity 0.0%

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

      2. associate-/r/ 0.0%

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

      3. exp-neg 0.0%

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

      4. remove-double-neg 0.0%

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

   3. Simplified 0.0%

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

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

      2. div-exp 0.0%

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

   6. Applied egg-rr 0.0%

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

   7. Taylor expanded in x around inf 99.5%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.5%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.5%

      \[\leadsto e^{\color{blue}{-x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.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(\log \left({\left(\sqrt[3]{e^{\sqrt{\cos x}}}\right)}^{2}\right) + \log \left(\sqrt[3]{e^{\sqrt{\cos x}}}\right)\right)\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;e^{-x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\ t_1 := e^{-x}\\ t_2 := t\_0 \cdot t\_1\\ \mathbf{if}\;t\_2 \leq 0 \lor \neg \left(t\_2 \leq 2\right):\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;{\left(\sqrt[3]{\frac{t\_0}{e^{x}}}\right)}^{3}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x))))
        (t_1 (exp (- x)))
        (t_2 (* t_0 t_1)))
   (if (or (<= t_2 0.0) (not (<= t_2 2.0)))
     t_1
     (pow (cbrt (/ t_0 (exp x))) 3.0))))

C

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double t_1 = exp(-x);
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 2.0)) {
		tmp = t_1;
	} else {
		tmp = pow(cbrt((t_0 / exp(x))), 3.0);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = rem(exp(x), sqrt(cos(x)))
	t_1 = exp(Float64(-x))
	t_2 = Float64(t_0 * t_1)
	tmp = 0.0
	if ((t_2 <= 0.0) || !(t_2 <= 2.0))
		tmp = t_1;
	else
		tmp = cbrt(Float64(t_0 / exp(x))) ^ 3.0;
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, If[Or[LessEqual[t$95$2, 0.0], N[Not[LessEqual[t$95$2, 2.0]], $MachinePrecision]], t$95$1, N[Power[N[Power[N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision], 1/3], $MachinePrecision], 3.0], $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 0.2%

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

      1. /-rgt-identity 0.2%

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

      2. associate-/r/ 0.2%

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

      3. exp-neg 0.2%

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

      4. remove-double-neg 0.2%

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

   3. Simplified 0.2%

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

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

      2. div-exp 0.2%

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

   6. Applied egg-rr 0.2%

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

   7. Taylor expanded in x around inf 99.6%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.6%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.6%

      \[\leadsto e^{\color{blue}{-x}} \]

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

   1. Initial program 85.4%

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

      1. /-rgt-identity 85.4%

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

      2. associate-/r/ 85.3%

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

      3. exp-neg 85.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 85.5%

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

   3. Simplified 85.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-cube-cbrt 85.6%

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

      2. pow3 85.7%

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

   6. Applied egg-rr 85.7%

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

4. Final simplification 97.6%

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

Alternative 4: 96.6% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x))))
        (t_1 (exp (- x)))
        (t_2 (* t_0 t_1)))
   (if (or (<= t_2 0.0) (not (<= t_2 2.0)))
     t_1
     (+ (+ (/ t_0 (exp x)) 1.0) -1.0))))

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_0 = mod(exp(x), sqrt(cos(x)))
    t_1 = exp(-x)
    t_2 = t_0 * t_1
    if ((t_2 <= 0.0d0) .or. (.not. (t_2 <= 2.0d0))) then
        tmp = t_1
    else
        tmp = ((t_0 / exp(x)) + 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)))
	t_1 = math.exp(-x)
	t_2 = t_0 * t_1
	tmp = 0
	if (t_2 <= 0.0) or not (t_2 <= 2.0):
		tmp = t_1
	else:
		tmp = ((t_0 / math.exp(x)) + 1.0) + -1.0
	return tmp

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 0.2%

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

      1. /-rgt-identity 0.2%

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

      2. associate-/r/ 0.2%

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

      3. exp-neg 0.2%

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

      4. remove-double-neg 0.2%

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

   3. Simplified 0.2%

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

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

      2. div-exp 0.2%

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

   6. Applied egg-rr 0.2%

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

   7. Taylor expanded in x around inf 99.6%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.6%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.6%

      \[\leadsto e^{\color{blue}{-x}} \]

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

   1. Initial program 85.4%

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

      1. /-rgt-identity 85.4%

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

      2. associate-/r/ 85.3%

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

      3. exp-neg 85.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 85.5%

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

   3. Simplified 85.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 85.3%

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

      2. add-cube-cbrt 82.8%

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

      3. log-prod 82.8%

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

      4. pow2 82.8%

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

   6. Applied egg-rr 82.8%

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

      1. sum-log 82.8%

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

      2. unpow2 82.8%

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

      3. add-cube-cbrt 85.3%

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

      4. add-log-exp 85.5%

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

      5. expm1-log1p-u 85.5%

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

      6. expm1-define 85.7%

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

      7. log1p-undefine 85.7%

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

      8. rem-exp-log 85.7%

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

   8. Applied egg-rr 85.7%

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

4. Final simplification 97.6%

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

Alternative 5: 96.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right)\\ t_1 := e^{-x}\\ t_2 := t\_0 \cdot t\_1\\ \mathbf{if}\;t\_2 \leq 0 \lor \neg \left(t\_2 \leq 2\right):\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_0}{e^{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) (sqrt (cos x))))
        (t_1 (exp (- x)))
        (t_2 (* t_0 t_1)))
   (if (or (<= t_2 0.0) (not (<= t_2 2.0))) t_1 (/ t_0 (exp x)))))

C

double code(double x) {
	double t_0 = fmod(exp(x), sqrt(cos(x)));
	double t_1 = exp(-x);
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 2.0)) {
		tmp = t_1;
	} else {
		tmp = t_0 / exp(x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_0 = mod(exp(x), sqrt(cos(x)))
    t_1 = exp(-x)
    t_2 = t_0 * t_1
    if ((t_2 <= 0.0d0) .or. (.not. (t_2 <= 2.0d0))) then
        tmp = t_1
    else
        tmp = t_0 / exp(x)
    end if
    code = tmp
end function

Python

def code(x):
	t_0 = math.fmod(math.exp(x), math.sqrt(math.cos(x)))
	t_1 = math.exp(-x)
	t_2 = t_0 * t_1
	tmp = 0
	if (t_2 <= 0.0) or not (t_2 <= 2.0):
		tmp = t_1
	else:
		tmp = t_0 / math.exp(x)
	return tmp

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]}, Block[{t$95$1 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 * t$95$1), $MachinePrecision]}, If[Or[LessEqual[t$95$2, 0.0], N[Not[LessEqual[t$95$2, 2.0]], $MachinePrecision]], t$95$1, N[(t$95$0 / 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 or 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.2%

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

      1. /-rgt-identity 0.2%

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

      2. associate-/r/ 0.2%

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

      3. exp-neg 0.2%

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

      4. remove-double-neg 0.2%

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

   3. Simplified 0.2%

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

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

      2. div-exp 0.2%

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

   6. Applied egg-rr 0.2%

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

   7. Taylor expanded in x around inf 99.6%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.6%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.6%

      \[\leadsto e^{\color{blue}{-x}} \]

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

   1. Initial program 85.4%

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

      1. /-rgt-identity 85.4%

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

      2. associate-/r/ 85.3%

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

      3. exp-neg 85.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 85.5%

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

   3. Simplified 85.5%

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

4. Final simplification 97.5%

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

Alternative 6: 94.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16}:\\ \;\;\;\;e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x}\\ \mathbf{elif}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 1.26\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot {x}^{2}\right)\right)}{e^{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-16)
   (exp (- (log (fmod (exp x) 1.0)) x))
   (if (or (<= x -5e-26) (not (<= x 1.26)))
     (exp (- x))
     (/ (fmod (exp x) (+ 1.0 (* -0.25 (pow x 2.0)))) (exp x)))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-16) {
		tmp = exp((log(fmod(exp(x), 1.0)) - x));
	} else if ((x <= -5e-26) || !(x <= 1.26)) {
		tmp = exp(-x);
	} else {
		tmp = fmod(exp(x), (1.0 + (-0.25 * pow(x, 2.0)))) / exp(x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2d-16)) then
        tmp = exp((log(mod(exp(x), 1.0d0)) - x))
    else if ((x <= (-5d-26)) .or. (.not. (x <= 1.26d0))) then
        tmp = exp(-x)
    else
        tmp = mod(exp(x), (1.0d0 + ((-0.25d0) * (x ** 2.0d0)))) / exp(x)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= -2e-16:
		tmp = math.exp((math.log(math.fmod(math.exp(x), 1.0)) - x))
	elif (x <= -5e-26) or not (x <= 1.26):
		tmp = math.exp(-x)
	else:
		tmp = math.fmod(math.exp(x), (1.0 + (-0.25 * math.pow(x, 2.0)))) / math.exp(x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-16)
		tmp = exp(Float64(log(rem(exp(x), 1.0)) - x));
	elseif ((x <= -5e-26) || !(x <= 1.26))
		tmp = exp(Float64(-x));
	else
		tmp = Float64(rem(exp(x), Float64(1.0 + Float64(-0.25 * (x ^ 2.0)))) / exp(x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -2e-16], N[Exp[N[(N[Log[N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[x, -5e-26], N[Not[LessEqual[x, 1.26]], $MachinePrecision]], N[Exp[(-x)], $MachinePrecision], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(1.0 + N[(-0.25 * N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2e-16

   1. Initial program 94.8%

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

      1. /-rgt-identity 94.8%

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

      2. associate-/r/ 94.5%

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

      3. exp-neg 95.0%

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

      4. remove-double-neg 95.0%

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

   3. Simplified 95.0%

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

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

      1. add-exp-log 95.0%

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

      2. div-exp 95.2%

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

   7. Applied egg-rr 95.2%

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

   if -2e-16 < x < -5.00000000000000019e-26 or 1.26000000000000001 < x

   1. Initial program 0.6%

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

      1. /-rgt-identity 0.6%

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

      2. associate-/r/ 0.6%

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

      3. exp-neg 0.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 0.6%

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

   3. Simplified 0.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-exp-log 0.6%

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

      2. div-exp 0.6%

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

   6. Applied egg-rr 0.6%

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

   7. Taylor expanded in x around inf 99.6%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.6%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.6%

      \[\leadsto e^{\color{blue}{-x}} \]

   if -5.00000000000000019e-26 < x < 1.26000000000000001

   1. Initial program 68.6%

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

      1. /-rgt-identity 68.6%

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

      2. associate-/r/ 68.7%

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

      3. exp-neg 68.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 68.7%

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

   3. Simplified 68.7%

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

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

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16}:\\ \;\;\;\;e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x}\\ \mathbf{elif}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 1.26\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod \left(1 + -0.25 \cdot {x}^{2}\right)\right)}{e^{x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 94.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16}:\\ \;\;\;\;e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x}\\ \mathbf{elif}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 0.93\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \left(1 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-16)
   (exp (- (log (fmod (exp x) 1.0)) x))
   (if (or (<= x -5e-26) (not (<= x 0.93)))
     (exp (- x))
     (* (fmod (exp x) (sqrt (cos x))) (- 1.0 x)))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-16) {
		tmp = exp((log(fmod(exp(x), 1.0)) - x));
	} else if ((x <= -5e-26) || !(x <= 0.93)) {
		tmp = exp(-x);
	} else {
		tmp = fmod(exp(x), sqrt(cos(x))) * (1.0 - x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2d-16)) then
        tmp = exp((log(mod(exp(x), 1.0d0)) - x))
    else if ((x <= (-5d-26)) .or. (.not. (x <= 0.93d0))) then
        tmp = exp(-x)
    else
        tmp = mod(exp(x), sqrt(cos(x))) * (1.0d0 - x)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= -2e-16:
		tmp = math.exp((math.log(math.fmod(math.exp(x), 1.0)) - x))
	elif (x <= -5e-26) or not (x <= 0.93):
		tmp = math.exp(-x)
	else:
		tmp = math.fmod(math.exp(x), math.sqrt(math.cos(x))) * (1.0 - x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-16)
		tmp = exp(Float64(log(rem(exp(x), 1.0)) - x));
	elseif ((x <= -5e-26) || !(x <= 0.93))
		tmp = exp(Float64(-x));
	else
		tmp = Float64(rem(exp(x), sqrt(cos(x))) * Float64(1.0 - x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -2e-16], N[Exp[N[(N[Log[N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[x, -5e-26], N[Not[LessEqual[x, 0.93]], $MachinePrecision]], N[Exp[(-x)], $MachinePrecision], 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[(1.0 - x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2e-16

   1. Initial program 94.8%

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

      1. /-rgt-identity 94.8%

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

      2. associate-/r/ 94.5%

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

      3. exp-neg 95.0%

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

      4. remove-double-neg 95.0%

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

   3. Simplified 95.0%

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

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

      1. add-exp-log 95.0%

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

      2. div-exp 95.2%

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

   7. Applied egg-rr 95.2%

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

   if -2e-16 < x < -5.00000000000000019e-26 or 0.930000000000000049 < x

   1. Initial program 0.6%

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

      1. /-rgt-identity 0.6%

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

      2. associate-/r/ 0.6%

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

      3. exp-neg 0.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 0.6%

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

   3. Simplified 0.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-exp-log 0.6%

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

      2. div-exp 0.6%

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

   6. Applied egg-rr 0.6%

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

   7. Taylor expanded in x around inf 99.6%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 99.6%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 99.6%

      \[\leadsto e^{\color{blue}{-x}} \]

   if -5.00000000000000019e-26 < x < 0.930000000000000049

   1. Initial program 68.6%

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

      1. /-rgt-identity 68.6%

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

      2. associate-/r/ 68.7%

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

      3. exp-neg 68.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 68.7%

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

   3. Simplified 68.7%

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

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

      1. +-commutative 53.0%

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

      2. mul-1-neg 53.0%

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

      3. unsub-neg 53.0%

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

      4. *-lft-identity 53.0%

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

      5. distribute-rgt-out-- 53.0%

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

   7. Simplified 53.0%

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

4. Final simplification 96.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16}:\\ \;\;\;\;e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x}\\ \mathbf{elif}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 0.93\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot \left(1 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 93.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(e^{x}\right) \bmod 1\right)\\ \mathbf{if}\;x \leq -2 \cdot 10^{-16}:\\ \;\;\;\;e^{\log t\_0 - x}\\ \mathbf{elif}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 2\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\frac{t\_0}{e^{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (fmod (exp x) 1.0)))
   (if (<= x -2e-16)
     (exp (- (log t_0) x))
     (if (or (<= x -5e-26) (not (<= x 2.0))) (exp (- x)) (/ t_0 (exp x))))))

C

double code(double x) {
	double t_0 = fmod(exp(x), 1.0);
	double tmp;
	if (x <= -2e-16) {
		tmp = exp((log(t_0) - x));
	} else if ((x <= -5e-26) || !(x <= 2.0)) {
		tmp = exp(-x);
	} else {
		tmp = t_0 / exp(x);
	}
	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), 1.0d0)
    if (x <= (-2d-16)) then
        tmp = exp((log(t_0) - x))
    else if ((x <= (-5d-26)) .or. (.not. (x <= 2.0d0))) then
        tmp = exp(-x)
    else
        tmp = t_0 / exp(x)
    end if
    code = tmp
end function

Python

def code(x):
	t_0 = math.fmod(math.exp(x), 1.0)
	tmp = 0
	if x <= -2e-16:
		tmp = math.exp((math.log(t_0) - x))
	elif (x <= -5e-26) or not (x <= 2.0):
		tmp = math.exp(-x)
	else:
		tmp = t_0 / math.exp(x)
	return tmp

Julia

function code(x)
	t_0 = rem(exp(x), 1.0)
	tmp = 0.0
	if (x <= -2e-16)
		tmp = exp(Float64(log(t_0) - x));
	elseif ((x <= -5e-26) || !(x <= 2.0))
		tmp = exp(Float64(-x));
	else
		tmp = Float64(t_0 / exp(x));
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]}, If[LessEqual[x, -2e-16], N[Exp[N[(N[Log[t$95$0], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[x, -5e-26], N[Not[LessEqual[x, 2.0]], $MachinePrecision]], N[Exp[(-x)], $MachinePrecision], N[(t$95$0 / N[Exp[x], $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2e-16

   1. Initial program 94.8%

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

      1. /-rgt-identity 94.8%

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

      2. associate-/r/ 94.5%

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

      3. exp-neg 95.0%

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

      4. remove-double-neg 95.0%

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

   3. Simplified 95.0%

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

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

      1. add-exp-log 95.0%

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

      2. div-exp 95.2%

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

   7. Applied egg-rr 95.2%

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

   if -2e-16 < x < -5.00000000000000019e-26 or 2 < x

   1. Initial program 0.2%

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

      1. /-rgt-identity 0.2%

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

      2. associate-/r/ 0.2%

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

      3. exp-neg 0.2%

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

      4. remove-double-neg 0.2%

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

   3. Simplified 0.2%

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

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

      2. div-exp 0.2%

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

   6. Applied egg-rr 0.2%

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

   7. Taylor expanded in x around inf 100.0%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 100.0%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 100.0%

      \[\leadsto e^{\color{blue}{-x}} \]

   if -5.00000000000000019e-26 < x < 2

   1. Initial program 70.2%

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

      1. /-rgt-identity 70.2%

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

      2. associate-/r/ 70.3%

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

      3. exp-neg 70.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 70.3%

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

   3. Simplified 70.3%

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

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

4. Final simplification 95.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16}:\\ \;\;\;\;e^{\log \left(\left(e^{x}\right) \bmod 1\right) - x}\\ \mathbf{elif}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 2\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 93.6% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16} \lor \neg \left(x \leq -5 \cdot 10^{-26}\right) \land x \leq 2:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -2e-16) (and (not (<= x -5e-26)) (<= x 2.0)))
   (/ (fmod (exp x) 1.0) (exp x))
   (exp (- x))))

C

double code(double x) {
	double tmp;
	if ((x <= -2e-16) || (!(x <= -5e-26) && (x <= 2.0))) {
		tmp = fmod(exp(x), 1.0) / exp(x);
	} else {
		tmp = exp(-x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-2d-16)) .or. (.not. (x <= (-5d-26))) .and. (x <= 2.0d0)) then
        tmp = mod(exp(x), 1.0d0) / exp(x)
    else
        tmp = exp(-x)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if (x <= -2e-16) or (not (x <= -5e-26) and (x <= 2.0)):
		tmp = math.fmod(math.exp(x), 1.0) / math.exp(x)
	else:
		tmp = math.exp(-x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -2e-16) || (!(x <= -5e-26) && (x <= 2.0)))
		tmp = Float64(rem(exp(x), 1.0) / exp(x));
	else
		tmp = exp(Float64(-x));
	end
	return tmp
end

Wolfram

code[x_] := If[Or[LessEqual[x, -2e-16], And[N[Not[LessEqual[x, -5e-26]], $MachinePrecision], LessEqual[x, 2.0]]], 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[Exp[(-x)], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2e-16 or -5.00000000000000019e-26 < x < 2

   1. Initial program 83.2%

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

      1. /-rgt-identity 83.2%

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

      2. associate-/r/ 83.0%

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

      3. exp-neg 83.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 83.3%

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

   3. Simplified 83.3%

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

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

   if -2e-16 < x < -5.00000000000000019e-26 or 2 < x

   1. Initial program 0.2%

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

      1. /-rgt-identity 0.2%

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

      2. associate-/r/ 0.2%

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

      3. exp-neg 0.2%

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

      4. remove-double-neg 0.2%

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

   3. Simplified 0.2%

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

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

      2. div-exp 0.2%

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

   6. Applied egg-rr 0.2%

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

   7. Taylor expanded in x around inf 100.0%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 100.0%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 100.0%

      \[\leadsto e^{\color{blue}{-x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-16} \lor \neg \left(x \leq -5 \cdot 10^{-26}\right) \land x \leq 2:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\\ \mathbf{else}:\\ \;\;\;\;e^{-x}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 89.6% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 0.48\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -5e-26) (not (<= x 0.48))) (exp (- x)) (fmod (exp x) 1.0)))

C

double code(double x) {
	double tmp;
	if ((x <= -5e-26) || !(x <= 0.48)) {
		tmp = exp(-x);
	} else {
		tmp = fmod(exp(x), 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-5d-26)) .or. (.not. (x <= 0.48d0))) then
        tmp = exp(-x)
    else
        tmp = mod(exp(x), 1.0d0)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if (x <= -5e-26) or not (x <= 0.48):
		tmp = math.exp(-x)
	else:
		tmp = math.fmod(math.exp(x), 1.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -5e-26) || !(x <= 0.48))
		tmp = exp(Float64(-x));
	else
		tmp = rem(exp(x), 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[Or[LessEqual[x, -5e-26], N[Not[LessEqual[x, 0.48]], $MachinePrecision]], N[Exp[(-x)], $MachinePrecision], N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.00000000000000019e-26 or 0.47999999999999998 < x

   1. Initial program 8.9%

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

      1. /-rgt-identity 8.9%

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

      2. associate-/r/ 8.8%

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

      3. exp-neg 8.9%

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

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

   3. Simplified 8.9%

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

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

      2. div-exp 8.9%

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

   6. Applied egg-rr 8.9%

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

   7. Taylor expanded in x around inf 95.4%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 95.4%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 95.4%

      \[\leadsto e^{\color{blue}{-x}} \]

   if -5.00000000000000019e-26 < x < 0.47999999999999998

   1. Initial program 66.9%

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

      1. /-rgt-identity 66.9%

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

      2. associate-/r/ 67.0%

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

      3. exp-neg 67.0%

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

      4. remove-double-neg 67.0%

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

   3. Simplified 67.0%

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

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

   6. Taylor expanded in x around 0 46.1%

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

4. Final simplification 92.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-26} \lor \neg \left(x \leq 0.48\right):\\ \;\;\;\;e^{-x}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(e^{x}\right) \bmod 1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 90.6% accurate, 2.4× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.15e-16) (* (fmod (exp x) 1.0) (- 1.0 x)) (exp (- x))))

C

double code(double x) {
	double tmp;
	if (x <= -1.15e-16) {
		tmp = fmod(exp(x), 1.0) * (1.0 - x);
	} else {
		tmp = exp(-x);
	}
	return tmp;
}

Fortran

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

Python

def code(x):
	tmp = 0
	if x <= -1.15e-16:
		tmp = math.fmod(math.exp(x), 1.0) * (1.0 - x)
	else:
		tmp = math.exp(-x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.15e-16)
		tmp = Float64(rem(exp(x), 1.0) * Float64(1.0 - x));
	else
		tmp = exp(Float64(-x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.15e-16

   1. Initial program 94.8%

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

      1. /-rgt-identity 94.8%

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

      2. associate-/r/ 94.5%

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

      3. exp-neg 95.0%

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

      4. remove-double-neg 95.0%

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

   3. Simplified 95.0%

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

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

   6. Taylor expanded in x around 0 73.8%

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

      1. +-commutative 73.8%

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

      2. *-lft-identity 73.8%

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

      3. associate-*r* 73.8%

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

      4. neg-mul-1 73.8%

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

      5. distribute-rgt-out 73.6%

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

   8. Simplified 73.6%

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

   9. Taylor expanded in x around 0 73.8%

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

       1. +-commutative 73.8%

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

       2. mul-1-neg 73.8%

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

       3. *-commutative 73.8%

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

       4. sub-neg 73.8%

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

       5. *-rgt-identity 73.8%

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

       6. distribute-lft-out-- 73.6%

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

   11. Simplified 73.6%

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

   if -1.15e-16 < x

   1. Initial program 5.5%

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

      1. /-rgt-identity 5.5%

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

      2. associate-/r/ 5.5%

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

      3. exp-neg 5.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 5.5%

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

   3. Simplified 5.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-exp-log 5.5%

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

      2. div-exp 5.5%

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

   6. Applied egg-rr 5.5%

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

   7. Taylor expanded in x around inf 93.3%

      \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
   8. Step-by-step derivation

      1. neg-mul-1 93.3%

         \[\leadsto e^{\color{blue}{-x}} \]

   9. Simplified 93.3%

      \[\leadsto e^{\color{blue}{-x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 91.8%

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

Alternative 12: 88.9% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (exp (- x)))

C

double code(double x) {
	return exp(-x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = exp(-x)
end function

Java

public static double code(double x) {
	return Math.exp(-x);
}

Python

def code(x):
	return math.exp(-x)

Julia

function code(x)
	return exp(Float64(-x))
end

MATLAB

function tmp = code(x)
	tmp = exp(-x);
end

Wolfram

code[x_] := N[Exp[(-x)], $MachinePrecision]

Derivation

1. Initial program 12.5%

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

   1. /-rgt-identity 12.5%

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

   2. associate-/r/ 12.5%

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

   3. exp-neg 12.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 12.5%

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

3. Simplified 12.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-exp-log 12.5%

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

   2. div-exp 12.5%

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

6. Applied egg-rr 12.5%

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

7. Taylor expanded in x around inf 90.2%

   \[\leadsto e^{\color{blue}{-1 \cdot x}} \]
8. Step-by-step derivation

   1. neg-mul-1 90.2%

      \[\leadsto e^{\color{blue}{-x}} \]

9. Simplified 90.2%

   \[\leadsto e^{\color{blue}{-x}} \]

10. Final simplification 90.2%

    \[\leadsto e^{-x} \]
11. Add Preprocessing

Reproduce

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