Numeric.Histogram:binBounds from Chart-1.5.3

Percentage Accurate: 92.6% → 97.6%

Time: 3.2s

Alternatives: 7

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

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 - x) * z) / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 92.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 - x) * z) / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return fma((z / t), (y - x), x);
}

Julia

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

Wolfram

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

Derivation

1. Initial program 91.0%

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

   1. lift-+.f64 N/A

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

   2. lift-/.f64 N/A

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

   3. lift--.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. +-commutative N/A

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

   6. associate-/l* N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 N/A

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

   10. lift--.f64 98.3

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

4. Applied rewrites 98.3%

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

Alternative 2: 85.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{\left(y - x\right) \cdot z}{t}\\ \mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 4 \cdot 10^{+291}\right):\\ \;\;\;\;\frac{y - x}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ x (/ (* (- y x) z) t))))
   (if (or (<= t_1 (- INFINITY)) (not (<= t_1 4e+291)))
     (* (/ (- y x) t) z)
     (+ x (/ (* y z) t)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x + (((y - x) * z) / t);
	double tmp;
	if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 4e+291)) {
		tmp = ((y - x) / t) * z;
	} else {
		tmp = x + ((y * z) / t);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x + (((y - x) * z) / t);
	double tmp;
	if ((t_1 <= -Double.POSITIVE_INFINITY) || !(t_1 <= 4e+291)) {
		tmp = ((y - x) / t) * z;
	} else {
		tmp = x + ((y * z) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x + (((y - x) * z) / t)
	tmp = 0
	if (t_1 <= -math.inf) or not (t_1 <= 4e+291):
		tmp = ((y - x) / t) * z
	else:
		tmp = x + ((y * z) / t)
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x + Float64(Float64(Float64(y - x) * z) / t))
	tmp = 0.0
	if ((t_1 <= Float64(-Inf)) || !(t_1 <= 4e+291))
		tmp = Float64(Float64(Float64(y - x) / t) * z);
	else
		tmp = Float64(x + Float64(Float64(y * z) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x + (((y - x) * z) / t);
	tmp = 0.0;
	if ((t_1 <= -Inf) || ~((t_1 <= 4e+291)))
		tmp = ((y - x) / t) * z;
	else
		tmp = x + ((y * z) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x + N[(N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, (-Infinity)], N[Not[LessEqual[t$95$1, 4e+291]], $MachinePrecision]], N[(N[(N[(y - x), $MachinePrecision] / t), $MachinePrecision] * z), $MachinePrecision], N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 (*.f64 (-.f64 y x) z) t)) < -inf.0 or 3.9999999999999998e291 < (+.f64 x (/.f64 (*.f64 (-.f64 y x) z) t))

   1. Initial program 76.8%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift--.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. associate-*l/ N/A

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

      6. sub-div N/A

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

      7. *-commutative N/A

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

      8. lift-/.f64 N/A

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

      9. lift--.f64 N/A

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

      10. lift-*.f64 93.1

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

   7. Applied rewrites 93.1%

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

   if -inf.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y x) z) t)) < 3.9999999999999998e291

   1. Initial program 98.7%

      \[x + \frac{\left(y - x\right) \cdot z}{t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 85.8%

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

4. Final simplification 88.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + \frac{\left(y - x\right) \cdot z}{t} \leq -\infty \lor \neg \left(x + \frac{\left(y - x\right) \cdot z}{t} \leq 4 \cdot 10^{+291}\right):\\ \;\;\;\;\frac{y - x}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot z}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8 \cdot 10^{+54} \lor \neg \left(x \leq 470000000\right):\\ \;\;\;\;\left(1 - \frac{z}{t}\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{t}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -8e+54) (not (<= x 470000000.0)))
   (* (- 1.0 (/ z t)) x)
   (fma y (/ z t) x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -8e+54) || !(x <= 470000000.0)) {
		tmp = (1.0 - (z / t)) * x;
	} else {
		tmp = fma(y, (z / t), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -8e+54) || !(x <= 470000000.0))
		tmp = Float64(Float64(1.0 - Float64(z / t)) * x);
	else
		tmp = fma(y, Float64(z / t), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -8e+54], N[Not[LessEqual[x, 470000000.0]], $MachinePrecision]], N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.0000000000000006e54 or 4.7e8 < x

   1. Initial program 88.3%

      \[x + \frac{\left(y - x\right) \cdot z}{t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cancel-sign-sub N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 91.0

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

   5. Applied rewrites 91.0%

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

   if -8.0000000000000006e54 < x < 4.7e8

   1. Initial program 93.4%

      \[x + \frac{\left(y - x\right) \cdot z}{t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 82.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 85.6

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

   7. Applied rewrites 85.6%

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

4. Final simplification 88.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8 \cdot 10^{+54} \lor \neg \left(x \leq 470000000\right):\\ \;\;\;\;\left(1 - \frac{z}{t}\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{t}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 55.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7 \cdot 10^{+38} \lor \neg \left(z \leq 7.1 \cdot 10^{-84}\right):\\ \;\;\;\;y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -7e+38) (not (<= z 7.1e-84))) (* y (/ z t)) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -7e+38) || !(z <= 7.1e-84)) {
		tmp = y * (z / t);
	} else {
		tmp = 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 <= (-7d+38)) .or. (.not. (z <= 7.1d-84))) then
        tmp = y * (z / t)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -7e+38) || !(z <= 7.1e-84)) {
		tmp = y * (z / t);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -7e+38) or not (z <= 7.1e-84):
		tmp = y * (z / t)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -7e+38) || !(z <= 7.1e-84))
		tmp = Float64(y * Float64(z / t));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -7e+38) || ~((z <= 7.1e-84)))
		tmp = y * (z / t);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -7e+38], N[Not[LessEqual[z, 7.1e-84]], $MachinePrecision]], N[(y * N[(z / t), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -7.00000000000000003e38 or 7.0999999999999997e-84 < z

   1. Initial program 86.2%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift--.f64 97.8

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

   4. Applied rewrites 97.8%

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

   5. Taylor expanded in x around 0

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

      1. associate-*l/ N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. associate-*l/ N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lift-/.f64 55.4

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

   7. Applied rewrites 55.4%

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

   if -7.00000000000000003e38 < z < 7.0999999999999997e-84

   1. Initial program 97.2%

      \[x + \frac{\left(y - x\right) \cdot z}{t} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 66.0%

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

4. Final simplification 60.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7 \cdot 10^{+38} \lor \neg \left(z \leq 7.1 \cdot 10^{-84}\right):\\ \;\;\;\;y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 75.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.55e+190) (* (/ (- z) t) x) (fma y (/ z t) x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.5500000000000001e190

   1. Initial program 85.1%

      \[x + \frac{\left(y - x\right) \cdot z}{t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cancel-sign-sub N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 73.0

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

   5. Applied rewrites 73.0%

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

   6. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 69.9

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

   8. Applied rewrites 69.9%

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

   if -1.5500000000000001e190 < z

   1. Initial program 91.8%

      \[x + \frac{\left(y - x\right) \cdot z}{t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 77.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 80.8

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

   7. Applied rewrites 80.8%

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

Alternative 6: 76.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, \frac{z}{t}, x\right) \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (fma y (/ z t) x))

C

double code(double x, double y, double z, double t) {
	return fma(y, (z / t), x);
}

Julia

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

Wolfram

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

Derivation

1. Initial program 91.0%

   \[x + \frac{\left(y - x\right) \cdot z}{t} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

5. Applied rewrites 73.7%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. lower-fma.f64 N/A

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

   7. lift-/.f64 77.4

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

7. Applied rewrites 77.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{z}{t}, x\right)} \]
8. Add Preprocessing

Alternative 7: 38.9% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, 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
end function

Java

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

Python

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

Julia

function code(x, y, z, t)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := x

Derivation

1. Initial program 91.0%

   \[x + \frac{\left(y - x\right) \cdot z}{t} \]
2. Add Preprocessing

3. Taylor expanded in z around 0

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

5. Applied rewrites 38.0%

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

Developer Target 1: 97.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x < -9.025511195533005 \cdot 10^{-135}:\\ \;\;\;\;x - \frac{z}{t} \cdot \left(x - y\right)\\ \mathbf{elif}\;x < 4.275032163700715 \cdot 10^{-250}:\\ \;\;\;\;x + \frac{y - x}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y - x}{\frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (< x -9.025511195533005e-135)
   (- x (* (/ z t) (- x y)))
   (if (< x 4.275032163700715e-250)
     (+ x (* (/ (- y x) t) z))
     (+ x (/ (- y x) (/ t z))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x < -9.025511195533005e-135) {
		tmp = x - ((z / t) * (x - y));
	} else if (x < 4.275032163700715e-250) {
		tmp = x + (((y - x) / t) * z);
	} else {
		tmp = x + ((y - x) / (t / 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) :: tmp
    if (x < (-9.025511195533005d-135)) then
        tmp = x - ((z / t) * (x - y))
    else if (x < 4.275032163700715d-250) then
        tmp = x + (((y - x) / t) * z)
    else
        tmp = x + ((y - x) / (t / z))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if x < -9.025511195533005e-135:
		tmp = x - ((z / t) * (x - y))
	elif x < 4.275032163700715e-250:
		tmp = x + (((y - x) / t) * z)
	else:
		tmp = x + ((y - x) / (t / z))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x < -9.025511195533005e-135)
		tmp = Float64(x - Float64(Float64(z / t) * Float64(x - y)));
	elseif (x < 4.275032163700715e-250)
		tmp = Float64(x + Float64(Float64(Float64(y - x) / t) * z));
	else
		tmp = Float64(x + Float64(Float64(y - x) / Float64(t / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x < -9.025511195533005e-135)
		tmp = x - ((z / t) * (x - y));
	elseif (x < 4.275032163700715e-250)
		tmp = x + (((y - x) / t) * z);
	else
		tmp = x + ((y - x) / (t / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Less[x, -9.025511195533005e-135], N[(x - N[(N[(z / t), $MachinePrecision] * N[(x - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[x, 4.275032163700715e-250], N[(x + N[(N[(N[(y - x), $MachinePrecision] / t), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y - x), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2025064 
(FPCore (x y z t)
  :name "Numeric.Histogram:binBounds from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< x -1805102239106601/200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- x (* (/ z t) (- x y))) (if (< x 855006432740143/2000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ x (* (/ (- y x) t) z)) (+ x (/ (- y x) (/ t z))))))

  (+ x (/ (* (- y x) z) t)))