Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J

Percentage Accurate: 96.1% → 99.1%

Time: 2.3s

Alternatives: 10

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y - 1\right) \cdot x\\ \mathbf{if}\;z \leq -4.3 \cdot 10^{+15}:\\ \;\;\;\;t\_0 \cdot z\\ \mathbf{elif}\;z \leq 4 \cdot 10^{-67}:\\ \;\;\;\;x \cdot \left(1 - \left(-y\right) \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t\_0, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- y 1.0) x)))
   (if (<= z -4.3e+15)
     (* t_0 z)
     (if (<= z 4e-67) (* x (- 1.0 (* (- y) z))) (fma t_0 z x)))))

C

double code(double x, double y, double z) {
	double t_0 = (y - 1.0) * x;
	double tmp;
	if (z <= -4.3e+15) {
		tmp = t_0 * z;
	} else if (z <= 4e-67) {
		tmp = x * (1.0 - (-y * z));
	} else {
		tmp = fma(t_0, z, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y - 1.0) * x)
	tmp = 0.0
	if (z <= -4.3e+15)
		tmp = Float64(t_0 * z);
	elseif (z <= 4e-67)
		tmp = Float64(x * Float64(1.0 - Float64(Float64(-y) * z)));
	else
		tmp = fma(t_0, z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(y - 1.0), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -4.3e+15], N[(t$95$0 * z), $MachinePrecision], If[LessEqual[z, 4e-67], N[(x * N[(1.0 - N[((-y) * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(t$95$0 * z + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if z < -4.3e15

   1. Initial program 91.8%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around inf

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

      1. negate-sub N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. mul-1-neg N/A

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

      5. negate-sub N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 91.8

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

   4. Applied rewrites 91.8%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto x \cdot \left(\mathsf{neg}\left(z\right)\right) \]

      2. lower-neg.f64 56.5

         \[\leadsto x \cdot \left(-z\right) \]

   7. Applied rewrites 56.5%

      \[\leadsto x \cdot \left(-z\right) \]

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. negate-sub2 N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. distribute-lft1-in N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. *-commutative N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift--.f64 N/A

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

      16. lift-*.f64 99.9

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

   10. Applied rewrites 99.9%

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

   if -4.3e15 < z < 3.99999999999999977e-67

   1. Initial program 99.9%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 98.3

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

   4. Applied rewrites 98.3%

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

   if 3.99999999999999977e-67 < z

   1. Initial program 93.6%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

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

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

      7. mul-1-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. negate-sub2 N/A

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

      11. +-commutative N/A

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

      12. distribute-lft1-in N/A

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

      13. *-commutative N/A

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

      14. negate-sub2 N/A

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

      15. mul-1-neg N/A

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

      16. *-commutative N/A

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

      17. associate-*r* N/A

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

      18. mul-1-neg N/A

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

      19. negate-sub2 N/A

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

      20. lower-fma.f64 N/A

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

   3. Applied rewrites 99.6%

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

Alternative 2: 98.6% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma (- y 1.0) (* z x) x))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 96.1%

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

   1. lift--.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lower-*.f64 N/A

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

   5. *-commutative N/A

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

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

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

   7. mul-1-neg N/A

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

   8. *-commutative N/A

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

   9. mul-1-neg N/A

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

   10. negate-sub2 N/A

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

   11. +-commutative N/A

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

   12. distribute-lft1-in N/A

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

   13. *-commutative N/A

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

   14. negate-sub2 N/A

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

   15. mul-1-neg N/A

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

   16. *-commutative N/A

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

   17. associate-*r* N/A

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

   18. mul-1-neg N/A

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

   19. negate-sub2 N/A

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

3. Applied rewrites 98.2%

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

Alternative 3: 98.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* (- y 1.0) x) z)))
   (if (<= z -4.3e+15) t_0 (if (<= z 1.0) (* x (- 1.0 (* (- y) z))) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y - 1.0) * x) * z;
	double tmp;
	if (z <= -4.3e+15) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = x * (1.0 - (-y * z));
	} 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 = ((y - 1.0d0) * x) * z
    if (z <= (-4.3d+15)) then
        tmp = t_0
    else if (z <= 1.0d0) then
        tmp = x * (1.0d0 - (-y * z))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = ((y - 1.0) * x) * z;
	double tmp;
	if (z <= -4.3e+15) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = x * (1.0 - (-y * z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((y - 1.0) * x) * z
	tmp = 0
	if z <= -4.3e+15:
		tmp = t_0
	elif z <= 1.0:
		tmp = x * (1.0 - (-y * z))
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(y - 1.0) * x) * z)
	tmp = 0.0
	if (z <= -4.3e+15)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = Float64(x * Float64(1.0 - Float64(Float64(-y) * z)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((y - 1.0) * x) * z;
	tmp = 0.0;
	if (z <= -4.3e+15)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = x * (1.0 - (-y * z));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -4.3e15 or 1 < z

   1. Initial program 92.1%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around inf

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

      1. negate-sub N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. mul-1-neg N/A

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

      5. negate-sub N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 91.5

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

   4. Applied rewrites 91.5%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto x \cdot \left(\mathsf{neg}\left(z\right)\right) \]

      2. lower-neg.f64 55.4

         \[\leadsto x \cdot \left(-z\right) \]

   7. Applied rewrites 55.4%

      \[\leadsto x \cdot \left(-z\right) \]

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. negate-sub2 N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. distribute-lft1-in N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. *-commutative N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift--.f64 N/A

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

      16. lift-*.f64 99.3

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

   10. Applied rewrites 99.3%

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

   if -4.3e15 < z < 1

   1. Initial program 99.9%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 98.1

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

   4. Applied rewrites 98.1%

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

Alternative 4: 97.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* (- y 1.0) x) z)))
   (if (<= z -1.65e-11) t_0 (if (<= z 1.0) (fma y (* z x) x) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((y - 1.0) * x) * z;
	double tmp;
	if (z <= -1.65e-11) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = fma(y, (z * x), x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(y - 1.0) * x) * z)
	tmp = 0.0
	if (z <= -1.65e-11)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = fma(y, Float64(z * x), x);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.6500000000000001e-11 or 1 < z

   1. Initial program 92.4%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around inf

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

      1. negate-sub N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. mul-1-neg N/A

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

      5. negate-sub N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 90.7

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

   4. Applied rewrites 90.7%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto x \cdot \left(\mathsf{neg}\left(z\right)\right) \]

      2. lower-neg.f64 54.2

         \[\leadsto x \cdot \left(-z\right) \]

   7. Applied rewrites 54.2%

      \[\leadsto x \cdot \left(-z\right) \]

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. negate-sub2 N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. distribute-lft1-in N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. *-commutative N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift--.f64 N/A

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

      16. lift-*.f64 98.2

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

   10. Applied rewrites 98.2%

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

   if -1.6500000000000001e-11 < z < 1

   1. Initial program 99.9%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

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

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

      7. mul-1-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. negate-sub2 N/A

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

      11. +-commutative N/A

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

      12. distribute-lft1-in N/A

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

      13. *-commutative N/A

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

      14. negate-sub2 N/A

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

      15. mul-1-neg N/A

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

      16. *-commutative N/A

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

      17. associate-*r* N/A

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

      18. mul-1-neg N/A

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

      19. negate-sub2 N/A

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

   3. Applied rewrites 96.5%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 96.0%

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

Alternative 5: 97.1% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma y (* z x) x)))
   (if (<= y -720000000.0) t_0 (if (<= y 1.0) (* x (- 1.0 z)) t_0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -7.2e8 or 1 < y

   1. Initial program 92.2%

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

      1. lift--.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. *-commutative N/A

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

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

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

      7. mul-1-neg N/A

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

      8. *-commutative N/A

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

      9. mul-1-neg N/A

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

      10. negate-sub2 N/A

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

      11. +-commutative N/A

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

      12. distribute-lft1-in N/A

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

      13. *-commutative N/A

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

      14. negate-sub2 N/A

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

      15. mul-1-neg N/A

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

      16. *-commutative N/A

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

      17. associate-*r* N/A

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

      18. mul-1-neg N/A

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

      19. negate-sub2 N/A

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

   3. Applied rewrites 96.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 95.9%

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

   if -7.2e8 < y < 1

   1. Initial program 100.0%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 98.7%

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

Alternative 6: 85.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;1 - y \leq -1000000000:\\ \;\;\;\;x \cdot \left(z \cdot y\right)\\ \mathbf{elif}\;1 - y \leq 5 \cdot 10^{+103}:\\ \;\;\;\;x \cdot \left(1 - z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x \cdot y\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (- 1.0 y) -1000000000.0)
   (* x (* z y))
   (if (<= (- 1.0 y) 5e+103) (* x (- 1.0 z)) (* (* x y) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -1000000000.0) {
		tmp = x * (z * y);
	} else if ((1.0 - y) <= 5e+103) {
		tmp = x * (1.0 - z);
	} else {
		tmp = (x * y) * z;
	}
	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 ((1.0d0 - y) <= (-1000000000.0d0)) then
        tmp = x * (z * y)
    else if ((1.0d0 - y) <= 5d+103) then
        tmp = x * (1.0d0 - z)
    else
        tmp = (x * y) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((1.0 - y) <= -1000000000.0) {
		tmp = x * (z * y);
	} else if ((1.0 - y) <= 5e+103) {
		tmp = x * (1.0 - z);
	} else {
		tmp = (x * y) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (1.0 - y) <= -1000000000.0:
		tmp = x * (z * y)
	elif (1.0 - y) <= 5e+103:
		tmp = x * (1.0 - z)
	else:
		tmp = (x * y) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -1000000000.0)
		tmp = Float64(x * Float64(z * y));
	elseif (Float64(1.0 - y) <= 5e+103)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = Float64(Float64(x * y) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((1.0 - y) <= -1000000000.0)
		tmp = x * (z * y);
	elseif ((1.0 - y) <= 5e+103)
		tmp = x * (1.0 - z);
	else
		tmp = (x * y) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(1.0 - y), $MachinePrecision], -1000000000.0], N[(x * N[(z * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(1.0 - y), $MachinePrecision], 5e+103], N[(x * N[(1.0 - z), $MachinePrecision]), $MachinePrecision], N[(N[(x * y), $MachinePrecision] * z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -1e9

   1. Initial program 91.3%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 66.6

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

   4. Applied rewrites 66.6%

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

   if -1e9 < (-.f64 #s(literal 1 binary64) y) < 5e103

   1. Initial program 99.4%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 92.1%

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

   if 5e103 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 91.1%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around inf

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

      1. negate-sub N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. mul-1-neg N/A

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

      5. negate-sub N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 75.9

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

   4. Applied rewrites 75.9%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto x \cdot \left(\mathsf{neg}\left(z\right)\right) \]

      2. lower-neg.f64 16.8

         \[\leadsto x \cdot \left(-z\right) \]

   7. Applied rewrites 16.8%

      \[\leadsto x \cdot \left(-z\right) \]

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. negate-sub2 N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. distribute-lft1-in N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. *-commutative N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift--.f64 N/A

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

      16. lift-*.f64 79.1

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

   10. Applied rewrites 79.1%

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

   11. Taylor expanded in y around inf

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

       1. lower-*.f64 79.1

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

   13. Applied rewrites 79.1%

       \[\leadsto \left(x \cdot y\right) \cdot z \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 83.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* x y) z)))
   (if (<= (- 1.0 y) -1000000000.0)
     t_0
     (if (<= (- 1.0 y) 5e+103) (* x (- 1.0 z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x * y) * z;
	double tmp;
	if ((1.0 - y) <= -1000000000.0) {
		tmp = t_0;
	} else if ((1.0 - y) <= 5e+103) {
		tmp = x * (1.0 - z);
	} 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 = (x * y) * z
    if ((1.0d0 - y) <= (-1000000000.0d0)) then
        tmp = t_0
    else if ((1.0d0 - y) <= 5d+103) then
        tmp = x * (1.0d0 - z)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x * y) * z;
	double tmp;
	if ((1.0 - y) <= -1000000000.0) {
		tmp = t_0;
	} else if ((1.0 - y) <= 5e+103) {
		tmp = x * (1.0 - z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x * y) * z
	tmp = 0
	if (1.0 - y) <= -1000000000.0:
		tmp = t_0
	elif (1.0 - y) <= 5e+103:
		tmp = x * (1.0 - z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x * y) * z)
	tmp = 0.0
	if (Float64(1.0 - y) <= -1000000000.0)
		tmp = t_0;
	elseif (Float64(1.0 - y) <= 5e+103)
		tmp = Float64(x * Float64(1.0 - z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x * y) * z;
	tmp = 0.0;
	if ((1.0 - y) <= -1000000000.0)
		tmp = t_0;
	elseif ((1.0 - y) <= 5e+103)
		tmp = x * (1.0 - z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -1e9 or 5e103 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 91.2%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around inf

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

      1. negate-sub N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. mul-1-neg N/A

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

      5. negate-sub N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 70.4

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

   4. Applied rewrites 70.4%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto x \cdot \left(\mathsf{neg}\left(z\right)\right) \]

      2. lower-neg.f64 7.9

         \[\leadsto x \cdot \left(-z\right) \]

   7. Applied rewrites 7.9%

      \[\leadsto x \cdot \left(-z\right) \]

   8. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. cancel-sign-sub-inv N/A

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

      3. negate-sub2 N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. distribute-lft1-in N/A

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

      7. *-commutative N/A

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

      8. associate-*r* N/A

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

      9. *-commutative N/A

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

      10. associate-*l* N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. lower-*.f64 N/A

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

      14. *-commutative N/A

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

      15. lift--.f64 N/A

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

      16. lift-*.f64 75.0

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

   10. Applied rewrites 75.0%

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

   11. Taylor expanded in y around inf

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

       1. lower-*.f64 74.9

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

   13. Applied rewrites 74.9%

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

   if -1e9 < (-.f64 #s(literal 1 binary64) y) < 5e103

   1. Initial program 99.4%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 92.1%

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

Alternative 8: 65.8% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.1%

   \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

2. Taylor expanded in y around 0

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

4. Applied rewrites 65.8%

   \[\leadsto x \cdot \left(1 - \color{blue}{z}\right) \]
5. Add Preprocessing

Alternative 9: 64.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (- z)))) (if (<= z -4.3e+15) t_0 (if (<= z 1.0) x t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * -z;
	double tmp;
	if (z <= -4.3e+15) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = 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 = x * -z
    if (z <= (-4.3d+15)) then
        tmp = t_0
    else if (z <= 1.0d0) then
        tmp = 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 = x * -z;
	double tmp;
	if (z <= -4.3e+15) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * -z
	tmp = 0
	if z <= -4.3e+15:
		tmp = t_0
	elif z <= 1.0:
		tmp = x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(-z))
	tmp = 0.0
	if (z <= -4.3e+15)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = x;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * -z;
	tmp = 0.0;
	if (z <= -4.3e+15)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * (-z)), $MachinePrecision]}, If[LessEqual[z, -4.3e+15], t$95$0, If[LessEqual[z, 1.0], x, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.3e15 or 1 < z

   1. Initial program 92.1%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around inf

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

      1. negate-sub N/A

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

      2. metadata-eval N/A

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

      3. distribute-rgt-in N/A

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

      4. mul-1-neg N/A

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

      5. negate-sub N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 91.5

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

   4. Applied rewrites 91.5%

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

   5. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

         \[\leadsto x \cdot \left(\mathsf{neg}\left(z\right)\right) \]

      2. lower-neg.f64 55.4

         \[\leadsto x \cdot \left(-z\right) \]

   7. Applied rewrites 55.4%

      \[\leadsto x \cdot \left(-z\right) \]

   if -4.3e15 < z < 1

   1. Initial program 99.9%

      \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 73.2%

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

Alternative 10: 39.3% accurate, 12.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 96.1%

   \[x \cdot \left(1 - \left(1 - y\right) \cdot z\right) \]

2. Taylor expanded in z around 0

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

4. Applied rewrites 39.3%

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

Reproduce

herbie shell --seed 2025110 
(FPCore (x y z)
  :name "Data.Colour.RGBSpace.HSV:hsv from colour-2.3.3, J"
  :precision binary64
  (* x (- 1.0 (* (- 1.0 y) z))))