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

Percentage Accurate: 75.8% → 100.0%

Time: 4.8s

Alternatives: 5

Speedup: 29.6×

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)}^{2} - {x}^{2} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 75.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\varepsilon, \varepsilon, x \cdot \left(\varepsilon \cdot 2\right)\right) \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (fma eps eps (* x (* eps 2.0))))

C

double code(double x, double eps) {
	return fma(eps, eps, (x * (eps * 2.0)));
}

Julia

function code(x, eps)
	return fma(eps, eps, Float64(x * Float64(eps * 2.0)))
end

Wolfram

code[x_, eps_] := N[(eps * eps + N[(x * N[(eps * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.7%

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

   1. +-commutative 70.7%

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

   2. unpow2 70.7%

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

   3. unpow2 70.7%

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

   4. difference-of-squares 70.7%

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

   5. sub-neg 70.7%

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

   6. distribute-lft-in 70.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. +-commutative 70.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-in 70.7%

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

   9. associate-+l+ 70.7%

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

   10. remove-double-neg 70.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-neg 70.7%

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

   12. +-commutative 70.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. +-inverses 100.0%

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

   15. +-rgt-identity 100.0%

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

   16. *-commutative 100.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-2 100.0%

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

   19. *-commutative 100.0%

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

3. Simplified 100.0%

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

   1. distribute-rgt-in 100.0%

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

   2. fma-define 100.0%

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

   3. associate-*l* 100.0%

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

6. Applied egg-rr 100.0%

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

7. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(\varepsilon, \varepsilon, x \cdot \left(\varepsilon \cdot 2\right)\right) \]
8. Add Preprocessing

Alternative 2: 90.7% accurate, 13.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-113} \lor \neg \left(x \leq 3.1 \cdot 10^{-135}\right):\\ \;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (or (<= x -2e-113) (not (<= x 3.1e-135))) (* 2.0 (* eps x)) (* eps eps)))

C

double code(double x, double eps) {
	double tmp;
	if ((x <= -2e-113) || !(x <= 3.1e-135)) {
		tmp = 2.0 * (eps * x);
	} else {
		tmp = eps * eps;
	}
	return tmp;
}

Fortran

real(8) function code(x, eps)
    real(8), intent (in) :: x
    real(8), intent (in) :: eps
    real(8) :: tmp
    if ((x <= (-2d-113)) .or. (.not. (x <= 3.1d-135))) then
        tmp = 2.0d0 * (eps * x)
    else
        tmp = eps * eps
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((x <= -2e-113) || !(x <= 3.1e-135)) {
		tmp = 2.0 * (eps * x);
	} else {
		tmp = eps * eps;
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (x <= -2e-113) or not (x <= 3.1e-135):
		tmp = 2.0 * (eps * x)
	else:
		tmp = eps * eps
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if ((x <= -2e-113) || !(x <= 3.1e-135))
		tmp = Float64(2.0 * Float64(eps * x));
	else
		tmp = Float64(eps * eps);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x <= -2e-113) || ~((x <= 3.1e-135)))
		tmp = 2.0 * (eps * x);
	else
		tmp = eps * eps;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[Or[LessEqual[x, -2e-113], N[Not[LessEqual[x, 3.1e-135]], $MachinePrecision]], N[(2.0 * N[(eps * x), $MachinePrecision]), $MachinePrecision], N[(eps * eps), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.99999999999999996e-113 or 3.1000000000000001e-135 < x

   1. Initial program 33.2%

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

      1. +-commutative 33.2%

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

      2. unpow2 33.2%

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

      3. unpow2 33.2%

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

      4. difference-of-squares 33.2%

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

      5. sub-neg 33.2%

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

      6. distribute-lft-in 33.2%

         \[\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. +-commutative 33.2%

         \[\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-in 33.2%

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

      9. associate-+l+ 33.2%

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

      10. remove-double-neg 33.2%

          \[\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-neg 33.2%

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

      12. +-commutative 33.2%

          \[\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. +-inverses 100.0%

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

      15. +-rgt-identity 100.0%

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

      16. *-commutative 100.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-2 100.0%

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

      19. *-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in eps around 0 91.1%

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

      1. *-commutative 91.1%

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

   7. Simplified 91.1%

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

   if -1.99999999999999996e-113 < x < 3.1000000000000001e-135

   1. Initial program 98.9%

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

      1. +-commutative 98.9%

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

      2. unpow2 98.9%

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

      3. unpow2 98.9%

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

      4. difference-of-squares 99.0%

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

      5. sub-neg 99.0%

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

      6. distribute-lft-in 98.9%

         \[\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. +-commutative 98.9%

         \[\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-in 99.0%

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

      9. associate-+l+ 98.9%

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

      10. remove-double-neg 98.9%

          \[\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-neg 98.9%

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

      12. +-commutative 98.9%

          \[\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. +-inverses 100.0%

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

      15. +-rgt-identity 100.0%

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

      16. *-commutative 100.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-2 100.0%

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

      19. *-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in eps around inf 97.1%

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

4. Final simplification 94.5%

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

Alternative 3: 90.6% accurate, 13.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.05 \cdot 10^{-114}:\\ \;\;\;\;2 \cdot \left(\varepsilon \cdot x\right)\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-135}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(\varepsilon \cdot 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (<= x -1.05e-114)
   (* 2.0 (* eps x))
   (if (<= x 3.1e-135) (* eps eps) (* x (* eps 2.0)))))

C

double code(double x, double eps) {
	double tmp;
	if (x <= -1.05e-114) {
		tmp = 2.0 * (eps * x);
	} else if (x <= 3.1e-135) {
		tmp = eps * eps;
	} else {
		tmp = x * (eps * 2.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 <= (-1.05d-114)) then
        tmp = 2.0d0 * (eps * x)
    else if (x <= 3.1d-135) then
        tmp = eps * eps
    else
        tmp = x * (eps * 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if (x <= -1.05e-114) {
		tmp = 2.0 * (eps * x);
	} else if (x <= 3.1e-135) {
		tmp = eps * eps;
	} else {
		tmp = x * (eps * 2.0);
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if x <= -1.05e-114:
		tmp = 2.0 * (eps * x)
	elif x <= 3.1e-135:
		tmp = eps * eps
	else:
		tmp = x * (eps * 2.0)
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if (x <= -1.05e-114)
		tmp = Float64(2.0 * Float64(eps * x));
	elseif (x <= 3.1e-135)
		tmp = Float64(eps * eps);
	else
		tmp = Float64(x * Float64(eps * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if (x <= -1.05e-114)
		tmp = 2.0 * (eps * x);
	elseif (x <= 3.1e-135)
		tmp = eps * eps;
	else
		tmp = x * (eps * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[LessEqual[x, -1.05e-114], N[(2.0 * N[(eps * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.1e-135], N[(eps * eps), $MachinePrecision], N[(x * N[(eps * 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.04999999999999996e-114

   1. Initial program 31.2%

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

      1. +-commutative 31.2%

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

      2. unpow2 31.2%

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

      3. unpow2 31.2%

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

      4. difference-of-squares 31.1%

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

      5. sub-neg 31.1%

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

      6. distribute-lft-in 31.1%

         \[\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. +-commutative 31.1%

         \[\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-in 31.1%

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

      9. associate-+l+ 31.1%

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

      10. remove-double-neg 31.1%

          \[\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-neg 31.1%

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

      12. +-commutative 31.1%

          \[\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+ 99.9%

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

      14. +-inverses 99.9%

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

      15. +-rgt-identity 99.9%

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

      16. *-commutative 99.9%

          \[\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-2 100.0%

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

      19. *-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in eps around 0 89.4%

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

      1. *-commutative 89.4%

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

   7. Simplified 89.4%

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

   if -1.04999999999999996e-114 < x < 3.1000000000000001e-135

   1. Initial program 98.9%

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

      1. +-commutative 98.9%

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

      2. unpow2 98.9%

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

      3. unpow2 98.9%

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

      4. difference-of-squares 99.0%

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

      5. sub-neg 99.0%

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

      6. distribute-lft-in 98.9%

         \[\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. +-commutative 98.9%

         \[\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-in 99.0%

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

      9. associate-+l+ 98.9%

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

      10. remove-double-neg 98.9%

          \[\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-neg 98.9%

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

      12. +-commutative 98.9%

          \[\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. +-inverses 100.0%

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

      15. +-rgt-identity 100.0%

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

      16. *-commutative 100.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-2 100.0%

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

      19. *-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in eps around inf 97.1%

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

   if 3.1000000000000001e-135 < x

   1. Initial program 35.2%

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

      1. +-commutative 35.2%

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

      2. unpow2 35.2%

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

      3. unpow2 35.2%

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

      4. difference-of-squares 35.1%

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

      5. sub-neg 35.1%

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

      6. distribute-lft-in 35.2%

         \[\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. +-commutative 35.2%

         \[\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-in 35.1%

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

      9. associate-+l+ 35.1%

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

      10. remove-double-neg 35.1%

          \[\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-neg 35.1%

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

      12. +-commutative 35.1%

          \[\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. +-inverses 100.0%

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

      15. +-rgt-identity 100.0%

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

      16. *-commutative 100.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-2 100.0%

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

      19. *-commutative 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 100.0%

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

      1. *-commutative 100.0%

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

      2. unpow2 100.0%

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

      3. associate-/l* 99.9%

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

      4. distribute-lft-out 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in eps around 0 92.9%

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

4. Final simplification 94.6%

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

Alternative 4: 100.0% accurate, 29.6× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \left(\varepsilon + x \cdot 2\right) \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (* eps (+ eps (* x 2.0))))

C

double code(double x, double eps) {
	return eps * (eps + (x * 2.0));
}

Fortran

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

Java

public static double code(double x, double eps) {
	return eps * (eps + (x * 2.0));
}

Python

def code(x, eps):
	return eps * (eps + (x * 2.0))

Julia

function code(x, eps)
	return Float64(eps * Float64(eps + Float64(x * 2.0)))
end

MATLAB

function tmp = code(x, eps)
	tmp = eps * (eps + (x * 2.0));
end

Wolfram

code[x_, eps_] := N[(eps * N[(eps + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.7%

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

   1. +-commutative 70.7%

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

   2. unpow2 70.7%

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

   3. unpow2 70.7%

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

   4. difference-of-squares 70.7%

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

   5. sub-neg 70.7%

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

   6. distribute-lft-in 70.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. +-commutative 70.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-in 70.7%

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

   9. associate-+l+ 70.7%

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

   10. remove-double-neg 70.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-neg 70.7%

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

   12. +-commutative 70.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. +-inverses 100.0%

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

   15. +-rgt-identity 100.0%

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

   16. *-commutative 100.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-2 100.0%

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

   19. *-commutative 100.0%

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

3. Simplified 100.0%

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

Alternative 5: 73.5% accurate, 69.0× speedup

Math

\[\begin{array}{l} \\ \varepsilon \cdot \varepsilon \end{array} \]

FPCore

(FPCore (x eps) :precision binary64 (* eps eps))

C

double code(double x, double eps) {
	return eps * eps;
}

Fortran

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

Java

public static double code(double x, double eps) {
	return eps * eps;
}

Python

def code(x, eps):
	return eps * eps

Julia

function code(x, eps)
	return Float64(eps * eps)
end

MATLAB

function tmp = code(x, eps)
	tmp = eps * eps;
end

Wolfram

code[x_, eps_] := N[(eps * eps), $MachinePrecision]

Derivation

1. Initial program 70.7%

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

   1. +-commutative 70.7%

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

   2. unpow2 70.7%

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

   3. unpow2 70.7%

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

   4. difference-of-squares 70.7%

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

   5. sub-neg 70.7%

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

   6. distribute-lft-in 70.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. +-commutative 70.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-in 70.7%

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

   9. associate-+l+ 70.7%

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

   10. remove-double-neg 70.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-neg 70.7%

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

   12. +-commutative 70.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. +-inverses 100.0%

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

   15. +-rgt-identity 100.0%

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

   16. *-commutative 100.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-2 100.0%

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

   19. *-commutative 100.0%

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

3. Simplified 100.0%

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

5. Taylor expanded in eps around inf 69.3%

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

Reproduce

herbie shell --seed 2024185 
(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)))