ENA, Section 1.4, Mentioned, B

Percentage Accurate: 87.8% → 99.6%

Time: 5.5s

Alternatives: 4

Speedup: 1.1×

Specification

\[0.999 \leq x \land x \leq 1.001\]

Math

\[\begin{array}{l} \\ \frac{10}{1 - x \cdot x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 10.0 (- 1.0 (* x x))))

C

double code(double x) {
	return 10.0 / (1.0 - (x * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 10.0d0 / (1.0d0 - (x * x))
end function

Java

public static double code(double x) {
	return 10.0 / (1.0 - (x * x));
}

Python

def code(x):
	return 10.0 / (1.0 - (x * x))

Julia

function code(x)
	return Float64(10.0 / Float64(1.0 - Float64(x * x)))
end

MATLAB

function tmp = code(x)
	tmp = 10.0 / (1.0 - (x * x));
end

Wolfram

code[x_] := N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 87.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{10}{1 - x \cdot x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 10.0 (- 1.0 (* x x))))

C

double code(double x) {
	return 10.0 / (1.0 - (x * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 10.0d0 / (1.0d0 - (x * x))
end function

Java

public static double code(double x) {
	return 10.0 / (1.0 - (x * x));
}

Python

def code(x):
	return 10.0 / (1.0 - (x * x))

Julia

function code(x)
	return Float64(10.0 / Float64(1.0 - Float64(x * x)))
end

MATLAB

function tmp = code(x)
	tmp = 10.0 / (1.0 - (x * x));
end

Wolfram

code[x_] := N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \frac{-10}{\mathsf{fma}\left(x, x, -1\right)} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ -10.0 (fma x x -1.0)))

C

double code(double x) {
	return -10.0 / fma(x, x, -1.0);
}

Julia

function code(x)
	return Float64(-10.0 / fma(x, x, -1.0))
end

Wolfram

code[x_] := N[(-10.0 / N[(x * x + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.6%

   \[\frac{10}{1 - x \cdot x} \]
2. Add Preprocessing

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\frac{-10}{\mathsf{fma}\left(x, x, -1\right)}} \]
5. Add Preprocessing

Alternative 2: 13.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{10}{1 - x \cdot x} \leq -5000:\\ \;\;\;\;\left(-10 \cdot x\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, x, 1\right) \cdot 10\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ 10.0 (- 1.0 (* x x))) -5000.0)
   (* (* -10.0 x) x)
   (* (fma x x 1.0) 10.0)))

C

double code(double x) {
	double tmp;
	if ((10.0 / (1.0 - (x * x))) <= -5000.0) {
		tmp = (-10.0 * x) * x;
	} else {
		tmp = fma(x, x, 1.0) * 10.0;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(10.0 / Float64(1.0 - Float64(x * x))) <= -5000.0)
		tmp = Float64(Float64(-10.0 * x) * x);
	else
		tmp = Float64(fma(x, x, 1.0) * 10.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5000.0], N[(N[(-10.0 * x), $MachinePrecision] * x), $MachinePrecision], N[(N[(x * x + 1.0), $MachinePrecision] * 10.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) < -5e3

   1. Initial program 86.8%

      \[\frac{10}{1 - x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{10 + 10 \cdot {x}^{2}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{10 \cdot {x}^{2} + 10} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{{x}^{2} \cdot 10} + 10 \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 1.5

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

   5. Applied rewrites 1.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, 10, 10\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 11.9%

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

   8. Taylor expanded in x around inf

      \[\leadsto -10 \cdot \color{blue}{{x}^{2}} \]
   9. Step-by-step derivation

   10. Applied rewrites 13.5%

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

   12. Applied rewrites 13.5%

       \[\leadsto \left(-10 \cdot x\right) \cdot x \]

   if -5e3 < (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x)))

   1. Initial program 88.1%

      \[\frac{10}{1 - x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{10 + 10 \cdot {x}^{2}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{10 \cdot {x}^{2} + 10} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{{x}^{2} \cdot 10} + 10 \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 13.7

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

   5. Applied rewrites 13.7%

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

   7. Applied rewrites 13.7%

      \[\leadsto \mathsf{fma}\left(x, x, 1\right) \cdot \color{blue}{10} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 13.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{10}{1 - x \cdot x} \leq -5000:\\ \;\;\;\;\left(-10 \cdot x\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;10\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (/ 10.0 (- 1.0 (* x x))) -5000.0) (* (* -10.0 x) x) 10.0))

C

double code(double x) {
	double tmp;
	if ((10.0 / (1.0 - (x * x))) <= -5000.0) {
		tmp = (-10.0 * x) * x;
	} else {
		tmp = 10.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((10.0d0 / (1.0d0 - (x * x))) <= (-5000.0d0)) then
        tmp = ((-10.0d0) * x) * x
    else
        tmp = 10.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((10.0 / (1.0 - (x * x))) <= -5000.0) {
		tmp = (-10.0 * x) * x;
	} else {
		tmp = 10.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (10.0 / (1.0 - (x * x))) <= -5000.0:
		tmp = (-10.0 * x) * x
	else:
		tmp = 10.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(10.0 / Float64(1.0 - Float64(x * x))) <= -5000.0)
		tmp = Float64(Float64(-10.0 * x) * x);
	else
		tmp = 10.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((10.0 / (1.0 - (x * x))) <= -5000.0)
		tmp = (-10.0 * x) * x;
	else
		tmp = 10.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(10.0 / N[(1.0 - N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -5000.0], N[(N[(-10.0 * x), $MachinePrecision] * x), $MachinePrecision], 10.0]

Derivation

1. Split input into 2 regimes

2. if (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x))) < -5e3

   1. Initial program 86.8%

      \[\frac{10}{1 - x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{10 + 10 \cdot {x}^{2}} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{10 \cdot {x}^{2} + 10} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{{x}^{2} \cdot 10} + 10 \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

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

      5. lower-*.f64 1.5

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

   5. Applied rewrites 1.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, 10, 10\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 11.9%

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

   8. Taylor expanded in x around inf

      \[\leadsto -10 \cdot \color{blue}{{x}^{2}} \]
   9. Step-by-step derivation

   10. Applied rewrites 13.5%

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

   12. Applied rewrites 13.5%

       \[\leadsto \left(-10 \cdot x\right) \cdot x \]

   if -5e3 < (/.f64 #s(literal 10 binary64) (-.f64 #s(literal 1 binary64) (*.f64 x x)))

   1. Initial program 88.1%

      \[\frac{10}{1 - x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{10} \]
   4. Step-by-step derivation

   5. Applied rewrites 13.5%

      \[\leadsto \color{blue}{10} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 9.6% accurate, 20.0× speedup

Math

\[\begin{array}{l} \\ 10 \end{array} \]

FPCore

(FPCore (x) :precision binary64 10.0)

C

double code(double x) {
	return 10.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 10.0d0
end function

Java

public static double code(double x) {
	return 10.0;
}

Python

def code(x):
	return 10.0

Julia

function code(x)
	return 10.0
end

MATLAB

function tmp = code(x)
	tmp = 10.0;
end

Wolfram

code[x_] := 10.0

Derivation

1. Initial program 87.6%

   \[\frac{10}{1 - x \cdot x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{10} \]
4. Step-by-step derivation

5. Applied rewrites 9.1%

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

Reproduce

herbie shell --seed 2024343 
(FPCore (x)
  :name "ENA, Section 1.4, Mentioned, B"
  :precision binary64
  :pre (and (<= 0.999 x) (<= x 1.001))
  (/ 10.0 (- 1.0 (* x x))))