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

Percentage Accurate: 84.0% → 96.4%

Time: 7.3s

Alternatives: 7

Speedup: 0.4×

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.0% 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: 96.4% 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 -1 \cdot 10^{+116}:\\ \;\;\;\;\mathsf{fma}\left(x\_m \cdot z, \frac{-1}{y}, x\_m\right)\\ \mathbf{else}:\\ \;\;\;\;x\_m - x\_m \cdot \frac{z}{y}\\ \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) -1e+116)
    (fma (* x_m z) (/ -1.0 y) x_m)
    (- x_m (* x_m (/ 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) <= -1e+116) {
		tmp = fma((x_m * z), (-1.0 / y), x_m);
	} else {
		tmp = x_m - (x_m * (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) <= -1e+116)
		tmp = fma(Float64(x_m * z), Float64(-1.0 / y), x_m);
	else
		tmp = Float64(x_m - Float64(x_m * Float64(z / y)));
	end
	return Float64(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], -1e+116], N[(N[(x$95$m * z), $MachinePrecision] * N[(-1.0 / y), $MachinePrecision] + x$95$m), $MachinePrecision], N[(x$95$m - N[(x$95$m * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -1.00000000000000002e116

   1. Initial program 81.2%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 95.3

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

   4. Applied rewrites 95.3%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 95.3

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

   6. Applied rewrites 95.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lift--.f64 N/A

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

      4. sub-neg N/A

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

      5. lift-neg.f64 N/A

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

      6. distribute-lft-in N/A

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

      7. *-commutative N/A

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

      8. lift-neg.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. distribute-neg-frac N/A

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

      11. lift-neg.f64 N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

      14. lift-*.f64 N/A

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

      15. lift-/.f64 N/A

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

      16. *-lft-identity N/A

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

      17. +-commutative N/A

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

      18. lift-/.f64 N/A

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

      19. frac-2neg N/A

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

      20. div-inv N/A

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

      21. lower-fma.f64 N/A

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

   8. Applied rewrites 98.2%

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

   if -1.00000000000000002e116 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 81.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 98.0

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

   4. Applied rewrites 98.0%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 98.0

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

   6. Applied rewrites 98.0%

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

   8. Applied rewrites 98.0%

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

Alternative 2: 96.5% 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)}{y}\\ x\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+98}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;x\_m - x\_m \cdot \frac{z}{y}\\ \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)) y)))
   (* x_s (if (<= t_0 -5e+98) t_0 (- x_m (* x_m (/ 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 t_0 = (x_m * (y - z)) / y;
	double tmp;
	if (t_0 <= -5e+98) {
		tmp = t_0;
	} else {
		tmp = x_m - (x_m * (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) :: t_0
    real(8) :: tmp
    t_0 = (x_m * (y - z)) / y
    if (t_0 <= (-5d+98)) then
        tmp = t_0
    else
        tmp = x_m - (x_m * (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 t_0 = (x_m * (y - z)) / y;
	double tmp;
	if (t_0 <= -5e+98) {
		tmp = t_0;
	} else {
		tmp = x_m - (x_m * (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):
	t_0 = (x_m * (y - z)) / y
	tmp = 0
	if t_0 <= -5e+98:
		tmp = t_0
	else:
		tmp = x_m - (x_m * (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)
	t_0 = Float64(Float64(x_m * Float64(y - z)) / y)
	tmp = 0.0
	if (t_0 <= -5e+98)
		tmp = t_0;
	else
		tmp = Float64(x_m - Float64(x_m * 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)
	t_0 = (x_m * (y - z)) / y;
	tmp = 0.0;
	if (t_0 <= -5e+98)
		tmp = t_0;
	else
		tmp = x_m - (x_m * (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_] := Block[{t$95$0 = N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision]}, N[(x$95$s * If[LessEqual[t$95$0, -5e+98], t$95$0, N[(x$95$m - N[(x$95$m * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -4.9999999999999998e98

   1. Initial program 81.8%

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

   if -4.9999999999999998e98 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 81.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.9

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

   4. Applied rewrites 97.9%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 98.0

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

   6. Applied rewrites 98.0%

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

   8. Applied rewrites 98.0%

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

Alternative 3: 96.4% 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 -5 \cdot 10^{+98}:\\ \;\;\;\;\frac{x\_m \cdot \left(-z\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;x\_m - x\_m \cdot \frac{z}{y}\\ \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) -5e+98)
    (/ (* x_m (- z)) y)
    (- x_m (* x_m (/ 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) <= -5e+98) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = x_m - (x_m * (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) <= (-5d+98)) then
        tmp = (x_m * -z) / y
    else
        tmp = x_m - (x_m * (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) <= -5e+98) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = x_m - (x_m * (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) <= -5e+98:
		tmp = (x_m * -z) / y
	else:
		tmp = x_m - (x_m * (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) <= -5e+98)
		tmp = Float64(Float64(x_m * Float64(-z)) / y);
	else
		tmp = Float64(x_m - Float64(x_m * 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) <= -5e+98)
		tmp = (x_m * -z) / y;
	else
		tmp = x_m - (x_m * (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], -5e+98], N[(N[(x$95$m * (-z)), $MachinePrecision] / y), $MachinePrecision], N[(x$95$m - N[(x$95$m * N[(z / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -4.9999999999999998e98

   1. Initial program 81.8%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 66.8

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

   5. Applied rewrites 66.8%

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

   if -4.9999999999999998e98 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 81.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.9

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

   4. Applied rewrites 97.9%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 98.0

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

   6. Applied rewrites 98.0%

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

   8. Applied rewrites 98.0%

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

Alternative 4: 96.4% 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 -5 \cdot 10^{+98}:\\ \;\;\;\;\frac{x\_m \cdot \left(-z\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;\left(1 - \frac{z}{y}\right) \cdot 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 (<= (/ (* x_m (- y z)) y) -5e+98)
    (/ (* x_m (- z)) y)
    (* (- 1.0 (/ 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 (((x_m * (y - z)) / y) <= -5e+98) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = (1.0 - (z / y)) * 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 (((x_m * (y - z)) / y) <= (-5d+98)) then
        tmp = (x_m * -z) / y
    else
        tmp = (1.0d0 - (z / y)) * 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 (((x_m * (y - z)) / y) <= -5e+98) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = (1.0 - (z / y)) * 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 ((x_m * (y - z)) / y) <= -5e+98:
		tmp = (x_m * -z) / y
	else:
		tmp = (1.0 - (z / y)) * 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 (Float64(Float64(x_m * Float64(y - z)) / y) <= -5e+98)
		tmp = Float64(Float64(x_m * Float64(-z)) / y);
	else
		tmp = Float64(Float64(1.0 - Float64(z / y)) * 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 (((x_m * (y - z)) / y) <= -5e+98)
		tmp = (x_m * -z) / y;
	else
		tmp = (1.0 - (z / y)) * 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[N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], -5e+98], N[(N[(x$95$m * (-z)), $MachinePrecision] / y), $MachinePrecision], N[(N[(1.0 - N[(z / y), $MachinePrecision]), $MachinePrecision] * x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -4.9999999999999998e98

   1. Initial program 81.8%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 66.8

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

   5. Applied rewrites 66.8%

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

   if -4.9999999999999998e98 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 81.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.9

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

   4. Applied rewrites 97.9%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. div-sub N/A

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

      4. *-inverses N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 98.0

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

   6. Applied rewrites 98.0%

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

Alternative 5: 72.5% 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}\;\frac{x\_m \cdot \left(y - z\right)}{y} \leq -1 \cdot 10^{-234}:\\ \;\;\;\;\frac{x\_m \cdot \left(-z\right)}{y}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot 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 (<= (/ (* x_m (- y z)) y) -1e-234) (/ (* x_m (- z)) y) (* 1.0 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 (((x_m * (y - z)) / y) <= -1e-234) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = 1.0 * 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 (((x_m * (y - z)) / y) <= (-1d-234)) then
        tmp = (x_m * -z) / y
    else
        tmp = 1.0d0 * 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 (((x_m * (y - z)) / y) <= -1e-234) {
		tmp = (x_m * -z) / y;
	} else {
		tmp = 1.0 * 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 ((x_m * (y - z)) / y) <= -1e-234:
		tmp = (x_m * -z) / y
	else:
		tmp = 1.0 * 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 (Float64(Float64(x_m * Float64(y - z)) / y) <= -1e-234)
		tmp = Float64(Float64(x_m * Float64(-z)) / y);
	else
		tmp = Float64(1.0 * 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 (((x_m * (y - z)) / y) <= -1e-234)
		tmp = (x_m * -z) / y;
	else
		tmp = 1.0 * 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[N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], -1e-234], N[(N[(x$95$m * (-z)), $MachinePrecision] / y), $MachinePrecision], N[(1.0 * x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -9.9999999999999996e-235

   1. Initial program 89.9%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 52.9

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

   5. Applied rewrites 52.9%

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

   if -9.9999999999999996e-235 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 75.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.3

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

   4. Applied rewrites 97.3%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 60.9%

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

Alternative 6: 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}\;\frac{x\_m \cdot \left(y - z\right)}{y} \leq -1 \cdot 10^{-234}:\\ \;\;\;\;\frac{-x\_m}{y} \cdot z\\ \mathbf{else}:\\ \;\;\;\;1 \cdot 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 (<= (/ (* x_m (- y z)) y) -1e-234) (* (/ (- x_m) y) z) (* 1.0 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 (((x_m * (y - z)) / y) <= -1e-234) {
		tmp = (-x_m / y) * z;
	} else {
		tmp = 1.0 * 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 (((x_m * (y - z)) / y) <= (-1d-234)) then
        tmp = (-x_m / y) * z
    else
        tmp = 1.0d0 * 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 (((x_m * (y - z)) / y) <= -1e-234) {
		tmp = (-x_m / y) * z;
	} else {
		tmp = 1.0 * 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 ((x_m * (y - z)) / y) <= -1e-234:
		tmp = (-x_m / y) * z
	else:
		tmp = 1.0 * 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 (Float64(Float64(x_m * Float64(y - z)) / y) <= -1e-234)
		tmp = Float64(Float64(Float64(-x_m) / y) * z);
	else
		tmp = Float64(1.0 * 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 (((x_m * (y - z)) / y) <= -1e-234)
		tmp = (-x_m / y) * z;
	else
		tmp = 1.0 * 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[N[(N[(x$95$m * N[(y - z), $MachinePrecision]), $MachinePrecision] / y), $MachinePrecision], -1e-234], N[(N[((-x$95$m) / y), $MachinePrecision] * z), $MachinePrecision], N[(1.0 * x$95$m), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (-.f64 y z)) y) < -9.9999999999999996e-235

   1. Initial program 89.9%

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

   3. Taylor expanded in y around 0

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

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. associate-*r/ N/A

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

      5. lower-/.f64 N/A

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

      6. mul-1-neg N/A

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

      7. lower-neg.f64 51.4

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

   5. Applied rewrites 51.4%

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

   if -9.9999999999999996e-235 < (/.f64 (*.f64 x (-.f64 y z)) y)

   1. Initial program 75.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 97.3

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

   4. Applied rewrites 97.3%

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

   5. Taylor expanded in y around inf

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

   7. Applied rewrites 60.9%

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

Alternative 7: 51.0% accurate, 3.3× speedup

Math

\[\begin{array}{l} x\_m = \left|x\right| \\ x\_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(1 \cdot x\_m\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 (* 1.0 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 * (1.0 * 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 * (1.0d0 * 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 * (1.0 * 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 * (1.0 * 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 * Float64(1.0 * 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 * (1.0 * 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 * N[(1.0 * x$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 81.7%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower-/.f64 97.3

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

4. Applied rewrites 97.3%

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

5. Taylor expanded in y around inf

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

7. Applied rewrites 55.5%

   \[\leadsto \color{blue}{1} \cdot x \]
8. Add Preprocessing

Developer Target 1: 96.2% accurate, 0.5× 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 2024318 
(FPCore (x y z)
  :name "Diagrams.Backend.Cairo.Internal:setTexture from diagrams-cairo-1.3.0.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -206020233192173900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- x (/ (* z x) y)) (if (< z 1693976601382852600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ x (/ y (- y z))) (* (- y z) (/ x y)))))

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