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

Percentage Accurate: 74.1% → 100.0%

Time: 2.7s

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)\]

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.1% 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, 29.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 76.9%

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

   1. unpow2 76.9%

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

   2. unpow2 76.9%

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

   3. difference-of-squares 76.9%

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

   4. *-commutative 76.9%

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

   5. +-commutative 76.9%

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

   6. associate--l+ 100.0%

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

   7. +-inverses 100.0%

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

   8. +-rgt-identity 100.0%

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

   9. +-commutative 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \varepsilon \cdot \left(x + \left(\varepsilon + x\right)\right) \]

Alternative 2: 90.2% accurate, 22.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-136} \lor \neg \left(x \leq 4 \cdot 10^{-127}\right):\\ \;\;\;\;x \cdot \left(\varepsilon + \varepsilon\right)\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \end{array} \end{array} \]

FPCore

(FPCore (x eps)
 :precision binary64
 (if (or (<= x -3.5e-136) (not (<= x 4e-127))) (* x (+ eps eps)) (* eps eps)))

C

double code(double x, double eps) {
	double tmp;
	if ((x <= -3.5e-136) || !(x <= 4e-127)) {
		tmp = x * (eps + eps);
	} 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 <= (-3.5d-136)) .or. (.not. (x <= 4d-127))) then
        tmp = x * (eps + eps)
    else
        tmp = eps * eps
    end if
    code = tmp
end function

Java

public static double code(double x, double eps) {
	double tmp;
	if ((x <= -3.5e-136) || !(x <= 4e-127)) {
		tmp = x * (eps + eps);
	} else {
		tmp = eps * eps;
	}
	return tmp;
}

Python

def code(x, eps):
	tmp = 0
	if (x <= -3.5e-136) or not (x <= 4e-127):
		tmp = x * (eps + eps)
	else:
		tmp = eps * eps
	return tmp

Julia

function code(x, eps)
	tmp = 0.0
	if ((x <= -3.5e-136) || !(x <= 4e-127))
		tmp = Float64(x * Float64(eps + eps));
	else
		tmp = Float64(eps * eps);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, eps)
	tmp = 0.0;
	if ((x <= -3.5e-136) || ~((x <= 4e-127)))
		tmp = x * (eps + eps);
	else
		tmp = eps * eps;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, eps_] := If[Or[LessEqual[x, -3.5e-136], N[Not[LessEqual[x, 4e-127]], $MachinePrecision]], N[(x * N[(eps + eps), $MachinePrecision]), $MachinePrecision], N[(eps * eps), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.50000000000000029e-136 or 4.0000000000000001e-127 < x

   1. Initial program 41.1%

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

      1. unpow2 41.1%

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

      2. unpow2 41.1%

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

      3. difference-of-squares 41.1%

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

      4. *-commutative 41.1%

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

      5. +-commutative 41.1%

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

      6. associate--l+ 100.0%

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

      7. +-inverses 100.0%

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

      8. +-rgt-identity 100.0%

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

      9. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in eps around 0 83.7%

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

      1. *-commutative 83.7%

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

      2. count-2 83.7%

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

      3. distribute-lft-out 83.7%

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

   6. Simplified 83.7%

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

   if -3.50000000000000029e-136 < x < 4.0000000000000001e-127

   1. Initial program 98.7%

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

      1. unpow2 98.7%

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

      2. unpow2 98.7%

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

      3. difference-of-squares 98.7%

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

      4. *-commutative 98.7%

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

      5. +-commutative 98.7%

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

      6. associate--l+ 100.0%

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

      7. +-inverses 100.0%

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

      8. +-rgt-identity 100.0%

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

      9. +-commutative 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 98.7%

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

4. Final simplification 93.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-136} \lor \neg \left(x \leq 4 \cdot 10^{-127}\right):\\ \;\;\;\;x \cdot \left(\varepsilon + \varepsilon\right)\\ \mathbf{else}:\\ \;\;\;\;\varepsilon \cdot \varepsilon\\ \end{array} \]

Alternative 3: 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 76.9%

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

   1. unpow2 76.9%

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

   2. unpow2 76.9%

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

   3. difference-of-squares 76.9%

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

   4. *-commutative 76.9%

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

   5. +-commutative 76.9%

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

   6. associate--l+ 100.0%

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

   7. +-inverses 100.0%

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

   8. +-rgt-identity 100.0%

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

   9. +-commutative 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around 0 100.0%

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

5. Final simplification 100.0%

   \[\leadsto \varepsilon \cdot \left(\varepsilon + x \cdot 2\right) \]

Alternative 4: 71.8% 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 76.9%

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

   1. unpow2 76.9%

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

   2. unpow2 76.9%

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

   3. difference-of-squares 76.9%

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

   4. *-commutative 76.9%

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

   5. +-commutative 76.9%

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

   6. associate--l+ 100.0%

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

   7. +-inverses 100.0%

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

   8. +-rgt-identity 100.0%

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

   9. +-commutative 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in x around 0 75.3%

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

5. Final simplification 75.3%

   \[\leadsto \varepsilon \cdot \varepsilon \]

Reproduce

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