expfmod (used to be hard to sample)

Percentage Accurate: 7.0% → 63.5%

Time: 16.2s

Alternatives: 5

Speedup: 5.0×

• could not determine a ground truth

  1. x = -7.397679270914824e+202

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

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

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

Alternative 1: 63.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x) {
	double t_0 = exp(-x);
	double t_1 = fmod(exp(x), sqrt(cos(x)));
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 2.0)) {
		tmp = t_0;
	} else {
		tmp = exp((3.0 * (0.3333333333333333 * (log(t_1) - 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 = exp(-x)
    t_1 = mod(exp(x), sqrt(cos(x)))
    t_2 = t_0 * t_1
    if ((t_2 <= 0.0d0) .or. (.not. (t_2 <= 2.0d0))) then
        tmp = t_0
    else
        tmp = exp((3.0d0 * (0.3333333333333333d0 * (log(t_1) - x))))
    end if
    code = tmp
end function

Python

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

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$1 = 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$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$0, N[Exp[N[(3.0 * N[(0.3333333333333333 * N[(N[Log[t$95$1], $MachinePrecision] - x), $MachinePrecision]), $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 3.5%

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

      1. exp-neg 3.5%

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

      2. associate-*r/ 3.5%

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

      3. *-rgt-identity 3.5%

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

   3. Simplified 3.5%

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

      1. add-exp-log 3.5%

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

      2. div-exp 3.5%

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

   5. Applied egg-rr 3.5%

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

   6. Taylor expanded in x around inf 60.9%

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

      1. neg-mul-1 60.9%

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

   8. Simplified 60.9%

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

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

      1. exp-neg 86.2%

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

      2. associate-*r/ 86.3%

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

      3. *-rgt-identity 86.3%

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

   3. Simplified 86.3%

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

      1. add-cube-cbrt 86.1%

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

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

      3. pow-to-exp 86.2%

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

      4. pow1/3 86.4%

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

      5. log-pow 86.6%

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

      6. log-div 86.6%

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

      7. add-log-exp 86.6%

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

   5. Applied egg-rr 86.6%

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

4. Final simplification 62.2%

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

Alternative 2: 63.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x) {
	double t_0 = exp(-x);
	double t_1 = fmod(exp(x), sqrt(cos(x)));
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 2.0)) {
		tmp = t_0;
	} else {
		tmp = exp((log(t_1) - 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 = exp(-x)
    t_1 = mod(exp(x), sqrt(cos(x)))
    t_2 = t_0 * t_1
    if ((t_2 <= 0.0d0) .or. (.not. (t_2 <= 2.0d0))) then
        tmp = t_0
    else
        tmp = exp((log(t_1) - x))
    end if
    code = tmp
end function

Python

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

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$1 = 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$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$0, N[Exp[N[(N[Log[t$95$1], $MachinePrecision] - 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 3.5%

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

      1. exp-neg 3.5%

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

      2. associate-*r/ 3.5%

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

      3. *-rgt-identity 3.5%

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

   3. Simplified 3.5%

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

      1. add-exp-log 3.5%

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

      2. div-exp 3.5%

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

   5. Applied egg-rr 3.5%

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

   6. Taylor expanded in x around inf 60.9%

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

      1. neg-mul-1 60.9%

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

   8. Simplified 60.9%

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

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

      1. exp-neg 86.2%

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

      2. associate-*r/ 86.3%

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

      3. *-rgt-identity 86.3%

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

   3. Simplified 86.3%

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

      1. add-exp-log 86.3%

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

      2. div-exp 86.4%

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

   5. Applied egg-rr 86.4%

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

4. Final simplification 62.2%

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

Alternative 3: 63.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x) {
	double t_0 = exp(-x);
	double t_1 = fmod(exp(x), sqrt(cos(x)));
	double t_2 = t_0 * t_1;
	double tmp;
	if ((t_2 <= 0.0) || !(t_2 <= 2.0)) {
		tmp = t_0;
	} else {
		tmp = t_1 / 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 = exp(-x)
    t_1 = mod(exp(x), sqrt(cos(x)))
    t_2 = t_0 * t_1
    if ((t_2 <= 0.0d0) .or. (.not. (t_2 <= 2.0d0))) then
        tmp = t_0
    else
        tmp = t_1 / exp(x)
    end if
    code = tmp
end function

Python

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

Julia

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

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$1 = 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$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$0, N[(t$95$1 / 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 3.5%

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

      1. exp-neg 3.5%

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

      2. associate-*r/ 3.5%

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

      3. *-rgt-identity 3.5%

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

   3. Simplified 3.5%

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

      1. add-exp-log 3.5%

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

      2. div-exp 3.5%

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

   5. Applied egg-rr 3.5%

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

   6. Taylor expanded in x around inf 60.9%

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

      1. neg-mul-1 60.9%

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

   8. Simplified 60.9%

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

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

      1. exp-neg 86.2%

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

      2. associate-*r/ 86.3%

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

      3. *-rgt-identity 86.3%

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

   3. Simplified 86.3%

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

4. Final simplification 62.2%

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

Alternative 4: 63.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_] := If[LessEqual[x, 1.0], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[(3.0 * N[Log[N[Power[N[Exp[N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]], $MachinePrecision], 1/3], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, 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 < 1

   1. Initial program 9.6%

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

      1. exp-neg 9.6%

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

      2. associate-*r/ 9.6%

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

      3. *-rgt-identity 9.6%

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

   3. Simplified 9.6%

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

      1. add-log-exp 9.6%

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

      2. add-cube-cbrt 52.9%

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

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

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

   5. Applied egg-rr 52.9%

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

      1. log-pow 52.9%

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

      2. distribute-lft1-in 52.9%

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

      3. metadata-eval 52.9%

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

   7. Simplified 52.9%

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

   if 1 < 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. exp-neg 0.0%

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

      2. associate-*r/ 0.0%

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

      3. *-rgt-identity 0.0%

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

   3. Simplified 0.0%

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

   5. Applied egg-rr 0.0%

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

   6. Taylor expanded in x around inf 100.0%

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

      1. neg-mul-1 100.0%

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

   8. Simplified 100.0%

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

4. Final simplification 62.1%

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

Alternative 5: 61.3% 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 7.7%

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

   1. exp-neg 7.7%

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

   2. associate-*r/ 7.7%

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

   3. *-rgt-identity 7.7%

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

3. Simplified 7.7%

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

   1. add-exp-log 7.7%

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

   2. div-exp 7.7%

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

5. Applied egg-rr 7.7%

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

6. Taylor expanded in x around inf 59.8%

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

   1. neg-mul-1 59.8%

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

8. Simplified 59.8%

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

9. Final simplification 59.8%

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

Reproduce

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