fabs fraction 1

Percentage Accurate: 91.6% → 99.9%

Time: 7.4s

Alternatives: 6

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = abs((((x + 4.0d0) / y) - ((x / y) * z)))
end function

Java

public static double code(double x, double y, double z) {
	return Math.abs((((x + 4.0) / y) - ((x / y) * z)));
}

Python

def code(x, y, z):
	return math.fabs((((x + 4.0) / y) - ((x / y) * z)))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 91.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = abs((((x + 4.0d0) / y) - ((x / y) * z)))
end function

Java

public static double code(double x, double y, double z) {
	return Math.abs((((x + 4.0) / y) - ((x / y) * z)));
}

Python

def code(x, y, z):
	return math.fabs((((x + 4.0) / y) - ((x / y) * z)))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 132000000:\\ \;\;\;\;\left|\frac{\left(x + 4\right) - x \cdot z}{y\_m}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{x + 4}{y\_m} - \frac{x}{\frac{y\_m}{z}}\right|\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m z)
 :precision binary64
 (if (<= y_m 132000000.0)
   (fabs (/ (- (+ x 4.0) (* x z)) y_m))
   (fabs (- (/ (+ x 4.0) y_m) (/ x (/ y_m z))))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double tmp;
	if (y_m <= 132000000.0) {
		tmp = fabs((((x + 4.0) - (x * z)) / y_m));
	} else {
		tmp = fabs((((x + 4.0) / y_m) - (x / (y_m / z))));
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y_m <= 132000000.0d0) then
        tmp = abs((((x + 4.0d0) - (x * z)) / y_m))
    else
        tmp = abs((((x + 4.0d0) / y_m) - (x / (y_m / z))))
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m, double z) {
	double tmp;
	if (y_m <= 132000000.0) {
		tmp = Math.abs((((x + 4.0) - (x * z)) / y_m));
	} else {
		tmp = Math.abs((((x + 4.0) / y_m) - (x / (y_m / z))));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	tmp = 0
	if y_m <= 132000000.0:
		tmp = math.fabs((((x + 4.0) - (x * z)) / y_m))
	else:
		tmp = math.fabs((((x + 4.0) / y_m) - (x / (y_m / z))))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	tmp = 0.0
	if (y_m <= 132000000.0)
		tmp = abs(Float64(Float64(Float64(x + 4.0) - Float64(x * z)) / y_m));
	else
		tmp = abs(Float64(Float64(Float64(x + 4.0) / y_m) - Float64(x / Float64(y_m / z))));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m, z)
	tmp = 0.0;
	if (y_m <= 132000000.0)
		tmp = abs((((x + 4.0) - (x * z)) / y_m));
	else
		tmp = abs((((x + 4.0) / y_m) - (x / (y_m / z))));
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_, z_] := If[LessEqual[y$95$m, 132000000.0], N[Abs[N[(N[(N[(x + 4.0), $MachinePrecision] - N[(x * z), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(N[(x + 4.0), $MachinePrecision] / y$95$m), $MachinePrecision] - N[(x / N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 1.32e8

   1. Initial program 90.7%

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

      1. associate-*l/ 92.3%

         \[\leadsto \left|\frac{x + 4}{y} - \color{blue}{\frac{x \cdot z}{y}}\right| \]

      2. sub-div 96.0%

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

   4. Applied egg-rr 96.0%

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

   if 1.32e8 < y

   1. Initial program 94.1%

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

      1. associate-*l/ 94.0%

         \[\leadsto \left|\frac{x + 4}{y} - \color{blue}{\frac{x \cdot z}{y}}\right| \]

      2. associate-*r/ 99.9%

         \[\leadsto \left|\frac{x + 4}{y} - \color{blue}{x \cdot \frac{z}{y}}\right| \]

      3. clear-num 99.9%

         \[\leadsto \left|\frac{x + 4}{y} - x \cdot \color{blue}{\frac{1}{\frac{y}{z}}}\right| \]

      4. un-div-inv 99.9%

         \[\leadsto \left|\frac{x + 4}{y} - \color{blue}{\frac{x}{\frac{y}{z}}}\right| \]

   4. Applied egg-rr 99.9%

      \[\leadsto \left|\frac{x + 4}{y} - \color{blue}{\frac{x}{\frac{y}{z}}}\right| \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 132000000:\\ \;\;\;\;\left|\frac{\left(x + 4\right) - x \cdot z}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{x + 4}{y} - \frac{x}{\frac{y}{z}}\right|\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 68.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} t_0 := \left|z \cdot \frac{x}{y\_m}\right|\\ t_1 := \left|\frac{x}{y\_m}\right|\\ \mathbf{if}\;x \leq -2.5 \cdot 10^{+105}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -5.1 \cdot 10^{+76}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -1.15 \cdot 10^{-99}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 4:\\ \;\;\;\;\left|\frac{4}{y\_m}\right|\\ \mathbf{elif}\;x \leq 2.1 \cdot 10^{+198} \lor \neg \left(x \leq 3.3 \cdot 10^{+243}\right):\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m z)
 :precision binary64
 (let* ((t_0 (fabs (* z (/ x y_m)))) (t_1 (fabs (/ x y_m))))
   (if (<= x -2.5e+105)
     t_0
     (if (<= x -5.1e+76)
       t_1
       (if (<= x -1.15e-99)
         t_0
         (if (<= x 4.0)
           (fabs (/ 4.0 y_m))
           (if (or (<= x 2.1e+198) (not (<= x 3.3e+243))) t_1 t_0)))))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double t_0 = fabs((z * (x / y_m)));
	double t_1 = fabs((x / y_m));
	double tmp;
	if (x <= -2.5e+105) {
		tmp = t_0;
	} else if (x <= -5.1e+76) {
		tmp = t_1;
	} else if (x <= -1.15e-99) {
		tmp = t_0;
	} else if (x <= 4.0) {
		tmp = fabs((4.0 / y_m));
	} else if ((x <= 2.1e+198) || !(x <= 3.3e+243)) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = abs((z * (x / y_m)))
    t_1 = abs((x / y_m))
    if (x <= (-2.5d+105)) then
        tmp = t_0
    else if (x <= (-5.1d+76)) then
        tmp = t_1
    else if (x <= (-1.15d-99)) then
        tmp = t_0
    else if (x <= 4.0d0) then
        tmp = abs((4.0d0 / y_m))
    else if ((x <= 2.1d+198) .or. (.not. (x <= 3.3d+243))) then
        tmp = t_1
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m, double z) {
	double t_0 = Math.abs((z * (x / y_m)));
	double t_1 = Math.abs((x / y_m));
	double tmp;
	if (x <= -2.5e+105) {
		tmp = t_0;
	} else if (x <= -5.1e+76) {
		tmp = t_1;
	} else if (x <= -1.15e-99) {
		tmp = t_0;
	} else if (x <= 4.0) {
		tmp = Math.abs((4.0 / y_m));
	} else if ((x <= 2.1e+198) || !(x <= 3.3e+243)) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	t_0 = math.fabs((z * (x / y_m)))
	t_1 = math.fabs((x / y_m))
	tmp = 0
	if x <= -2.5e+105:
		tmp = t_0
	elif x <= -5.1e+76:
		tmp = t_1
	elif x <= -1.15e-99:
		tmp = t_0
	elif x <= 4.0:
		tmp = math.fabs((4.0 / y_m))
	elif (x <= 2.1e+198) or not (x <= 3.3e+243):
		tmp = t_1
	else:
		tmp = t_0
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	t_0 = abs(Float64(z * Float64(x / y_m)))
	t_1 = abs(Float64(x / y_m))
	tmp = 0.0
	if (x <= -2.5e+105)
		tmp = t_0;
	elseif (x <= -5.1e+76)
		tmp = t_1;
	elseif (x <= -1.15e-99)
		tmp = t_0;
	elseif (x <= 4.0)
		tmp = abs(Float64(4.0 / y_m));
	elseif ((x <= 2.1e+198) || !(x <= 3.3e+243))
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m, z)
	t_0 = abs((z * (x / y_m)));
	t_1 = abs((x / y_m));
	tmp = 0.0;
	if (x <= -2.5e+105)
		tmp = t_0;
	elseif (x <= -5.1e+76)
		tmp = t_1;
	elseif (x <= -1.15e-99)
		tmp = t_0;
	elseif (x <= 4.0)
		tmp = abs((4.0 / y_m));
	elseif ((x <= 2.1e+198) || ~((x <= 3.3e+243)))
		tmp = t_1;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_, z_] := Block[{t$95$0 = N[Abs[N[(z * N[(x / y$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$1 = N[Abs[N[(x / y$95$m), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x, -2.5e+105], t$95$0, If[LessEqual[x, -5.1e+76], t$95$1, If[LessEqual[x, -1.15e-99], t$95$0, If[LessEqual[x, 4.0], N[Abs[N[(4.0 / y$95$m), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[x, 2.1e+198], N[Not[LessEqual[x, 3.3e+243]], $MachinePrecision]], t$95$1, t$95$0]]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.50000000000000023e105 or -5.1000000000000002e76 < x < -1.1499999999999999e-99 or 2.10000000000000013e198 < x < 3.29999999999999994e243

   1. Initial program 90.2%

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

      1. fabs-sub 90.2%

         \[\leadsto \color{blue}{\left|\frac{x}{y} \cdot z - \frac{x + 4}{y}\right|} \]

      2. associate-*l/ 84.4%

         \[\leadsto \left|\color{blue}{\frac{x \cdot z}{y}} - \frac{x + 4}{y}\right| \]

      3. associate-*r/ 92.5%

         \[\leadsto \left|\color{blue}{x \cdot \frac{z}{y}} - \frac{x + 4}{y}\right| \]

      4. fma-neg 96.8%

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

      5. distribute-neg-frac 96.8%

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

      6. +-commutative 96.8%

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

      7. distribute-neg-in 96.8%

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

      8. unsub-neg 96.8%

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

      9. metadata-eval 96.8%

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

   3. Simplified 96.8%

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

   5. Taylor expanded in x around inf 87.1%

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

   6. Taylor expanded in z around inf 52.9%

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

      1. associate-*l/ 72.1%

         \[\leadsto \left|\color{blue}{\frac{x}{y} \cdot z}\right| \]

      2. *-commutative 72.1%

         \[\leadsto \left|\color{blue}{z \cdot \frac{x}{y}}\right| \]

   8. Simplified 72.1%

      \[\leadsto \left|\color{blue}{z \cdot \frac{x}{y}}\right| \]

   if -2.50000000000000023e105 < x < -5.1000000000000002e76 or 4 < x < 2.10000000000000013e198 or 3.29999999999999994e243 < x

   1. Initial program 90.2%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 96.0%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 96.2%

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

      1. mul-1-neg 96.2%

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

      2. *-commutative 96.2%

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

      3. associate-/l* 99.8%

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

      4. distribute-lft-neg-in 99.8%

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

      5. neg-sub0 99.8%

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

      6. associate-+l- 99.8%

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

      7. neg-sub0 99.8%

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

      8. +-commutative 99.8%

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

      9. unsub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in z around 0 78.7%

      \[\leadsto \left|\color{blue}{\frac{x}{y}}\right| \]

   if -1.1499999999999999e-99 < x < 4

   1. Initial program 93.2%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 77.9%

      \[\leadsto \left|\color{blue}{\frac{4}{y}}\right| \]
3. Recombined 3 regimes into one program.

4. Final simplification 76.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.5 \cdot 10^{+105}:\\ \;\;\;\;\left|z \cdot \frac{x}{y}\right|\\ \mathbf{elif}\;x \leq -5.1 \cdot 10^{+76}:\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{elif}\;x \leq -1.15 \cdot 10^{-99}:\\ \;\;\;\;\left|z \cdot \frac{x}{y}\right|\\ \mathbf{elif}\;x \leq 4:\\ \;\;\;\;\left|\frac{4}{y}\right|\\ \mathbf{elif}\;x \leq 2.1 \cdot 10^{+198} \lor \neg \left(x \leq 3.3 \cdot 10^{+243}\right):\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|z \cdot \frac{x}{y}\right|\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;z \leq -2.3 \cdot 10^{+89} \lor \neg \left(z \leq 3.5 \cdot 10^{+108}\right):\\ \;\;\;\;\left|\frac{x}{\frac{y\_m}{z}}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{-4 - x}{y\_m}\right|\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m z)
 :precision binary64
 (if (or (<= z -2.3e+89) (not (<= z 3.5e+108)))
   (fabs (/ x (/ y_m z)))
   (fabs (/ (- -4.0 x) y_m))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double tmp;
	if ((z <= -2.3e+89) || !(z <= 3.5e+108)) {
		tmp = fabs((x / (y_m / z)));
	} else {
		tmp = fabs(((-4.0 - x) / y_m));
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-2.3d+89)) .or. (.not. (z <= 3.5d+108))) then
        tmp = abs((x / (y_m / z)))
    else
        tmp = abs((((-4.0d0) - x) / y_m))
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m, double z) {
	double tmp;
	if ((z <= -2.3e+89) || !(z <= 3.5e+108)) {
		tmp = Math.abs((x / (y_m / z)));
	} else {
		tmp = Math.abs(((-4.0 - x) / y_m));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	tmp = 0
	if (z <= -2.3e+89) or not (z <= 3.5e+108):
		tmp = math.fabs((x / (y_m / z)))
	else:
		tmp = math.fabs(((-4.0 - x) / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	tmp = 0.0
	if ((z <= -2.3e+89) || !(z <= 3.5e+108))
		tmp = abs(Float64(x / Float64(y_m / z)));
	else
		tmp = abs(Float64(Float64(-4.0 - x) / y_m));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m, z)
	tmp = 0.0;
	if ((z <= -2.3e+89) || ~((z <= 3.5e+108)))
		tmp = abs((x / (y_m / z)));
	else
		tmp = abs(((-4.0 - x) / y_m));
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_, z_] := If[Or[LessEqual[z, -2.3e+89], N[Not[LessEqual[z, 3.5e+108]], $MachinePrecision]], N[Abs[N[(x / N[(y$95$m / z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(-4.0 - x), $MachinePrecision] / y$95$m), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.2999999999999999e89 or 3.5000000000000002e108 < z

   1. Initial program 89.5%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 88.5%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 73.7%

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

      1. mul-1-neg 73.7%

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

      2. distribute-frac-neg2 73.7%

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

      3. associate-/l* 80.7%

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

   7. Simplified 80.7%

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

      1. clear-num 80.7%

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

      2. un-div-inv 82.3%

         \[\leadsto \left|\color{blue}{\frac{x}{\frac{-y}{z}}}\right| \]

      3. add-sqr-sqrt 40.2%

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

      4. sqrt-unprod 63.4%

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

      5. sqr-neg 63.4%

         \[\leadsto \left|\frac{x}{\frac{\sqrt{\color{blue}{y \cdot y}}}{z}}\right| \]

      6. sqrt-unprod 41.8%

         \[\leadsto \left|\frac{x}{\frac{\color{blue}{\sqrt{y} \cdot \sqrt{y}}}{z}}\right| \]

      7. add-sqr-sqrt 82.3%

         \[\leadsto \left|\frac{x}{\frac{\color{blue}{y}}{z}}\right| \]

   9. Applied egg-rr 82.3%

      \[\leadsto \left|\color{blue}{\frac{x}{\frac{y}{z}}}\right| \]

   if -2.2999999999999999e89 < z < 3.5000000000000002e108

   1. Initial program 92.6%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 99.2%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 92.1%

      \[\leadsto \left|\color{blue}{\frac{4 + x}{y}}\right| \]
   6. Step-by-step derivation

      1. +-commutative 92.1%

         \[\leadsto \left|\frac{\color{blue}{x + 4}}{y}\right| \]

      2. rem-square-sqrt 44.5%

         \[\leadsto \left|\color{blue}{\sqrt{\frac{x + 4}{y}} \cdot \sqrt{\frac{x + 4}{y}}}\right| \]

      3. fabs-sqr 44.5%

         \[\leadsto \left|\color{blue}{\left|\sqrt{\frac{x + 4}{y}} \cdot \sqrt{\frac{x + 4}{y}}\right|}\right| \]

      4. rem-square-sqrt 92.1%

         \[\leadsto \left|\left|\color{blue}{\frac{x + 4}{y}}\right|\right| \]

      5. fabs-neg 92.1%

         \[\leadsto \left|\color{blue}{\left|-\frac{x + 4}{y}\right|}\right| \]

      6. distribute-neg-frac 92.1%

         \[\leadsto \left|\left|\color{blue}{\frac{-\left(x + 4\right)}{y}}\right|\right| \]

      7. distribute-neg-in 92.1%

         \[\leadsto \left|\left|\frac{\color{blue}{\left(-x\right) + \left(-4\right)}}{y}\right|\right| \]

      8. metadata-eval 92.1%

         \[\leadsto \left|\left|\frac{\left(-x\right) + \color{blue}{-4}}{y}\right|\right| \]

      9. +-commutative 92.1%

         \[\leadsto \left|\left|\frac{\color{blue}{-4 + \left(-x\right)}}{y}\right|\right| \]

      10. sub-neg 92.1%

          \[\leadsto \left|\left|\frac{\color{blue}{-4 - x}}{y}\right|\right| \]

      11. rem-square-sqrt 47.1%

          \[\leadsto \left|\left|\color{blue}{\sqrt{\frac{-4 - x}{y}} \cdot \sqrt{\frac{-4 - x}{y}}}\right|\right| \]

      12. fabs-sqr 47.1%

          \[\leadsto \left|\color{blue}{\sqrt{\frac{-4 - x}{y}} \cdot \sqrt{\frac{-4 - x}{y}}}\right| \]

      13. rem-square-sqrt 92.1%

          \[\leadsto \left|\color{blue}{\frac{-4 - x}{y}}\right| \]

   7. Simplified 92.1%

      \[\leadsto \left|\color{blue}{\frac{-4 - x}{y}}\right| \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.6%

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

Alternative 4: 97.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+57}:\\ \;\;\;\;\left|\left(1 - z\right) \cdot \frac{x}{y\_m}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{\left(x + 4\right) - x \cdot z}{y\_m}\right|\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m z)
 :precision binary64
 (if (<= x -1e+57)
   (fabs (* (- 1.0 z) (/ x y_m)))
   (fabs (/ (- (+ x 4.0) (* x z)) y_m))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double tmp;
	if (x <= -1e+57) {
		tmp = fabs(((1.0 - z) * (x / y_m)));
	} else {
		tmp = fabs((((x + 4.0) - (x * z)) / y_m));
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-1d+57)) then
        tmp = abs(((1.0d0 - z) * (x / y_m)))
    else
        tmp = abs((((x + 4.0d0) - (x * z)) / y_m))
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m, double z) {
	double tmp;
	if (x <= -1e+57) {
		tmp = Math.abs(((1.0 - z) * (x / y_m)));
	} else {
		tmp = Math.abs((((x + 4.0) - (x * z)) / y_m));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	tmp = 0
	if x <= -1e+57:
		tmp = math.fabs(((1.0 - z) * (x / y_m)))
	else:
		tmp = math.fabs((((x + 4.0) - (x * z)) / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	tmp = 0.0
	if (x <= -1e+57)
		tmp = abs(Float64(Float64(1.0 - z) * Float64(x / y_m)));
	else
		tmp = abs(Float64(Float64(Float64(x + 4.0) - Float64(x * z)) / y_m));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m, z)
	tmp = 0.0;
	if (x <= -1e+57)
		tmp = abs(((1.0 - z) * (x / y_m)));
	else
		tmp = abs((((x + 4.0) - (x * z)) / y_m));
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_, z_] := If[LessEqual[x, -1e+57], N[Abs[N[(N[(1.0 - z), $MachinePrecision] * N[(x / y$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[Abs[N[(N[(N[(x + 4.0), $MachinePrecision] - N[(x * z), $MachinePrecision]), $MachinePrecision] / y$95$m), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.00000000000000005e57

   1. Initial program 88.7%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 87.6%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 87.8%

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

      1. mul-1-neg 87.8%

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

      2. *-commutative 87.8%

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

      3. associate-/l* 100.0%

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

      4. distribute-lft-neg-in 100.0%

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

      5. neg-sub0 100.0%

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

      6. associate-+l- 100.0%

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

      7. neg-sub0 100.0%

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

      8. +-commutative 100.0%

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

      9. unsub-neg 100.0%

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

   7. Simplified 100.0%

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

   if -1.00000000000000005e57 < x

   1. Initial program 92.4%

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

      1. associate-*l/ 96.4%

         \[\leadsto \left|\frac{x + 4}{y} - \color{blue}{\frac{x \cdot z}{y}}\right| \]

      2. sub-div 97.9%

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

   4. Applied egg-rr 97.9%

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

4. Final simplification 98.4%

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

Alternative 5: 68.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -1.55 \lor \neg \left(x \leq 4\right):\\ \;\;\;\;\left|\frac{x}{y\_m}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{4}{y\_m}\right|\\ \end{array} \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m z)
 :precision binary64
 (if (or (<= x -1.55) (not (<= x 4.0))) (fabs (/ x y_m)) (fabs (/ 4.0 y_m))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double tmp;
	if ((x <= -1.55) || !(x <= 4.0)) {
		tmp = fabs((x / y_m));
	} else {
		tmp = fabs((4.0 / y_m));
	}
	return tmp;
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.55d0)) .or. (.not. (x <= 4.0d0))) then
        tmp = abs((x / y_m))
    else
        tmp = abs((4.0d0 / y_m))
    end if
    code = tmp
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m, double z) {
	double tmp;
	if ((x <= -1.55) || !(x <= 4.0)) {
		tmp = Math.abs((x / y_m));
	} else {
		tmp = Math.abs((4.0 / y_m));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	tmp = 0
	if (x <= -1.55) or not (x <= 4.0):
		tmp = math.fabs((x / y_m))
	else:
		tmp = math.fabs((4.0 / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	tmp = 0.0
	if ((x <= -1.55) || !(x <= 4.0))
		tmp = abs(Float64(x / y_m));
	else
		tmp = abs(Float64(4.0 / y_m));
	end
	return tmp
end

MATLAB

y_m = abs(y);
function tmp_2 = code(x, y_m, z)
	tmp = 0.0;
	if ((x <= -1.55) || ~((x <= 4.0)))
		tmp = abs((x / y_m));
	else
		tmp = abs((4.0 / y_m));
	end
	tmp_2 = tmp;
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_, z_] := If[Or[LessEqual[x, -1.55], N[Not[LessEqual[x, 4.0]], $MachinePrecision]], N[Abs[N[(x / y$95$m), $MachinePrecision]], $MachinePrecision], N[Abs[N[(4.0 / y$95$m), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.55000000000000004 or 4 < x

   1. Initial program 88.5%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 90.6%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 90.1%

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

      1. mul-1-neg 90.1%

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

      2. *-commutative 90.1%

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

      3. associate-/l* 99.3%

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

      4. distribute-lft-neg-in 99.3%

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

      5. neg-sub0 99.3%

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

      6. associate-+l- 99.3%

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

      7. neg-sub0 99.3%

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

      8. +-commutative 99.3%

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

      9. unsub-neg 99.3%

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

   7. Simplified 99.3%

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

   8. Taylor expanded in z around 0 61.8%

      \[\leadsto \left|\color{blue}{\frac{x}{y}}\right| \]

   if -1.55000000000000004 < x < 4

   1. Initial program 94.3%

      \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 72.1%

      \[\leadsto \left|\color{blue}{\frac{4}{y}}\right| \]
3. Recombined 2 regimes into one program.

4. Final simplification 67.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.55 \lor \neg \left(x \leq 4\right):\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{4}{y}\right|\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 39.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \left|\frac{4}{y\_m}\right| \end{array} \]

FPCore

y_m = (fabs.f64 y)
(FPCore (x y_m z) :precision binary64 (fabs (/ 4.0 y_m)))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	return fabs((4.0 / y_m));
}

Fortran

y_m = abs(y)
real(8) function code(x, y_m, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = abs((4.0d0 / y_m))
end function

Java

y_m = Math.abs(y);
public static double code(double x, double y_m, double z) {
	return Math.abs((4.0 / y_m));
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	return math.fabs((4.0 / y_m))

Julia

y_m = abs(y)
function code(x, y_m, z)
	return abs(Float64(4.0 / y_m))
end

MATLAB

y_m = abs(y);
function tmp = code(x, y_m, z)
	tmp = abs((4.0 / y_m));
end

Wolfram

y_m = N[Abs[y], $MachinePrecision]
code[x_, y$95$m_, z_] := N[Abs[N[(4.0 / y$95$m), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 91.5%

   \[\left|\frac{x + 4}{y} - \frac{x}{y} \cdot z\right| \]

3. Simplified 95.4%

   \[\leadsto \color{blue}{\left|\frac{-1}{y} \cdot \mathsf{fma}\left(x, z, -4 - x\right)\right|} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 39.8%

   \[\leadsto \left|\color{blue}{\frac{4}{y}}\right| \]

6. Final simplification 39.8%

   \[\leadsto \left|\frac{4}{y}\right| \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024076 
(FPCore (x y z)
  :name "fabs fraction 1"
  :precision binary64
  (fabs (- (/ (+ x 4.0) y) (* (/ x y) z))))