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

Percentage Accurate: 84.2% → 96.7%

Time: 4.8s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

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.2% accurate, 1.0× speedup

Math

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

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: 96.7% accurate, 1.0× speedup

Math

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

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.2%

   \[\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 96.7

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

3. Applied rewrites 96.7%

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

Alternative 2: 87.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 2 \cdot 10^{+183}:\\ \;\;\;\;\frac{x}{z - t} \cdot \left(z - y\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{z - y}{z} \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z 2e+183) (* (/ x (- z t)) (- z y)) (* (/ (- z y) z) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= 2e+183) {
		tmp = (x / (z - t)) * (z - y);
	} else {
		tmp = ((z - y) / z) * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, 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 <= 2d+183) then
        tmp = (x / (z - t)) * (z - y)
    else
        tmp = ((z - y) / z) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= 2e+183) {
		tmp = (x / (z - t)) * (z - y);
	} else {
		tmp = ((z - y) / z) * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= 2e+183:
		tmp = (x / (z - t)) * (z - y)
	else:
		tmp = ((z - y) / z) * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= 2e+183)
		tmp = Float64(Float64(x / Float64(z - t)) * Float64(z - y));
	else
		tmp = Float64(Float64(Float64(z - y) / z) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= 2e+183)
		tmp = (x / (z - t)) * (z - y);
	else
		tmp = ((z - y) / z) * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, 2e+183], N[(N[(x / N[(z - t), $MachinePrecision]), $MachinePrecision] * N[(z - y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(z - y), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1.99999999999999989e183

   1. Initial program 84.2%

      \[\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 85.2

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

   3. Applied rewrites 85.2%

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

   if 1.99999999999999989e183 < z

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

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

   4. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 52.1

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

   6. Applied rewrites 52.1%

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

Alternative 3: 76.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - y}{z} \cdot x\\ \mathbf{if}\;z \leq -2.1 \cdot 10^{-29}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 5.4 \cdot 10^{-5}:\\ \;\;\;\;\frac{y}{t - z} \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ (- z y) z) x)))
   (if (<= z -2.1e-29) t_1 (if (<= z 5.4e-5) (* (/ y (- t z)) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((z - y) / z) * x;
	double tmp;
	if (z <= -2.1e-29) {
		tmp = t_1;
	} else if (z <= 5.4e-5) {
		tmp = (y / (t - 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 - y) / z) * x
    if (z <= (-2.1d-29)) then
        tmp = t_1
    else if (z <= 5.4d-5) then
        tmp = (y / (t - 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 - y) / z) * x;
	double tmp;
	if (z <= -2.1e-29) {
		tmp = t_1;
	} else if (z <= 5.4e-5) {
		tmp = (y / (t - z)) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((z - y) / z) * x
	tmp = 0
	if z <= -2.1e-29:
		tmp = t_1
	elif z <= 5.4e-5:
		tmp = (y / (t - z)) * x
	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 <= -2.1e-29)
		tmp = t_1;
	elseif (z <= 5.4e-5)
		tmp = Float64(Float64(y / Float64(t - z)) * x);
	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 <= -2.1e-29)
		tmp = t_1;
	elseif (z <= 5.4e-5)
		tmp = (y / (t - z)) * x;
	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, -2.1e-29], t$95$1, If[LessEqual[z, 5.4e-5], N[(N[(y / N[(t - z), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.09999999999999989e-29 or 5.3999999999999998e-5 < z

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

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

   4. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 52.1

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

   6. Applied rewrites 52.1%

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

   if -2.09999999999999989e-29 < z < 5.3999999999999998e-5

   1. Initial program 84.2%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 47.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 50.4

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

   6. Applied rewrites 50.4%

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

   7. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 53.6

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

   9. Applied rewrites 53.6%

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

Alternative 4: 65.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x (- y z)) (- t z))))
   (if (<= t_1 5e-227)
     (* (/ y (- t z)) x)
     (if (<= t_1 1e+273) (/ (* x (- z y)) z) (* (- z y) (/ x z))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * (y - z)) / (t - z);
	double tmp;
	if (t_1 <= 5e-227) {
		tmp = (y / (t - z)) * x;
	} else if (t_1 <= 1e+273) {
		tmp = (x * (z - y)) / z;
	} else {
		tmp = (z - y) * (x / z);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, 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 * (y - z)) / (t - z)
    if (t_1 <= 5d-227) then
        tmp = (y / (t - z)) * x
    else if (t_1 <= 1d+273) then
        tmp = (x * (z - y)) / z
    else
        tmp = (z - y) * (x / z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x * (y - z)) / (t - z);
	double tmp;
	if (t_1 <= 5e-227) {
		tmp = (y / (t - z)) * x;
	} else if (t_1 <= 1e+273) {
		tmp = (x * (z - y)) / z;
	} else {
		tmp = (z - y) * (x / z);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x * (y - z)) / (t - z)
	tmp = 0
	if t_1 <= 5e-227:
		tmp = (y / (t - z)) * x
	elif t_1 <= 1e+273:
		tmp = (x * (z - y)) / z
	else:
		tmp = (z - y) * (x / z)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * Float64(y - z)) / Float64(t - z))
	tmp = 0.0
	if (t_1 <= 5e-227)
		tmp = Float64(Float64(y / Float64(t - z)) * x);
	elseif (t_1 <= 1e+273)
		tmp = Float64(Float64(x * Float64(z - y)) / z);
	else
		tmp = Float64(Float64(z - y) * Float64(x / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * (y - z)) / (t - z);
	tmp = 0.0;
	if (t_1 <= 5e-227)
		tmp = (y / (t - z)) * x;
	elseif (t_1 <= 1e+273)
		tmp = (x * (z - y)) / z;
	else
		tmp = (z - y) * (x / z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) (-.f64 t z)) < 4.99999999999999961e-227

   1. Initial program 84.2%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 47.7%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 50.4

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

   6. Applied rewrites 50.4%

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

   7. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 53.6

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

   9. Applied rewrites 53.6%

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

   if 4.99999999999999961e-227 < (/.f64 (*.f64 x (-.f64 y z)) (-.f64 t z)) < 9.99999999999999945e272

   1. Initial program 84.2%

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

   2. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 44.7

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

   4. Applied rewrites 44.7%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-/.f64 N/A

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

      4. distribute-neg-frac N/A

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

      5. lower-/.f64 N/A

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

      6. lift-*.f64 N/A

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

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

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

      8. lift--.f64 N/A

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

      9. sub-negate-rev N/A

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

      10. lift--.f64 N/A

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

      11. lower-*.f64 44.7

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

   6. Applied rewrites 44.7%

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

   if 9.99999999999999945e272 < (/.f64 (*.f64 x (-.f64 y z)) (-.f64 t z))

   1. Initial program 84.2%

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

   2. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 44.7

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

   4. Applied rewrites 44.7%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

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

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

      9. lift--.f64 N/A

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

      10. sub-negate-rev N/A

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

      11. lift--.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. mult-flip-rev N/A

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

      14. lower-/.f64 43.7

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

   6. Applied rewrites 43.7%

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

Alternative 5: 61.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(z - y\right) \cdot \frac{x}{z}\\ \mathbf{if}\;z \leq -3.8 \cdot 10^{+137}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq -9.6 \cdot 10^{-126}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 9.2 \cdot 10^{-118}:\\ \;\;\;\;\frac{y}{t} \cdot x\\ \mathbf{elif}\;z \leq 6.1 \cdot 10^{+218}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- z y) (/ x z))))
   (if (<= z -3.8e+137)
     (* 1.0 x)
     (if (<= z -9.6e-126)
       t_1
       (if (<= z 9.2e-118)
         (* (/ y t) x)
         (if (<= z 6.1e+218) t_1 (* 1.0 x)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z - y) * (x / z);
	double tmp;
	if (z <= -3.8e+137) {
		tmp = 1.0 * x;
	} else if (z <= -9.6e-126) {
		tmp = t_1;
	} else if (z <= 9.2e-118) {
		tmp = (y / t) * x;
	} else if (z <= 6.1e+218) {
		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 = (z - y) * (x / z)
    if (z <= (-3.8d+137)) then
        tmp = 1.0d0 * x
    else if (z <= (-9.6d-126)) then
        tmp = t_1
    else if (z <= 9.2d-118) then
        tmp = (y / t) * x
    else if (z <= 6.1d+218) 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 = (z - y) * (x / z);
	double tmp;
	if (z <= -3.8e+137) {
		tmp = 1.0 * x;
	} else if (z <= -9.6e-126) {
		tmp = t_1;
	} else if (z <= 9.2e-118) {
		tmp = (y / t) * x;
	} else if (z <= 6.1e+218) {
		tmp = t_1;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z - y) * (x / z)
	tmp = 0
	if z <= -3.8e+137:
		tmp = 1.0 * x
	elif z <= -9.6e-126:
		tmp = t_1
	elif z <= 9.2e-118:
		tmp = (y / t) * x
	elif z <= 6.1e+218:
		tmp = t_1
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z - y) * Float64(x / z))
	tmp = 0.0
	if (z <= -3.8e+137)
		tmp = Float64(1.0 * x);
	elseif (z <= -9.6e-126)
		tmp = t_1;
	elseif (z <= 9.2e-118)
		tmp = Float64(Float64(y / t) * x);
	elseif (z <= 6.1e+218)
		tmp = t_1;
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z - y) * (x / z);
	tmp = 0.0;
	if (z <= -3.8e+137)
		tmp = 1.0 * x;
	elseif (z <= -9.6e-126)
		tmp = t_1;
	elseif (z <= 9.2e-118)
		tmp = (y / t) * x;
	elseif (z <= 6.1e+218)
		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[(z - y), $MachinePrecision] * N[(x / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.8e+137], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, -9.6e-126], t$95$1, If[LessEqual[z, 9.2e-118], N[(N[(y / t), $MachinePrecision] * x), $MachinePrecision], If[LessEqual[z, 6.1e+218], t$95$1, N[(1.0 * x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.79999999999999963e137 or 6.10000000000000021e218 < z

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

      \[\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 34.9%

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

   if -3.79999999999999963e137 < z < -9.60000000000000027e-126 or 9.20000000000000084e-118 < z < 6.10000000000000021e218

   1. Initial program 84.2%

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

   2. Taylor expanded in t around 0

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 44.7

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

   4. Applied rewrites 44.7%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-/.f64 N/A

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

      4. mult-flip N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*l* N/A

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

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

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

      9. lift--.f64 N/A

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

      10. sub-negate-rev N/A

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

      11. lift--.f64 N/A

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

      12. lower-*.f64 N/A

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

      13. mult-flip-rev N/A

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

      14. lower-/.f64 43.7

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

   6. Applied rewrites 43.7%

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

   if -9.60000000000000027e-126 < z < 9.20000000000000084e-118

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

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

   4. Taylor expanded in z around 0

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

      1. lower-/.f64 40.4

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

   6. Applied rewrites 40.4%

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

Alternative 6: 60.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.1 \cdot 10^{-29}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq 4 \cdot 10^{-5}:\\ \;\;\;\;\frac{y}{t} \cdot x\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.1e-29) (* 1.0 x) (if (<= z 4e-5) (* (/ y t) x) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.1e-29) {
		tmp = 1.0 * x;
	} else if (z <= 4e-5) {
		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 <= (-2.1d-29)) then
        tmp = 1.0d0 * x
    else if (z <= 4d-5) 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 <= -2.1e-29) {
		tmp = 1.0 * x;
	} else if (z <= 4e-5) {
		tmp = (y / t) * x;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.1e-29:
		tmp = 1.0 * x
	elif z <= 4e-5:
		tmp = (y / t) * x
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.1e-29)
		tmp = Float64(1.0 * x);
	elseif (z <= 4e-5)
		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 <= -2.1e-29)
		tmp = 1.0 * x;
	elseif (z <= 4e-5)
		tmp = (y / t) * x;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -2.1e-29], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, 4e-5], N[(N[(y / t), $MachinePrecision] * x), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.09999999999999989e-29 or 4.00000000000000033e-5 < z

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

      \[\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 34.9%

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

   if -2.09999999999999989e-29 < z < 4.00000000000000033e-5

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

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

   4. Taylor expanded in z around 0

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

      1. lower-/.f64 40.4

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

   6. Applied rewrites 40.4%

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

Alternative 7: 59.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.1 \cdot 10^{-29}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq 4 \cdot 10^{-5}:\\ \;\;\;\;\frac{x \cdot y}{t}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.1e-29) (* 1.0 x) (if (<= z 4e-5) (/ (* x y) t) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.1e-29) {
		tmp = 1.0 * x;
	} else if (z <= 4e-5) {
		tmp = (x * y) / t;
	} 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 <= (-2.1d-29)) then
        tmp = 1.0d0 * x
    else if (z <= 4d-5) then
        tmp = (x * y) / t
    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 <= -2.1e-29) {
		tmp = 1.0 * x;
	} else if (z <= 4e-5) {
		tmp = (x * y) / t;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.1e-29:
		tmp = 1.0 * x
	elif z <= 4e-5:
		tmp = (x * y) / t
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.1e-29)
		tmp = Float64(1.0 * x);
	elseif (z <= 4e-5)
		tmp = Float64(Float64(x * y) / t);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -2.1e-29)
		tmp = 1.0 * x;
	elseif (z <= 4e-5)
		tmp = (x * y) / t;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -2.1e-29], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, 4e-5], N[(N[(x * y), $MachinePrecision] / t), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.09999999999999989e-29 or 4.00000000000000033e-5 < z

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

      \[\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 34.9%

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

   if -2.09999999999999989e-29 < z < 4.00000000000000033e-5

   1. Initial program 84.2%

      \[\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 38.5

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

   4. Applied rewrites 38.5%

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

Alternative 8: 56.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.35 \cdot 10^{-30}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;z \leq 8 \cdot 10^{-88}:\\ \;\;\;\;\frac{x}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -2.35e-30) (* 1.0 x) (if (<= z 8e-88) (* (/ x t) y) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -2.35e-30) {
		tmp = 1.0 * x;
	} else if (z <= 8e-88) {
		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 <= (-2.35d-30)) then
        tmp = 1.0d0 * x
    else if (z <= 8d-88) 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 <= -2.35e-30) {
		tmp = 1.0 * x;
	} else if (z <= 8e-88) {
		tmp = (x / t) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -2.35e-30:
		tmp = 1.0 * x
	elif z <= 8e-88:
		tmp = (x / t) * y
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -2.35e-30)
		tmp = Float64(1.0 * x);
	elseif (z <= 8e-88)
		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 <= -2.35e-30)
		tmp = 1.0 * x;
	elseif (z <= 8e-88)
		tmp = (x / t) * y;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -2.35e-30], N[(1.0 * x), $MachinePrecision], If[LessEqual[z, 8e-88], N[(N[(x / t), $MachinePrecision] * y), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.34999999999999985e-30 or 7.99999999999999947e-88 < z

   1. Initial program 84.2%

      \[\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 96.7

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

   3. Applied rewrites 96.7%

      \[\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 34.9%

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

   if -2.34999999999999985e-30 < z < 7.99999999999999947e-88

   1. Initial program 84.2%

      \[\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 38.5

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

   4. Applied rewrites 38.5%

      \[\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 38.8

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

   6. Applied rewrites 38.8%

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

Alternative 9: 34.9% accurate, 3.2× speedup

Math

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

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.2%

   \[\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 96.7

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

3. Applied rewrites 96.7%

   \[\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 34.9%

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

Reproduce

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