Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendInside from plot-0.2.3.4

Percentage Accurate: 99.9% → 100.0%

Time: 6.6s

Alternatives: 9

Speedup: 1.3×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return ((((x + y) + y) + x) + 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) + y) + x) + z) + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return ((((x + y) + y) + x) + 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) + y) + x) + z) + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma x 3.0 (fma 2.0 y z)))

C

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

Julia

function code(x, y, z)
	return fma(x, 3.0, fma(2.0, y, z))
end

Wolfram

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

Derivation

1. Initial program 99.9%

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

2. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. count-2-rev N/A

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

   6. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

   1. lift-+.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. lift-+.f64 N/A

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

   4. count-2-rev N/A

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

   5. associate-+l+ N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lift-fma.f64 100.0

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

6. Applied rewrites 100.0%

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

Alternative 2: 86.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(3, x, y + y\right)\\ \mathbf{if}\;y \leq -3.5 \cdot 10^{+39}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.3 \cdot 10^{+20}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma 3.0 x (+ y y))))
   (if (<= y -3.5e+39) t_0 (if (<= y 2.3e+20) (fma 3.0 x z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(3.0, x, (y + y));
	double tmp;
	if (y <= -3.5e+39) {
		tmp = t_0;
	} else if (y <= 2.3e+20) {
		tmp = fma(3.0, x, z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(3.0, x, Float64(y + y))
	tmp = 0.0
	if (y <= -3.5e+39)
		tmp = t_0;
	elseif (y <= 2.3e+20)
		tmp = fma(3.0, x, z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(3.0 * x + N[(y + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.5e+39], t$95$0, If[LessEqual[y, 2.3e+20], N[(3.0 * x + z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.5000000000000002e39 or 2.3e20 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

         \[\leadsto 3 \cdot x + 2 \cdot y \]

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 67.7

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

   4. Applied rewrites 67.7%

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

   if -3.5000000000000002e39 < y < 2.3e20

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto 3 \cdot x + z \]

      2. lower-fma.f64 67.1

         \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

   7. Applied rewrites 67.1%

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

Alternative 3: 85.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.35 \cdot 10^{+49}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{+19}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \mathbf{else}:\\ \;\;\;\;z - -3 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.35e+49)
   (fma 3.0 x z)
   (if (<= x 1.25e+19) (fma 2.0 y z) (- z (* -3.0 x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.35e+49) {
		tmp = fma(3.0, x, z);
	} else if (x <= 1.25e+19) {
		tmp = fma(2.0, y, z);
	} else {
		tmp = z - (-3.0 * x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.35e+49)
		tmp = fma(3.0, x, z);
	elseif (x <= 1.25e+19)
		tmp = fma(2.0, y, z);
	else
		tmp = Float64(z - Float64(-3.0 * x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.35e+49], N[(3.0 * x + z), $MachinePrecision], If[LessEqual[x, 1.25e+19], N[(2.0 * y + z), $MachinePrecision], N[(z - N[(-3.0 * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.3499999999999999e49

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto 3 \cdot x + z \]

      2. lower-fma.f64 67.1

         \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

   7. Applied rewrites 67.1%

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

   if -2.3499999999999999e49 < x < 1.25e19

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 65.5

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

   4. Applied rewrites 65.5%

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

   if 1.25e19 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto 3 \cdot x + z \]

      2. lower-fma.f64 67.1

         \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

   7. Applied rewrites 67.1%

      \[\leadsto \mathsf{fma}\left(3, \color{blue}{x}, z\right) \]
   8. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto 3 \cdot x + z \]

      2. +-commutative N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. lower--.f64 N/A

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

      5. metadata-eval N/A

         \[\leadsto z - -3 \cdot x \]

      6. lower-*.f64 67.0

         \[\leadsto z - -3 \cdot x \]

   9. Applied rewrites 67.0%

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

Alternative 4: 85.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.35 \cdot 10^{+49}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{elif}\;x \leq 1.25 \cdot 10^{+19}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -2.35e+49)
   (fma 3.0 x z)
   (if (<= x 1.25e+19) (fma 2.0 y z) (fma 3.0 x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -2.35e+49) {
		tmp = fma(3.0, x, z);
	} else if (x <= 1.25e+19) {
		tmp = fma(2.0, y, z);
	} else {
		tmp = fma(3.0, x, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -2.35e+49)
		tmp = fma(3.0, x, z);
	elseif (x <= 1.25e+19)
		tmp = fma(2.0, y, z);
	else
		tmp = fma(3.0, x, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -2.35e+49], N[(3.0 * x + z), $MachinePrecision], If[LessEqual[x, 1.25e+19], N[(2.0 * y + z), $MachinePrecision], N[(3.0 * x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.3499999999999999e49 or 1.25e19 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto 3 \cdot x + z \]

      2. lower-fma.f64 67.1

         \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

   7. Applied rewrites 67.1%

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

   if -2.3499999999999999e49 < x < 1.25e19

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 65.5

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

   4. Applied rewrites 65.5%

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

Alternative 5: 80.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+111}:\\ \;\;\;\;y + y\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{+92}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{else}:\\ \;\;\;\;y + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -2.6e+111) (+ y y) (if (<= y 2.8e+92) (fma 3.0 x z) (+ y y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.6e+111) {
		tmp = y + y;
	} else if (y <= 2.8e+92) {
		tmp = fma(3.0, x, z);
	} else {
		tmp = y + y;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -2.6e+111)
		tmp = Float64(y + y);
	elseif (y <= 2.8e+92)
		tmp = fma(3.0, x, z);
	else
		tmp = Float64(y + y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -2.6e+111], N[(y + y), $MachinePrecision], If[LessEqual[y, 2.8e+92], N[(3.0 * x + z), $MachinePrecision], N[(y + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.5999999999999999e111 or 2.80000000000000001e92 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

         \[\leadsto 3 \cdot x + 2 \cdot y \]

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 67.7

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

   4. Applied rewrites 67.7%

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

   5. Taylor expanded in x around 0

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

      1. count-2-rev N/A

         \[\leadsto y + y \]

      2. lift-+.f64 34.0

         \[\leadsto y + y \]

   7. Applied rewrites 34.0%

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

   if -2.5999999999999999e111 < y < 2.80000000000000001e92

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto 3 \cdot x + z \]

      2. lower-fma.f64 67.1

         \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

   7. Applied rewrites 67.1%

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

Alternative 6: 55.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+70}:\\ \;\;\;\;3 \cdot x\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-276}:\\ \;\;\;\;y + y\\ \mathbf{elif}\;x \leq 1.6 \cdot 10^{+43}:\\ \;\;\;\;z + x\\ \mathbf{else}:\\ \;\;\;\;3 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -6.8e+70)
   (* 3.0 x)
   (if (<= x 3.1e-276) (+ y y) (if (<= x 1.6e+43) (+ z x) (* 3.0 x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -6.8e+70) {
		tmp = 3.0 * x;
	} else if (x <= 3.1e-276) {
		tmp = y + y;
	} else if (x <= 1.6e+43) {
		tmp = z + x;
	} else {
		tmp = 3.0 * x;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (x <= (-6.8d+70)) then
        tmp = 3.0d0 * x
    else if (x <= 3.1d-276) then
        tmp = y + y
    else if (x <= 1.6d+43) then
        tmp = z + x
    else
        tmp = 3.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -6.8e+70) {
		tmp = 3.0 * x;
	} else if (x <= 3.1e-276) {
		tmp = y + y;
	} else if (x <= 1.6e+43) {
		tmp = z + x;
	} else {
		tmp = 3.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -6.8e+70:
		tmp = 3.0 * x
	elif x <= 3.1e-276:
		tmp = y + y
	elif x <= 1.6e+43:
		tmp = z + x
	else:
		tmp = 3.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -6.8e+70)
		tmp = Float64(3.0 * x);
	elseif (x <= 3.1e-276)
		tmp = Float64(y + y);
	elseif (x <= 1.6e+43)
		tmp = Float64(z + x);
	else
		tmp = Float64(3.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -6.8e+70)
		tmp = 3.0 * x;
	elseif (x <= 3.1e-276)
		tmp = y + y;
	elseif (x <= 1.6e+43)
		tmp = z + x;
	else
		tmp = 3.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -6.8e+70], N[(3.0 * x), $MachinePrecision], If[LessEqual[x, 3.1e-276], N[(y + y), $MachinePrecision], If[LessEqual[x, 1.6e+43], N[(z + x), $MachinePrecision], N[(3.0 * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.8000000000000002e70 or 1.60000000000000007e43 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf

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

      1. lower-*.f64 35.4

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

   4. Applied rewrites 35.4%

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

   if -6.8000000000000002e70 < x < 3.09999999999999989e-276

   1. Initial program 99.9%

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

   2. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

         \[\leadsto 3 \cdot x + 2 \cdot y \]

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 67.7

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

   4. Applied rewrites 67.7%

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

   5. Taylor expanded in x around 0

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

      1. count-2-rev N/A

         \[\leadsto y + y \]

      2. lift-+.f64 34.0

         \[\leadsto y + y \]

   7. Applied rewrites 34.0%

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

   if 3.09999999999999989e-276 < x < 1.60000000000000007e43

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 67.0

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

   4. Applied rewrites 67.0%

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

   5. Taylor expanded in x around 0

      \[\leadsto z + x \]
   6. Step-by-step derivation

   7. Applied rewrites 38.7%

      \[\leadsto z + x \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 53.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.2 \cdot 10^{+39}:\\ \;\;\;\;y + y\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{+20}:\\ \;\;\;\;z + x\\ \mathbf{else}:\\ \;\;\;\;y + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -7.2e+39) (+ y y) (if (<= y 3.8e+20) (+ z x) (+ y y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -7.2e+39) {
		tmp = y + y;
	} else if (y <= 3.8e+20) {
		tmp = z + x;
	} else {
		tmp = y + y;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (y <= (-7.2d+39)) then
        tmp = y + y
    else if (y <= 3.8d+20) then
        tmp = z + x
    else
        tmp = y + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -7.2e+39) {
		tmp = y + y;
	} else if (y <= 3.8e+20) {
		tmp = z + x;
	} else {
		tmp = y + y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -7.2e+39:
		tmp = y + y
	elif y <= 3.8e+20:
		tmp = z + x
	else:
		tmp = y + y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -7.2e+39)
		tmp = Float64(y + y);
	elseif (y <= 3.8e+20)
		tmp = Float64(z + x);
	else
		tmp = Float64(y + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -7.2e+39)
		tmp = y + y;
	elseif (y <= 3.8e+20)
		tmp = z + x;
	else
		tmp = y + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -7.2e+39], N[(y + y), $MachinePrecision], If[LessEqual[y, 3.8e+20], N[(z + x), $MachinePrecision], N[(y + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.19999999999999969e39 or 3.8e20 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

         \[\leadsto 3 \cdot x + 2 \cdot y \]

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 67.7

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

   4. Applied rewrites 67.7%

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

   5. Taylor expanded in x around 0

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

      1. count-2-rev N/A

         \[\leadsto y + y \]

      2. lift-+.f64 34.0

         \[\leadsto y + y \]

   7. Applied rewrites 34.0%

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

   if -7.19999999999999969e39 < y < 3.8e20

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 67.0

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

   4. Applied rewrites 67.0%

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

   5. Taylor expanded in x around 0

      \[\leadsto z + x \]
   6. Step-by-step derivation

   7. Applied rewrites 38.7%

      \[\leadsto z + x \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 52.1% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{+39}:\\ \;\;\;\;y + y\\ \mathbf{elif}\;y \leq 2.3 \cdot 10^{+20}:\\ \;\;\;\;z\\ \mathbf{else}:\\ \;\;\;\;y + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -5e+39) (+ y y) (if (<= y 2.3e+20) z (+ y y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e+39) {
		tmp = y + y;
	} else if (y <= 2.3e+20) {
		tmp = z;
	} else {
		tmp = y + y;
	}
	return tmp;
}

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
    real(8) :: tmp
    if (y <= (-5d+39)) then
        tmp = y + y
    else if (y <= 2.3d+20) then
        tmp = z
    else
        tmp = y + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e+39) {
		tmp = y + y;
	} else if (y <= 2.3e+20) {
		tmp = z;
	} else {
		tmp = y + y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -5e+39:
		tmp = y + y
	elif y <= 2.3e+20:
		tmp = z
	else:
		tmp = y + y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -5e+39)
		tmp = Float64(y + y);
	elseif (y <= 2.3e+20)
		tmp = z;
	else
		tmp = Float64(y + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -5e+39)
		tmp = y + y;
	elseif (y <= 2.3e+20)
		tmp = z;
	else
		tmp = y + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -5e+39], N[(y + y), $MachinePrecision], If[LessEqual[y, 2.3e+20], z, N[(y + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -5.00000000000000015e39 or 2.3e20 < y

   1. Initial program 99.9%

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

   2. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

         \[\leadsto 3 \cdot x + 2 \cdot y \]

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 67.7

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

   4. Applied rewrites 67.7%

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

   5. Taylor expanded in x around 0

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

      1. count-2-rev N/A

         \[\leadsto y + y \]

      2. lift-+.f64 34.0

         \[\leadsto y + y \]

   7. Applied rewrites 34.0%

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

   if -5.00000000000000015e39 < y < 2.3e20

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto 3 \cdot x + z \]

      2. lower-fma.f64 67.1

         \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

   7. Applied rewrites 67.1%

      \[\leadsto \mathsf{fma}\left(3, \color{blue}{x}, z\right) \]
   8. Step-by-step derivation

      1. lift-fma.f64 N/A

         \[\leadsto 3 \cdot x + z \]

      2. +-commutative N/A

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

      3. fp-cancel-sign-sub-inv N/A

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

      4. lower--.f64 N/A

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

      5. metadata-eval N/A

         \[\leadsto z - -3 \cdot x \]

      6. lower-*.f64 67.0

         \[\leadsto z - -3 \cdot x \]

   9. Applied rewrites 67.0%

      \[\leadsto z - -3 \cdot \color{blue}{x} \]

   10. Taylor expanded in x around 0

       \[\leadsto z \]
   11. Step-by-step derivation

   12. Applied rewrites 33.4%

       \[\leadsto z \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 33.4% accurate, 14.7× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 99.9%

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

2. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. count-2-rev N/A

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

   6. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Taylor expanded in y around 0

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

   1. +-commutative N/A

      \[\leadsto 3 \cdot x + z \]

   2. lower-fma.f64 67.1

      \[\leadsto \mathsf{fma}\left(3, x, z\right) \]

7. Applied rewrites 67.1%

   \[\leadsto \mathsf{fma}\left(3, \color{blue}{x}, z\right) \]
8. Step-by-step derivation

   1. lift-fma.f64 N/A

      \[\leadsto 3 \cdot x + z \]

   2. +-commutative N/A

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

   3. fp-cancel-sign-sub-inv N/A

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

   4. lower--.f64 N/A

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

   5. metadata-eval N/A

      \[\leadsto z - -3 \cdot x \]

   6. lower-*.f64 67.0

      \[\leadsto z - -3 \cdot x \]

9. Applied rewrites 67.0%

   \[\leadsto z - -3 \cdot \color{blue}{x} \]

10. Taylor expanded in x around 0

    \[\leadsto z \]
11. Step-by-step derivation

12. Applied rewrites 33.4%

    \[\leadsto z \]
13. Add Preprocessing

Reproduce

herbie shell --seed 2025139 
(FPCore (x y z)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendInside from plot-0.2.3.4"
  :precision binary64
  (+ (+ (+ (+ (+ x y) y) x) z) x))