Graphics.Rendering.Chart.Plot.AreaSpots:renderAreaSpots4D from Chart-1.5.3

Percentage Accurate: 84.7% → 97.2%

Time: 3.7s

Alternatives: 15

Speedup: 1.0×

Specification

Math

\[\frac{x \cdot \left(y - z\right)}{t - z} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return (x * (y - z)) / (t - 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * (y - z)) / (t - z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.7% accurate, 1.0× speedup

Math

\[\frac{x \cdot \left(y - z\right)}{t - z} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return (x * (y - z)) / (t - 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (x * (y - z)) / (t - z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.2% accurate, 0.5× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 3.6 \cdot 10^{-56}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y, \left|x\right|, \left(-\left|x\right|\right) \cdot z\right)}{t - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left|x\right|}{z - t} \cdot \left(z - y\right)\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (*
 (copysign 1.0 x)
 (if (<= (fabs x) 3.6e-56)
   (/ (fma y (fabs x) (* (- (fabs x)) z)) (- t z))
   (* (/ (fabs x) (- z t)) (- z y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (fabs(x) <= 3.6e-56) {
		tmp = fma(y, fabs(x), (-fabs(x) * z)) / (t - z);
	} else {
		tmp = (fabs(x) / (z - t)) * (z - y);
	}
	return copysign(1.0, x) * tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (abs(x) <= 3.6e-56)
		tmp = Float64(fma(y, abs(x), Float64(Float64(-abs(x)) * z)) / Float64(t - z));
	else
		tmp = Float64(Float64(abs(x) / Float64(z - t)) * Float64(z - y));
	end
	return Float64(copysign(1.0, x) * tmp)
end

Wolfram

code[x_, y_, z_, t_] := N[(N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 3.6e-56], N[(N[(y * N[Abs[x], $MachinePrecision] + N[((-N[Abs[x], $MachinePrecision]) * z), $MachinePrecision]), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], N[(N[(N[Abs[x], $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(z - y), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 3.5999999999999998e-56

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-flip N/A

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

      4. distribute-rgt-in N/A

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

      5. lower-fma.f64 N/A

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

      6. *-commutative N/A

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

      7. distribute-rgt-neg-out N/A

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

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

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

      9. lower-*.f64 N/A

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

      10. lower-neg.f64 84.2%

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

   3. Applied rewrites 84.2%

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

   if 3.5999999999999998e-56 < x

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

Alternative 2: 96.4% accurate, 0.5× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 3.6 \cdot 10^{-56}:\\ \;\;\;\;\frac{y \cdot \left|x\right| - z \cdot \left|x\right|}{t - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left|x\right|}{z - t} \cdot \left(z - y\right)\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (*
 (copysign 1.0 x)
 (if (<= (fabs x) 3.6e-56)
   (/ (- (* y (fabs x)) (* z (fabs x))) (- t z))
   (* (/ (fabs x) (- z t)) (- z y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (fabs(x) <= 3.6e-56) {
		tmp = ((y * fabs(x)) - (z * fabs(x))) / (t - z);
	} else {
		tmp = (fabs(x) / (z - t)) * (z - y);
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (Math.abs(x) <= 3.6e-56) {
		tmp = ((y * Math.abs(x)) - (z * Math.abs(x))) / (t - z);
	} else {
		tmp = (Math.abs(x) / (z - t)) * (z - y);
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if math.fabs(x) <= 3.6e-56:
		tmp = ((y * math.fabs(x)) - (z * math.fabs(x))) / (t - z)
	else:
		tmp = (math.fabs(x) / (z - t)) * (z - y)
	return math.copysign(1.0, x) * tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (abs(x) <= 3.6e-56)
		tmp = Float64(Float64(Float64(y * abs(x)) - Float64(z * abs(x))) / Float64(t - z));
	else
		tmp = Float64(Float64(abs(x) / Float64(z - t)) * Float64(z - y));
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (abs(x) <= 3.6e-56)
		tmp = ((y * abs(x)) - (z * abs(x))) / (t - z);
	else
		tmp = (abs(x) / (z - t)) * (z - y);
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 3.6e-56], N[(N[(N[(y * N[Abs[x], $MachinePrecision]), $MachinePrecision] - N[(z * N[Abs[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], N[(N[(N[Abs[x], $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(z - y), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 3.5999999999999998e-56

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-flip N/A

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

      4. distribute-rgt-in N/A

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

      5. add-flip N/A

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

      6. lower--.f64 N/A

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

      7. lower-*.f64 N/A

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

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

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

      9. remove-double-neg N/A

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

      10. lower-*.f64 84.1%

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

   3. Applied rewrites 84.1%

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

   if 3.5999999999999998e-56 < x

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

Alternative 3: 96.4% accurate, 0.5× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 3.6 \cdot 10^{-56}:\\ \;\;\;\;\frac{\left|x\right| \cdot \left(y - z\right)}{t - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left|x\right|}{z - t} \cdot \left(z - y\right)\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (*
 (copysign 1.0 x)
 (if (<= (fabs x) 3.6e-56)
   (/ (* (fabs x) (- y z)) (- t z))
   (* (/ (fabs x) (- z t)) (- z y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (fabs(x) <= 3.6e-56) {
		tmp = (fabs(x) * (y - z)) / (t - z);
	} else {
		tmp = (fabs(x) / (z - t)) * (z - y);
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (Math.abs(x) <= 3.6e-56) {
		tmp = (Math.abs(x) * (y - z)) / (t - z);
	} else {
		tmp = (Math.abs(x) / (z - t)) * (z - y);
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if math.fabs(x) <= 3.6e-56:
		tmp = (math.fabs(x) * (y - z)) / (t - z)
	else:
		tmp = (math.fabs(x) / (z - t)) * (z - y)
	return math.copysign(1.0, x) * tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (abs(x) <= 3.6e-56)
		tmp = Float64(Float64(abs(x) * Float64(y - z)) / Float64(t - z));
	else
		tmp = Float64(Float64(abs(x) / Float64(z - t)) * Float64(z - y));
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (abs(x) <= 3.6e-56)
		tmp = (abs(x) * (y - z)) / (t - z);
	else
		tmp = (abs(x) / (z - t)) * (z - y);
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_, y_, z_, t_] := N[(N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 3.6e-56], N[(N[(N[Abs[x], $MachinePrecision] * N[(y - z), $MachinePrecision]), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], N[(N[(N[Abs[x], $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(z - y), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 3.5999999999999998e-56

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   if 3.5999999999999998e-56 < x

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

Alternative 4: 96.4% accurate, 1.0× speedup

Math

\[\frac{z - y}{z - t} \cdot x \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((z - y) / (z - t)) * 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((z - y) / (z - t)) * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.7%

   \[\frac{x \cdot \left(y - z\right)}{t - z} \]
2. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lift--.f64 N/A

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

   7. sub-negate-rev N/A

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

   8. distribute-frac-neg N/A

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

   9. distribute-neg-frac2 N/A

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

   10. lower-/.f64 N/A

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

   11. lower--.f64 N/A

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

   12. lift--.f64 N/A

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

   13. sub-negate-rev N/A

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

   14. lower--.f64 97.2%

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

3. Applied rewrites 97.2%

   \[\leadsto \color{blue}{\frac{z - y}{z - t} \cdot x} \]
4. Add Preprocessing

Alternative 5: 89.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \frac{z}{z - t} \cdot x\\ \mathbf{if}\;z \leq -3.6 \cdot 10^{+145}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{+81}:\\ \;\;\;\;\frac{x}{z - t} \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ z (- z t)) x)))
  (if (<= z -3.6e+145)
    t_1
    (if (<= z 1.1e+81) (* (/ x (- z t)) (- z y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -3.6e+145) {
		tmp = t_1;
	} else if (z <= 1.1e+81) {
		tmp = (x / (z - t)) * (z - y);
	} 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z / (z - t)) * x
    if (z <= (-3.6d+145)) then
        tmp = t_1
    else if (z <= 1.1d+81) then
        tmp = (x / (z - t)) * (z - y)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -3.6e+145) {
		tmp = t_1;
	} else if (z <= 1.1e+81) {
		tmp = (x / (z - t)) * (z - y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z / (z - t)) * x
	tmp = 0
	if z <= -3.6e+145:
		tmp = t_1
	elif z <= 1.1e+81:
		tmp = (x / (z - t)) * (z - y)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z / Float64(z - t)) * x)
	tmp = 0.0
	if (z <= -3.6e+145)
		tmp = t_1;
	elseif (z <= 1.1e+81)
		tmp = Float64(Float64(x / Float64(z - t)) * Float64(z - y));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / (z - t)) * x;
	tmp = 0.0;
	if (z <= -3.6e+145)
		tmp = t_1;
	elseif (z <= 1.1e+81)
		tmp = (x / (z - t)) * (z - y);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / N[(z - t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -3.6e+145], t$95$1, If[LessEqual[z, 1.1e+81], N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(z - y), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.5999999999999997e145 or 1.0999999999999999e81 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

   4. Taylor expanded in y around 0

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   5. Step-by-step derivation

   6. Applied rewrites 46.4%

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. mult-flip N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 54.5%

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

   8. Applied rewrites 54.5%

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

   if -3.5999999999999997e145 < z < 1.0999999999999999e81

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

Alternative 6: 82.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \frac{y - z}{t} \cdot x\\ \mathbf{if}\;t \leq -1.95 \cdot 10^{+56}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 4.9 \cdot 10^{+128}:\\ \;\;\;\;\left(1 - \frac{y}{z - t}\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ (- y z) t) x)))
  (if (<= t -1.95e+56)
    t_1
    (if (<= t 4.9e+128) (* (- 1.0 (/ y (- z t))) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((y - z) / t) * x;
	double tmp;
	if (t <= -1.95e+56) {
		tmp = t_1;
	} else if (t <= 4.9e+128) {
		tmp = (1.0 - (y / (z - t))) * 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((y - z) / t) * x
    if (t <= (-1.95d+56)) then
        tmp = t_1
    else if (t <= 4.9d+128) then
        tmp = (1.0d0 - (y / (z - t))) * x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((y - z) / t) * x;
	double tmp;
	if (t <= -1.95e+56) {
		tmp = t_1;
	} else if (t <= 4.9e+128) {
		tmp = (1.0 - (y / (z - t))) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((y - z) / t) * x
	tmp = 0
	if t <= -1.95e+56:
		tmp = t_1
	elif t <= 4.9e+128:
		tmp = (1.0 - (y / (z - t))) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(y - z) / t) * x)
	tmp = 0.0
	if (t <= -1.95e+56)
		tmp = t_1;
	elseif (t <= 4.9e+128)
		tmp = Float64(Float64(1.0 - Float64(y / Float64(z - t))) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((y - z) / t) * x;
	tmp = 0.0;
	if (t <= -1.95e+56)
		tmp = t_1;
	elseif (t <= 4.9e+128)
		tmp = (1.0 - (y / (z - t))) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(y - z), $MachinePrecision] / t), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t, -1.95e+56], t$95$1, If[LessEqual[t, 4.9e+128], N[(N[(1.0 - N[(y / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -1.95e56 or 4.9000000000000002e128 < t

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-flip N/A

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

      4. distribute-rgt-in N/A

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

      5. add-flip N/A

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

      6. lower--.f64 N/A

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

      7. lower-*.f64 N/A

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

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

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

      9. remove-double-neg N/A

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

      10. lower-*.f64 84.1%

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

   3. Applied rewrites 84.1%

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

   4. Taylor expanded in z around 0

      \[\leadsto \frac{y \cdot x - z \cdot x}{\color{blue}{t}} \]
   5. Step-by-step derivation

   6. Applied rewrites 47.4%

      \[\leadsto \frac{y \cdot x - z \cdot x}{\color{blue}{t}} \]
   7. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. distribute-rgt-out-- N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 50.6%

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

   8. Applied rewrites 50.6%

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

   if -1.95e56 < t < 4.9000000000000002e128

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. sub-flip N/A

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

      5. distribute-rgt-in N/A

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

      6. div-add N/A

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

      7. associate-*l/ N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. associate-*l/ N/A

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

      11. lower-*.f64 N/A

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

      12. frac-2neg N/A

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

      13. remove-double-neg N/A

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

      14. lower-/.f64 N/A

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

      15. lift--.f64 N/A

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

      16. sub-negate-rev N/A

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

      17. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 66.1%

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

      1. lift-fma.f64 N/A

         \[\leadsto \color{blue}{\frac{y}{t - z} \cdot x + 1 \cdot x} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{y}{t - z} \cdot x + \color{blue}{1 \cdot x} \]

      3. distribute-rgt-out N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. +-commutative N/A

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

      7. add-flip N/A

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

      8. lift-/.f64 N/A

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

      9. distribute-frac-neg2 N/A

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

      10. lift--.f64 N/A

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

      11. sub-negate-rev N/A

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

      12. lift--.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower-/.f64 66.1%

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

   8. Applied rewrites 66.1%

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

Alternative 7: 75.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} t_1 := \frac{z}{z - t} \cdot x\\ \mathbf{if}\;z \leq -2.9 \cdot 10^{-10}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 3 \cdot 10^{+18}:\\ \;\;\;\;\frac{x \cdot y}{t - z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ z (- z t)) x)))
  (if (<= z -2.9e-10) t_1 (if (<= z 3e+18) (/ (* x y) (- t z)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -2.9e-10) {
		tmp = t_1;
	} else if (z <= 3e+18) {
		tmp = (x * y) / (t - z);
	} 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z / (z - t)) * x
    if (z <= (-2.9d-10)) then
        tmp = t_1
    else if (z <= 3d+18) then
        tmp = (x * y) / (t - z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -2.9e-10) {
		tmp = t_1;
	} else if (z <= 3e+18) {
		tmp = (x * y) / (t - z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z / (z - t)) * x
	tmp = 0
	if z <= -2.9e-10:
		tmp = t_1
	elif z <= 3e+18:
		tmp = (x * y) / (t - z)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z / Float64(z - t)) * x)
	tmp = 0.0
	if (z <= -2.9e-10)
		tmp = t_1;
	elseif (z <= 3e+18)
		tmp = Float64(Float64(x * y) / Float64(t - z));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / (z - t)) * x;
	tmp = 0.0;
	if (z <= -2.9e-10)
		tmp = t_1;
	elseif (z <= 3e+18)
		tmp = (x * y) / (t - z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / N[(z - t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -2.9e-10], t$95$1, If[LessEqual[z, 3e+18], N[(N[(x * y), $MachinePrecision] / N[(t - z), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.8999999999999998e-10 or 3e18 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

   4. Taylor expanded in y around 0

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   5. Step-by-step derivation

   6. Applied rewrites 46.4%

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. mult-flip N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 54.5%

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

   8. Applied rewrites 54.5%

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

   if -2.8999999999999998e-10 < z < 3e18

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in y around inf

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

      1. lower-*.f64 50.4%

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

   4. Applied rewrites 50.4%

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

Alternative 8: 72.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} t_1 := \frac{z}{z - t} \cdot x\\ \mathbf{if}\;z \leq -6.2 \cdot 10^{+112}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.35 \cdot 10^{+36}:\\ \;\;\;\;\frac{y - z}{t} \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ z (- z t)) x)))
  (if (<= z -6.2e+112)
    t_1
    (if (<= z 1.35e+36) (* (/ (- y z) t) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -6.2e+112) {
		tmp = t_1;
	} else if (z <= 1.35e+36) {
		tmp = ((y - z) / t) * 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z / (z - t)) * x
    if (z <= (-6.2d+112)) then
        tmp = t_1
    else if (z <= 1.35d+36) then
        tmp = ((y - z) / t) * x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -6.2e+112) {
		tmp = t_1;
	} else if (z <= 1.35e+36) {
		tmp = ((y - z) / t) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z / (z - t)) * x
	tmp = 0
	if z <= -6.2e+112:
		tmp = t_1
	elif z <= 1.35e+36:
		tmp = ((y - z) / t) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z / Float64(z - t)) * x)
	tmp = 0.0
	if (z <= -6.2e+112)
		tmp = t_1;
	elseif (z <= 1.35e+36)
		tmp = Float64(Float64(Float64(y - z) / t) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / (z - t)) * x;
	tmp = 0.0;
	if (z <= -6.2e+112)
		tmp = t_1;
	elseif (z <= 1.35e+36)
		tmp = ((y - z) / t) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / N[(z - t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -6.2e+112], t$95$1, If[LessEqual[z, 1.35e+36], N[(N[(N[(y - z), $MachinePrecision] / t), $MachinePrecision] * x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -6.1999999999999997e112 or 1.35e36 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

   4. Taylor expanded in y around 0

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   5. Step-by-step derivation

   6. Applied rewrites 46.4%

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. mult-flip N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 54.5%

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

   8. Applied rewrites 54.5%

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

   if -6.1999999999999997e112 < z < 1.35e36

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-flip N/A

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

      4. distribute-rgt-in N/A

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

      5. add-flip N/A

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

      6. lower--.f64 N/A

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

      7. lower-*.f64 N/A

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

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

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

      9. remove-double-neg N/A

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

      10. lower-*.f64 84.1%

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

   3. Applied rewrites 84.1%

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

   4. Taylor expanded in z around 0

      \[\leadsto \frac{y \cdot x - z \cdot x}{\color{blue}{t}} \]
   5. Step-by-step derivation

   6. Applied rewrites 47.4%

      \[\leadsto \frac{y \cdot x - z \cdot x}{\color{blue}{t}} \]
   7. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. distribute-rgt-out-- N/A

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

      7. associate-*l* N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. mult-flip-rev N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 50.6%

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

   8. Applied rewrites 50.6%

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

Alternative 9: 69.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \frac{z}{z - t} \cdot x\\ \mathbf{if}\;z \leq -3.1 \cdot 10^{-22}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{-84}:\\ \;\;\;\;\frac{x}{t} \cdot y\\ \mathbf{elif}\;z \leq 2.1 \cdot 10^{+19}:\\ \;\;\;\;\frac{z - y}{z} \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ z (- z t)) x)))
  (if (<= z -3.1e-22)
    t_1
    (if (<= z 4.2e-84)
      (* (/ x t) y)
      (if (<= z 2.1e+19) (* (/ (- z y) z) x) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -3.1e-22) {
		tmp = t_1;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} else if (z <= 2.1e+19) {
		tmp = ((z - y) / 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (z / (z - t)) * x
    if (z <= (-3.1d-22)) then
        tmp = t_1
    else if (z <= 4.2d-84) then
        tmp = (x / t) * y
    else if (z <= 2.1d+19) then
        tmp = ((z - y) / 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) {
	double t_1 = (z / (z - t)) * x;
	double tmp;
	if (z <= -3.1e-22) {
		tmp = t_1;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} else if (z <= 2.1e+19) {
		tmp = ((z - y) / z) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z / (z - t)) * x
	tmp = 0
	if z <= -3.1e-22:
		tmp = t_1
	elif z <= 4.2e-84:
		tmp = (x / t) * y
	elif z <= 2.1e+19:
		tmp = ((z - y) / z) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z / Float64(z - t)) * x)
	tmp = 0.0
	if (z <= -3.1e-22)
		tmp = t_1;
	elseif (z <= 4.2e-84)
		tmp = Float64(Float64(x / t) * y);
	elseif (z <= 2.1e+19)
		tmp = Float64(Float64(Float64(z - y) / z) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z / (z - t)) * x;
	tmp = 0.0;
	if (z <= -3.1e-22)
		tmp = t_1;
	elseif (z <= 4.2e-84)
		tmp = (x / t) * y;
	elseif (z <= 2.1e+19)
		tmp = ((z - y) / z) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / N[(z - t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -3.1e-22], t$95$1, If[LessEqual[z, 4.2e-84], N[(N[(x / t), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[z, 2.1e+19], N[(N[(N[(z - y), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.1000000000000001e-22 or 2.1e19 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

   4. Taylor expanded in y around 0

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   5. Step-by-step derivation

   6. Applied rewrites 46.4%

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. *-commutative N/A

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

      9. mult-flip N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 54.5%

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

   8. Applied rewrites 54.5%

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

   if -3.1000000000000001e-22 < z < 4.2e-84

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lower-*.f64 37.8%

         \[\leadsto \frac{x \cdot y}{t} \]

   4. Applied rewrites 37.8%

      \[\leadsto \color{blue}{\frac{x \cdot y}{t}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. mult-flip-rev N/A

         \[\leadsto \frac{x}{t} \cdot y \]

      9. lower-/.f64 37.6%

         \[\leadsto \frac{x}{t} \cdot y \]

   6. Applied rewrites 37.6%

      \[\leadsto \frac{x}{t} \cdot \color{blue}{y} \]

   if 4.2e-84 < z < 2.1e19

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. distribute-frac-neg N/A

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

      9. distribute-neg-frac2 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 35.1%

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

   7. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{z - y}{z}} \cdot x \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower--.f64 52.5%

         \[\leadsto \frac{z - y}{z} \cdot x \]

   9. Applied rewrites 52.5%

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

Alternative 10: 69.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} t_1 := \frac{z - y}{z} \cdot x\\ \mathbf{if}\;z \leq -9.2 \cdot 10^{+222}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -3.1 \cdot 10^{-22}:\\ \;\;\;\;\frac{x}{z - t} \cdot z\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{-84}:\\ \;\;\;\;\frac{x}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ (- z y) z) x)))
  (if (<= z -9.2e+222)
    t_1
    (if (<= z -3.1e-22)
      (* (/ x (- z t)) z)
      (if (<= z 4.2e-84) (* (/ x t) y) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((z - y) / z) * x;
	double tmp;
	if (z <= -9.2e+222) {
		tmp = t_1;
	} else if (z <= -3.1e-22) {
		tmp = (x / (z - t)) * z;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((z - y) / z) * x
    if (z <= (-9.2d+222)) then
        tmp = t_1
    else if (z <= (-3.1d-22)) then
        tmp = (x / (z - t)) * z
    else if (z <= 4.2d-84) then
        tmp = (x / t) * y
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((z - y) / z) * x;
	double tmp;
	if (z <= -9.2e+222) {
		tmp = t_1;
	} else if (z <= -3.1e-22) {
		tmp = (x / (z - t)) * z;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((z - y) / z) * x
	tmp = 0
	if z <= -9.2e+222:
		tmp = t_1
	elif z <= -3.1e-22:
		tmp = (x / (z - t)) * z
	elif z <= 4.2e-84:
		tmp = (x / t) * y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(z - y) / z) * x)
	tmp = 0.0
	if (z <= -9.2e+222)
		tmp = t_1;
	elseif (z <= -3.1e-22)
		tmp = Float64(Float64(x / Float64(z - t)) * z);
	elseif (z <= 4.2e-84)
		tmp = Float64(Float64(x / t) * y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((z - y) / z) * x;
	tmp = 0.0;
	if (z <= -9.2e+222)
		tmp = t_1;
	elseif (z <= -3.1e-22)
		tmp = (x / (z - t)) * z;
	elseif (z <= 4.2e-84)
		tmp = (x / t) * y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(z - y), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -9.2e+222], t$95$1, If[LessEqual[z, -3.1e-22], N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[z, 4.2e-84], N[(N[(x / t), $MachinePrecision] * y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.2000000000000004e222 or 4.2e-84 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. distribute-frac-neg N/A

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

      9. distribute-neg-frac2 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 35.1%

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

   7. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{z - y}{z}} \cdot x \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower--.f64 52.5%

         \[\leadsto \frac{z - y}{z} \cdot x \]

   9. Applied rewrites 52.5%

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

   if -9.2000000000000004e222 < z < -3.1000000000000001e-22

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

   4. Taylor expanded in y around 0

      \[\leadsto \frac{x}{z - t} \cdot \color{blue}{z} \]
   5. Step-by-step derivation

   6. Applied rewrites 46.4%

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

   if -3.1000000000000001e-22 < z < 4.2e-84

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lower-*.f64 37.8%

         \[\leadsto \frac{x \cdot y}{t} \]

   4. Applied rewrites 37.8%

      \[\leadsto \color{blue}{\frac{x \cdot y}{t}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. mult-flip-rev N/A

         \[\leadsto \frac{x}{t} \cdot y \]

      9. lower-/.f64 37.6%

         \[\leadsto \frac{x}{t} \cdot y \]

   6. Applied rewrites 37.6%

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

Alternative 11: 66.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} t_1 := \frac{z - y}{z} \cdot x\\ \mathbf{if}\;z \leq -3.7 \cdot 10^{-22}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{-84}:\\ \;\;\;\;\frac{x}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (* (/ (- z y) z) x)))
  (if (<= z -3.7e-22) t_1 (if (<= z 4.2e-84) (* (/ x t) y) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((z - y) / z) * x;
	double tmp;
	if (z <= -3.7e-22) {
		tmp = t_1;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((z - y) / z) * x
    if (z <= (-3.7d-22)) then
        tmp = t_1
    else if (z <= 4.2d-84) then
        tmp = (x / t) * y
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((z - y) / z) * x;
	double tmp;
	if (z <= -3.7e-22) {
		tmp = t_1;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((z - y) / z) * x
	tmp = 0
	if z <= -3.7e-22:
		tmp = t_1
	elif z <= 4.2e-84:
		tmp = (x / t) * y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(z - y) / z) * x)
	tmp = 0.0
	if (z <= -3.7e-22)
		tmp = t_1;
	elseif (z <= 4.2e-84)
		tmp = Float64(Float64(x / t) * y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((z - y) / z) * x;
	tmp = 0.0;
	if (z <= -3.7e-22)
		tmp = t_1;
	elseif (z <= 4.2e-84)
		tmp = (x / t) * y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(z - y), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -3.7e-22], t$95$1, If[LessEqual[z, 4.2e-84], N[(N[(x / t), $MachinePrecision] * y), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.7e-22 or 4.2e-84 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. distribute-frac-neg N/A

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

      9. distribute-neg-frac2 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 35.1%

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

   7. Taylor expanded in t around 0

      \[\leadsto \color{blue}{\frac{z - y}{z}} \cdot x \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

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

      2. lower--.f64 52.5%

         \[\leadsto \frac{z - y}{z} \cdot x \]

   9. Applied rewrites 52.5%

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

   if -3.7e-22 < z < 4.2e-84

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lower-*.f64 37.8%

         \[\leadsto \frac{x \cdot y}{t} \]

   4. Applied rewrites 37.8%

      \[\leadsto \color{blue}{\frac{x \cdot y}{t}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. mult-flip-rev N/A

         \[\leadsto \frac{x}{t} \cdot y \]

      9. lower-/.f64 37.6%

         \[\leadsto \frac{x}{t} \cdot y \]

   6. Applied rewrites 37.6%

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

Alternative 12: 64.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} t_1 := \frac{x \cdot \left(z - y\right)}{z}\\ \mathbf{if}\;z \leq -2.25 \cdot 10^{+153}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq -3.7 \cdot 10^{-22}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{-84}:\\ \;\;\;\;\frac{x}{t} \cdot y\\ \mathbf{elif}\;z \leq 7 \cdot 10^{+193}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (let* ((t_1 (/ (* x (- z y)) z)))
  (if (<= z -2.25e+153)
    (* 1.0 x)
    (if (<= z -3.7e-22)
      t_1
      (if (<= z 4.2e-84)
        (* (/ x t) y)
        (if (<= z 7e+193) t_1 (* 1.0 x)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * (z - y)) / z;
	double tmp;
	if (z <= -2.25e+153) {
		tmp = 1.0 * x;
	} else if (z <= -3.7e-22) {
		tmp = t_1;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} else if (z <= 7e+193) {
		tmp = t_1;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x * (z - y)) / z
    if (z <= (-2.25d+153)) then
        tmp = 1.0d0 * x
    else if (z <= (-3.7d-22)) then
        tmp = t_1
    else if (z <= 4.2d-84) then
        tmp = (x / t) * y
    else if (z <= 7d+193) then
        tmp = t_1
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x * (z - y)) / z;
	double tmp;
	if (z <= -2.25e+153) {
		tmp = 1.0 * x;
	} else if (z <= -3.7e-22) {
		tmp = t_1;
	} else if (z <= 4.2e-84) {
		tmp = (x / t) * y;
	} else if (z <= 7e+193) {
		tmp = t_1;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x * (z - y)) / z
	tmp = 0
	if z <= -2.25e+153:
		tmp = 1.0 * x
	elif z <= -3.7e-22:
		tmp = t_1
	elif z <= 4.2e-84:
		tmp = (x / t) * y
	elif z <= 7e+193:
		tmp = t_1
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * Float64(z - y)) / z)
	tmp = 0.0
	if (z <= -2.25e+153)
		tmp = Float64(1.0 * x);
	elseif (z <= -3.7e-22)
		tmp = t_1;
	elseif (z <= 4.2e-84)
		tmp = Float64(Float64(x / t) * y);
	elseif (z <= 7e+193)
		tmp = t_1;
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * (z - y)) / z;
	tmp = 0.0;
	if (z <= -2.25e+153)
		tmp = 1.0 * x;
	elseif (z <= -3.7e-22)
		tmp = t_1;
	elseif (z <= 4.2e-84)
		tmp = (x / t) * y;
	elseif (z <= 7e+193)
		tmp = t_1;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * N[(z - y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[z, -2.25e+153], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, -3.7e-22], t$95$1, If[LessEqual[z, 4.2e-84], N[(N[(x / t), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[z, 7e+193], t$95$1, N[(1.0 * x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.25e153 or 7.0000000000000003e193 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. distribute-frac-neg N/A

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

      9. distribute-neg-frac2 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 35.1%

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

   if -2.25e153 < z < -3.7e-22 or 4.2e-84 < z < 7.0000000000000003e193

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

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

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 84.4%

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

   3. Applied rewrites 84.4%

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

   4. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 45.6%

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

   6. Applied rewrites 45.6%

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

   if -3.7e-22 < z < 4.2e-84

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lower-*.f64 37.8%

         \[\leadsto \frac{x \cdot y}{t} \]

   4. Applied rewrites 37.8%

      \[\leadsto \color{blue}{\frac{x \cdot y}{t}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. mult-flip-rev N/A

         \[\leadsto \frac{x}{t} \cdot y \]

      9. lower-/.f64 37.6%

         \[\leadsto \frac{x}{t} \cdot y \]

   6. Applied rewrites 37.6%

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

Alternative 13: 60.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+113}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq 5.1 \cdot 10^{+36}:\\ \;\;\;\;\frac{y}{t} \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (if (<= z -1.25e+113)
  (* 1.0 x)
  (if (<= z 5.1e+36) (* (/ y t) x) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.25e+113) {
		tmp = 1.0 * x;
	} else if (z <= 5.1e+36) {
		tmp = (y / t) * x;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-1.25d+113)) then
        tmp = 1.0d0 * x
    else if (z <= 5.1d+36) then
        tmp = (y / t) * x
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.25e+113) {
		tmp = 1.0 * x;
	} else if (z <= 5.1e+36) {
		tmp = (y / t) * x;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.25e+113:
		tmp = 1.0 * x
	elif z <= 5.1e+36:
		tmp = (y / t) * x
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -1.25e+113)
		tmp = Float64(1.0 * x);
	elseif (z <= 5.1e+36)
		tmp = Float64(Float64(y / t) * x);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.25e+113)
		tmp = 1.0 * x;
	elseif (z <= 5.1e+36)
		tmp = (y / t) * x;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -1.25e+113], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, 5.1e+36], N[(N[(y / t), $MachinePrecision] * x), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.25e113 or 5.0999999999999997e36 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. distribute-frac-neg N/A

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

      9. distribute-neg-frac2 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 35.1%

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

   if -1.25e113 < z < 5.0999999999999997e36

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lower-*.f64 37.8%

         \[\leadsto \frac{x \cdot y}{t} \]

   4. Applied rewrites 37.8%

      \[\leadsto \color{blue}{\frac{x \cdot y}{t}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y}{t} \]

      3. associate-/l* N/A

         \[\leadsto x \cdot \color{blue}{\frac{y}{t}} \]

      4. *-commutative N/A

         \[\leadsto \frac{y}{t} \cdot \color{blue}{x} \]

      5. lower-*.f64 N/A

         \[\leadsto \frac{y}{t} \cdot \color{blue}{x} \]

      6. lower-/.f64 39.7%

         \[\leadsto \frac{y}{t} \cdot x \]

   6. Applied rewrites 39.7%

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

Alternative 14: 59.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+113}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq 2.5 \cdot 10^{+38}:\\ \;\;\;\;\frac{x}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \]

FPCore

(FPCore (x y z t)
  :precision binary64
  (if (<= z -1.25e+113)
  (* 1.0 x)
  (if (<= z 2.5e+38) (* (/ x t) y) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.25e+113) {
		tmp = 1.0 * x;
	} else if (z <= 2.5e+38) {
		tmp = (x / t) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-1.25d+113)) then
        tmp = 1.0d0 * x
    else if (z <= 2.5d+38) then
        tmp = (x / t) * y
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -1.25e+113) {
		tmp = 1.0 * x;
	} else if (z <= 2.5e+38) {
		tmp = (x / t) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.25e+113:
		tmp = 1.0 * x
	elif z <= 2.5e+38:
		tmp = (x / t) * y
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -1.25e+113)
		tmp = Float64(1.0 * x);
	elseif (z <= 2.5e+38)
		tmp = Float64(Float64(x / t) * y);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.25e+113)
		tmp = 1.0 * x;
	elseif (z <= 2.5e+38)
		tmp = (x / t) * y;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -1.25e+113], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, 2.5e+38], N[(N[(x / t), $MachinePrecision] * y), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.25e113 or 2.4999999999999998e38 < z

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. distribute-frac-neg N/A

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

      9. distribute-neg-frac2 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lower--.f64 97.2%

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

   3. Applied rewrites 97.2%

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

   4. Taylor expanded in z around inf

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

   6. Applied rewrites 35.1%

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

   if -1.25e113 < z < 2.4999999999999998e38

   1. Initial program 84.7%

      \[\frac{x \cdot \left(y - z\right)}{t - z} \]

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. lower-*.f64 37.8%

         \[\leadsto \frac{x \cdot y}{t} \]

   4. Applied rewrites 37.8%

      \[\leadsto \color{blue}{\frac{x \cdot y}{t}} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{x \cdot y}{\color{blue}{t}} \]

      2. mult-flip N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. mult-flip-rev N/A

         \[\leadsto \frac{x}{t} \cdot y \]

      9. lower-/.f64 37.6%

         \[\leadsto \frac{x}{t} \cdot y \]

   6. Applied rewrites 37.6%

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

Alternative 15: 35.1% accurate, 3.3× speedup

Math

\[1 \cdot x \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return 1.0 * 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = 1.0d0 * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 84.7%

   \[\frac{x \cdot \left(y - z\right)}{t - z} \]
2. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lift--.f64 N/A

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

   7. sub-negate-rev N/A

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

   8. distribute-frac-neg N/A

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

   9. distribute-neg-frac2 N/A

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

   10. lower-/.f64 N/A

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

   11. lower--.f64 N/A

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

   12. lift--.f64 N/A

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

   13. sub-negate-rev N/A

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

   14. lower--.f64 97.2%

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

3. Applied rewrites 97.2%

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

4. Taylor expanded in z around inf

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

6. Applied rewrites 35.1%

   \[\leadsto \color{blue}{1} \cdot x \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2025212 
(FPCore (x y z t)
  :name "Graphics.Rendering.Chart.Plot.AreaSpots:renderAreaSpots4D from Chart-1.5.3"
  :precision binary64
  (/ (* x (- y z)) (- t z)))