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

Percentage Accurate: 95.9% → 99.6%

Time: 2.8s

Alternatives: 10

Speedup: 0.8×

• 21.4% 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: 95.9% 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.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\left(y - 1\right) \cdot x, z, x\right)\\ \mathbf{if}\;z \leq -3.6 \cdot 10^{-42}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.95 \cdot 10^{-93}:\\ \;\;\;\;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 (fma (* (- y 1.0) x) z x)))
   (if (<= z -3.6e-42)
     t_0
     (if (<= z 1.95e-93) (* x (- 1.0 (* (- y) z))) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(((y - 1.0) * x), z, x);
	double tmp;
	if (z <= -3.6e-42) {
		tmp = t_0;
	} else if (z <= 1.95e-93) {
		tmp = x * (1.0 - (-y * z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(Float64(Float64(y - 1.0) * x), z, x)
	tmp = 0.0
	if (z <= -3.6e-42)
		tmp = t_0;
	elseif (z <= 1.95e-93)
		tmp = Float64(x * Float64(1.0 - Float64(Float64(-y) * z)));
	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 + x), $MachinePrecision]}, If[LessEqual[z, -3.6e-42], t$95$0, If[LessEqual[z, 1.95e-93], N[(x * N[(1.0 - N[((-y) * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6000000000000002e-42 or 1.95000000000000009e-93 < z

   1. Initial program 93.5%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 99.4%

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

   if -3.6000000000000002e-42 < z < 1.95000000000000009e-93

   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 99.9

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

   4. Applied rewrites 99.9%

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

Alternative 2: 98.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 1.5e+28) (fma (* (- y 1.0) x) z x) (fma (- y 1.0) (* z x) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 1.5e+28) {
		tmp = fma(((y - 1.0) * x), z, x);
	} else {
		tmp = fma((y - 1.0), (z * x), x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 1.5e+28)
		tmp = fma(Float64(Float64(y - 1.0) * x), z, x);
	else
		tmp = fma(Float64(y - 1.0), Float64(z * x), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 1.5e28

   1. Initial program 94.7%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 97.6%

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

   if 1.5e28 < x

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y - 1, z \cdot x, x\right)} \]
3. Recombined 2 regimes into one program.
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 -90:\\ \;\;\;\;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 -90.0) 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 <= -90.0) {
		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 <= (-90.0d0)) 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 <= -90.0) {
		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 <= -90.0:
		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 <= -90.0)
		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 <= -90.0)
		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, -90.0], 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 < -90 or 1 < z

   1. Initial program 92.1%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in z around inf

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative 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. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lift--.f64 N/A

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

      12. lift-*.f64 99.1

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

   6. Applied rewrites 99.1%

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

   if -90 < 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.5

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

   4. Applied rewrites 98.5%

      \[\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.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* (- 1.0 y) z))) (t_1 (* (* (- y 1.0) x) z)))
   (if (<= t_0 -2e+14) t_1 (if (<= t_0 2.0) (- x (* z x)) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = 1.0 - ((1.0 - y) * z);
	double t_1 = ((y - 1.0) * x) * z;
	double tmp;
	if (t_0 <= -2e+14) {
		tmp = t_1;
	} else if (t_0 <= 2.0) {
		tmp = x - (z * x);
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = 1.0d0 - ((1.0d0 - y) * z)
    t_1 = ((y - 1.0d0) * x) * z
    if (t_0 <= (-2d+14)) then
        tmp = t_1
    else if (t_0 <= 2.0d0) then
        tmp = x - (z * x)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	t_0 = 1.0 - ((1.0 - y) * z)
	t_1 = ((y - 1.0) * x) * z
	tmp = 0
	if t_0 <= -2e+14:
		tmp = t_1
	elif t_0 <= 2.0:
		tmp = x - (z * x)
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < -2e14 or 2 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z))

   1. Initial program 93.4%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 97.1%

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

   4. Taylor expanded in z around inf

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative 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. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lift--.f64 N/A

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

      12. lift-*.f64 96.5

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

   6. Applied rewrites 96.5%

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

   if -2e14 < (-.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) y) z)) < 2

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 99.1%

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

   4. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-*.f64 96.9

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

   6. Applied rewrites 96.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. mul-1-neg N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-neg-in N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 96.9

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

   8. Applied rewrites 96.9%

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

Alternative 5: 96.7% 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 -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 0.0011:\\ \;\;\;\;x - z \cdot x\\ \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 -1.0) t_0 (if (<= y 0.0011) (- x (* z x)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(y, (z * x), x);
	double tmp;
	if (y <= -1.0) {
		tmp = t_0;
	} else if (y <= 0.0011) {
		tmp = x - (z * x);
	} 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 <= -1.0)
		tmp = t_0;
	elseif (y <= 0.0011)
		tmp = Float64(x - Float64(z * x));
	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, -1.0], t$95$0, If[LessEqual[y, 0.0011], N[(x - N[(z * x), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 0.00110000000000000007 < y

   1. Initial program 91.9%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 96.0%

      \[\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.0%

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

   if -1 < y < 0.00110000000000000007

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-*.f64 99.3

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

   6. Applied rewrites 99.3%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. mul-1-neg N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-neg-in N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 99.3

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

   8. Applied rewrites 99.3%

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

Alternative 6: 95.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 #s(literal 1 binary64) y) < -4e18 or 1.02 < (-.f64 #s(literal 1 binary64) y)

   1. Initial program 91.6%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 92.4%

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

   4. Taylor expanded in y around inf

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

      1. lower-*.f64 91.9

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

   6. Applied rewrites 91.9%

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

   if -4e18 < (-.f64 #s(literal 1 binary64) y) < 1.02

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 100.0%

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

   4. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-*.f64 97.9

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

   6. Applied rewrites 97.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. mul-1-neg N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-neg-in N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 97.9

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

   8. Applied rewrites 97.9%

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

Alternative 7: 85.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* y x) z)))
   (if (<= y -1.55e+90) t_0 (if (<= y 4e+16) (- x (* z x)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (y * x) * z;
	double tmp;
	if (y <= -1.55e+90) {
		tmp = t_0;
	} else if (y <= 4e+16) {
		tmp = x - (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 = (y * x) * z
    if (y <= (-1.55d+90)) then
        tmp = t_0
    else if (y <= 4d+16) then
        tmp = x - (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 = (y * x) * z;
	double tmp;
	if (y <= -1.55e+90) {
		tmp = t_0;
	} else if (y <= 4e+16) {
		tmp = x - (z * x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (y * x) * z
	tmp = 0
	if y <= -1.55e+90:
		tmp = t_0
	elif y <= 4e+16:
		tmp = x - (z * x)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(y * x) * z)
	tmp = 0.0
	if (y <= -1.55e+90)
		tmp = t_0;
	elseif (y <= 4e+16)
		tmp = Float64(x - Float64(z * x));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (y * x) * z;
	tmp = 0.0;
	if (y <= -1.55e+90)
		tmp = t_0;
	elseif (y <= 4e+16)
		tmp = x - (z * x);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.54999999999999994e90 or 4e16 < y

   1. Initial program 90.7%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 91.4%

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

   4. Taylor expanded in z around inf

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

      1. associate-*l* N/A

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

      2. *-commutative N/A

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

      3. *-commutative 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. associate-*r* N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lift--.f64 N/A

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

      12. lift-*.f64 75.6

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

   6. Applied rewrites 75.6%

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

   7. Taylor expanded in y around inf

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

   9. Applied rewrites 75.6%

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

   if -1.54999999999999994e90 < y < 4e16

   1. Initial program 99.5%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

         \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-*.f64 92.7

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

   6. Applied rewrites 92.7%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-neg.f64 N/A

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

      4. mul-1-neg N/A

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

      5. +-commutative N/A

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

      6. mul-1-neg N/A

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

      7. distribute-lft-neg-in N/A

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

      8. fp-cancel-sub-sign N/A

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

      9. lower--.f64 N/A

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

      10. *-commutative N/A

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

      11. lift-*.f64 92.7

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

   8. Applied rewrites 92.7%

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

Alternative 8: 66.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ x - z \cdot x \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 95.9%

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

   1. lift-*.f64 N/A

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

   2. lift--.f64 N/A

      \[\leadsto x \cdot \color{blue}{\left(1 - \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. lift--.f64 N/A

      \[\leadsto x \cdot \left(1 - \color{blue}{\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} \]

3. Applied rewrites 98.0%

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

4. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. mul-1-neg N/A

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

   4. lower-neg.f64 N/A

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

   5. lower-*.f64 66.1

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

6. Applied rewrites 66.1%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-neg.f64 N/A

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

   4. mul-1-neg N/A

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

   5. +-commutative N/A

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

   6. mul-1-neg N/A

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

   7. distribute-lft-neg-in N/A

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

   8. fp-cancel-sub-sign N/A

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

   9. lower--.f64 N/A

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

   10. *-commutative N/A

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

   11. lift-*.f64 66.1

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

8. Applied rewrites 66.1%

   \[\leadsto \color{blue}{x - z \cdot x} \]
9. Add Preprocessing

Alternative 9: 65.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

def code(x, y, z):
	t_0 = x * -z
	tmp = 0
	if z <= -1.0:
		tmp = t_0
	elif z <= 0.0055:
		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 <= -1.0)
		tmp = t_0;
	elseif (z <= 0.0055)
		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 <= -1.0)
		tmp = t_0;
	elseif (z <= 0.0055)
		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, -1.0], t$95$0, If[LessEqual[z, 0.0055], x, t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1 or 0.0054999999999999997 < z

   1. Initial program 92.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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 91.0

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

   4. Applied rewrites 91.0%

      \[\leadsto x \cdot \color{blue}{\left(\left(y - 1\right) \cdot 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.9

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

   7. Applied rewrites 55.9%

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

   if -1 < z < 0.0054999999999999997

   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 74.7%

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

Alternative 10: 38.2% 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 95.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 38.2%

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

Reproduce

herbie shell --seed 2025120 
(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))))