Main:bigenough2 from A

Percentage Accurate: 100.0% → 100.0%

Time: 4.0s

Alternatives: 5

Speedup: 1.1×

• 21.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    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.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]

3. Applied rewrites 100.0%

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

Alternative 2: 98.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x + z\right) \cdot y\\ \mathbf{if}\;y \leq -4.4:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 0.00125:\\ \;\;\;\;\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 -4.4) t_0 (if (<= y 0.00125) (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 <= -4.4) {
		tmp = t_0;
	} else if (y <= 0.00125) {
		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 <= -4.4)
		tmp = t_0;
	elseif (y <= 0.00125)
		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, -4.4], t$95$0, If[LessEqual[y, 0.00125], N[(z * y + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.4000000000000004 or 0.00125000000000000003 < y

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lower-+.f64 N/A

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

      4. +-commutative N/A

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

      5. +-commutative N/A

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

      6. distribute-lft-in N/A

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

      7. *-commutative N/A

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

      8. +-commutative N/A

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

      9. associate-+l+ N/A

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

      10. *-rgt-identity N/A

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

      11. distribute-lft-in N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. *-commutative N/A

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

      16. +-commutative N/A

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

      17. distribute-lft1-in N/A

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

      18. lower-fma.f64 98.9

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

   3. Applied rewrites 98.9%

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

   4. Taylor expanded in y around inf

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

      1. associate-+r+ N/A

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

      2. *-commutative N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      3. *-commutative N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      4. +-commutative N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      5. *-commutative N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      6. distribute-rgt-in N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      7. +-commutative N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      8. *-commutative N/A

         \[\leadsto y \cdot \left(x + z\right) \]

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 65.0

          \[\leadsto \left(x + z\right) \cdot y \]

   6. Applied rewrites 65.0%

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

   if -4.4000000000000004 < y < 0.00125000000000000003

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 75.8%

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

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + 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 75.8

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

   6. Applied rewrites 75.8%

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

Alternative 3: 86.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{-62}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{elif}\;z \leq 5.5 \cdot 10^{-24}:\\ \;\;\;\;\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.25e-62) (fma z y x) (if (<= z 5.5e-24) (fma y x x) (fma z y x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.25e-62) {
		tmp = fma(z, y, x);
	} else if (z <= 5.5e-24) {
		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.25e-62)
		tmp = fma(z, y, x);
	elseif (z <= 5.5e-24)
		tmp = fma(y, x, x);
	else
		tmp = fma(z, y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.25e-62], N[(z * y + x), $MachinePrecision], If[LessEqual[z, 5.5e-24], N[(y * x + x), $MachinePrecision], N[(z * y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.25e-62 or 5.4999999999999999e-24 < z

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 75.8%

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

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x + 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 75.8

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

   6. Applied rewrites 75.8%

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

   if -1.25e-62 < z < 5.4999999999999999e-24

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. +-commutative N/A

         \[\leadsto \left(y + 1\right) \cdot x \]

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 62.2

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

   4. Applied rewrites 62.2%

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

Alternative 4: 74.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.4 \cdot 10^{-87}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \mathbf{elif}\;x \leq 2.5 \cdot 10^{-74}:\\ \;\;\;\;z \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.4e-87) (fma y x x) (if (<= x 2.5e-74) (* z y) (fma y x x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.4e-87) {
		tmp = fma(y, x, x);
	} else if (x <= 2.5e-74) {
		tmp = z * y;
	} else {
		tmp = fma(y, x, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.4e-87)
		tmp = fma(y, x, x);
	elseif (x <= 2.5e-74)
		tmp = Float64(z * y);
	else
		tmp = fma(y, x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.4e-87], N[(y * x + x), $MachinePrecision], If[LessEqual[x, 2.5e-74], N[(z * y), $MachinePrecision], N[(y * x + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.4e-87 or 2.49999999999999999e-74 < x

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. +-commutative N/A

         \[\leadsto \left(y + 1\right) \cdot x \]

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 62.2

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

   4. Applied rewrites 62.2%

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

   if -1.4e-87 < x < 2.49999999999999999e-74

   1. Initial program 100.0%

      \[x + y \cdot \left(z + x\right) \]

   2. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 41.5

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

   4. Applied rewrites 41.5%

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

Alternative 5: 41.5% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + y \cdot \left(z + x\right) \]

2. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 41.5

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

4. Applied rewrites 41.5%

   \[\leadsto \color{blue}{z \cdot y} \]
5. Add Preprocessing

Reproduce

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