fabs fraction 1

Percentage Accurate: 91.8% → 99.8%

Time: 7.2s

Alternatives: 9

Speedup: 1.0×

• 20.1% 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.8% 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.8% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.00000000000000023e-26

   1. Initial program 95.4%

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

      1. associate-*l/ 96.3%

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

      2. sub-div 98.4%

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

   4. Applied egg-rr 98.4%

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

   if 6.00000000000000023e-26 < y

   1. Initial program 97.0%

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

      1. fabs-sub 97.0%

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

      2. associate-*l/ 93.1%

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

      3. associate-*r/ 99.9%

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

      4. fma-neg 99.9%

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

      5. distribute-neg-frac 99.9%

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

      6. +-commutative 99.9%

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

      7. distribute-neg-in 99.9%

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

      8. unsub-neg 99.9%

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

      9. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

Alternative 2: 97.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} t_0 := \frac{x + 4}{y\_m}\\ t_1 := z \cdot \frac{x}{y\_m}\\ \mathbf{if}\;t\_0 - t\_1 \leq -5 \cdot 10^{+110}:\\ \;\;\;\;\left|t\_1 - t\_0\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
 (let* ((t_0 (/ (+ x 4.0) y_m)) (t_1 (* z (/ x y_m))))
   (if (<= (- t_0 t_1) -5e+110)
     (fabs (- t_1 t_0))
     (fabs (/ (- (+ x 4.0) (* x z)) y_m)))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double t_0 = (x + 4.0) / y_m;
	double t_1 = z * (x / y_m);
	double tmp;
	if ((t_0 - t_1) <= -5e+110) {
		tmp = fabs((t_1 - t_0));
	} 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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (x + 4.0d0) / y_m
    t_1 = z * (x / y_m)
    if ((t_0 - t_1) <= (-5d+110)) then
        tmp = abs((t_1 - t_0))
    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 t_0 = (x + 4.0) / y_m;
	double t_1 = z * (x / y_m);
	double tmp;
	if ((t_0 - t_1) <= -5e+110) {
		tmp = Math.abs((t_1 - t_0));
	} 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):
	t_0 = (x + 4.0) / y_m
	t_1 = z * (x / y_m)
	tmp = 0
	if (t_0 - t_1) <= -5e+110:
		tmp = math.fabs((t_1 - t_0))
	else:
		tmp = math.fabs((((x + 4.0) - (x * z)) / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	t_0 = Float64(Float64(x + 4.0) / y_m)
	t_1 = Float64(z * Float64(x / y_m))
	tmp = 0.0
	if (Float64(t_0 - t_1) <= -5e+110)
		tmp = abs(Float64(t_1 - t_0));
	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)
	t_0 = (x + 4.0) / y_m;
	t_1 = z * (x / y_m);
	tmp = 0.0;
	if ((t_0 - t_1) <= -5e+110)
		tmp = abs((t_1 - t_0));
	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_] := Block[{t$95$0 = N[(N[(x + 4.0), $MachinePrecision] / y$95$m), $MachinePrecision]}, Block[{t$95$1 = N[(z * N[(x / y$95$m), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(t$95$0 - t$95$1), $MachinePrecision], -5e+110], N[Abs[N[(t$95$1 - t$95$0), $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 (-.f64 (/.f64 (+.f64 x #s(literal 4 binary64)) y) (*.f64 (/.f64 x y) z)) < -4.99999999999999978e110

   1. Initial program 99.9%

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

   if -4.99999999999999978e110 < (-.f64 (/.f64 (+.f64 x #s(literal 4 binary64)) y) (*.f64 (/.f64 x y) z))

   1. Initial program 94.6%

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

      1. associate-*l/ 95.0%

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

      2. sub-div 97.1%

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

   4. Applied egg-rr 97.1%

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

4. Final simplification 97.7%

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

Alternative 3: 68.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} t_0 := \left|z \cdot \frac{x}{y\_m}\right|\\ \mathbf{if}\;x \leq -2.05 \cdot 10^{+157}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq -1.18 \cdot 10^{+54}:\\ \;\;\;\;\left|\frac{x}{y\_m}\right|\\ \mathbf{elif}\;x \leq -1.4 \cdot 10^{-9} \lor \neg \left(x \leq 1.5 \cdot 10^{-61}\right):\\ \;\;\;\;t\_0\\ \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
 (let* ((t_0 (fabs (* z (/ x y_m)))))
   (if (<= x -2.05e+157)
     t_0
     (if (<= x -1.18e+54)
       (fabs (/ x y_m))
       (if (or (<= x -1.4e-9) (not (<= x 1.5e-61))) t_0 (fabs (/ 4.0 y_m)))))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double t_0 = fabs((z * (x / y_m)));
	double tmp;
	if (x <= -2.05e+157) {
		tmp = t_0;
	} else if (x <= -1.18e+54) {
		tmp = fabs((x / y_m));
	} else if ((x <= -1.4e-9) || !(x <= 1.5e-61)) {
		tmp = t_0;
	} 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) :: t_0
    real(8) :: tmp
    t_0 = abs((z * (x / y_m)))
    if (x <= (-2.05d+157)) then
        tmp = t_0
    else if (x <= (-1.18d+54)) then
        tmp = abs((x / y_m))
    else if ((x <= (-1.4d-9)) .or. (.not. (x <= 1.5d-61))) then
        tmp = t_0
    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 t_0 = Math.abs((z * (x / y_m)));
	double tmp;
	if (x <= -2.05e+157) {
		tmp = t_0;
	} else if (x <= -1.18e+54) {
		tmp = Math.abs((x / y_m));
	} else if ((x <= -1.4e-9) || !(x <= 1.5e-61)) {
		tmp = t_0;
	} else {
		tmp = Math.abs((4.0 / y_m));
	}
	return tmp;
}

Python

y_m = math.fabs(y)
def code(x, y_m, z):
	t_0 = math.fabs((z * (x / y_m)))
	tmp = 0
	if x <= -2.05e+157:
		tmp = t_0
	elif x <= -1.18e+54:
		tmp = math.fabs((x / y_m))
	elif (x <= -1.4e-9) or not (x <= 1.5e-61):
		tmp = t_0
	else:
		tmp = math.fabs((4.0 / y_m))
	return tmp

Julia

y_m = abs(y)
function code(x, y_m, z)
	t_0 = abs(Float64(z * Float64(x / y_m)))
	tmp = 0.0
	if (x <= -2.05e+157)
		tmp = t_0;
	elseif (x <= -1.18e+54)
		tmp = abs(Float64(x / y_m));
	elseif ((x <= -1.4e-9) || !(x <= 1.5e-61))
		tmp = t_0;
	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)
	t_0 = abs((z * (x / y_m)));
	tmp = 0.0;
	if (x <= -2.05e+157)
		tmp = t_0;
	elseif (x <= -1.18e+54)
		tmp = abs((x / y_m));
	elseif ((x <= -1.4e-9) || ~((x <= 1.5e-61)))
		tmp = t_0;
	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_] := Block[{t$95$0 = N[Abs[N[(z * N[(x / y$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[x, -2.05e+157], t$95$0, If[LessEqual[x, -1.18e+54], N[Abs[N[(x / y$95$m), $MachinePrecision]], $MachinePrecision], If[Or[LessEqual[x, -1.4e-9], N[Not[LessEqual[x, 1.5e-61]], $MachinePrecision]], t$95$0, N[Abs[N[(4.0 / y$95$m), $MachinePrecision]], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.05000000000000008e157 or -1.1799999999999999e54 < x < -1.39999999999999992e-9 or 1.50000000000000006e-61 < x

   1. Initial program 93.6%

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

   3. Simplified 93.1%

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

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

      1. associate-*r/ 58.8%

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

      2. neg-mul-1 58.8%

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

      3. distribute-rgt-neg-in 58.8%

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

   7. Simplified 58.8%

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

      1. *-commutative 58.8%

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

      2. associate-/l* 73.0%

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

      3. add-sqr-sqrt 41.2%

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

      4. sqrt-unprod 49.1%

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

      5. sqr-neg 49.1%

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

      6. sqrt-unprod 31.5%

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

      7. add-sqr-sqrt 73.0%

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

      8. *-commutative 73.0%

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

   9. Applied egg-rr 73.0%

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

   if -2.05000000000000008e157 < x < -1.1799999999999999e54

   1. Initial program 100.0%

      \[\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 inf 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 99.8%

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

      3. associate-*r* 99.8%

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

      4. *-commutative 99.8%

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

      5. associate-*r/ 99.8%

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

      6. mul-1-neg 99.8%

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

      7. neg-sub0 99.8%

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

      8. associate-+l- 99.8%

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

      9. neg-sub0 99.8%

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

      10. +-commutative 99.8%

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

      11. unsub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in z around 0 85.4%

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

   if -1.39999999999999992e-9 < x < 1.50000000000000006e-61

   1. Initial program 97.3%

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

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

4. Final simplification 78.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.05 \cdot 10^{+157}:\\ \;\;\;\;\left|z \cdot \frac{x}{y}\right|\\ \mathbf{elif}\;x \leq -1.18 \cdot 10^{+54}:\\ \;\;\;\;\left|\frac{x}{y}\right|\\ \mathbf{elif}\;x \leq -1.4 \cdot 10^{-9} \lor \neg \left(x \leq 1.5 \cdot 10^{-61}\right):\\ \;\;\;\;\left|z \cdot \frac{x}{y}\right|\\ \mathbf{else}:\\ \;\;\;\;\left|\frac{4}{y}\right|\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 86.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{-9} \lor \neg \left(x \leq 1.5 \cdot 10^{-61}\right):\\ \;\;\;\;\left|x \cdot \frac{1 - z}{y\_m}\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 (<= x -4.8e-9) (not (<= x 1.5e-61)))
   (fabs (* x (/ (- 1.0 z) y_m)))
   (fabs (/ (- -4.0 x) y_m))))

C

y_m = fabs(y);
double code(double x, double y_m, double z) {
	double tmp;
	if ((x <= -4.8e-9) || !(x <= 1.5e-61)) {
		tmp = fabs((x * ((1.0 - z) / y_m)));
	} 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 ((x <= (-4.8d-9)) .or. (.not. (x <= 1.5d-61))) then
        tmp = abs((x * ((1.0d0 - z) / y_m)))
    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 ((x <= -4.8e-9) || !(x <= 1.5e-61)) {
		tmp = Math.abs((x * ((1.0 - z) / y_m)));
	} 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 (x <= -4.8e-9) or not (x <= 1.5e-61):
		tmp = math.fabs((x * ((1.0 - z) / y_m)))
	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 ((x <= -4.8e-9) || !(x <= 1.5e-61))
		tmp = abs(Float64(x * Float64(Float64(1.0 - z) / y_m)));
	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 ((x <= -4.8e-9) || ~((x <= 1.5e-61)))
		tmp = abs((x * ((1.0 - z) / y_m)));
	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[x, -4.8e-9], N[Not[LessEqual[x, 1.5e-61]], $MachinePrecision]], N[Abs[N[(x * N[(N[(1.0 - z), $MachinePrecision] / y$95$m), $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 x < -4.8e-9 or 1.50000000000000006e-61 < x

   1. Initial program 94.3%

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

   3. Simplified 93.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 inf 87.5%

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

      1. *-commutative 87.5%

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

      2. associate-/l* 93.3%

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

      3. associate-*r* 93.3%

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

      4. *-commutative 93.3%

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

      5. associate-*r/ 93.3%

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

      6. mul-1-neg 93.3%

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

      7. neg-sub0 93.3%

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

      8. associate-+l- 93.3%

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

      9. neg-sub0 93.3%

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

      10. +-commutative 93.3%

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

      11. unsub-neg 93.3%

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

   7. Simplified 93.3%

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

   if -4.8e-9 < x < 1.50000000000000006e-61

   1. Initial program 97.3%

      \[\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 z around 0 83.6%

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

      1. +-commutative 83.6%

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

      2. rem-square-sqrt 40.3%

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

      3. fabs-sqr 40.3%

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

      4. rem-square-sqrt 83.6%

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

      5. fabs-neg 83.6%

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

      6. distribute-neg-frac 83.6%

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

      7. distribute-neg-in 83.6%

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

      8. metadata-eval 83.6%

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

      9. +-commutative 83.6%

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

      10. sub-neg 83.6%

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

      11. rem-square-sqrt 42.7%

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

      12. fabs-sqr 42.7%

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

      13. rem-square-sqrt 83.6%

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

   7. Simplified 83.6%

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

4. Final simplification 88.4%

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

Alternative 5: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;y\_m \leq 2 \cdot 10^{-26}:\\ \;\;\;\;\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 2e-26)
   (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 <= 2e-26) {
		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 <= 2d-26) 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 <= 2e-26) {
		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 <= 2e-26:
		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 <= 2e-26)
		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 <= 2e-26)
		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, 2e-26], 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 < 2.0000000000000001e-26

   1. Initial program 95.4%

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

      1. associate-*l/ 96.3%

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

      2. sub-div 98.4%

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

   4. Applied egg-rr 98.4%

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

   if 2.0000000000000001e-26 < y

   1. Initial program 97.0%

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

      1. associate-*l/ 93.1%

         \[\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.8%

         \[\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. Add Preprocessing

Alternative 6: 86.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;z \leq -2.8 \cdot 10^{+100} \lor \neg \left(z \leq 2.3 \cdot 10^{+50}\right):\\ \;\;\;\;\left|z \cdot \frac{x}{y\_m}\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.8e+100) (not (<= z 2.3e+50)))
   (fabs (* z (/ x y_m)))
   (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.8e+100) || !(z <= 2.3e+50)) {
		tmp = fabs((z * (x / y_m)));
	} 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.8d+100)) .or. (.not. (z <= 2.3d+50))) then
        tmp = abs((z * (x / y_m)))
    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.8e+100) || !(z <= 2.3e+50)) {
		tmp = Math.abs((z * (x / y_m)));
	} 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.8e+100) or not (z <= 2.3e+50):
		tmp = math.fabs((z * (x / y_m)))
	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.8e+100) || !(z <= 2.3e+50))
		tmp = abs(Float64(z * Float64(x / y_m)));
	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.8e+100) || ~((z <= 2.3e+50)))
		tmp = abs((z * (x / y_m)));
	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.8e+100], N[Not[LessEqual[z, 2.3e+50]], $MachinePrecision]], N[Abs[N[(z * N[(x / y$95$m), $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.7999999999999998e100 or 2.29999999999999997e50 < z

   1. Initial program 94.5%

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

   3. Simplified 94.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 inf 74.9%

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

      1. associate-*r/ 74.9%

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

      2. neg-mul-1 74.9%

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

      3. distribute-rgt-neg-in 74.9%

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

   7. Simplified 74.9%

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

      1. *-commutative 74.9%

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

      2. associate-/l* 77.7%

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

      3. add-sqr-sqrt 38.3%

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

      4. sqrt-unprod 46.3%

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

      5. sqr-neg 46.3%

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

      6. sqrt-unprod 39.0%

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

      7. add-sqr-sqrt 77.7%

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

      8. *-commutative 77.7%

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

   9. Applied egg-rr 77.7%

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

   if -2.7999999999999998e100 < z < 2.29999999999999997e50

   1. Initial program 96.7%

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

   3. Simplified 98.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 z around 0 92.8%

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

      1. +-commutative 92.8%

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

      2. rem-square-sqrt 43.1%

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

      3. fabs-sqr 43.1%

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

      4. rem-square-sqrt 92.8%

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

      5. fabs-neg 92.8%

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

      6. distribute-neg-frac 92.8%

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

      7. distribute-neg-in 92.8%

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

      8. metadata-eval 92.8%

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

      9. +-commutative 92.8%

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

      10. sub-neg 92.8%

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

      11. rem-square-sqrt 49.3%

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

      12. fabs-sqr 49.3%

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

      13. rem-square-sqrt 92.8%

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

   7. Simplified 92.8%

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

4. Final simplification 86.8%

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

Alternative 7: 97.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -2.25 \cdot 10^{+167}:\\ \;\;\;\;\left|x \cdot \frac{1 - z}{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 -2.25e+167)
   (fabs (* x (/ (- 1.0 z) 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 <= -2.25e+167) {
		tmp = fabs((x * ((1.0 - z) / 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 <= (-2.25d+167)) then
        tmp = abs((x * ((1.0d0 - z) / 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 <= -2.25e+167) {
		tmp = Math.abs((x * ((1.0 - z) / 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 <= -2.25e+167:
		tmp = math.fabs((x * ((1.0 - z) / 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 <= -2.25e+167)
		tmp = abs(Float64(x * Float64(Float64(1.0 - z) / 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 <= -2.25e+167)
		tmp = abs((x * ((1.0 - z) / 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, -2.25e+167], N[Abs[N[(x * N[(N[(1.0 - z), $MachinePrecision] / 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 < -2.25e167

   1. Initial program 88.1%

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

   3. Simplified 72.1%

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

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

      1. *-commutative 72.2%

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

      2. associate-/l* 99.6%

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

      3. associate-*r* 99.6%

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

      4. *-commutative 99.6%

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

      5. associate-*r/ 99.6%

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

      6. mul-1-neg 99.6%

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

      7. neg-sub0 99.6%

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

      8. associate-+l- 99.6%

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

      9. neg-sub0 99.6%

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

      10. +-commutative 99.6%

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

      11. unsub-neg 99.6%

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

   7. Simplified 99.6%

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

   if -2.25e167 < x

   1. Initial program 96.4%

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

      1. associate-*l/ 97.5%

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

      2. sub-div 98.8%

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

   4. Applied egg-rr 98.8%

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

Alternative 8: 69.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} y_m = \left|y\right| \\ \begin{array}{l} \mathbf{if}\;x \leq -10.5 \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 -10.5) (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 <= -10.5) || !(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 <= (-10.5d0)) .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 <= -10.5) || !(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 <= -10.5) 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 <= -10.5) || !(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 <= -10.5) || ~((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, -10.5], 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 < -10.5 or 4 < x

   1. Initial program 93.1%

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

   3. Simplified 92.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 x around inf 90.9%

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

      1. *-commutative 90.9%

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

      2. associate-/l* 98.0%

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

      3. associate-*r* 98.0%

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

      4. *-commutative 98.0%

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

      5. associate-*r/ 98.0%

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

      6. mul-1-neg 98.0%

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

      7. neg-sub0 98.0%

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

      8. associate-+l- 98.0%

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

      9. neg-sub0 98.0%

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

      10. +-commutative 98.0%

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

      11. unsub-neg 98.0%

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

   7. Simplified 98.0%

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

   8. Taylor expanded in z around 0 53.5%

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

   if -10.5 < x < 4

   1. Initial program 97.7%

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

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

4. Final simplification 66.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -10.5 \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 9: 39.8% 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 95.8%

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

3. Simplified 96.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 47.0%

   \[\leadsto \left|\color{blue}{\frac{4}{y}}\right| \]
6. Add Preprocessing

Reproduce

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