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

Percentage Accurate: 74.3% → 100.0%
Time: 3.5s
Alternatives: 4
Speedup: 29.6×

Specification

?
\[\left(-1000000000 \leq x \land x \leq 1000000000\right) \land \left(-1 \leq \varepsilon \land \varepsilon \leq 1\right)\]
\[\begin{array}{l} \\ {\left(x + \varepsilon\right)}^{2} - {x}^{2} \end{array} \]
(FPCore (x eps) :precision binary64 (- (pow (+ x eps) 2.0) (pow x 2.0)))
double code(double x, double eps) {
	return pow((x + eps), 2.0) - pow(x, 2.0);
}
real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = ((x + eps) ** 2.0d0) - (x ** 2.0d0)
end function
public static double code(double x, double eps) {
	return Math.pow((x + eps), 2.0) - Math.pow(x, 2.0);
}
def code(x, eps):
	return math.pow((x + eps), 2.0) - math.pow(x, 2.0)
function code(x, eps)
	return Float64((Float64(x + eps) ^ 2.0) - (x ^ 2.0))
end
function tmp = code(x, eps)
	tmp = ((x + eps) ^ 2.0) - (x ^ 2.0);
end
code[x_, eps_] := N[(N[Power[N[(x + eps), $MachinePrecision], 2.0], $MachinePrecision] - N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
{\left(x + \varepsilon\right)}^{2} - {x}^{2}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 4 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 74.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ {\left(x + \varepsilon\right)}^{2} - {x}^{2} \end{array} \]
(FPCore (x eps) :precision binary64 (- (pow (+ x eps) 2.0) (pow x 2.0)))
double code(double x, double eps) {
	return pow((x + eps), 2.0) - pow(x, 2.0);
}
real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = ((x + eps) ** 2.0d0) - (x ** 2.0d0)
end function
public static double code(double x, double eps) {
	return Math.pow((x + eps), 2.0) - Math.pow(x, 2.0);
}
def code(x, eps):
	return math.pow((x + eps), 2.0) - math.pow(x, 2.0)
function code(x, eps)
	return Float64((Float64(x + eps) ^ 2.0) - (x ^ 2.0))
end
function tmp = code(x, eps)
	tmp = ((x + eps) ^ 2.0) - (x ^ 2.0);
end
code[x_, eps_] := N[(N[Power[N[(x + eps), $MachinePrecision], 2.0], $MachinePrecision] - N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
{\left(x + \varepsilon\right)}^{2} - {x}^{2}
\end{array}

Alternative 1: 100.0% accurate, 29.6× speedup?

\[\begin{array}{l} \\ \varepsilon \cdot \left(\varepsilon + x \cdot 2\right) \end{array} \]
(FPCore (x eps) :precision binary64 (* eps (+ eps (* x 2.0))))
double code(double x, double eps) {
	return eps * (eps + (x * 2.0));
}
real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps * (eps + (x * 2.0d0))
end function
public static double code(double x, double eps) {
	return eps * (eps + (x * 2.0));
}
def code(x, eps):
	return eps * (eps + (x * 2.0))
function code(x, eps)
	return Float64(eps * Float64(eps + Float64(x * 2.0)))
end
function tmp = code(x, eps)
	tmp = eps * (eps + (x * 2.0));
end
code[x_, eps_] := N[(eps * N[(eps + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)
\end{array}
Derivation
  1. Initial program 82.5%

    \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
  2. Step-by-step derivation
    1. +-commutative82.5%

      \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
    2. unpow282.5%

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

      \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
    4. difference-of-squares82.6%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
    5. sub-neg82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
    6. distribute-lft-in82.5%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
    7. +-commutative82.5%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
    8. distribute-lft-in82.6%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
    9. associate-+l+82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
    10. remove-double-neg82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
    11. sub-neg82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
    12. +-commutative82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
    13. associate--l+100.0%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
    14. +-inverses100.0%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
    15. +-rgt-identity100.0%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
    16. *-commutative100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
    17. associate-+l+100.0%

      \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
    18. count-2100.0%

      \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
    19. *-commutative100.0%

      \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
  3. Simplified100.0%

    \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
  4. Add Preprocessing
  5. Add Preprocessing

Alternative 2: 89.3% accurate, 13.8× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-62} \lor \neg \left(x \leq 1.25 \cdot 10^{-102}\right):\\ \;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \end{array} \end{array} \]
(FPCore (x eps)
 :precision binary64
 (if (or (<= x -1.15e-62) (not (<= x 1.25e-102)))
   (* 2.0 (* eps x))
   (* eps eps)))
double code(double x, double eps) {
	double tmp;
	if ((x <= -1.15e-62) || !(x <= 1.25e-102)) {
		tmp = 2.0 * (eps * x);
	} else {
		tmp = eps * eps;
	}
	return tmp;
}
real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((x <= (-1.15d-62)) .or. (.not. (x <= 1.25d-102))) then
        tmp = 2.0d0 * (eps * x)
    else
        tmp = eps * eps
    end if
    code = tmp
end function
public static double code(double x, double eps) {
	double tmp;
	if ((x <= -1.15e-62) || !(x <= 1.25e-102)) {
		tmp = 2.0 * (eps * x);
	} else {
		tmp = eps * eps;
	}
	return tmp;
}
def code(x, eps):
	tmp = 0
	if (x <= -1.15e-62) or not (x <= 1.25e-102):
		tmp = 2.0 * (eps * x)
	else:
		tmp = eps * eps
	return tmp
function code(x, eps)
	tmp = 0.0
	if ((x <= -1.15e-62) || !(x <= 1.25e-102))
		tmp = Float64(2.0 * Float64(eps * x));
	else
		tmp = Float64(eps * eps);
	end
	return tmp
end
function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x <= -1.15e-62) || ~((x <= 1.25e-102)))
		tmp = 2.0 * (eps * x);
	else
		tmp = eps * eps;
	end
	tmp_2 = tmp;
end
code[x_, eps_] := If[Or[LessEqual[x, -1.15e-62], N[Not[LessEqual[x, 1.25e-102]], $MachinePrecision]], N[(2.0 * N[(eps * x), $MachinePrecision]), $MachinePrecision], N[(eps * eps), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.15 \cdot 10^{-62} \lor \neg \left(x \leq 1.25 \cdot 10^{-102}\right):\\
\;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\

\mathbf{else}:\\
\;\;\;\;\varepsilon \cdot \varepsilon\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if x < -1.15e-62 or 1.25000000000000006e-102 < x

    1. Initial program 39.4%

      \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
    2. Step-by-step derivation
      1. +-commutative39.4%

        \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
      2. unpow239.4%

        \[\leadsto \color{blue}{\left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right)} - {x}^{2} \]
      3. unpow239.4%

        \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
      4. difference-of-squares39.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
      5. sub-neg39.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
      6. distribute-lft-in39.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
      7. +-commutative39.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
      8. distribute-lft-in39.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
      9. associate-+l+39.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
      10. remove-double-neg39.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
      11. sub-neg39.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
      12. +-commutative39.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
      13. associate--l+100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
      14. +-inverses100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
      15. +-rgt-identity100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
      16. *-commutative100.0%

        \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
      17. associate-+l+100.0%

        \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
      18. count-2100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
      19. *-commutative100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
    3. Simplified100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
    4. Add Preprocessing
    5. Taylor expanded in eps around 0 88.3%

      \[\leadsto \color{blue}{2 \cdot \left(\varepsilon \cdot x\right)} \]
    6. Step-by-step derivation
      1. *-commutative88.3%

        \[\leadsto 2 \cdot \color{blue}{\left(x \cdot \varepsilon\right)} \]
    7. Simplified88.3%

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot \varepsilon\right)} \]

    if -1.15e-62 < x < 1.25000000000000006e-102

    1. Initial program 97.5%

      \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
    2. Step-by-step derivation
      1. +-commutative97.5%

        \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
      2. unpow297.5%

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

        \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
      4. difference-of-squares97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
      5. sub-neg97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
      6. distribute-lft-in97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
      7. +-commutative97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
      8. distribute-lft-in97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
      9. associate-+l+97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
      10. remove-double-neg97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
      11. sub-neg97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
      12. +-commutative97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
      13. associate--l+100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
      14. +-inverses100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
      15. +-rgt-identity100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
      16. *-commutative100.0%

        \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
      17. associate-+l+100.0%

        \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
      18. count-2100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
      19. *-commutative100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
    3. Simplified100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
    4. Add Preprocessing
    5. Taylor expanded in eps around inf 96.4%

      \[\leadsto \varepsilon \cdot \color{blue}{\varepsilon} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification94.3%

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-62} \lor \neg \left(x \leq 1.25 \cdot 10^{-102}\right):\\ \;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \end{array} \]
  5. Add Preprocessing

Alternative 3: 89.4% accurate, 13.8× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-62}:\\ \;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\ \mathbf{elif}\;x \leq 10^{-103}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\varepsilon \cdot 2\right)\\ \end{array} \end{array} \]
(FPCore (x eps)
 :precision binary64
 (if (<= x -1.15e-62)
   (* 2.0 (* eps x))
   (if (<= x 1e-103) (* eps eps) (* x (* eps 2.0)))))
double code(double x, double eps) {
	double tmp;
	if (x <= -1.15e-62) {
		tmp = 2.0 * (eps * x);
	} else if (x <= 1e-103) {
		tmp = eps * eps;
	} else {
		tmp = x * (eps * 2.0);
	}
	return tmp;
}
real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if (x <= (-1.15d-62)) then
        tmp = 2.0d0 * (eps * x)
    else if (x <= 1d-103) then
        tmp = eps * eps
    else
        tmp = x * (eps * 2.0d0)
    end if
    code = tmp
end function
public static double code(double x, double eps) {
	double tmp;
	if (x <= -1.15e-62) {
		tmp = 2.0 * (eps * x);
	} else if (x <= 1e-103) {
		tmp = eps * eps;
	} else {
		tmp = x * (eps * 2.0);
	}
	return tmp;
}
def code(x, eps):
	tmp = 0
	if x <= -1.15e-62:
		tmp = 2.0 * (eps * x)
	elif x <= 1e-103:
		tmp = eps * eps
	else:
		tmp = x * (eps * 2.0)
	return tmp
function code(x, eps)
	tmp = 0.0
	if (x <= -1.15e-62)
		tmp = Float64(2.0 * Float64(eps * x));
	elseif (x <= 1e-103)
		tmp = Float64(eps * eps);
	else
		tmp = Float64(x * Float64(eps * 2.0));
	end
	return tmp
end
function tmp_2 = code(x, eps)
	tmp = 0.0;
	if (x <= -1.15e-62)
		tmp = 2.0 * (eps * x);
	elseif (x <= 1e-103)
		tmp = eps * eps;
	else
		tmp = x * (eps * 2.0);
	end
	tmp_2 = tmp;
end
code[x_, eps_] := If[LessEqual[x, -1.15e-62], N[(2.0 * N[(eps * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1e-103], N[(eps * eps), $MachinePrecision], N[(x * N[(eps * 2.0), $MachinePrecision]), $MachinePrecision]]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;x \leq -1.15 \cdot 10^{-62}:\\
\;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\

\mathbf{elif}\;x \leq 10^{-103}:\\
\;\;\;\;\varepsilon \cdot \varepsilon\\

\mathbf{else}:\\
\;\;\;\;x \cdot \left(\varepsilon \cdot 2\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if x < -1.15e-62

    1. Initial program 41.3%

      \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
    2. Step-by-step derivation
      1. +-commutative41.3%

        \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
      2. unpow241.3%

        \[\leadsto \color{blue}{\left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right)} - {x}^{2} \]
      3. unpow241.3%

        \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
      4. difference-of-squares41.3%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
      5. sub-neg41.3%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
      6. distribute-lft-in41.3%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
      7. +-commutative41.3%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
      8. distribute-lft-in41.3%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
      9. associate-+l+41.3%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
      10. remove-double-neg41.3%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
      11. sub-neg41.3%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
      12. +-commutative41.3%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
      13. associate--l+100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
      14. +-inverses100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
      15. +-rgt-identity100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
      16. *-commutative100.0%

        \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
      17. associate-+l+100.0%

        \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
      18. count-2100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
      19. *-commutative100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
    3. Simplified100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
    4. Add Preprocessing
    5. Taylor expanded in eps around 0 87.4%

      \[\leadsto \color{blue}{2 \cdot \left(\varepsilon \cdot x\right)} \]
    6. Step-by-step derivation
      1. *-commutative87.4%

        \[\leadsto 2 \cdot \color{blue}{\left(x \cdot \varepsilon\right)} \]
    7. Simplified87.4%

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot \varepsilon\right)} \]

    if -1.15e-62 < x < 9.99999999999999958e-104

    1. Initial program 97.5%

      \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
    2. Step-by-step derivation
      1. +-commutative97.5%

        \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
      2. unpow297.5%

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

        \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
      4. difference-of-squares97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
      5. sub-neg97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
      6. distribute-lft-in97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
      7. +-commutative97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
      8. distribute-lft-in97.5%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
      9. associate-+l+97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
      10. remove-double-neg97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
      11. sub-neg97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
      12. +-commutative97.5%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
      13. associate--l+100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
      14. +-inverses100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
      15. +-rgt-identity100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
      16. *-commutative100.0%

        \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
      17. associate-+l+100.0%

        \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
      18. count-2100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
      19. *-commutative100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
    3. Simplified100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
    4. Add Preprocessing
    5. Taylor expanded in eps around inf 96.4%

      \[\leadsto \varepsilon \cdot \color{blue}{\varepsilon} \]

    if 9.99999999999999958e-104 < x

    1. Initial program 38.5%

      \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
    2. Step-by-step derivation
      1. +-commutative38.5%

        \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
      2. unpow238.5%

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

        \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
      4. difference-of-squares38.7%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
      5. sub-neg38.7%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
      6. distribute-lft-in38.7%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
      7. +-commutative38.7%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
      8. distribute-lft-in38.7%

        \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
      9. associate-+l+38.7%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
      10. remove-double-neg38.7%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
      11. sub-neg38.7%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
      12. +-commutative38.7%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
      13. associate--l+100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
      14. +-inverses100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
      15. +-rgt-identity100.0%

        \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
      16. *-commutative100.0%

        \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
      17. associate-+l+100.0%

        \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
      18. count-2100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
      19. *-commutative100.0%

        \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
    3. Simplified100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
    4. Add Preprocessing
    5. Taylor expanded in eps around 0 88.7%

      \[\leadsto \color{blue}{2 \cdot \left(\varepsilon \cdot x\right)} \]
    6. Step-by-step derivation
      1. *-commutative88.7%

        \[\leadsto 2 \cdot \color{blue}{\left(x \cdot \varepsilon\right)} \]
    7. Simplified88.7%

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot \varepsilon\right)} \]
    8. Taylor expanded in x around 0 88.7%

      \[\leadsto \color{blue}{2 \cdot \left(\varepsilon \cdot x\right)} \]
    9. Step-by-step derivation
      1. associate-*r*88.7%

        \[\leadsto \color{blue}{\left(2 \cdot \varepsilon\right) \cdot x} \]
    10. Simplified88.7%

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

    \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{-62}:\\ \;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\ \mathbf{elif}\;x \leq 10^{-103}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\varepsilon \cdot 2\right)\\ \end{array} \]
  5. Add Preprocessing

Alternative 4: 71.9% accurate, 69.0× speedup?

\[\begin{array}{l} \\ \varepsilon \cdot \varepsilon \end{array} \]
(FPCore (x eps) :precision binary64 (* eps eps))
double code(double x, double eps) {
	return eps * eps;
}
real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    code = eps * eps
end function
public static double code(double x, double eps) {
	return eps * eps;
}
def code(x, eps):
	return eps * eps
function code(x, eps)
	return Float64(eps * eps)
end
function tmp = code(x, eps)
	tmp = eps * eps;
end
code[x_, eps_] := N[(eps * eps), $MachinePrecision]
\begin{array}{l}

\\
\varepsilon \cdot \varepsilon
\end{array}
Derivation
  1. Initial program 82.5%

    \[{\left(x + \varepsilon\right)}^{2} - {x}^{2} \]
  2. Step-by-step derivation
    1. +-commutative82.5%

      \[\leadsto {\color{blue}{\left(\varepsilon + x\right)}}^{2} - {x}^{2} \]
    2. unpow282.5%

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

      \[\leadsto \left(\varepsilon + x\right) \cdot \left(\varepsilon + x\right) - \color{blue}{x \cdot x} \]
    4. difference-of-squares82.6%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\varepsilon + x\right) - x\right)} \]
    5. sub-neg82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\varepsilon + x\right) + \left(-x\right)\right)} \]
    6. distribute-lft-in82.5%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right)} \]
    7. +-commutative82.5%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(-x\right) + \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + x\right)} \]
    8. distribute-lft-in82.6%

      \[\leadsto \color{blue}{\left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(-x\right) + \left(\varepsilon + x\right)\right)} \]
    9. associate-+l+82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) + x\right)} \]
    10. remove-double-neg82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\left(\left(-x\right) + \varepsilon\right) + \color{blue}{\left(-\left(-x\right)\right)}\right) \]
    11. sub-neg82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\left(\left(-x\right) + \varepsilon\right) - \left(-x\right)\right)} \]
    12. +-commutative82.6%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\color{blue}{\left(\varepsilon + \left(-x\right)\right)} - \left(-x\right)\right) \]
    13. associate--l+100.0%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\left(\varepsilon + \left(\left(-x\right) - \left(-x\right)\right)\right)} \]
    14. +-inverses100.0%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \left(\varepsilon + \color{blue}{0}\right) \]
    15. +-rgt-identity100.0%

      \[\leadsto \left(\left(\varepsilon + x\right) + x\right) \cdot \color{blue}{\varepsilon} \]
    16. *-commutative100.0%

      \[\leadsto \color{blue}{\varepsilon \cdot \left(\left(\varepsilon + x\right) + x\right)} \]
    17. associate-+l+100.0%

      \[\leadsto \varepsilon \cdot \color{blue}{\left(\varepsilon + \left(x + x\right)\right)} \]
    18. count-2100.0%

      \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{2 \cdot x}\right) \]
    19. *-commutative100.0%

      \[\leadsto \varepsilon \cdot \left(\varepsilon + \color{blue}{x \cdot 2}\right) \]
  3. Simplified100.0%

    \[\leadsto \color{blue}{\varepsilon \cdot \left(\varepsilon + x \cdot 2\right)} \]
  4. Add Preprocessing
  5. Taylor expanded in eps around inf 79.7%

    \[\leadsto \varepsilon \cdot \color{blue}{\varepsilon} \]
  6. Add Preprocessing

Reproduce

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