Numeric.SpecFunctions:choose from math-functions-0.1.5.2

Percentage Accurate: 84.2% → 96.9%

Time: 4.8s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * (y + z)) / 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 = (x * (y + z)) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * (y + z)) / 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 = (x * (y + z)) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ \begin{array}{l} t_0 := \frac{x\_m \cdot \left(y + z\right)}{z}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -4 \cdot 10^{-149}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(\frac{y}{z} - -1\right)\\ \end{array} \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (let* ((t_0 (/ (* x_m (+ y z)) z)))
   (* x_s (if (<= t_0 -4e-149) t_0 (* x_m (- (/ y z) -1.0))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double t_0 = (x_m * (y + z)) / z;
	double tmp;
	if (t_0 <= -4e-149) {
		tmp = t_0;
	} else {
		tmp = x_m * ((y / z) - -1.0);
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x_m * (y + z)) / z
    if (t_0 <= (-4d-149)) then
        tmp = t_0
    else
        tmp = x_m * ((y / z) - (-1.0d0))
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double t_0 = (x_m * (y + z)) / z;
	double tmp;
	if (t_0 <= -4e-149) {
		tmp = t_0;
	} else {
		tmp = x_m * ((y / z) - -1.0);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	t_0 = (x_m * (y + z)) / z
	tmp = 0
	if t_0 <= -4e-149:
		tmp = t_0
	else:
		tmp = x_m * ((y / z) - -1.0)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	t_0 = Float64(Float64(x_m * Float64(y + z)) / z)
	tmp = 0.0
	if (t_0 <= -4e-149)
		tmp = t_0;
	else
		tmp = Float64(x_m * Float64(Float64(y / z) - -1.0));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	t_0 = (x_m * (y + z)) / z;
	tmp = 0.0;
	if (t_0 <= -4e-149)
		tmp = t_0;
	else
		tmp = x_m * ((y / z) - -1.0);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[(x$95$m * N[(y + z), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$0, -4e-149], t$95$0, N[(x$95$m * N[(N[(y / z), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (+.f64 y z)) z) < -3.99999999999999992e-149

   1. Initial program 91.8%

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

   if -3.99999999999999992e-149 < (/.f64 (*.f64 x (+.f64 y z)) z)

   1. Initial program 85.2%

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

      1. associate-/l* 98.1%

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

      2. remove-double-neg 98.1%

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

      3. unsub-neg 98.1%

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

      4. div-sub 98.1%

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

      5. remove-double-neg 98.1%

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

      6. distribute-frac-neg2 98.1%

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

      7. *-inverses 98.1%

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

      8. metadata-eval 98.1%

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

   3. Simplified 98.1%

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

Alternative 2: 68.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{-58}:\\ \;\;\;\;x\_m\\ \mathbf{elif}\;z \leq 8.8 \cdot 10^{-141}:\\ \;\;\;\;\frac{y}{\frac{z}{x\_m}}\\ \mathbf{elif}\;z \leq 2 \cdot 10^{+16}:\\ \;\;\;\;x\_m\\ \mathbf{elif}\;z \leq 5.6 \cdot 10^{+125}:\\ \;\;\;\;x\_m \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= z -1e-58)
    x_m
    (if (<= z 8.8e-141)
      (/ y (/ z x_m))
      (if (<= z 2e+16) x_m (if (<= z 5.6e+125) (* x_m (/ y z)) x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= -1e-58) {
		tmp = x_m;
	} else if (z <= 8.8e-141) {
		tmp = y / (z / x_m);
	} else if (z <= 2e+16) {
		tmp = x_m;
	} else if (z <= 5.6e+125) {
		tmp = x_m * (y / z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-1d-58)) then
        tmp = x_m
    else if (z <= 8.8d-141) then
        tmp = y / (z / x_m)
    else if (z <= 2d+16) then
        tmp = x_m
    else if (z <= 5.6d+125) then
        tmp = x_m * (y / z)
    else
        tmp = x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= -1e-58) {
		tmp = x_m;
	} else if (z <= 8.8e-141) {
		tmp = y / (z / x_m);
	} else if (z <= 2e+16) {
		tmp = x_m;
	} else if (z <= 5.6e+125) {
		tmp = x_m * (y / z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if z <= -1e-58:
		tmp = x_m
	elif z <= 8.8e-141:
		tmp = y / (z / x_m)
	elif z <= 2e+16:
		tmp = x_m
	elif z <= 5.6e+125:
		tmp = x_m * (y / z)
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (z <= -1e-58)
		tmp = x_m;
	elseif (z <= 8.8e-141)
		tmp = Float64(y / Float64(z / x_m));
	elseif (z <= 2e+16)
		tmp = x_m;
	elseif (z <= 5.6e+125)
		tmp = Float64(x_m * Float64(y / z));
	else
		tmp = x_m;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (z <= -1e-58)
		tmp = x_m;
	elseif (z <= 8.8e-141)
		tmp = y / (z / x_m);
	elseif (z <= 2e+16)
		tmp = x_m;
	elseif (z <= 5.6e+125)
		tmp = x_m * (y / z);
	else
		tmp = x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[z, -1e-58], x$95$m, If[LessEqual[z, 8.8e-141], N[(y / N[(z / x$95$m), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2e+16], x$95$m, If[LessEqual[z, 5.6e+125], N[(x$95$m * N[(y / z), $MachinePrecision]), $MachinePrecision], x$95$m]]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < -1e-58 or 8.80000000000000037e-141 < z < 2e16 or 5.6000000000000002e125 < z

   1. Initial program 83.5%

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

      1. associate-/l* 99.9%

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

      2. remove-double-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. div-sub 99.9%

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

      5. remove-double-neg 99.9%

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

      6. distribute-frac-neg2 99.9%

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

      7. *-inverses 99.9%

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

      8. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around 0 78.5%

      \[\leadsto \color{blue}{x} \]

   if -1e-58 < z < 8.80000000000000037e-141

   1. Initial program 94.1%

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

      1. associate-/l* 90.6%

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

      2. remove-double-neg 90.6%

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

      3. unsub-neg 90.6%

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

      4. div-sub 90.6%

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

      5. remove-double-neg 90.6%

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

      6. distribute-frac-neg2 90.6%

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

      7. *-inverses 90.6%

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

      8. metadata-eval 90.6%

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

   3. Simplified 90.6%

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

   5. Taylor expanded in y around inf 76.9%

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

      1. associate-*r/ 84.0%

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

      2. *-commutative 84.0%

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

      3. associate-*r/ 82.3%

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

      4. clear-num 82.2%

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

      5. un-div-inv 82.7%

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

   7. Applied egg-rr 82.7%

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

   if 2e16 < z < 5.6000000000000002e125

   1. Initial program 89.1%

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

      1. associate-/l* 99.8%

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

      2. remove-double-neg 99.8%

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

      3. unsub-neg 99.8%

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

      4. div-sub 99.8%

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

      5. remove-double-neg 99.8%

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

      6. distribute-frac-neg2 99.8%

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

      7. *-inverses 99.8%

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

      8. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around inf 70.2%

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

Alternative 3: 68.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{-58}:\\ \;\;\;\;x\_m\\ \mathbf{elif}\;z \leq 8.8 \cdot 10^{-141}:\\ \;\;\;\;y \cdot \frac{x\_m}{z}\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{+16}:\\ \;\;\;\;x\_m\\ \mathbf{elif}\;z \leq 5.6 \cdot 10^{+125}:\\ \;\;\;\;x\_m \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (*
  x_s
  (if (<= z -3.4e-58)
    x_m
    (if (<= z 8.8e-141)
      (* y (/ x_m z))
      (if (<= z 2.65e+16) x_m (if (<= z 5.6e+125) (* x_m (/ y z)) x_m))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= -3.4e-58) {
		tmp = x_m;
	} else if (z <= 8.8e-141) {
		tmp = y * (x_m / z);
	} else if (z <= 2.65e+16) {
		tmp = x_m;
	} else if (z <= 5.6e+125) {
		tmp = x_m * (y / z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.4d-58)) then
        tmp = x_m
    else if (z <= 8.8d-141) then
        tmp = y * (x_m / z)
    else if (z <= 2.65d+16) then
        tmp = x_m
    else if (z <= 5.6d+125) then
        tmp = x_m * (y / z)
    else
        tmp = x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if (z <= -3.4e-58) {
		tmp = x_m;
	} else if (z <= 8.8e-141) {
		tmp = y * (x_m / z);
	} else if (z <= 2.65e+16) {
		tmp = x_m;
	} else if (z <= 5.6e+125) {
		tmp = x_m * (y / z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if z <= -3.4e-58:
		tmp = x_m
	elif z <= 8.8e-141:
		tmp = y * (x_m / z)
	elif z <= 2.65e+16:
		tmp = x_m
	elif z <= 5.6e+125:
		tmp = x_m * (y / z)
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if (z <= -3.4e-58)
		tmp = x_m;
	elseif (z <= 8.8e-141)
		tmp = Float64(y * Float64(x_m / z));
	elseif (z <= 2.65e+16)
		tmp = x_m;
	elseif (z <= 5.6e+125)
		tmp = Float64(x_m * Float64(y / z));
	else
		tmp = x_m;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if (z <= -3.4e-58)
		tmp = x_m;
	elseif (z <= 8.8e-141)
		tmp = y * (x_m / z);
	elseif (z <= 2.65e+16)
		tmp = x_m;
	elseif (z <= 5.6e+125)
		tmp = x_m * (y / z);
	else
		tmp = x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[LessEqual[z, -3.4e-58], x$95$m, If[LessEqual[z, 8.8e-141], N[(y * N[(x$95$m / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 2.65e+16], x$95$m, If[LessEqual[z, 5.6e+125], N[(x$95$m * N[(y / z), $MachinePrecision]), $MachinePrecision], x$95$m]]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if z < -3.39999999999999973e-58 or 8.80000000000000037e-141 < z < 2.65e16 or 5.6000000000000002e125 < z

   1. Initial program 83.5%

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

      1. associate-/l* 99.9%

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

      2. remove-double-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. div-sub 99.9%

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

      5. remove-double-neg 99.9%

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

      6. distribute-frac-neg2 99.9%

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

      7. *-inverses 99.9%

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

      8. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in y around 0 78.5%

      \[\leadsto \color{blue}{x} \]

   if -3.39999999999999973e-58 < z < 8.80000000000000037e-141

   1. Initial program 94.1%

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

      1. associate-/l* 90.6%

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

      2. remove-double-neg 90.6%

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

      3. unsub-neg 90.6%

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

      4. div-sub 90.6%

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

      5. remove-double-neg 90.6%

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

      6. distribute-frac-neg2 90.6%

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

      7. *-inverses 90.6%

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

      8. metadata-eval 90.6%

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

   3. Simplified 90.6%

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

   5. Taylor expanded in y around inf 84.0%

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

      1. associate-*l/ 82.3%

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

      2. *-commutative 82.3%

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

   7. Simplified 82.3%

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

   if 2.65e16 < z < 5.6000000000000002e125

   1. Initial program 89.1%

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

      1. associate-/l* 99.8%

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

      2. remove-double-neg 99.8%

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

      3. unsub-neg 99.8%

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

      4. div-sub 99.8%

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

      5. remove-double-neg 99.8%

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

      6. distribute-frac-neg2 99.8%

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

      7. *-inverses 99.8%

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

      8. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around inf 70.2%

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

Alternative 4: 72.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -1.55 \cdot 10^{-89} \lor \neg \left(y \leq 2.6 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{x\_m \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (or (<= y -1.55e-89) (not (<= y 2.6e-24))) (/ (* x_m y) z) x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((y <= -1.55e-89) || !(y <= 2.6e-24)) {
		tmp = (x_m * y) / z;
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-1.55d-89)) .or. (.not. (y <= 2.6d-24))) then
        tmp = (x_m * y) / z
    else
        tmp = x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((y <= -1.55e-89) || !(y <= 2.6e-24)) {
		tmp = (x_m * y) / z;
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if (y <= -1.55e-89) or not (y <= 2.6e-24):
		tmp = (x_m * y) / z
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((y <= -1.55e-89) || !(y <= 2.6e-24))
		tmp = Float64(Float64(x_m * y) / z);
	else
		tmp = x_m;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((y <= -1.55e-89) || ~((y <= 2.6e-24)))
		tmp = (x_m * y) / z;
	else
		tmp = x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[y, -1.55e-89], N[Not[LessEqual[y, 2.6e-24]], $MachinePrecision]], N[(N[(x$95$m * y), $MachinePrecision] / z), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -1.54999999999999998e-89 or 2.6e-24 < y

   1. Initial program 92.3%

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

   3. Taylor expanded in y around inf 72.5%

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

      1. *-commutative 72.5%

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

   5. Simplified 72.5%

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

   if -1.54999999999999998e-89 < y < 2.6e-24

   1. Initial program 81.8%

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

      1. associate-/l* 99.9%

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

      2. remove-double-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. div-sub 100.0%

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

      5. remove-double-neg 100.0%

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

      6. distribute-frac-neg2 100.0%

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

      7. *-inverses 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 83.9%

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

4. Final simplification 77.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.55 \cdot 10^{-89} \lor \neg \left(y \leq 2.6 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 70.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{-89} \lor \neg \left(y \leq 3.6 \cdot 10^{-26}\right):\\ \;\;\;\;x\_m \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\_m\\ \end{array} \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z)
 :precision binary64
 (* x_s (if (or (<= y -1.9e-89) (not (<= y 3.6e-26))) (* x_m (/ y z)) x_m)))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((y <= -1.9e-89) || !(y <= 3.6e-26)) {
		tmp = x_m * (y / z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-1.9d-89)) .or. (.not. (y <= 3.6d-26))) then
        tmp = x_m * (y / z)
    else
        tmp = x_m
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	double tmp;
	if ((y <= -1.9e-89) || !(y <= 3.6e-26)) {
		tmp = x_m * (y / z);
	} else {
		tmp = x_m;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	tmp = 0
	if (y <= -1.9e-89) or not (y <= 3.6e-26):
		tmp = x_m * (y / z)
	else:
		tmp = x_m
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	tmp = 0.0
	if ((y <= -1.9e-89) || !(y <= 3.6e-26))
		tmp = Float64(x_m * Float64(y / z));
	else
		tmp = x_m;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z)
	tmp = 0.0;
	if ((y <= -1.9e-89) || ~((y <= 3.6e-26)))
		tmp = x_m * (y / z);
	else
		tmp = x_m;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * If[Or[LessEqual[y, -1.9e-89], N[Not[LessEqual[y, 3.6e-26]], $MachinePrecision]], N[(x$95$m * N[(y / z), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < -1.9000000000000001e-89 or 3.6000000000000001e-26 < y

   1. Initial program 92.3%

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

      1. associate-/l* 94.1%

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

      2. remove-double-neg 94.1%

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

      3. unsub-neg 94.1%

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

      4. div-sub 94.2%

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

      5. remove-double-neg 94.2%

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

      6. distribute-frac-neg2 94.2%

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

      7. *-inverses 94.2%

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

      8. metadata-eval 94.2%

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

   3. Simplified 94.2%

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

   5. Taylor expanded in y around inf 68.7%

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

   if -1.9000000000000001e-89 < y < 3.6000000000000001e-26

   1. Initial program 81.8%

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

      1. associate-/l* 99.9%

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

      2. remove-double-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. div-sub 100.0%

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

      5. remove-double-neg 100.0%

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

      6. distribute-frac-neg2 100.0%

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

      7. *-inverses 100.0%

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

      8. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 83.9%

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

4. Final simplification 75.0%

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

Alternative 6: 95.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(x\_m \cdot \left(\frac{y}{z} - -1\right)\right) \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s (* x_m (- (/ y z) -1.0))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * (x_m * ((y / z) - -1.0));
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * (x_m * ((y / z) - (-1.0d0)))
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * (x_m * ((y / z) - -1.0));
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * (x_m * ((y / z) - -1.0))

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * Float64(x_m * Float64(Float64(y / z) - -1.0)))
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * (x_m * ((y / z) - -1.0));
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * N[(x$95$m * N[(N[(y / z), $MachinePrecision] - -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.9%

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

   1. associate-/l* 96.6%

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

   2. remove-double-neg 96.6%

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

   3. unsub-neg 96.6%

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

   4. div-sub 96.6%

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

   5. remove-double-neg 96.6%

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

   6. distribute-frac-neg2 96.6%

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

   7. *-inverses 96.6%

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

   8. metadata-eval 96.6%

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

3. Simplified 96.6%

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

Alternative 7: 50.7% accurate, 7.0× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot x\_m \end{array} \]

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z) :precision binary64 (* x_s x_m))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z) {
	return x_s * x_m;
}

Fortran

x\_m = abs(x)
x\_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m, y, z)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x_s * x_m
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z) {
	return x_s * x_m;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z):
	return x_s * x_m

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z)
	return Float64(x_s * x_m)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m, y, z)
	tmp = x_s * x_m;
end

Wolfram

x\_m = N[Abs[x], $MachinePrecision]
x\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_, y_, z_] := N[(x$95$s * x$95$m), $MachinePrecision]

Derivation

1. Initial program 87.9%

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

   1. associate-/l* 96.6%

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

   2. remove-double-neg 96.6%

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

   3. unsub-neg 96.6%

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

   4. div-sub 96.6%

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

   5. remove-double-neg 96.6%

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

   6. distribute-frac-neg2 96.6%

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

   7. *-inverses 96.6%

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

   8. metadata-eval 96.6%

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

3. Simplified 96.6%

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

5. Taylor expanded in y around 0 51.5%

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

Developer Target 1: 96.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return x / (z / (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 = x / (z / (y + z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024170 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:choose from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (/ x (/ z (+ y z))))

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