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

Percentage Accurate: 95.9% → 97.9%

Time: 3.8s

Alternatives: 6

Speedup: 0.7×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 10^{-45}:\\ \;\;\;\;x\_m - \left(z \cdot x\_m\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;x\_m - \left(z \cdot y\right) \cdot x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= x_m 1e-45) (- x_m (* (* z x_m) y)) (- x_m (* (* z y) x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 1e-45) {
		tmp = x_m - ((z * x_m) * y);
	} else {
		tmp = x_m - ((z * y) * x_m);
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1d-45) then
        tmp = x_m - ((z * x_m) * y)
    else
        tmp = x_m - ((z * y) * x_m)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 1e-45) {
		tmp = x_m - ((z * x_m) * y);
	} else {
		tmp = x_m - ((z * y) * x_m);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if x_m <= 1e-45:
		tmp = x_m - ((z * x_m) * y)
	else:
		tmp = x_m - ((z * y) * x_m)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 1e-45)
		tmp = Float64(x_m - Float64(Float64(z * x_m) * y));
	else
		tmp = Float64(x_m - Float64(Float64(z * y) * x_m));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (x_m <= 1e-45)
		tmp = x_m - ((z * x_m) * y);
	else
		tmp = x_m - ((z * y) * x_m);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[x$95$m, 1e-45], N[(x$95$m - N[(N[(z * x$95$m), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], N[(x$95$m - N[(N[(z * y), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 9.99999999999999984e-46

   1. Initial program 91.9%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. mul-1-neg N/A

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

      6. associate-*r* N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. mul-1-neg N/A

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

      10. distribute-rgt-neg-in N/A

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

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

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

      12. *-commutative N/A

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

      13. associate-*r* N/A

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

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

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

      15. mul-1-neg N/A

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

      16. lower-fma.f64 N/A

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

      17. mul-1-neg N/A

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

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

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

      19. lower-*.f64 N/A

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

      20. lower-neg.f64 N/A

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

      21. lower-*.f64 94.6

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

   4. Applied rewrites 94.6%

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

      1. lift-*.f64 N/A

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

      2. lift-fma.f64 N/A

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

      3. *-rgt-identity N/A

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

      4. +-commutative N/A

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

      5. lift-neg.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. associate-*l* N/A

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

      8. mul-1-neg N/A

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

      9. *-commutative N/A

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

      10. mul-1-neg N/A

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

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

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

      12. *-commutative N/A

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

      13. *-commutative N/A

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

      14. lower--.f64 N/A

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

      15. *-commutative N/A

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

      16. *-commutative N/A

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

      17. *-commutative N/A

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

      18. associate-*r* N/A

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

      19. lower-*.f64 N/A

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

      20. *-commutative N/A

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

      21. lower-*.f64 94.6

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

   6. Applied rewrites 94.6%

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

   if 9.99999999999999984e-46 < x

   1. Initial program 99.9%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 96.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 10^{-45}:\\ \;\;\;\;x - \left(z \cdot x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;x - \left(z \cdot y\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 96.4% accurate, 0.3× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* y z))) (t_1 (* (* (- x_m) y) z)))
   (*
    x_s
    (if (<= t_0 -2000.0)
      t_1
      (if (<= t_0 2.0) x_m (if (<= t_0 1e+299) (* x_m (* (- y) z)) t_1))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - (y * z);
	double t_1 = (-x_m * y) * z;
	double tmp;
	if (t_0 <= -2000.0) {
		tmp = t_1;
	} else if (t_0 <= 2.0) {
		tmp = x_m;
	} else if (t_0 <= 1e+299) {
		tmp = x_m * (-y * z);
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    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 - (y * z)
    t_1 = (-x_m * y) * z
    if (t_0 <= (-2000.0d0)) then
        tmp = t_1
    else if (t_0 <= 2.0d0) then
        tmp = x_m
    else if (t_0 <= 1d+299) then
        tmp = x_m * (-y * z)
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - (y * z);
	double t_1 = (-x_m * y) * z;
	double tmp;
	if (t_0 <= -2000.0) {
		tmp = t_1;
	} else if (t_0 <= 2.0) {
		tmp = x_m;
	} else if (t_0 <= 1e+299) {
		tmp = x_m * (-y * z);
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = 1.0 - (y * z)
	t_1 = (-x_m * y) * z
	tmp = 0
	if t_0 <= -2000.0:
		tmp = t_1
	elif t_0 <= 2.0:
		tmp = x_m
	elif t_0 <= 1e+299:
		tmp = x_m * (-y * z)
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(1.0 - Float64(y * z))
	t_1 = Float64(Float64(Float64(-x_m) * y) * z)
	tmp = 0.0
	if (t_0 <= -2000.0)
		tmp = t_1;
	elseif (t_0 <= 2.0)
		tmp = x_m;
	elseif (t_0 <= 1e+299)
		tmp = Float64(x_m * Float64(Float64(-y) * z));
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = 1.0 - (y * z);
	t_1 = (-x_m * y) * z;
	tmp = 0.0;
	if (t_0 <= -2000.0)
		tmp = t_1;
	elseif (t_0 <= 2.0)
		tmp = x_m;
	elseif (t_0 <= 1e+299)
		tmp = x_m * (-y * z);
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[((-x$95$m) * y), $MachinePrecision] * z), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$0, -2000.0], t$95$1, If[LessEqual[t$95$0, 2.0], x$95$m, If[LessEqual[t$95$0, 1e+299], N[(x$95$m * N[((-y) * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 83.4%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. mul-1-neg N/A

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

      6. associate-*r* N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. mul-1-neg N/A

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

      10. distribute-rgt-neg-in N/A

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

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

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

      12. *-commutative N/A

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

      13. associate-*r* N/A

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

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

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

      15. mul-1-neg N/A

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

      16. lower-fma.f64 N/A

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

      17. mul-1-neg N/A

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

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

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

      19. lower-*.f64 N/A

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

      20. lower-neg.f64 N/A

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

      21. lower-*.f64 94.5

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

   4. Applied rewrites 94.5%

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

   5. Taylor expanded in y around inf

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

      1. associate-*l* N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. +-commutative N/A

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

      7. associate-*r* N/A

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

      8. mul-1-neg N/A

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

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

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

      10. *-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. associate-*r* N/A

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

      14. lower-*.f64 N/A

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

      15. mul-1-neg N/A

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

      16. distribute-lft-neg-out N/A

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

      17. lift-*.f64 N/A

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

      18. lift-neg.f64 97.0

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

   7. Applied rewrites 97.0%

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

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

   1. Initial program 100.0%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 98.0%

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

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

   1. Initial program 99.7%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 93.3

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

   5. Applied rewrites 93.3%

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

4. Final simplification 96.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 - y \cdot z \leq -2000:\\ \;\;\;\;\left(\left(-x\right) \cdot y\right) \cdot z\\ \mathbf{elif}\;1 - y \cdot z \leq 2:\\ \;\;\;\;x\\ \mathbf{elif}\;1 - y \cdot z \leq 10^{+299}:\\ \;\;\;\;x \cdot \left(\left(-y\right) \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-x\right) \cdot y\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 95.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := 1 - y \cdot z\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq 0.9999999999999987 \lor \neg \left(t\_0 \leq 1.00000005\right):\\ \;\;\;\;x\_m - \left(y \cdot x\_m\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* y z))))
   (*
    x_s
    (if (or (<= t_0 0.9999999999999987) (not (<= t_0 1.00000005)))
      (- x_m (* (* y x_m) z))
      x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - (y * z);
	double tmp;
	if ((t_0 <= 0.9999999999999987) || !(t_0 <= 1.00000005)) {
		tmp = x_m - ((y * x_m) * z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 - (y * z)
    if ((t_0 <= 0.9999999999999987d0) .or. (.not. (t_0 <= 1.00000005d0))) then
        tmp = x_m - ((y * x_m) * z)
    else
        tmp = x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - (y * z);
	double tmp;
	if ((t_0 <= 0.9999999999999987) || !(t_0 <= 1.00000005)) {
		tmp = x_m - ((y * x_m) * z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = 1.0 - (y * z)
	tmp = 0
	if (t_0 <= 0.9999999999999987) or not (t_0 <= 1.00000005):
		tmp = x_m - ((y * x_m) * z)
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(1.0 - Float64(y * z))
	tmp = 0.0
	if ((t_0 <= 0.9999999999999987) || !(t_0 <= 1.00000005))
		tmp = Float64(x_m - Float64(Float64(y * x_m) * z));
	else
		tmp = x_m;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = 1.0 - (y * z);
	tmp = 0.0;
	if ((t_0 <= 0.9999999999999987) || ~((t_0 <= 1.00000005)))
		tmp = x_m - ((y * x_m) * z);
	else
		tmp = x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[Or[LessEqual[t$95$0, 0.9999999999999987], N[Not[LessEqual[t$95$0, 1.00000005]], $MachinePrecision]], N[(x$95$m - N[(N[(y * x$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 89.2%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 89.2

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

   5. Applied rewrites 89.2%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 94.5

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

   7. Applied rewrites 94.5%

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

   if 0.99999999999999867 < (-.f64 #s(literal 1 binary64) (*.f64 y z)) < 1.00000004999999992

   1. Initial program 100.0%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 99.8%

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

4. Final simplification 97.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 - y \cdot z \leq 0.9999999999999987 \lor \neg \left(1 - y \cdot z \leq 1.00000005\right):\\ \;\;\;\;x - \left(y \cdot x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 94.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := 1 - y \cdot z\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -2000 \lor \neg \left(t\_0 \leq 5000\right):\\ \;\;\;\;\left(\left(-x\_m\right) \cdot y\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (- 1.0 (* y z))))
   (*
    x_s
    (if (or (<= t_0 -2000.0) (not (<= t_0 5000.0))) (* (* (- x_m) y) z) x_m))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - (y * z);
	double tmp;
	if ((t_0 <= -2000.0) || !(t_0 <= 5000.0)) {
		tmp = (-x_m * y) * z;
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 - (y * z)
    if ((t_0 <= (-2000.0d0)) .or. (.not. (t_0 <= 5000.0d0))) then
        tmp = (-x_m * y) * z
    else
        tmp = x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = 1.0 - (y * z);
	double tmp;
	if ((t_0 <= -2000.0) || !(t_0 <= 5000.0)) {
		tmp = (-x_m * y) * z;
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = 1.0 - (y * z)
	tmp = 0
	if (t_0 <= -2000.0) or not (t_0 <= 5000.0):
		tmp = (-x_m * y) * z
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(1.0 - Float64(y * z))
	tmp = 0.0
	if ((t_0 <= -2000.0) || !(t_0 <= 5000.0))
		tmp = Float64(Float64(Float64(-x_m) * y) * z);
	else
		tmp = x_m;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = 1.0 - (y * z);
	tmp = 0.0;
	if ((t_0 <= -2000.0) || ~((t_0 <= 5000.0)))
		tmp = (-x_m * y) * z;
	else
		tmp = x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]}, N[(x$95$s * If[Or[LessEqual[t$95$0, -2000.0], N[Not[LessEqual[t$95$0, 5000.0]], $MachinePrecision]], N[(N[((-x$95$m) * y), $MachinePrecision] * z), $MachinePrecision], x$95$m]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 88.6%

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

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

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

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

      5. mul-1-neg N/A

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

      6. associate-*r* N/A

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

      7. +-commutative N/A

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

      8. distribute-lft-in N/A

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

      9. mul-1-neg N/A

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

      10. distribute-rgt-neg-in N/A

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

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

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

      12. *-commutative N/A

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

      13. associate-*r* N/A

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

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

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

      15. mul-1-neg N/A

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

      16. lower-fma.f64 N/A

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

      17. mul-1-neg N/A

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

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

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

      19. lower-*.f64 N/A

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

      20. lower-neg.f64 N/A

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

      21. lower-*.f64 93.9

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

   4. Applied rewrites 93.9%

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

   5. Taylor expanded in y around inf

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

      1. associate-*l* N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-rgt-identity N/A

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

      6. +-commutative N/A

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

      7. associate-*r* N/A

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

      8. mul-1-neg N/A

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

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

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

      10. *-commutative N/A

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

      11. *-commutative N/A

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

      12. associate-*r* N/A

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

      13. associate-*r* N/A

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

      14. lower-*.f64 N/A

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

      15. mul-1-neg N/A

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

      16. distribute-lft-neg-out N/A

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

      17. lift-*.f64 N/A

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

      18. lift-neg.f64 93.0

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

   7. Applied rewrites 93.0%

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

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

   1. Initial program 100.0%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 97.4%

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

4. Final simplification 95.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 - y \cdot z \leq -2000 \lor \neg \left(1 - y \cdot z \leq 5000\right):\\ \;\;\;\;\left(\left(-x\right) \cdot y\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;x\_m \leq 10^{-42}:\\ \;\;\;\;x\_m - \left(y \cdot x\_m\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\_m - \left(z \cdot y\right) \cdot x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (<= x_m 1e-42) (- x_m (* (* y x_m) z)) (- x_m (* (* z y) x_m)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 1e-42) {
		tmp = x_m - ((y * x_m) * z);
	} else {
		tmp = x_m - ((z * y) * x_m);
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x_m <= 1d-42) then
        tmp = x_m - ((y * x_m) * z)
    else
        tmp = x_m - ((z * y) * x_m)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (x_m <= 1e-42) {
		tmp = x_m - ((y * x_m) * z);
	} else {
		tmp = x_m - ((z * y) * x_m);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if x_m <= 1e-42:
		tmp = x_m - ((y * x_m) * z)
	else:
		tmp = x_m - ((z * y) * x_m)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (x_m <= 1e-42)
		tmp = Float64(x_m - Float64(Float64(y * x_m) * z));
	else
		tmp = Float64(x_m - Float64(Float64(z * y) * x_m));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (x_m <= 1e-42)
		tmp = x_m - ((y * x_m) * z);
	else
		tmp = x_m - ((z * y) * x_m);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[x$95$m, 1e-42], N[(x$95$m - N[(N[(y * x$95$m), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(x$95$m - N[(N[(z * y), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1.00000000000000004e-42

   1. Initial program 91.9%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 91.9

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

   5. Applied rewrites 91.9%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-*r* N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 93.2

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

   7. Applied rewrites 93.2%

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

   if 1.00000000000000004e-42 < x

   1. Initial program 99.9%

      \[x \cdot \left(1 - y \cdot z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

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

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

      2. metadata-eval N/A

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

      3. *-lft-identity N/A

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

      4. lower--.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

4. Final simplification 95.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 10^{-42}:\\ \;\;\;\;x - \left(y \cdot x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x - \left(z \cdot y\right) \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 50.9% accurate, 14.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot x\_m \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s x_m))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * x_m;
}

Fortran

x\_m =     private
x\_s =     private
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_s, x_m, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * x_m
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * x_m;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * x_m

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * x_m)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * x_m;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * x$95$m), $MachinePrecision]

Derivation

1. Initial program 94.4%

   \[x \cdot \left(1 - y \cdot z\right) \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 50.8%

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

6. Final simplification 50.8%

   \[\leadsto x \]
7. Add Preprocessing

Reproduce

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