Main:bigenough2 from A

Percentage Accurate: 100.0% → 100.0%

Time: 5.1s

Alternatives: 6

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 x + y \cdot \color{blue}{\left(z + x\right)} \]

   2. lift-*.f64 N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 100.0

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

   7. lift-+.f64 N/A

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

   8. +-commutative N/A

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

   9. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 98.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.8e8 or 2.99999999999999974e-4 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 99.3

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

   5. Applied rewrites 99.3%

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

   if -1.8e8 < y < 2.99999999999999974e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 99.8

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

   5. Applied rewrites 99.8%

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

      1. lift-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 99.8

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

   7. Applied rewrites 99.8%

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

4. Final simplification 99.6%

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

Alternative 3: 86.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.7 \cdot 10^{+35}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-28}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.7e+35) (fma z y x) (if (<= z 1.1e-28) (fma y x x) (fma z y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.7e+35) {
		tmp = fma(z, y, x);
	} else if (z <= 1.1e-28) {
		tmp = fma(y, x, x);
	} else {
		tmp = fma(z, y, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.7e+35)
		tmp = fma(z, y, x);
	elseif (z <= 1.1e-28)
		tmp = fma(y, x, x);
	else
		tmp = fma(z, y, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.7000000000000001e35 or 1.09999999999999998e-28 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 91.5

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

   5. Applied rewrites 91.5%

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

      1. lift-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 91.5

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

   7. Applied rewrites 91.5%

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

   if -1.7000000000000001e35 < z < 1.09999999999999998e-28

   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 86.8

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

   5. Applied rewrites 86.8%

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

Alternative 4: 75.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.1 \cdot 10^{+35}:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{+101}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -2.1e+35) (* z y) (if (<= z 1.15e+101) (fma y x x) (* z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -2.1e+35) {
		tmp = z * y;
	} else if (z <= 1.15e+101) {
		tmp = fma(y, x, x);
	} else {
		tmp = z * y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -2.1e+35)
		tmp = Float64(z * y);
	elseif (z <= 1.15e+101)
		tmp = fma(y, x, x);
	else
		tmp = Float64(z * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -2.1e+35], N[(z * y), $MachinePrecision], If[LessEqual[z, 1.15e+101], N[(y * x + x), $MachinePrecision], N[(z * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.0999999999999999e35 or 1.1500000000000001e101 < z

   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. lower-*.f64 75.1

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

   5. Applied rewrites 75.1%

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

   if -2.0999999999999999e35 < z < 1.1500000000000001e101

   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 82.1

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

   5. Applied rewrites 82.1%

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

4. Final simplification 78.8%

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

Alternative 5: 52.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -6.8e+30) (* z y) (if (<= z 1.1e-28) (* x y) (* z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -6.8e+30) {
		tmp = z * y;
	} else if (z <= 1.1e-28) {
		tmp = x * y;
	} else {
		tmp = z * y;
	}
	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 (z <= (-6.8d+30)) then
        tmp = z * y
    else if (z <= 1.1d-28) then
        tmp = x * y
    else
        tmp = z * y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if z <= -6.8e+30:
		tmp = z * y
	elif z <= 1.1e-28:
		tmp = x * y
	else:
		tmp = z * y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -6.8e+30)
		tmp = z * y;
	elseif (z <= 1.1e-28)
		tmp = x * y;
	else
		tmp = z * y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -6.8000000000000005e30 or 1.09999999999999998e-28 < z

   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. lower-*.f64 68.3

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

   5. Applied rewrites 68.3%

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

   if -6.8000000000000005e30 < z < 1.09999999999999998e-28

   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 86.5

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

   5. Applied rewrites 86.5%

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

   6. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 38.6

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

   8. Applied rewrites 38.6%

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

4. Final simplification 56.0%

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

Alternative 6: 27.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x * y), $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 58.7

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

5. Applied rewrites 58.7%

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

6. Taylor expanded in y around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 25.7

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

8. Applied rewrites 25.7%

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

9. Final simplification 25.7%

   \[\leadsto x \cdot y \]
10. Add Preprocessing

Reproduce

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