Main:bigenough2 from A

Percentage Accurate: 100.0% → 100.0%

Time: 3.7s

Alternatives: 5

Speedup: 1.2×

• 21.1% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (+ z x))))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return x + (y * (z + x))

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z + x)))
end

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (+ z x))))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return x + (y * (z + x))

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z + x)))
end

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x + z, y, x\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (+ x z) y x))

C

double code(double x, double y, double z) {
	return fma((x + z), y, x);
}

Julia

function code(x, y, z)
	return fma(Float64(x + z), y, x)
end

Wolfram

code[x_, y_, z_] := N[(N[(x + z), $MachinePrecision] * y + x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 100.0

      \[\leadsto \color{blue}{\mathsf{fma}\left(z + x, y, x\right)} \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z + x, y, x\right)} \]

5. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(x + z, y, x\right) \]
6. Add Preprocessing

Alternative 2: 85.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(x + z\right)\\ \mathbf{if}\;y \leq -850000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 0.48:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (+ x z))))
   (if (<= y -850000.0) t_0 (if (<= y 0.48) (fma y x x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = y * (x + z);
	double tmp;
	if (y <= -850000.0) {
		tmp = t_0;
	} else if (y <= 0.48) {
		tmp = fma(y, x, x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(x + z))
	tmp = 0.0
	if (y <= -850000.0)
		tmp = t_0;
	elseif (y <= 0.48)
		tmp = fma(y, x, x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -850000.0], t$95$0, If[LessEqual[y, 0.48], N[(y * x + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -8.5e5 or 0.47999999999999998 < y

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. distribute-rgt-in N/A

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

      6. associate-+l+ N/A

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

      7. lower-fma.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 97.8

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

   4. Applied rewrites 97.8%

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

   5. Taylor expanded in y around -inf

      \[\leadsto \color{blue}{-1 \cdot \left(y \cdot \left(-1 \cdot x + -1 \cdot z\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(y \cdot \left(-1 \cdot x + -1 \cdot z\right)\right)} \]

      2. distribute-lft-in N/A

         \[\leadsto \mathsf{neg}\left(y \cdot \color{blue}{\left(-1 \cdot \left(x + z\right)\right)}\right) \]

      3. distribute-rgt-neg-in N/A

         \[\leadsto \color{blue}{y \cdot \left(\mathsf{neg}\left(-1 \cdot \left(x + z\right)\right)\right)} \]

      4. mul-1-neg N/A

         \[\leadsto y \cdot \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\left(x + z\right)\right)\right)}\right)\right) \]

      5. remove-double-neg N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-+.f64 99.7

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

   7. Applied rewrites 99.7%

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

   if -8.5e5 < y < 0.47999999999999998

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 76.7

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

   5. Applied rewrites 76.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -850000:\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{elif}\;y \leq 0.48:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(x + z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.7 \cdot 10^{-73}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{elif}\;x \leq 3.2 \cdot 10^{-79}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -4.7e-73) (fma y x x) (if (<= x 3.2e-79) (* y z) (fma y x x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.7e-73) {
		tmp = fma(y, x, x);
	} else if (x <= 3.2e-79) {
		tmp = y * z;
	} else {
		tmp = fma(y, x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4.7e-73)
		tmp = fma(y, x, x);
	elseif (x <= 3.2e-79)
		tmp = Float64(y * z);
	else
		tmp = fma(y, x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4.7e-73], N[(y * x + x), $MachinePrecision], If[LessEqual[x, 3.2e-79], N[(y * z), $MachinePrecision], N[(y * x + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.69999999999999994e-73 or 3.19999999999999988e-79 < x

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 87.8

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

   5. Applied rewrites 87.8%

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

   if -4.69999999999999994e-73 < x < 3.19999999999999988e-79

   1. Initial program 99.9%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{y \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot y} \]

      2. lower-*.f64 76.8

         \[\leadsto \color{blue}{z \cdot y} \]

   5. Applied rewrites 76.8%

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

4. Final simplification 83.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.7 \cdot 10^{-73}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{elif}\;x \leq 3.2 \cdot 10^{-79}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 50.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.9 \cdot 10^{+28}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{-75}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.9e+28) (* y x) (if (<= x 1.2e-75) (* y z) (* y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.9e+28) {
		tmp = y * x;
	} else if (x <= 1.2e-75) {
		tmp = y * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-1.9d+28)) then
        tmp = y * x
    else if (x <= 1.2d-75) then
        tmp = y * z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.9e+28) {
		tmp = y * x;
	} else if (x <= 1.2e-75) {
		tmp = y * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.9e+28:
		tmp = y * x
	elif x <= 1.2e-75:
		tmp = y * z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.9e+28)
		tmp = Float64(y * x);
	elseif (x <= 1.2e-75)
		tmp = Float64(y * z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.9e+28)
		tmp = y * x;
	elseif (x <= 1.2e-75)
		tmp = y * z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.9e+28], N[(y * x), $MachinePrecision], If[LessEqual[x, 1.2e-75], N[(y * z), $MachinePrecision], N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.8999999999999999e28 or 1.2000000000000001e-75 < x

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 91.0

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

   5. Applied rewrites 91.0%

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

   6. Taylor expanded in y around inf

      \[\leadsto x \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 44.5%

      \[\leadsto y \cdot \color{blue}{x} \]

   if -1.8999999999999999e28 < x < 1.2000000000000001e-75

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{y \cdot z} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{z \cdot y} \]

      2. lower-*.f64 71.9

         \[\leadsto \color{blue}{z \cdot y} \]

   5. Applied rewrites 71.9%

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

4. Final simplification 55.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.9 \cdot 10^{+28}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 1.2 \cdot 10^{-75}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 27.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ y \cdot x \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* y x))

C

double code(double x, double y, double z) {
	return y * x;
}

Fortran

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

Java

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

Python

def code(x, y, z):
	return y * x

Julia

function code(x, y, z)
	return Float64(y * x)
end

MATLAB

function tmp = code(x, y, z)
	tmp = y * x;
end

Wolfram

code[x_, y_, z_] := N[(y * x), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{x \cdot \left(1 + y\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. +-commutative N/A

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

   3. distribute-lft1-in N/A

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

   4. lower-fma.f64 65.4

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

5. Applied rewrites 65.4%

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

6. Taylor expanded in y around inf

   \[\leadsto x \cdot \color{blue}{y} \]
7. Step-by-step derivation

8. Applied rewrites 31.9%

   \[\leadsto y \cdot \color{blue}{x} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024327 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))