Numeric.Histogram:binBounds from Chart-1.5.3

Percentage Accurate: 93.2% → 97.7%

Time: 8.2s

Alternatives: 8

Speedup: 1.0×

• 25.1% 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

real(8) function code(x, y, z, t)
    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: 93.2% 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

real(8) function code(x, y, z, t)
    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.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x + ((y - x) / (t / z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 92.5%

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

   1. associate-/l* 98.4%

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

3. Simplified 98.4%

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

   1. clear-num 98.3%

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

   2. un-div-inv 98.5%

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

6. Applied egg-rr 98.5%

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

Alternative 2: 94.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{-224} \lor \neg \left(z \leq 1.5 \cdot 10^{-79}\right):\\ \;\;\;\;x + z \cdot \frac{y - x}{t}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.8e-224) (not (<= z 1.5e-79)))
   (+ x (* z (/ (- y x) t)))
   (+ x (* y (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.8e-224) || !(z <= 1.5e-79)) {
		tmp = x + (z * ((y - x) / t));
	} else {
		tmp = x + (y * (z / t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z <= (-1.8d-224)) .or. (.not. (z <= 1.5d-79))) then
        tmp = x + (z * ((y - x) / t))
    else
        tmp = x + (y * (z / t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.8e-224) || !(z <= 1.5e-79)) {
		tmp = x + (z * ((y - x) / t));
	} else {
		tmp = x + (y * (z / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -1.8e-224) or not (z <= 1.5e-79):
		tmp = x + (z * ((y - x) / t))
	else:
		tmp = x + (y * (z / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.8e-224) || !(z <= 1.5e-79))
		tmp = Float64(x + Float64(z * Float64(Float64(y - x) / t)));
	else
		tmp = Float64(x + Float64(y * Float64(z / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.8e-224) || ~((z <= 1.5e-79)))
		tmp = x + (z * ((y - x) / t));
	else
		tmp = x + (y * (z / t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.8e-224], N[Not[LessEqual[z, 1.5e-79]], $MachinePrecision]], N[(x + N[(z * N[(N[(y - x), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(z / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.8e-224 or 1.5e-79 < z

   1. Initial program 90.4%

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

      1. associate-/l* 97.7%

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

   3. Simplified 97.7%

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

   5. Taylor expanded in y around 0 86.0%

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

      1. +-commutative 86.0%

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

      2. associate-*r/ 88.5%

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

      3. mul-1-neg 88.5%

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

      4. associate-/l* 91.0%

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

      5. distribute-lft-neg-out 91.0%

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

      6. distribute-rgt-out 97.7%

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

      7. sub-neg 97.7%

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

      8. associate-*l/ 90.4%

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

      9. associate-*r/ 95.8%

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

   7. Simplified 95.8%

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

   if -1.8e-224 < z < 1.5e-79

   1. Initial program 97.5%

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

      1. associate-/l* 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around inf 92.8%

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

      1. associate-*r/ 95.2%

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

   7. Simplified 95.2%

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

4. Final simplification 95.6%

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

Alternative 3: 85.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.25 \cdot 10^{-98} \lor \neg \left(y \leq 1.9 \cdot 10^{-139}\right):\\ \;\;\;\;x + y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - \frac{z}{t}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -1.25e-98) (not (<= y 1.9e-139)))
   (+ x (* y (/ z t)))
   (* x (- 1.0 (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -1.25e-98) || !(y <= 1.9e-139)) {
		tmp = x + (y * (z / t));
	} else {
		tmp = x * (1.0 - (z / t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((y <= (-1.25d-98)) .or. (.not. (y <= 1.9d-139))) then
        tmp = x + (y * (z / t))
    else
        tmp = x * (1.0d0 - (z / t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -1.25e-98) || !(y <= 1.9e-139)) {
		tmp = x + (y * (z / t));
	} else {
		tmp = x * (1.0 - (z / t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (y <= -1.25e-98) or not (y <= 1.9e-139):
		tmp = x + (y * (z / t))
	else:
		tmp = x * (1.0 - (z / t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -1.25e-98) || !(y <= 1.9e-139))
		tmp = Float64(x + Float64(y * Float64(z / t)));
	else
		tmp = Float64(x * Float64(1.0 - Float64(z / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((y <= -1.25e-98) || ~((y <= 1.9e-139)))
		tmp = x + (y * (z / t));
	else
		tmp = x * (1.0 - (z / t));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.25000000000000005e-98 or 1.90000000000000004e-139 < y

   1. Initial program 89.5%

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

      1. associate-/l* 98.7%

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

   3. Simplified 98.7%

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

   5. Taylor expanded in y around inf 82.7%

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

      1. associate-*r/ 90.9%

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

   7. Simplified 90.9%

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

   if -1.25000000000000005e-98 < y < 1.90000000000000004e-139

   1. Initial program 98.8%

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

      1. associate-/l* 97.6%

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

   3. Simplified 97.6%

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

   5. Taylor expanded in x around inf 94.9%

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

      1. mul-1-neg 94.9%

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

      2. unsub-neg 94.9%

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

   7. Simplified 94.9%

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

4. Final simplification 92.2%

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

Alternative 4: 50.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.55 \cdot 10^{+154} \lor \neg \left(z \leq 8.2 \cdot 10^{+64}\right):\\ \;\;\;\;x \cdot \frac{z}{-t}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -2.55e+154) (not (<= z 8.2e+64))) (* x (/ z (- t))) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -2.55e+154) || !(z <= 8.2e+64)) {
		tmp = x * (z / -t);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    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.55d+154)) .or. (.not. (z <= 8.2d+64))) then
        tmp = x * (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 <= -2.55e+154) || !(z <= 8.2e+64)) {
		tmp = x * (z / -t);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -2.55e+154) or not (z <= 8.2e+64):
		tmp = x * (z / -t)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -2.55e+154) || !(z <= 8.2e+64))
		tmp = Float64(x * Float64(z / Float64(-t)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -2.55e+154) || ~((z <= 8.2e+64)))
		tmp = x * (z / -t);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -2.55e+154], N[Not[LessEqual[z, 8.2e+64]], $MachinePrecision]], N[(x * N[(z / (-t)), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -2.55e154 or 8.19999999999999956e64 < z

   1. Initial program 84.4%

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

      1. associate-/l* 96.3%

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

   3. Simplified 96.3%

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

   5. Taylor expanded in x around inf 54.8%

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

      1. mul-1-neg 54.8%

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

      2. unsub-neg 54.8%

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

   7. Simplified 54.8%

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

   8. Taylor expanded in z around inf 42.2%

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

      1. mul-1-neg 42.2%

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

      2. associate-/l* 49.6%

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

      3. distribute-rgt-neg-in 49.6%

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

      4. distribute-frac-neg2 49.6%

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

   10. Simplified 49.6%

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

   if -2.55e154 < z < 8.19999999999999956e64

   1. Initial program 96.1%

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

      1. associate-/l* 99.3%

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

   3. Simplified 99.3%

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

   5. Taylor expanded in z around 0 58.4%

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

4. Final simplification 55.7%

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

Alternative 5: 49.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.5 \cdot 10^{+154} \lor \neg \left(z \leq 4.25 \cdot 10^{+64}\right):\\ \;\;\;\;\frac{z}{-\frac{t}{x}}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -6.5e+154) (not (<= z 4.25e+64))) (/ z (- (/ t x))) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -6.5e+154) || !(z <= 4.25e+64)) {
		tmp = z / -(t / x);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    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 <= (-6.5d+154)) .or. (.not. (z <= 4.25d+64))) then
        tmp = z / -(t / x)
    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 <= -6.5e+154) || !(z <= 4.25e+64)) {
		tmp = z / -(t / x);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -6.5e+154) or not (z <= 4.25e+64):
		tmp = z / -(t / x)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -6.5e+154) || !(z <= 4.25e+64))
		tmp = Float64(z / Float64(-Float64(t / x)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -6.5e+154) || ~((z <= 4.25e+64)))
		tmp = z / -(t / x);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -6.5e+154], N[Not[LessEqual[z, 4.25e+64]], $MachinePrecision]], N[(z / (-N[(t / x), $MachinePrecision])), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -6.5000000000000005e154 or 4.2499999999999999e64 < z

   1. Initial program 84.4%

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

      1. associate-/l* 96.3%

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

   3. Simplified 96.3%

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

   5. Taylor expanded in x around inf 54.8%

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

      1. mul-1-neg 54.8%

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

      2. unsub-neg 54.8%

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

   7. Simplified 54.8%

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

   8. Taylor expanded in z around inf 42.2%

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

      1. mul-1-neg 42.2%

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

      2. associate-/l* 49.6%

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

      3. distribute-rgt-neg-in 49.6%

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

      4. distribute-frac-neg2 49.6%

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

   10. Simplified 49.6%

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

   11. Taylor expanded in x around 0 42.2%

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

       1. mul-1-neg 42.2%

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

       2. associate-*r/ 49.6%

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

       3. *-commutative 49.6%

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

       4. associate-/r/ 43.7%

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

   13. Simplified 43.7%

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

   if -6.5000000000000005e154 < z < 4.2499999999999999e64

   1. Initial program 96.1%

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

      1. associate-/l* 99.3%

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

   3. Simplified 99.3%

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

   5. Taylor expanded in z around 0 58.4%

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

4. Final simplification 53.9%

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

Alternative 6: 97.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(y - x\right) \cdot \frac{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

real(8) function code(x, y, z, t)
    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(y - x) * Float64(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[(y - x), $MachinePrecision] * N[(z / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 92.5%

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

   1. associate-/l* 98.4%

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

3. Simplified 98.4%

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

Alternative 7: 65.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x * (1.0d0 - (z / t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 92.5%

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

   1. associate-/l* 98.4%

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

3. Simplified 98.4%

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

5. Taylor expanded in x around inf 64.1%

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

   1. mul-1-neg 64.1%

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

   2. unsub-neg 64.1%

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

7. Simplified 64.1%

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

Alternative 8: 38.9% accurate, 9.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

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

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

   1. associate-/l* 98.4%

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

3. Simplified 98.4%

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

5. Taylor expanded in z around 0 42.7%

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

Developer Target 1: 97.7% accurate, 0.5× 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

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