ENA, Section 1.4, Exercise 4b, n=5

Percentage Accurate: 88.5% → 99.3%

Time: 7.0s

Alternatives: 6

Speedup: 1.8×

Specification

\[\left(-1000000000 \leq x \land x \leq 1000000000\right) \land \left(-1 \leq \varepsilon \land \varepsilon \leq 1\right)\]

Math

\[\begin{array}{l} \\ {\left(x + \varepsilon\right)}^{5} - {x}^{5} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (pow (+ x eps) 5.0) (pow x 5.0)))

C

double code(double x, double eps) {
	return pow((x + eps), 5.0) - pow(x, 5.0);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = ((x + eps) ** 5.0d0) - (x ** 5.0d0)
end function

Java

public static double code(double x, double eps) {
	return Math.pow((x + eps), 5.0) - Math.pow(x, 5.0);
}

Python

def code(x, eps):
	return math.pow((x + eps), 5.0) - math.pow(x, 5.0)

Julia

function code(x, eps)
	return Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
end

MATLAB

function tmp = code(x, eps)
	tmp = ((x + eps) ^ 5.0) - (x ^ 5.0);
end

Wolfram

code[x_, eps_] := N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]

Initial Program: 88.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ {\left(x + \varepsilon\right)}^{5} - {x}^{5} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (- (pow (+ x eps) 5.0) (pow x 5.0)))

C

double code(double x, double eps) {
	return pow((x + eps), 5.0) - pow(x, 5.0);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = ((x + eps) ** 5.0d0) - (x ** 5.0d0)
end function

Java

public static double code(double x, double eps) {
	return Math.pow((x + eps), 5.0) - Math.pow(x, 5.0);
}

Python

def code(x, eps):
	return math.pow((x + eps), 5.0) - math.pow(x, 5.0)

Julia

function code(x, eps)
	return Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
end

MATLAB

function tmp = code(x, eps)
	tmp = ((x + eps) ^ 5.0) - (x ^ 5.0);
end

Wolfram

code[x_, eps_] := N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5}\\ t_1 := t\_0 - {x}^{5}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-316}:\\ \;\;\;\;t\_0 - \sqrt[3]{{x}^{15}}\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (pow (+ x eps) 5.0)) (t_1 (- t_0 (pow x 5.0))))
   (if (<= t_1 -1e-316)
     (- t_0 (cbrt (pow x 15.0)))
     (if (<= t_1 0.0) (* (pow x 4.0) (* eps 5.0)) t_1))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0);
	double t_1 = t_0 - pow(x, 5.0);
	double tmp;
	if (t_1 <= -1e-316) {
		tmp = t_0 - cbrt(pow(x, 15.0));
	} else if (t_1 <= 0.0) {
		tmp = pow(x, 4.0) * (eps * 5.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double eps) {
	double t_0 = Math.pow((x + eps), 5.0);
	double t_1 = t_0 - Math.pow(x, 5.0);
	double tmp;
	if (t_1 <= -1e-316) {
		tmp = t_0 - Math.cbrt(Math.pow(x, 15.0));
	} else if (t_1 <= 0.0) {
		tmp = Math.pow(x, 4.0) * (eps * 5.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, eps)
	t_0 = Float64(x + eps) ^ 5.0
	t_1 = Float64(t_0 - (x ^ 5.0))
	tmp = 0.0
	if (t_1 <= -1e-316)
		tmp = Float64(t_0 - cbrt((x ^ 15.0)));
	elseif (t_1 <= 0.0)
		tmp = Float64((x ^ 4.0) * Float64(eps * 5.0));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-316], N[(t$95$0 - N[Power[N[Power[x, 15.0], $MachinePrecision], 1/3], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(N[Power[x, 4.0], $MachinePrecision] * N[(eps * 5.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -9.999999837e-317

   1. Initial program 99.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cbrt-cube 99.9%

         \[\leadsto {\left(x + \varepsilon\right)}^{5} - \color{blue}{\sqrt[3]{\left({x}^{5} \cdot {x}^{5}\right) \cdot {x}^{5}}} \]

      2. pow3 99.9%

         \[\leadsto {\left(x + \varepsilon\right)}^{5} - \sqrt[3]{\color{blue}{{\left({x}^{5}\right)}^{3}}} \]

      3. pow-pow 99.9%

         \[\leadsto {\left(x + \varepsilon\right)}^{5} - \sqrt[3]{\color{blue}{{x}^{\left(5 \cdot 3\right)}}} \]

      4. metadata-eval 99.9%

         \[\leadsto {\left(x + \varepsilon\right)}^{5} - \sqrt[3]{{x}^{\color{blue}{15}}} \]

   4. Applied egg-rr 99.9%

      \[\leadsto {\left(x + \varepsilon\right)}^{5} - \color{blue}{\sqrt[3]{{x}^{15}}} \]

   if -9.999999837e-317 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 87.9%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(\varepsilon + 4 \cdot \varepsilon\right)} \]
   4. Step-by-step derivation

      1. distribute-rgt1-in 100.0%

         \[\leadsto {x}^{4} \cdot \color{blue}{\left(\left(4 + 1\right) \cdot \varepsilon\right)} \]

      2. metadata-eval 100.0%

         \[\leadsto {x}^{4} \cdot \left(\color{blue}{5} \cdot \varepsilon\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(5 \cdot \varepsilon\right)} \]

   if 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 99.2%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing
3. Recombined 3 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -1 \cdot 10^{-316}:\\ \;\;\;\;{\left(x + \varepsilon\right)}^{5} - \sqrt[3]{{x}^{15}}\\ \mathbf{elif}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0:\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \mathbf{else}:\\ \;\;\;\;{\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{if}\;t\_0 \leq -1 \cdot 10^{-316} \lor \neg \left(t\_0 \leq 0\right):\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (let* ((t_0 (- (pow (+ x eps) 5.0) (pow x 5.0))))
   (if (or (<= t_0 -1e-316) (not (<= t_0 0.0)))
     t_0
     (* (pow x 4.0) (* eps 5.0)))))

C

double code(double x, double eps) {
	double t_0 = pow((x + eps), 5.0) - pow(x, 5.0);
	double tmp;
	if ((t_0 <= -1e-316) || !(t_0 <= 0.0)) {
		tmp = t_0;
	} else {
		tmp = pow(x, 4.0) * (eps * 5.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x + eps) ** 5.0d0) - (x ** 5.0d0)
    if ((t_0 <= (-1d-316)) .or. (.not. (t_0 <= 0.0d0))) then
        tmp = t_0
    else
        tmp = (x ** 4.0d0) * (eps * 5.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double t_0 = Math.pow((x + eps), 5.0) - Math.pow(x, 5.0);
	double tmp;
	if ((t_0 <= -1e-316) || !(t_0 <= 0.0)) {
		tmp = t_0;
	} else {
		tmp = Math.pow(x, 4.0) * (eps * 5.0);
	}
	return tmp;
}

Python

def code(x, eps):
	t_0 = math.pow((x + eps), 5.0) - math.pow(x, 5.0)
	tmp = 0
	if (t_0 <= -1e-316) or not (t_0 <= 0.0):
		tmp = t_0
	else:
		tmp = math.pow(x, 4.0) * (eps * 5.0)
	return tmp

Julia

function code(x, eps)
	t_0 = Float64((Float64(x + eps) ^ 5.0) - (x ^ 5.0))
	tmp = 0.0
	if ((t_0 <= -1e-316) || !(t_0 <= 0.0))
		tmp = t_0;
	else
		tmp = Float64((x ^ 4.0) * Float64(eps * 5.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	t_0 = ((x + eps) ^ 5.0) - (x ^ 5.0);
	tmp = 0.0;
	if ((t_0 <= -1e-316) || ~((t_0 <= 0.0)))
		tmp = t_0;
	else
		tmp = (x ^ 4.0) * (eps * 5.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := Block[{t$95$0 = N[(N[Power[N[(x + eps), $MachinePrecision], 5.0], $MachinePrecision] - N[Power[x, 5.0], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -1e-316], N[Not[LessEqual[t$95$0, 0.0]], $MachinePrecision]], t$95$0, N[(N[Power[x, 4.0], $MachinePrecision] * N[(eps * 5.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < -9.999999837e-317 or 0.0 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64)))

   1. Initial program 99.5%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   if -9.999999837e-317 < (-.f64 (pow.f64 (+.f64 x eps) #s(literal 5 binary64)) (pow.f64 x #s(literal 5 binary64))) < 0.0

   1. Initial program 87.9%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(\varepsilon + 4 \cdot \varepsilon\right)} \]
   4. Step-by-step derivation

      1. distribute-rgt1-in 100.0%

         \[\leadsto {x}^{4} \cdot \color{blue}{\left(\left(4 + 1\right) \cdot \varepsilon\right)} \]

      2. metadata-eval 100.0%

         \[\leadsto {x}^{4} \cdot \left(\color{blue}{5} \cdot \varepsilon\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(5 \cdot \varepsilon\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;{\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq -1 \cdot 10^{-316} \lor \neg \left({\left(x + \varepsilon\right)}^{5} - {x}^{5} \leq 0\right):\\ \;\;\;\;{\left(x + \varepsilon\right)}^{5} - {x}^{5}\\ \mathbf{else}:\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 97.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{-54}:\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{-66}:\\ \;\;\;\;{\varepsilon}^{5}\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \sqrt{{x}^{8} \cdot 25}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -4.5e-54)
   (* (pow x 4.0) (* eps 5.0))
   (if (<= x 1.45e-66) (pow eps 5.0) (* eps (sqrt (* (pow x 8.0) 25.0))))))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -4.5e-54) {
		tmp = pow(x, 4.0) * (eps * 5.0);
	} else if (x <= 1.45e-66) {
		tmp = pow(eps, 5.0);
	} else {
		tmp = eps * sqrt((pow(x, 8.0) * 25.0));
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if (x <= (-4.5d-54)) then
        tmp = (x ** 4.0d0) * (eps * 5.0d0)
    else if (x <= 1.45d-66) then
        tmp = eps ** 5.0d0
    else
        tmp = eps * sqrt(((x ** 8.0d0) * 25.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if (x <= -4.5e-54) {
		tmp = Math.pow(x, 4.0) * (eps * 5.0);
	} else if (x <= 1.45e-66) {
		tmp = Math.pow(eps, 5.0);
	} else {
		tmp = eps * Math.sqrt((Math.pow(x, 8.0) * 25.0));
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if x <= -4.5e-54:
		tmp = math.pow(x, 4.0) * (eps * 5.0)
	elif x <= 1.45e-66:
		tmp = math.pow(eps, 5.0)
	else:
		tmp = eps * math.sqrt((math.pow(x, 8.0) * 25.0))
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -4.5e-54)
		tmp = Float64((x ^ 4.0) * Float64(eps * 5.0));
	elseif (x <= 1.45e-66)
		tmp = eps ^ 5.0;
	else
		tmp = Float64(eps * sqrt(Float64((x ^ 8.0) * 25.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if (x <= -4.5e-54)
		tmp = (x ^ 4.0) * (eps * 5.0);
	elseif (x <= 1.45e-66)
		tmp = eps ^ 5.0;
	else
		tmp = eps * sqrt(((x ^ 8.0) * 25.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -4.5e-54], N[(N[Power[x, 4.0], $MachinePrecision] * N[(eps * 5.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.45e-66], N[Power[eps, 5.0], $MachinePrecision], N[(eps * N[Sqrt[N[(N[Power[x, 8.0], $MachinePrecision] * 25.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.4999999999999998e-54

   1. Initial program 45.6%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 96.5%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(\varepsilon + 4 \cdot \varepsilon\right)} \]
   4. Step-by-step derivation

      1. distribute-rgt1-in 96.5%

         \[\leadsto {x}^{4} \cdot \color{blue}{\left(\left(4 + 1\right) \cdot \varepsilon\right)} \]

      2. metadata-eval 96.5%

         \[\leadsto {x}^{4} \cdot \left(\color{blue}{5} \cdot \varepsilon\right) \]

   5. Simplified 96.5%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(5 \cdot \varepsilon\right)} \]

   if -4.4999999999999998e-54 < x < 1.45000000000000006e-66

   1. Initial program 100.0%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{{\varepsilon}^{5}} \]

   if 1.45000000000000006e-66 < x

   1. Initial program 54.7%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 89.9%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(\varepsilon + 4 \cdot \varepsilon\right)} \]
   4. Step-by-step derivation

      1. *-commutative 89.9%

         \[\leadsto \color{blue}{\left(\varepsilon + 4 \cdot \varepsilon\right) \cdot {x}^{4}} \]

      2. distribute-rgt1-in 89.9%

         \[\leadsto \color{blue}{\left(\left(4 + 1\right) \cdot \varepsilon\right)} \cdot {x}^{4} \]

      3. metadata-eval 89.9%

         \[\leadsto \left(\color{blue}{5} \cdot \varepsilon\right) \cdot {x}^{4} \]

      4. *-commutative 89.9%

         \[\leadsto \color{blue}{\left(\varepsilon \cdot 5\right)} \cdot {x}^{4} \]

      5. associate-*r* 89.8%

         \[\leadsto \color{blue}{\varepsilon \cdot \left(5 \cdot {x}^{4}\right)} \]

   5. Simplified 89.8%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(5 \cdot {x}^{4}\right)} \]
   6. Step-by-step derivation

      1. add-sqr-sqrt 89.7%

         \[\leadsto \varepsilon \cdot \color{blue}{\left(\sqrt{5 \cdot {x}^{4}} \cdot \sqrt{5 \cdot {x}^{4}}\right)} \]

      2. sqrt-unprod 89.8%

         \[\leadsto \varepsilon \cdot \color{blue}{\sqrt{\left(5 \cdot {x}^{4}\right) \cdot \left(5 \cdot {x}^{4}\right)}} \]

      3. *-commutative 89.8%

         \[\leadsto \varepsilon \cdot \sqrt{\color{blue}{\left({x}^{4} \cdot 5\right)} \cdot \left(5 \cdot {x}^{4}\right)} \]

      4. *-commutative 89.8%

         \[\leadsto \varepsilon \cdot \sqrt{\left({x}^{4} \cdot 5\right) \cdot \color{blue}{\left({x}^{4} \cdot 5\right)}} \]

      5. swap-sqr 89.9%

         \[\leadsto \varepsilon \cdot \sqrt{\color{blue}{\left({x}^{4} \cdot {x}^{4}\right) \cdot \left(5 \cdot 5\right)}} \]

      6. pow-prod-up 90.0%

         \[\leadsto \varepsilon \cdot \sqrt{\color{blue}{{x}^{\left(4 + 4\right)}} \cdot \left(5 \cdot 5\right)} \]

      7. metadata-eval 90.0%

         \[\leadsto \varepsilon \cdot \sqrt{{x}^{\color{blue}{8}} \cdot \left(5 \cdot 5\right)} \]

      8. metadata-eval 90.0%

         \[\leadsto \varepsilon \cdot \sqrt{{x}^{8} \cdot \color{blue}{25}} \]

   7. Applied egg-rr 90.0%

      \[\leadsto \varepsilon \cdot \color{blue}{\sqrt{{x}^{8} \cdot 25}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{-54}:\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{-66}:\\ \;\;\;\;{\varepsilon}^{5}\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \sqrt{{x}^{8} \cdot 25}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.5 \cdot 10^{-54} \lor \neg \left(x \leq 1.45 \cdot 10^{-66}\right):\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \mathbf{else}:\\ \;\;\;\;{\varepsilon}^{5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (or (<= x -5.5e-54) (not (<= x 1.45e-66)))
   (* (pow x 4.0) (* eps 5.0))
   (pow eps 5.0)))

C

double code(double x, double eps) {
	double tmp;
	if ((x <= -5.5e-54) || !(x <= 1.45e-66)) {
		tmp = pow(x, 4.0) * (eps * 5.0);
	} else {
		tmp = pow(eps, 5.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((x <= (-5.5d-54)) .or. (.not. (x <= 1.45d-66))) then
        tmp = (x ** 4.0d0) * (eps * 5.0d0)
    else
        tmp = eps ** 5.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((x <= -5.5e-54) || !(x <= 1.45e-66)) {
		tmp = Math.pow(x, 4.0) * (eps * 5.0);
	} else {
		tmp = Math.pow(eps, 5.0);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (x <= -5.5e-54) or not (x <= 1.45e-66):
		tmp = math.pow(x, 4.0) * (eps * 5.0)
	else:
		tmp = math.pow(eps, 5.0)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if ((x <= -5.5e-54) || !(x <= 1.45e-66))
		tmp = Float64((x ^ 4.0) * Float64(eps * 5.0));
	else
		tmp = eps ^ 5.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x <= -5.5e-54) || ~((x <= 1.45e-66)))
		tmp = (x ^ 4.0) * (eps * 5.0);
	else
		tmp = eps ^ 5.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[Or[LessEqual[x, -5.5e-54], N[Not[LessEqual[x, 1.45e-66]], $MachinePrecision]], N[(N[Power[x, 4.0], $MachinePrecision] * N[(eps * 5.0), $MachinePrecision]), $MachinePrecision], N[Power[eps, 5.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.50000000000000046e-54 or 1.45000000000000006e-66 < x

   1. Initial program 49.8%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 93.5%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(\varepsilon + 4 \cdot \varepsilon\right)} \]
   4. Step-by-step derivation

      1. distribute-rgt1-in 93.5%

         \[\leadsto {x}^{4} \cdot \color{blue}{\left(\left(4 + 1\right) \cdot \varepsilon\right)} \]

      2. metadata-eval 93.5%

         \[\leadsto {x}^{4} \cdot \left(\color{blue}{5} \cdot \varepsilon\right) \]

   5. Simplified 93.5%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(5 \cdot \varepsilon\right)} \]

   if -5.50000000000000046e-54 < x < 1.45000000000000006e-66

   1. Initial program 100.0%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{{\varepsilon}^{5}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.5 \cdot 10^{-54} \lor \neg \left(x \leq 1.45 \cdot 10^{-66}\right):\\ \;\;\;\;{x}^{4} \cdot \left(\varepsilon \cdot 5\right)\\ \mathbf{else}:\\ \;\;\;\;{\varepsilon}^{5}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.2 \cdot 10^{-56} \lor \neg \left(x \leq 1.45 \cdot 10^{-66}\right):\\ \;\;\;\;\varepsilon \cdot \left(5 \cdot {x}^{4}\right)\\ \mathbf{else}:\\ \;\;\;\;{\varepsilon}^{5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (or (<= x -4.2e-56) (not (<= x 1.45e-66)))
   (* eps (* 5.0 (pow x 4.0)))
   (pow eps 5.0)))

C

double code(double x, double eps) {
	double tmp;
	if ((x <= -4.2e-56) || !(x <= 1.45e-66)) {
		tmp = eps * (5.0 * pow(x, 4.0));
	} else {
		tmp = pow(eps, 5.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((x <= (-4.2d-56)) .or. (.not. (x <= 1.45d-66))) then
        tmp = eps * (5.0d0 * (x ** 4.0d0))
    else
        tmp = eps ** 5.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((x <= -4.2e-56) || !(x <= 1.45e-66)) {
		tmp = eps * (5.0 * Math.pow(x, 4.0));
	} else {
		tmp = Math.pow(eps, 5.0);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (x <= -4.2e-56) or not (x <= 1.45e-66):
		tmp = eps * (5.0 * math.pow(x, 4.0))
	else:
		tmp = math.pow(eps, 5.0)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if ((x <= -4.2e-56) || !(x <= 1.45e-66))
		tmp = Float64(eps * Float64(5.0 * (x ^ 4.0)));
	else
		tmp = eps ^ 5.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x <= -4.2e-56) || ~((x <= 1.45e-66)))
		tmp = eps * (5.0 * (x ^ 4.0));
	else
		tmp = eps ^ 5.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[Or[LessEqual[x, -4.2e-56], N[Not[LessEqual[x, 1.45e-66]], $MachinePrecision]], N[(eps * N[(5.0 * N[Power[x, 4.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[eps, 5.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.20000000000000012e-56 or 1.45000000000000006e-66 < x

   1. Initial program 49.8%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 93.5%

      \[\leadsto \color{blue}{{x}^{4} \cdot \left(\varepsilon + 4 \cdot \varepsilon\right)} \]
   4. Step-by-step derivation

      1. *-commutative 93.5%

         \[\leadsto \color{blue}{\left(\varepsilon + 4 \cdot \varepsilon\right) \cdot {x}^{4}} \]

      2. distribute-rgt1-in 93.5%

         \[\leadsto \color{blue}{\left(\left(4 + 1\right) \cdot \varepsilon\right)} \cdot {x}^{4} \]

      3. metadata-eval 93.5%

         \[\leadsto \left(\color{blue}{5} \cdot \varepsilon\right) \cdot {x}^{4} \]

      4. *-commutative 93.5%

         \[\leadsto \color{blue}{\left(\varepsilon \cdot 5\right)} \cdot {x}^{4} \]

      5. associate-*r* 93.4%

         \[\leadsto \color{blue}{\varepsilon \cdot \left(5 \cdot {x}^{4}\right)} \]

   5. Simplified 93.4%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(5 \cdot {x}^{4}\right)} \]

   if -4.20000000000000012e-56 < x < 1.45000000000000006e-66

   1. Initial program 100.0%

      \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{{\varepsilon}^{5}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.2 \cdot 10^{-56} \lor \neg \left(x \leq 1.45 \cdot 10^{-66}\right):\\ \;\;\;\;\varepsilon \cdot \left(5 \cdot {x}^{4}\right)\\ \mathbf{else}:\\ \;\;\;\;{\varepsilon}^{5}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 87.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ {\varepsilon}^{5} \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (pow eps 5.0))

C

double code(double x, double eps) {
	return pow(eps, 5.0);
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps ** 5.0d0
end function

Java

public static double code(double x, double eps) {
	return Math.pow(eps, 5.0);
}

Python

def code(x, eps):
	return math.pow(eps, 5.0)

Julia

function code(x, eps)
	return eps ^ 5.0
end

MATLAB

function tmp = code(x, eps)
	tmp = eps ^ 5.0;
end

Wolfram

code[x_, eps_] := N[Power[eps, 5.0], $MachinePrecision]

Derivation

1. Initial program 90.2%

   \[{\left(x + \varepsilon\right)}^{5} - {x}^{5} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 89.4%

   \[\leadsto \color{blue}{{\varepsilon}^{5}} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024186 
(FPCore (x eps)
  :name "ENA, Section 1.4, Exercise 4b, n=5"
  :precision binary64
  :pre (and (and (<= -1000000000.0 x) (<= x 1000000000.0)) (and (<= -1.0 eps) (<= eps 1.0)))
  (- (pow (+ x eps) 5.0) (pow x 5.0)))