Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3

Percentage Accurate: 84.3% → 97.3%

Time: 5.5s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

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)) / y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 84.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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)) / y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.3% accurate, 0.4× 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}\;\frac{x\_m \cdot \left(y - z\right)}{y} \leq -2 \cdot 10^{+31}:\\ \;\;\;\;\frac{y - z}{\frac{y}{x\_m}}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - \frac{z}{y}\right)\\ \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 (<= (/ (* x_m (- y z)) y) -2e+31)
    (/ (- y z) (/ y x_m))
    (* x_m (- 1.0 (/ z y))))))

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 (((x_m * (y - z)) / y) <= -2e+31) {
		tmp = (y - z) / (y / x_m);
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 (((x_m * (y - z)) / y) <= (-2d+31)) then
        tmp = (y - z) / (y / x_m)
    else
        tmp = x_m * (1.0d0 - (z / y))
    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 (((x_m * (y - z)) / y) <= -2e+31) {
		tmp = (y - z) / (y / x_m);
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 ((x_m * (y - z)) / y) <= -2e+31:
		tmp = (y - z) / (y / x_m)
	else:
		tmp = x_m * (1.0 - (z / y))
	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 (Float64(Float64(x_m * Float64(y - z)) / y) <= -2e+31)
		tmp = Float64(Float64(y - z) / Float64(y / x_m));
	else
		tmp = Float64(x_m * Float64(1.0 - Float64(z / y)));
	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 (((x_m * (y - z)) / y) <= -2e+31)
		tmp = (y - z) / (y / x_m);
	else
		tmp = x_m * (1.0 - (z / y));
	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[N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], -2e+31], N[(N[(y - z), $MachinePrecision] / N[(y / x$95$m), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -1.9999999999999999e31

   1. Initial program 82.0%

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

      1. remove-double-neg 82.0%

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

      2. distribute-frac-neg2 82.0%

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

      3. distribute-frac-neg 82.0%

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

      4. distribute-rgt-neg-in 82.0%

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

      5. associate-/l* 93.2%

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

      6. distribute-frac-neg 93.2%

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

      7. distribute-frac-neg2 93.2%

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

      8. remove-double-neg 93.2%

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

      9. div-sub 93.2%

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

      10. *-inverses 93.2%

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

   3. Simplified 93.2%

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

      1. *-inverses 93.2%

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

      2. div-sub 93.2%

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

      3. clear-num 93.1%

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

      4. un-div-inv 93.2%

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

   6. Applied egg-rr 93.2%

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

      1. associate-/r/ 90.8%

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

   8. Applied egg-rr 90.8%

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

      1. *-commutative 90.8%

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

      2. clear-num 90.6%

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

      3. un-div-inv 93.8%

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

   10. Applied egg-rr 93.8%

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

   if -1.9999999999999999e31 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 86.8%

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

      1. remove-double-neg 86.8%

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

      2. distribute-frac-neg2 86.8%

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

      3. distribute-frac-neg 86.8%

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

      4. distribute-rgt-neg-in 86.8%

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

      5. associate-/l* 96.6%

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

      6. distribute-frac-neg 96.6%

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

      7. distribute-frac-neg2 96.6%

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

      8. remove-double-neg 96.6%

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

      9. div-sub 96.6%

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

      10. *-inverses 96.6%

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

   3. Simplified 96.6%

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

4. Final simplification 95.7%

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

Alternative 2: 97.2% accurate, 0.4× 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}\;\frac{x\_m \cdot \left(y - z\right)}{y} \leq -2 \cdot 10^{+31}:\\ \;\;\;\;\left(y - z\right) \cdot \frac{x\_m}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m \cdot \left(1 - \frac{z}{y}\right)\\ \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 (<= (/ (* x_m (- y z)) y) -2e+31)
    (* (- y z) (/ x_m y))
    (* x_m (- 1.0 (/ z y))))))

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 (((x_m * (y - z)) / y) <= -2e+31) {
		tmp = (y - z) * (x_m / y);
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 (((x_m * (y - z)) / y) <= (-2d+31)) then
        tmp = (y - z) * (x_m / y)
    else
        tmp = x_m * (1.0d0 - (z / y))
    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 (((x_m * (y - z)) / y) <= -2e+31) {
		tmp = (y - z) * (x_m / y);
	} else {
		tmp = x_m * (1.0 - (z / y));
	}
	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 ((x_m * (y - z)) / y) <= -2e+31:
		tmp = (y - z) * (x_m / y)
	else:
		tmp = x_m * (1.0 - (z / y))
	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 (Float64(Float64(x_m * Float64(y - z)) / y) <= -2e+31)
		tmp = Float64(Float64(y - z) * Float64(x_m / y));
	else
		tmp = Float64(x_m * Float64(1.0 - Float64(z / y)));
	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 (((x_m * (y - z)) / y) <= -2e+31)
		tmp = (y - z) * (x_m / y);
	else
		tmp = x_m * (1.0 - (z / y));
	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[N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], -2e+31], N[(N[(y - z), $MachinePrecision] * N[(x$95$m / y), $MachinePrecision]), $MachinePrecision], N[(x$95$m * N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -1.9999999999999999e31

   1. Initial program 82.0%

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

      1. *-commutative 82.0%

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

      2. associate-/l* 90.8%

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

   4. Applied egg-rr 90.8%

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

   if -1.9999999999999999e31 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 86.8%

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

      1. remove-double-neg 86.8%

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

      2. distribute-frac-neg2 86.8%

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

      3. distribute-frac-neg 86.8%

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

      4. distribute-rgt-neg-in 86.8%

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

      5. associate-/l* 96.6%

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

      6. distribute-frac-neg 96.6%

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

      7. distribute-frac-neg2 96.6%

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

      8. remove-double-neg 96.6%

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

      9. div-sub 96.6%

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

      10. *-inverses 96.6%

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

   3. Simplified 96.6%

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

4. Final simplification 94.7%

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

Alternative 3: 70.6% accurate, 0.4× 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 -9 \cdot 10^{+50} \lor \neg \left(z \leq 5.4 \cdot 10^{-52}\right):\\ \;\;\;\;x\_m \cdot \frac{z}{-y}\\ \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 (<= z -9e+50) (not (<= z 5.4e-52))) (* x_m (/ z (- y))) 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 <= -9e+50) || !(z <= 5.4e-52)) {
		tmp = x_m * (z / -y);
	} 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 <= (-9d+50)) .or. (.not. (z <= 5.4d-52))) then
        tmp = x_m * (z / -y)
    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 <= -9e+50) || !(z <= 5.4e-52)) {
		tmp = x_m * (z / -y);
	} 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 <= -9e+50) or not (z <= 5.4e-52):
		tmp = x_m * (z / -y)
	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 <= -9e+50) || !(z <= 5.4e-52))
		tmp = Float64(x_m * Float64(z / Float64(-y)));
	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 <= -9e+50) || ~((z <= 5.4e-52)))
		tmp = x_m * (z / -y);
	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[z, -9e+50], N[Not[LessEqual[z, 5.4e-52]], $MachinePrecision]], N[(x$95$m * N[(z / (-y)), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -9.00000000000000027e50 or 5.40000000000000019e-52 < z

   1. Initial program 86.0%

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

      1. associate-/l* 91.1%

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

   3. Simplified 91.1%

      \[\leadsto \color{blue}{x \cdot \frac{y - z}{y}} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 68.7%

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

      1. mul-1-neg 68.7%

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

      2. distribute-frac-neg2 68.7%

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

   7. Simplified 68.7%

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

   if -9.00000000000000027e50 < z < 5.40000000000000019e-52

   1. Initial program 84.5%

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

      1. remove-double-neg 84.5%

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

      2. distribute-frac-neg2 84.5%

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

      3. distribute-frac-neg 84.5%

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

      4. distribute-rgt-neg-in 84.5%

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

      5. associate-/l* 99.9%

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

      6. distribute-frac-neg 99.9%

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

      7. distribute-frac-neg2 99.9%

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

      8. remove-double-neg 99.9%

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

      9. div-sub 100.0%

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

      10. *-inverses 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in z around 0 80.2%

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

4. Final simplification 74.4%

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

Alternative 4: 72.6% accurate, 0.4× 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.7 \cdot 10^{+51} \lor \neg \left(z \leq 5.4 \cdot 10^{-52}\right):\\ \;\;\;\;z \cdot \frac{-x\_m}{y}\\ \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 (<= z -1.7e+51) (not (<= z 5.4e-52))) (* z (/ (- x_m) y)) 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 <= -1.7e+51) || !(z <= 5.4e-52)) {
		tmp = z * (-x_m / y);
	} 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 <= (-1.7d+51)) .or. (.not. (z <= 5.4d-52))) then
        tmp = z * (-x_m / y)
    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 <= -1.7e+51) || !(z <= 5.4e-52)) {
		tmp = z * (-x_m / y);
	} 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 <= -1.7e+51) or not (z <= 5.4e-52):
		tmp = z * (-x_m / y)
	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 <= -1.7e+51) || !(z <= 5.4e-52))
		tmp = Float64(z * Float64(Float64(-x_m) / y));
	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 <= -1.7e+51) || ~((z <= 5.4e-52)))
		tmp = z * (-x_m / y);
	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[z, -1.7e+51], N[Not[LessEqual[z, 5.4e-52]], $MachinePrecision]], N[(z * N[((-x$95$m) / y), $MachinePrecision]), $MachinePrecision], x$95$m]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < -1.69999999999999992e51 or 5.40000000000000019e-52 < z

   1. Initial program 86.0%

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

      1. remove-double-neg 86.0%

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

      2. distribute-frac-neg2 86.0%

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

      3. distribute-frac-neg 86.0%

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

      4. distribute-rgt-neg-in 86.0%

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

      5. associate-/l* 91.1%

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

      6. distribute-frac-neg 91.1%

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

      7. distribute-frac-neg2 91.1%

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

      8. remove-double-neg 91.1%

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

      9. div-sub 91.1%

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

      10. *-inverses 91.1%

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

   3. Simplified 91.1%

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

   5. Taylor expanded in z around inf 72.0%

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

      1. associate-*l/ 73.3%

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

      2. associate-*l* 73.3%

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

      3. *-commutative 73.3%

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

      4. associate-*r/ 73.3%

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

      5. mul-1-neg 73.3%

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

   7. Simplified 73.3%

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

   if -1.69999999999999992e51 < z < 5.40000000000000019e-52

   1. Initial program 84.5%

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

      1. remove-double-neg 84.5%

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

      2. distribute-frac-neg2 84.5%

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

      3. distribute-frac-neg 84.5%

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

      4. distribute-rgt-neg-in 84.5%

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

      5. associate-/l* 99.9%

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

      6. distribute-frac-neg 99.9%

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

      7. distribute-frac-neg2 99.9%

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

      8. remove-double-neg 99.9%

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

      9. div-sub 100.0%

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

      10. *-inverses 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in z around 0 80.2%

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

4. Final simplification 76.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.7 \cdot 10^{+51} \lor \neg \left(z \leq 5.4 \cdot 10^{-52}\right):\\ \;\;\;\;z \cdot \frac{-x}{y}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 96.2% 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(1 - \frac{z}{y}\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 (- 1.0 (/ z y)))))

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 * (1.0 - (z / y)));
}

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 * (1.0d0 - (z / y)))
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 * (1.0 - (z / y)));
}

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 * (1.0 - (z / y)))

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(1.0 - Float64(z / y))))
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 * (1.0 - (z / y)));
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[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 85.2%

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

   1. remove-double-neg 85.2%

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

   2. distribute-frac-neg2 85.2%

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

   3. distribute-frac-neg 85.2%

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

   4. distribute-rgt-neg-in 85.2%

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

   5. associate-/l* 95.5%

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

   6. distribute-frac-neg 95.5%

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

   7. distribute-frac-neg2 95.5%

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

   8. remove-double-neg 95.5%

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

   9. div-sub 95.5%

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

   10. *-inverses 95.5%

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

3. Simplified 95.5%

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

5. Final simplification 95.5%

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

Alternative 6: 51.0% 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 85.2%

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

   1. remove-double-neg 85.2%

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

   2. distribute-frac-neg2 85.2%

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

   3. distribute-frac-neg 85.2%

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

   4. distribute-rgt-neg-in 85.2%

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

   5. associate-/l* 95.5%

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

   6. distribute-frac-neg 95.5%

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

   7. distribute-frac-neg2 95.5%

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

   8. remove-double-neg 95.5%

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

   9. div-sub 95.5%

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

   10. *-inverses 95.5%

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

3. Simplified 95.5%

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

5. Taylor expanded in z around 0 52.2%

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

6. Final simplification 52.2%

   \[\leadsto x \]
7. Add Preprocessing

Developer target: 95.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z < -2.060202331921739 \cdot 10^{+104}:\\ \;\;\;\;x - \frac{z \cdot x}{y}\\ \mathbf{elif}\;z < 1.6939766013828526 \cdot 10^{+213}:\\ \;\;\;\;\frac{x}{\frac{y}{y - z}}\\ \mathbf{else}:\\ \;\;\;\;\left(y - z\right) \cdot \frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (< z -2.060202331921739e+104)
   (- x (/ (* z x) y))
   (if (< z 1.6939766013828526e+213) (/ x (/ y (- y z))) (* (- y z) (/ x y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z < -2.060202331921739e+104) {
		tmp = x - ((z * x) / y);
	} else if (z < 1.6939766013828526e+213) {
		tmp = x / (y / (y - z));
	} else {
		tmp = (y - z) * (x / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z < (-2.060202331921739d+104)) then
        tmp = x - ((z * x) / y)
    else if (z < 1.6939766013828526d+213) then
        tmp = x / (y / (y - z))
    else
        tmp = (y - z) * (x / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z < -2.060202331921739e+104) {
		tmp = x - ((z * x) / y);
	} else if (z < 1.6939766013828526e+213) {
		tmp = x / (y / (y - z));
	} else {
		tmp = (y - z) * (x / y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z < -2.060202331921739e+104:
		tmp = x - ((z * x) / y)
	elif z < 1.6939766013828526e+213:
		tmp = x / (y / (y - z))
	else:
		tmp = (y - z) * (x / y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z < -2.060202331921739e+104)
		tmp = Float64(x - Float64(Float64(z * x) / y));
	elseif (z < 1.6939766013828526e+213)
		tmp = Float64(x / Float64(y / Float64(y - z)));
	else
		tmp = Float64(Float64(y - z) * Float64(x / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z < -2.060202331921739e+104)
		tmp = x - ((z * x) / y);
	elseif (z < 1.6939766013828526e+213)
		tmp = x / (y / (y - z));
	else
		tmp = (y - z) * (x / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Less[z, -2.060202331921739e+104], N[(x - N[(N[(z * x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[Less[z, 1.6939766013828526e+213], N[(x / N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024078 
(FPCore (x y z)
  :name "Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3"
  :precision binary64

  :alt
  (if (< z -2.060202331921739e+104) (- x (/ (* z x) y)) (if (< z 1.6939766013828526e+213) (/ x (/ y (- y z))) (* (- y z) (/ x y))))

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