Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, C

Percentage Accurate: 99.9% → 99.9%

Time: 7.4s

Alternatives: 15

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z):
	return (x + math.sin(y)) + (z * math.cos(y))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y, z):
	return (x + math.sin(y)) + (z * math.cos(y))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-sin.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-cos.f64 N/A

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

   6. +-commutative N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lift-cos.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-+.f64 N/A

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

   12. lift-sin.f64 99.9

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

3. Applied rewrites 99.9%

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

Alternative 2: 99.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\cos y, z, x\right)\\ \mathbf{if}\;z \leq -0.32:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 2.6 \cdot 10^{-17}:\\ \;\;\;\;\left(x + \sin y\right) + z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (cos y) z x)))
   (if (<= z -0.32) t_0 (if (<= z 2.6e-17) (+ (+ x (sin y)) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(cos(y), z, x);
	double tmp;
	if (z <= -0.32) {
		tmp = t_0;
	} else if (z <= 2.6e-17) {
		tmp = (x + sin(y)) + z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(cos(y), z, x)
	tmp = 0.0
	if (z <= -0.32)
		tmp = t_0;
	elseif (z <= 2.6e-17)
		tmp = Float64(Float64(x + sin(y)) + z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Cos[y], $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[z, -0.32], t$95$0, If[LessEqual[z, 2.6e-17], N[(N[(x + N[Sin[y], $MachinePrecision]), $MachinePrecision] + z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -0.320000000000000007 or 2.60000000000000003e-17 < z

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sin.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-cos.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lift-sin.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in x around inf

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

   6. Applied rewrites 98.6%

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

   if -0.320000000000000007 < z < 2.60000000000000003e-17

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 99.8%

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

Alternative 3: 95.4% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (cos y) z x)))
   (if (<= z -1.32e-21) t_0 (if (<= z 2.3e-21) (+ (sin y) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(cos(y), z, x);
	double tmp;
	if (z <= -1.32e-21) {
		tmp = t_0;
	} else if (z <= 2.3e-21) {
		tmp = sin(y) + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(cos(y), z, x)
	tmp = 0.0
	if (z <= -1.32e-21)
		tmp = t_0;
	elseif (z <= 2.3e-21)
		tmp = Float64(sin(y) + x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Cos[y], $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[z, -1.32e-21], t$95$0, If[LessEqual[z, 2.3e-21], N[(N[Sin[y], $MachinePrecision] + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.32e-21 or 2.29999999999999999e-21 < z

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-sin.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-cos.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-cos.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lift-sin.f64 99.9

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in x around inf

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

   6. Applied rewrites 97.8%

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

   if -1.32e-21 < z < 2.29999999999999999e-21

   1. Initial program 100.0%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lift-sin.f64 92.6

         \[\leadsto \sin y + x \]

   4. Applied rewrites 92.6%

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

Alternative 4: 85.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \cos y \cdot z\\ \mathbf{if}\;z \leq -7.2 \cdot 10^{+125}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq -1.32 \cdot 10^{-21}:\\ \;\;\;\;z + x\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{-17}:\\ \;\;\;\;\sin y + x\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{+116}:\\ \;\;\;\;z + x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (cos y) z)))
   (if (<= z -7.2e+125)
     t_0
     (if (<= z -1.32e-21)
       (+ z x)
       (if (<= z 2.1e-17) (+ (sin y) x) (if (<= z 1.7e+116) (+ z x) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = cos(y) * z;
	double tmp;
	if (z <= -7.2e+125) {
		tmp = t_0;
	} else if (z <= -1.32e-21) {
		tmp = z + x;
	} else if (z <= 2.1e-17) {
		tmp = sin(y) + x;
	} else if (z <= 1.7e+116) {
		tmp = z + x;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = cos(y) * z
    if (z <= (-7.2d+125)) then
        tmp = t_0
    else if (z <= (-1.32d-21)) then
        tmp = z + x
    else if (z <= 2.1d-17) then
        tmp = sin(y) + x
    else if (z <= 1.7d+116) then
        tmp = z + x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = Math.cos(y) * z;
	double tmp;
	if (z <= -7.2e+125) {
		tmp = t_0;
	} else if (z <= -1.32e-21) {
		tmp = z + x;
	} else if (z <= 2.1e-17) {
		tmp = Math.sin(y) + x;
	} else if (z <= 1.7e+116) {
		tmp = z + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = math.cos(y) * z
	tmp = 0
	if z <= -7.2e+125:
		tmp = t_0
	elif z <= -1.32e-21:
		tmp = z + x
	elif z <= 2.1e-17:
		tmp = math.sin(y) + x
	elif z <= 1.7e+116:
		tmp = z + x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(cos(y) * z)
	tmp = 0.0
	if (z <= -7.2e+125)
		tmp = t_0;
	elseif (z <= -1.32e-21)
		tmp = Float64(z + x);
	elseif (z <= 2.1e-17)
		tmp = Float64(sin(y) + x);
	elseif (z <= 1.7e+116)
		tmp = Float64(z + x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = cos(y) * z;
	tmp = 0.0;
	if (z <= -7.2e+125)
		tmp = t_0;
	elseif (z <= -1.32e-21)
		tmp = z + x;
	elseif (z <= 2.1e-17)
		tmp = sin(y) + x;
	elseif (z <= 1.7e+116)
		tmp = z + x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Cos[y], $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -7.2e+125], t$95$0, If[LessEqual[z, -1.32e-21], N[(z + x), $MachinePrecision], If[LessEqual[z, 2.1e-17], N[(N[Sin[y], $MachinePrecision] + x), $MachinePrecision], If[LessEqual[z, 1.7e+116], N[(z + x), $MachinePrecision], t$95$0]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -7.2000000000000007e125 or 1.70000000000000011e116 < z

   1. Initial program 99.8%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift-cos.f64 83.5

         \[\leadsto \cos y \cdot z \]

   4. Applied rewrites 83.5%

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

   if -7.2000000000000007e125 < z < -1.32e-21 or 2.09999999999999992e-17 < z < 1.70000000000000011e116

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 74.0

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

   4. Applied rewrites 74.0%

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

   if -1.32e-21 < z < 2.09999999999999992e-17

   1. Initial program 100.0%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lift-sin.f64 92.5

         \[\leadsto \sin y + x \]

   4. Applied rewrites 92.5%

      \[\leadsto \color{blue}{\sin y + x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 80.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x + \sin y\right) + z \cdot \cos y\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+15}:\\ \;\;\;\;z + x\\ \mathbf{elif}\;t\_0 \leq -0.0002:\\ \;\;\;\;\sin y\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{-11}:\\ \;\;\;\;\left(z + y\right) + x\\ \mathbf{elif}\;t\_0 \leq 5:\\ \;\;\;\;\sin y\\ \mathbf{else}:\\ \;\;\;\;z + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (+ x (sin y)) (* z (cos y)))))
   (if (<= t_0 -5e+15)
     (+ z x)
     (if (<= t_0 -0.0002)
       (sin y)
       (if (<= t_0 5e-11) (+ (+ z y) x) (if (<= t_0 5.0) (sin y) (+ z x)))))))

C

double code(double x, double y, double z) {
	double t_0 = (x + sin(y)) + (z * cos(y));
	double tmp;
	if (t_0 <= -5e+15) {
		tmp = z + x;
	} else if (t_0 <= -0.0002) {
		tmp = sin(y);
	} else if (t_0 <= 5e-11) {
		tmp = (z + y) + x;
	} else if (t_0 <= 5.0) {
		tmp = sin(y);
	} else {
		tmp = z + 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) :: t_0
    real(8) :: tmp
    t_0 = (x + sin(y)) + (z * cos(y))
    if (t_0 <= (-5d+15)) then
        tmp = z + x
    else if (t_0 <= (-0.0002d0)) then
        tmp = sin(y)
    else if (t_0 <= 5d-11) then
        tmp = (z + y) + x
    else if (t_0 <= 5.0d0) then
        tmp = sin(y)
    else
        tmp = z + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x + Math.sin(y)) + (z * Math.cos(y));
	double tmp;
	if (t_0 <= -5e+15) {
		tmp = z + x;
	} else if (t_0 <= -0.0002) {
		tmp = Math.sin(y);
	} else if (t_0 <= 5e-11) {
		tmp = (z + y) + x;
	} else if (t_0 <= 5.0) {
		tmp = Math.sin(y);
	} else {
		tmp = z + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x + math.sin(y)) + (z * math.cos(y))
	tmp = 0
	if t_0 <= -5e+15:
		tmp = z + x
	elif t_0 <= -0.0002:
		tmp = math.sin(y)
	elif t_0 <= 5e-11:
		tmp = (z + y) + x
	elif t_0 <= 5.0:
		tmp = math.sin(y)
	else:
		tmp = z + x
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x + sin(y)) + Float64(z * cos(y)))
	tmp = 0.0
	if (t_0 <= -5e+15)
		tmp = Float64(z + x);
	elseif (t_0 <= -0.0002)
		tmp = sin(y);
	elseif (t_0 <= 5e-11)
		tmp = Float64(Float64(z + y) + x);
	elseif (t_0 <= 5.0)
		tmp = sin(y);
	else
		tmp = Float64(z + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x + sin(y)) + (z * cos(y));
	tmp = 0.0;
	if (t_0 <= -5e+15)
		tmp = z + x;
	elseif (t_0 <= -0.0002)
		tmp = sin(y);
	elseif (t_0 <= 5e-11)
		tmp = (z + y) + x;
	elseif (t_0 <= 5.0)
		tmp = sin(y);
	else
		tmp = z + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x + N[Sin[y], $MachinePrecision]), $MachinePrecision] + N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e+15], N[(z + x), $MachinePrecision], If[LessEqual[t$95$0, -0.0002], N[Sin[y], $MachinePrecision], If[LessEqual[t$95$0, 5e-11], N[(N[(z + y), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$0, 5.0], N[Sin[y], $MachinePrecision], N[(z + x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 x (sin.f64 y)) (*.f64 z (cos.f64 y))) < -5e15 or 5 < (+.f64 (+.f64 x (sin.f64 y)) (*.f64 z (cos.f64 y)))

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 76.9

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

   4. Applied rewrites 76.9%

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

   if -5e15 < (+.f64 (+.f64 x (sin.f64 y)) (*.f64 z (cos.f64 y))) < -2.0000000000000001e-4 or 5.00000000000000018e-11 < (+.f64 (+.f64 x (sin.f64 y)) (*.f64 z (cos.f64 y))) < 5

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos y, z, \sin y\right) \]

      5. lift-sin.f64 90.5

         \[\leadsto \mathsf{fma}\left(\cos y, z, \sin y\right) \]

   4. Applied rewrites 90.5%

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

   5. Taylor expanded in z around 0

      \[\leadsto \sin y \]
   6. Step-by-step derivation

      1. lift-sin.f64 82.3

         \[\leadsto \sin y \]

   7. Applied rewrites 82.3%

      \[\leadsto \sin y \]

   if -2.0000000000000001e-4 < (+.f64 (+.f64 x (sin.f64 y)) (*.f64 z (cos.f64 y))) < 5.00000000000000018e-11

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 99.8

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

   4. Applied rewrites 99.8%

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

Alternative 6: 80.3% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (sin y) x)))
   (if (<= y -0.085)
     t_0
     (if (<= y 4200000000.0)
       (+ (fma (fma (fma -0.16666666666666666 y (* -0.5 z)) y 1.0) y z) x)
       t_0))))

C

double code(double x, double y, double z) {
	double t_0 = sin(y) + x;
	double tmp;
	if (y <= -0.085) {
		tmp = t_0;
	} else if (y <= 4200000000.0) {
		tmp = fma(fma(fma(-0.16666666666666666, y, (-0.5 * z)), y, 1.0), y, z) + x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(sin(y) + x)
	tmp = 0.0
	if (y <= -0.085)
		tmp = t_0;
	elseif (y <= 4200000000.0)
		tmp = Float64(fma(fma(fma(-0.16666666666666666, y, Float64(-0.5 * z)), y, 1.0), y, z) + x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Sin[y], $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[y, -0.085], t$95$0, If[LessEqual[y, 4200000000.0], N[(N[(N[(N[(-0.16666666666666666 * y + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + 1.0), $MachinePrecision] * y + z), $MachinePrecision] + x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.0850000000000000061 or 4.2e9 < y

   1. Initial program 99.8%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lift-sin.f64 62.0

         \[\leadsto \sin y + x \]

   4. Applied rewrites 62.0%

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

   if -0.0850000000000000061 < y < 4.2e9

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(y \cdot \left(1 + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right)\right) + z\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(1 + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right)\right) \cdot y + z\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right), y, z\right) + x \]

      6. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right) + 1, y, z\right) + x \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right) \cdot y + 1, y, z\right) + x \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y, y, 1\right), y, z\right) + x \]

      9. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6} \cdot y + \frac{-1}{2} \cdot z, y, 1\right), y, z\right) + x \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, y, \frac{-1}{2} \cdot z\right), y, 1\right), y, z\right) + x \]

      11. lower-*.f64 98.8

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, -0.5 \cdot z\right), y, 1\right), y, z\right) + x \]

   4. Applied rewrites 98.8%

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

Alternative 7: 70.7% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.5:\\ \;\;\;\;z + x\\ \mathbf{elif}\;y \leq 2450000000000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, -0.5 \cdot z\right), y, 1\right), y, z\right) + x\\ \mathbf{else}:\\ \;\;\;\;z + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -4.5)
   (+ z x)
   (if (<= y 2450000000000.0)
     (+ (fma (fma (fma -0.16666666666666666 y (* -0.5 z)) y 1.0) y z) x)
     (+ z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.5) {
		tmp = z + x;
	} else if (y <= 2450000000000.0) {
		tmp = fma(fma(fma(-0.16666666666666666, y, (-0.5 * z)), y, 1.0), y, z) + x;
	} else {
		tmp = z + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -4.5)
		tmp = Float64(z + x);
	elseif (y <= 2450000000000.0)
		tmp = Float64(fma(fma(fma(-0.16666666666666666, y, Float64(-0.5 * z)), y, 1.0), y, z) + x);
	else
		tmp = Float64(z + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -4.5], N[(z + x), $MachinePrecision], If[LessEqual[y, 2450000000000.0], N[(N[(N[(N[(-0.16666666666666666 * y + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + 1.0), $MachinePrecision] * y + z), $MachinePrecision] + x), $MachinePrecision], N[(z + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.5 or 2.45e12 < y

   1. Initial program 99.8%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 41.2

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

   4. Applied rewrites 41.2%

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

   if -4.5 < y < 2.45e12

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(y \cdot \left(1 + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right)\right) + z\right) + x \]

      4. *-commutative N/A

         \[\leadsto \left(\left(1 + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right)\right) \cdot y + z\right) + x \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(1 + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right), y, z\right) + x \]

      6. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right) + 1, y, z\right) + x \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y\right) \cdot y + 1, y, z\right) + x \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot y, y, 1\right), y, z\right) + x \]

      9. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6} \cdot y + \frac{-1}{2} \cdot z, y, 1\right), y, z\right) + x \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, y, \frac{-1}{2} \cdot z\right), y, 1\right), y, z\right) + x \]

      11. lower-*.f64 98.4

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, -0.5 \cdot z\right), y, 1\right), y, z\right) + x \]

   4. Applied rewrites 98.4%

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

Alternative 8: 70.6% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.5:\\ \;\;\;\;z + x\\ \mathbf{elif}\;y \leq 2300000000000:\\ \;\;\;\;\mathsf{fma}\left(-\left(0.5 \cdot z - \frac{1}{y}\right) \cdot y, y, z + x\right)\\ \mathbf{else}:\\ \;\;\;\;z + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -4.5)
   (+ z x)
   (if (<= y 2300000000000.0)
     (fma (- (* (- (* 0.5 z) (/ 1.0 y)) y)) y (+ z x))
     (+ z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.5) {
		tmp = z + x;
	} else if (y <= 2300000000000.0) {
		tmp = fma(-(((0.5 * z) - (1.0 / y)) * y), y, (z + x));
	} else {
		tmp = z + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -4.5)
		tmp = Float64(z + x);
	elseif (y <= 2300000000000.0)
		tmp = fma(Float64(-Float64(Float64(Float64(0.5 * z) - Float64(1.0 / y)) * y)), y, Float64(z + x));
	else
		tmp = Float64(z + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -4.5], N[(z + x), $MachinePrecision], If[LessEqual[y, 2300000000000.0], N[((-N[(N[(N[(0.5 * z), $MachinePrecision] - N[(1.0 / y), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]) * y + N[(z + x), $MachinePrecision]), $MachinePrecision], N[(z + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.5 or 2.3e12 < y

   1. Initial program 99.8%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 41.2

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

   4. Applied rewrites 41.2%

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

   if -4.5 < y < 2.3e12

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

         \[\leadsto \left(y \cdot \left(1 + \frac{-1}{2} \cdot \left(y \cdot z\right)\right) + z\right) + x \]

      3. associate-+l+ N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 98.3

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

   4. Applied rewrites 98.3%

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

   5. Taylor expanded in y around -inf

      \[\leadsto \mathsf{fma}\left(-1 \cdot \left(y \cdot \left(\frac{1}{2} \cdot z - \frac{1}{y}\right)\right), y, z + x\right) \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(y \cdot \left(\frac{1}{2} \cdot z - \frac{1}{y}\right)\right), y, z + x\right) \]

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 98.2

         \[\leadsto \mathsf{fma}\left(-\left(0.5 \cdot z - \frac{1}{y}\right) \cdot y, y, z + x\right) \]

   7. Applied rewrites 98.2%

      \[\leadsto \mathsf{fma}\left(-\left(0.5 \cdot z - \frac{1}{y}\right) \cdot y, y, z + x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 70.6% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.5:\\ \;\;\;\;z + x\\ \mathbf{elif}\;y \leq 2300000000000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(z \cdot y, -0.5, 1\right), y, z + x\right)\\ \mathbf{else}:\\ \;\;\;\;z + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -4.5)
   (+ z x)
   (if (<= y 2300000000000.0) (fma (fma (* z y) -0.5 1.0) y (+ z x)) (+ z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.5) {
		tmp = z + x;
	} else if (y <= 2300000000000.0) {
		tmp = fma(fma((z * y), -0.5, 1.0), y, (z + x));
	} else {
		tmp = z + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -4.5)
		tmp = Float64(z + x);
	elseif (y <= 2300000000000.0)
		tmp = fma(fma(Float64(z * y), -0.5, 1.0), y, Float64(z + x));
	else
		tmp = Float64(z + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -4.5], N[(z + x), $MachinePrecision], If[LessEqual[y, 2300000000000.0], N[(N[(N[(z * y), $MachinePrecision] * -0.5 + 1.0), $MachinePrecision] * y + N[(z + x), $MachinePrecision]), $MachinePrecision], N[(z + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.5 or 2.3e12 < y

   1. Initial program 99.8%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 41.2

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

   4. Applied rewrites 41.2%

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

   if -4.5 < y < 2.3e12

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

         \[\leadsto \left(y \cdot \left(1 + \frac{-1}{2} \cdot \left(y \cdot z\right)\right) + z\right) + x \]

      3. associate-+l+ N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 98.3

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

   4. Applied rewrites 98.3%

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

Alternative 10: 70.0% accurate, 3.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+85}:\\ \;\;\;\;z + x\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{+83}:\\ \;\;\;\;\mathsf{fma}\left(-\frac{-1}{y} \cdot y, y, z + x\right)\\ \mathbf{else}:\\ \;\;\;\;z + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -7e+85)
   (+ z x)
   (if (<= y 3.8e+83) (fma (- (* (/ -1.0 y) y)) y (+ z x)) (+ z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -7e+85) {
		tmp = z + x;
	} else if (y <= 3.8e+83) {
		tmp = fma(-((-1.0 / y) * y), y, (z + x));
	} else {
		tmp = z + x;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -7e+85)
		tmp = Float64(z + x);
	elseif (y <= 3.8e+83)
		tmp = fma(Float64(-Float64(Float64(-1.0 / y) * y)), y, Float64(z + x));
	else
		tmp = Float64(z + x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -7e+85], N[(z + x), $MachinePrecision], If[LessEqual[y, 3.8e+83], N[((-N[(N[(-1.0 / y), $MachinePrecision] * y), $MachinePrecision]) * y + N[(z + x), $MachinePrecision]), $MachinePrecision], N[(z + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.0000000000000001e85 or 3.8000000000000002e83 < y

   1. Initial program 99.8%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 41.3

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

   4. Applied rewrites 41.3%

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

   if -7.0000000000000001e85 < y < 3.8000000000000002e83

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

         \[\leadsto \left(y \cdot \left(1 + \frac{-1}{2} \cdot \left(y \cdot z\right)\right) + z\right) + x \]

      3. associate-+l+ N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 84.2

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

   4. Applied rewrites 84.2%

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

   5. Taylor expanded in y around -inf

      \[\leadsto \mathsf{fma}\left(-1 \cdot \left(y \cdot \left(\frac{1}{2} \cdot z - \frac{1}{y}\right)\right), y, z + x\right) \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(y \cdot \left(\frac{1}{2} \cdot z - \frac{1}{y}\right)\right), y, z + x\right) \]

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 84.2

         \[\leadsto \mathsf{fma}\left(-\left(0.5 \cdot z - \frac{1}{y}\right) \cdot y, y, z + x\right) \]

   7. Applied rewrites 84.2%

      \[\leadsto \mathsf{fma}\left(-\left(0.5 \cdot z - \frac{1}{y}\right) \cdot y, y, z + x\right) \]

   8. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(-\frac{-1}{y} \cdot y, y, z + x\right) \]
   9. Step-by-step derivation

      1. lower-/.f64 85.8

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

   10. Applied rewrites 85.8%

       \[\leadsto \mathsf{fma}\left(-\frac{-1}{y} \cdot y, y, z + x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 70.0% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+85}:\\ \;\;\;\;z + x\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{+83}:\\ \;\;\;\;\left(z + y\right) + x\\ \mathbf{else}:\\ \;\;\;\;z + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -7e+85) (+ z x) (if (<= y 3.8e+83) (+ (+ z y) x) (+ z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -7e+85) {
		tmp = z + x;
	} else if (y <= 3.8e+83) {
		tmp = (z + y) + x;
	} else {
		tmp = z + 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 (y <= (-7d+85)) then
        tmp = z + x
    else if (y <= 3.8d+83) then
        tmp = (z + y) + x
    else
        tmp = z + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -7e+85) {
		tmp = z + x;
	} else if (y <= 3.8e+83) {
		tmp = (z + y) + x;
	} else {
		tmp = z + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -7e+85:
		tmp = z + x
	elif y <= 3.8e+83:
		tmp = (z + y) + x
	else:
		tmp = z + x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -7e+85)
		tmp = Float64(z + x);
	elseif (y <= 3.8e+83)
		tmp = Float64(Float64(z + y) + x);
	else
		tmp = Float64(z + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -7e+85)
		tmp = z + x;
	elseif (y <= 3.8e+83)
		tmp = (z + y) + x;
	else
		tmp = z + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -7e+85], N[(z + x), $MachinePrecision], If[LessEqual[y, 3.8e+83], N[(N[(z + y), $MachinePrecision] + x), $MachinePrecision], N[(z + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.0000000000000001e85 or 3.8000000000000002e83 < y

   1. Initial program 99.8%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 41.3

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

   4. Applied rewrites 41.3%

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

   if -7.0000000000000001e85 < y < 3.8000000000000002e83

   1. Initial program 100.0%

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

   2. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 85.8

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

   4. Applied rewrites 85.8%

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

Alternative 12: 66.4% accurate, 19.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

2. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 66.4

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

4. Applied rewrites 66.4%

   \[\leadsto \color{blue}{z + x} \]
5. Add Preprocessing

Alternative 13: 57.0% accurate, 6.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.2e+53) x (if (<= x 2.6e-89) (+ z y) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.2e+53) {
		tmp = x;
	} else if (x <= 2.6e-89) {
		tmp = z + y;
	} else {
		tmp = 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 <= (-1.2d+53)) then
        tmp = x
    else if (x <= 2.6d-89) then
        tmp = z + y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.2e+53) {
		tmp = x;
	} else if (x <= 2.6e-89) {
		tmp = z + y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.2e+53:
		tmp = x
	elif x <= 2.6e-89:
		tmp = z + y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.2e+53)
		tmp = x;
	elseif (x <= 2.6e-89)
		tmp = Float64(z + y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.2e+53)
		tmp = x;
	elseif (x <= 2.6e-89)
		tmp = z + y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.2e+53], x, If[LessEqual[x, 2.6e-89], N[(z + y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.2e53 or 2.5999999999999999e-89 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 68.8%

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

   if -1.2e53 < x < 2.5999999999999999e-89

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos y, z, \sin y\right) \]

      5. lift-sin.f64 88.8

         \[\leadsto \mathsf{fma}\left(\cos y, z, \sin y\right) \]

   4. Applied rewrites 88.8%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

         \[\leadsto z + y \]

      2. lower-+.f64 43.9

         \[\leadsto z + y \]

   7. Applied rewrites 43.9%

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

Alternative 14: 53.8% accurate, 8.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+53}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2.6 \cdot 10^{-89}:\\ \;\;\;\;z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.2e+53) x (if (<= x 2.6e-89) z x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.2e+53) {
		tmp = x;
	} else if (x <= 2.6e-89) {
		tmp = z;
	} else {
		tmp = 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 <= (-1.2d+53)) then
        tmp = x
    else if (x <= 2.6d-89) then
        tmp = z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.2e+53) {
		tmp = x;
	} else if (x <= 2.6e-89) {
		tmp = z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.2e+53:
		tmp = x
	elif x <= 2.6e-89:
		tmp = z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.2e+53)
		tmp = x;
	elseif (x <= 2.6e-89)
		tmp = z;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.2e+53)
		tmp = x;
	elseif (x <= 2.6e-89)
		tmp = z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.2e+53], x, If[LessEqual[x, 2.6e-89], z, x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.2e53 or 2.5999999999999999e-89 < x

   1. Initial program 99.9%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 68.8%

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

   if -1.2e53 < x < 2.5999999999999999e-89

   1. Initial program 99.9%

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

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lift-cos.f64 N/A

         \[\leadsto \mathsf{fma}\left(\cos y, z, \sin y\right) \]

      5. lift-sin.f64 88.8

         \[\leadsto \mathsf{fma}\left(\cos y, z, \sin y\right) \]

   4. Applied rewrites 88.8%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 37.2%

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

Alternative 15: 42.2% accurate, 73.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.9%

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

2. Taylor expanded in x around inf

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

4. Applied rewrites 42.2%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025120 
(FPCore (x y z)
  :name "Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, C"
  :precision binary64
  (+ (+ x (sin y)) (* z (cos y))))