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

Percentage Accurate: 74.3% → 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: 74.3% 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(x \cdot 2, \varepsilon, \varepsilon \cdot \varepsilon\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 74.0%

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

   1. +-commutative 74.0%

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

   2. unpow2 74.0%

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

   3. unpow2 74.0%

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

   4. difference-of-squares 74.0%

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

   5. sub-neg 74.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 74.0%

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

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

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

   9. +-commutative 74.0%

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

   10. sub-neg 74.0%

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

   11. associate--l+ 100.0%

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

   12. +-inverses 100.0%

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

   13. +-rgt-identity 100.0%

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

   14. *-commutative 100.0%

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

   15. associate-+l+ 100.0%

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

   16. count-2 100.0%

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

   17. *-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. +-commutative 100.0%

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

   2. distribute-rgt-in 100.0%

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

   3. fma-define 100.0%

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

   4. pow2 100.0%

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

6. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot 2, \varepsilon, {\varepsilon}^{2}\right)} \]
7. Step-by-step derivation

   1. unpow2 100.0%

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

8. Applied egg-rr 100.0%

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

9. Final simplification 100.0%

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

Alternative 2: 100.0% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 74.0%

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

   1. +-commutative 74.0%

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

   2. unpow2 74.0%

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

   3. unpow2 74.0%

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

   4. difference-of-squares 74.0%

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

   5. sub-neg 74.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 74.0%

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

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

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

   9. +-commutative 74.0%

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

   10. sub-neg 74.0%

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

   11. associate--l+ 100.0%

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

   12. +-inverses 100.0%

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

   13. +-rgt-identity 100.0%

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

   14. *-commutative 100.0%

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

   15. associate-+l+ 100.0%

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

   16. count-2 100.0%

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

   17. *-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-lft-in 100.0%

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

   2. fma-define 100.0%

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

6. Applied egg-rr 100.0%

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

7. Final simplification 100.0%

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

Alternative 3: 100.0% accurate, 29.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 74.0%

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

   1. +-commutative 74.0%

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

   2. unpow2 74.0%

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

   3. unpow2 74.0%

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

   4. difference-of-squares 74.0%

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

   5. sub-neg 74.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 74.0%

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

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

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

   9. +-commutative 74.0%

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

   10. sub-neg 74.0%

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

   11. associate--l+ 100.0%

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

   12. +-inverses 100.0%

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

   13. +-rgt-identity 100.0%

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

   14. *-commutative 100.0%

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

   15. associate-+l+ 100.0%

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

   16. count-2 100.0%

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

   17. *-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. Final simplification 100.0%

   \[\leadsto \varepsilon \cdot \left(x \cdot 2 + \varepsilon\right) \]
6. Add Preprocessing

Alternative 4: 64.2% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 74.0%

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

   1. +-commutative 74.0%

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

   2. unpow2 74.0%

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

   3. unpow2 74.0%

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

   4. difference-of-squares 74.0%

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

   5. sub-neg 74.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 74.0%

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

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

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

   9. +-commutative 74.0%

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

   10. sub-neg 74.0%

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

   11. associate--l+ 100.0%

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

   12. +-inverses 100.0%

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

   13. +-rgt-identity 100.0%

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

   14. *-commutative 100.0%

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

   15. associate-+l+ 100.0%

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

   16. count-2 100.0%

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

   17. *-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 63.7%

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

6. Final simplification 63.7%

   \[\leadsto 2 \cdot \left(x \cdot \varepsilon\right) \]
7. Add Preprocessing

Alternative 5: 64.2% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 74.0%

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

   1. +-commutative 74.0%

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

   2. unpow2 74.0%

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

   3. unpow2 74.0%

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

   4. difference-of-squares 74.0%

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

   5. sub-neg 74.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 74.0%

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

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

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

   9. +-commutative 74.0%

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

   10. sub-neg 74.0%

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

   11. associate--l+ 100.0%

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

   12. +-inverses 100.0%

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

   13. +-rgt-identity 100.0%

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

   14. *-commutative 100.0%

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

   15. associate-+l+ 100.0%

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

   16. count-2 100.0%

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

   17. *-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 63.7%

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

   1. *-commutative 63.7%

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

   2. associate-*r* 63.7%

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

   3. *-commutative 63.7%

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

7. Simplified 63.7%

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

8. Final simplification 63.7%

   \[\leadsto \left(x \cdot 2\right) \cdot \varepsilon \]
9. Add Preprocessing

Reproduce

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