Numeric.Histogram:binBounds from Chart-1.5.3

Percentage Accurate: 92.8% → 97.8%

Time: 6.3s

Alternatives: 7

Speedup: 1.0×

• 24.9% 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: 92.8% 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.8% 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 91.1%

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

   1. associate-/l* 97.9%

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

3. Simplified 97.9%

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

   1. clear-num 97.6%

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

   2. un-div-inv 97.9%

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

6. Applied egg-rr 97.9%

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

Alternative 2: 85.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.4 \cdot 10^{+47} \lor \neg \left(y \leq 1.4 \cdot 10^{-7} \lor \neg \left(y \leq 5.8 \cdot 10^{+131}\right) \land y \leq 6 \cdot 10^{+131}\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 -3.4e+47)
         (not (or (<= y 1.4e-7) (and (not (<= y 5.8e+131)) (<= y 6e+131)))))
   (+ x (* y (/ z t)))
   (* x (- 1.0 (/ z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -3.4e+47) || !((y <= 1.4e-7) || (!(y <= 5.8e+131) && (y <= 6e+131)))) {
		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 <= (-3.4d+47)) .or. (.not. (y <= 1.4d-7) .or. (.not. (y <= 5.8d+131)) .and. (y <= 6d+131))) 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 <= -3.4e+47) || !((y <= 1.4e-7) || (!(y <= 5.8e+131) && (y <= 6e+131)))) {
		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 <= -3.4e+47) or not ((y <= 1.4e-7) or (not (y <= 5.8e+131) and (y <= 6e+131))):
		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 <= -3.4e+47) || !((y <= 1.4e-7) || (!(y <= 5.8e+131) && (y <= 6e+131))))
		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 <= -3.4e+47) || ~(((y <= 1.4e-7) || (~((y <= 5.8e+131)) && (y <= 6e+131)))))
		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, -3.4e+47], N[Not[Or[LessEqual[y, 1.4e-7], And[N[Not[LessEqual[y, 5.8e+131]], $MachinePrecision], LessEqual[y, 6e+131]]]], $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 < -3.3999999999999998e47 or 1.4000000000000001e-7 < y < 5.8000000000000002e131 or 6.0000000000000003e131 < y

   1. Initial program 87.7%

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

      1. associate-/l* 97.3%

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

   3. Simplified 97.3%

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

   5. Taylor expanded in y around inf 80.6%

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

      1. associate-*r/ 87.9%

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

   7. Simplified 87.9%

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

   if -3.3999999999999998e47 < y < 1.4000000000000001e-7 or 5.8000000000000002e131 < y < 6.0000000000000003e131

   1. Initial program 94.3%

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

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

      1. mul-1-neg 88.8%

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

      2. unsub-neg 88.8%

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

   7. Simplified 88.8%

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

4. Final simplification 88.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.4 \cdot 10^{+47} \lor \neg \left(y \leq 1.4 \cdot 10^{-7} \lor \neg \left(y \leq 5.8 \cdot 10^{+131}\right) \land y \leq 6 \cdot 10^{+131}\right):\\ \;\;\;\;x + y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(1 - \frac{z}{t}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \left(1 - \frac{z}{t}\right)\\ t_2 := x + y \cdot \frac{z}{t}\\ \mathbf{if}\;y \leq -4.6 \cdot 10^{+52}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq 7.4 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{+131}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq 6 \cdot 10^{+131}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{\frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (- 1.0 (/ z t)))) (t_2 (+ x (* y (/ z t)))))
   (if (<= y -4.6e+52)
     t_2
     (if (<= y 7.4e-7)
       t_1
       (if (<= y 5.8e+131) t_2 (if (<= y 6e+131) t_1 (+ x (/ y (/ t z)))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * (1.0 - (z / t));
	double t_2 = x + (y * (z / t));
	double tmp;
	if (y <= -4.6e+52) {
		tmp = t_2;
	} else if (y <= 7.4e-7) {
		tmp = t_1;
	} else if (y <= 5.8e+131) {
		tmp = t_2;
	} else if (y <= 6e+131) {
		tmp = t_1;
	} else {
		tmp = x + (y / (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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = x * (1.0d0 - (z / t))
    t_2 = x + (y * (z / t))
    if (y <= (-4.6d+52)) then
        tmp = t_2
    else if (y <= 7.4d-7) then
        tmp = t_1
    else if (y <= 5.8d+131) then
        tmp = t_2
    else if (y <= 6d+131) then
        tmp = t_1
    else
        tmp = x + (y / (t / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x * (1.0 - (z / t));
	double t_2 = x + (y * (z / t));
	double tmp;
	if (y <= -4.6e+52) {
		tmp = t_2;
	} else if (y <= 7.4e-7) {
		tmp = t_1;
	} else if (y <= 5.8e+131) {
		tmp = t_2;
	} else if (y <= 6e+131) {
		tmp = t_1;
	} else {
		tmp = x + (y / (t / z));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x * (1.0 - (z / t))
	t_2 = x + (y * (z / t))
	tmp = 0
	if y <= -4.6e+52:
		tmp = t_2
	elif y <= 7.4e-7:
		tmp = t_1
	elif y <= 5.8e+131:
		tmp = t_2
	elif y <= 6e+131:
		tmp = t_1
	else:
		tmp = x + (y / (t / z))
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x * Float64(1.0 - Float64(z / t)))
	t_2 = Float64(x + Float64(y * Float64(z / t)))
	tmp = 0.0
	if (y <= -4.6e+52)
		tmp = t_2;
	elseif (y <= 7.4e-7)
		tmp = t_1;
	elseif (y <= 5.8e+131)
		tmp = t_2;
	elseif (y <= 6e+131)
		tmp = t_1;
	else
		tmp = Float64(x + Float64(y / Float64(t / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * (1.0 - (z / t));
	t_2 = x + (y * (z / t));
	tmp = 0.0;
	if (y <= -4.6e+52)
		tmp = t_2;
	elseif (y <= 7.4e-7)
		tmp = t_1;
	elseif (y <= 5.8e+131)
		tmp = t_2;
	elseif (y <= 6e+131)
		tmp = t_1;
	else
		tmp = x + (y / (t / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x + N[(y * N[(z / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.6e+52], t$95$2, If[LessEqual[y, 7.4e-7], t$95$1, If[LessEqual[y, 5.8e+131], t$95$2, If[LessEqual[y, 6e+131], t$95$1, N[(x + N[(y / N[(t / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.6e52 or 7.40000000000000009e-7 < y < 5.8000000000000002e131

   1. Initial program 89.6%

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

      1. associate-/l* 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in y around inf 81.3%

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

      1. associate-*r/ 89.0%

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

   7. Simplified 89.0%

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

   if -4.6e52 < y < 7.40000000000000009e-7 or 5.8000000000000002e131 < y < 6.0000000000000003e131

   1. Initial program 94.3%

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

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

      1. mul-1-neg 88.8%

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

      2. unsub-neg 88.8%

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

   7. Simplified 88.8%

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

   if 6.0000000000000003e131 < y

   1. Initial program 84.0%

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

      1. associate-/l* 93.0%

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

   3. Simplified 93.0%

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

   5. Taylor expanded in y around inf 79.3%

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

      1. associate-*r/ 85.8%

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

   7. Simplified 85.8%

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

      1. clear-num 85.8%

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

      2. div-inv 86.0%

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

   9. Applied egg-rr 86.0%

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

Alternative 4: 95.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{-182} \lor \neg \left(z \leq 5.5 \cdot 10^{-174}\right):\\ \;\;\;\;x + z \cdot \frac{y - x}{t}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y \cdot z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -3.6e-182) (not (<= z 5.5e-174)))
   (+ x (* z (/ (- y x) t)))
   (+ x (/ (* y z) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -3.6e-182) || !(z <= 5.5e-174)) {
		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 <= (-3.6d-182)) .or. (.not. (z <= 5.5d-174))) 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 <= -3.6e-182) || !(z <= 5.5e-174)) {
		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 <= -3.6e-182) or not (z <= 5.5e-174):
		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 <= -3.6e-182) || !(z <= 5.5e-174))
		tmp = Float64(x + Float64(z * Float64(Float64(y - x) / t)));
	else
		tmp = Float64(x + Float64(Float64(y * z) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -3.6e-182) || ~((z <= 5.5e-174)))
		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, -3.6e-182], N[Not[LessEqual[z, 5.5e-174]], $MachinePrecision]], N[(x + N[(z * N[(N[(y - x), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.59999999999999977e-182 or 5.4999999999999999e-174 < z

   1. Initial program 89.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 y around 0 82.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 82.0%

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

      2. associate-*r/ 83.3%

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

      3. mul-1-neg 83.3%

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

      4. associate-/l* 87.4%

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

      5. distribute-lft-neg-out 87.4%

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

      6. distribute-rgt-out 98.4%

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

      7. sub-neg 98.4%

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

      8. associate-*l/ 89.5%

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

      9. associate-*r/ 96.1%

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

   7. Simplified 96.1%

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

   if -3.59999999999999977e-182 < z < 5.4999999999999999e-174

   1. Initial program 96.7%

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

   3. Taylor expanded in y around inf 94.9%

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

      1. *-commutative 94.9%

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

   5. Simplified 94.9%

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

4. Final simplification 95.9%

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

Alternative 5: 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 91.1%

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

   1. associate-/l* 97.9%

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

3. Simplified 97.9%

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

Alternative 6: 65.0% 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 91.1%

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

   1. associate-/l* 97.9%

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

3. Simplified 97.9%

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

5. Taylor expanded in x around inf 65.3%

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

   1. mul-1-neg 65.3%

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

   2. unsub-neg 65.3%

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

7. Simplified 65.3%

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

Alternative 7: 38.8% 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 91.1%

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

   1. associate-/l* 97.9%

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

3. Simplified 97.9%

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

5. Taylor expanded in z around 0 36.8%

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

Developer target: 97.8% 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 2024107 
(FPCore (x y z t)
  :name "Numeric.Histogram:binBounds from Chart-1.5.3"
  :precision binary64

  :alt
  (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)))))

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