Graphics.Rasterific.Shading:$sgradientColorAt from Rasterific-0.6.1

Percentage Accurate: 100.0% → 100.0%

Time: 6.5s

Alternatives: 8

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x - y}{z - 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 - y) / Float64(z - y))
end

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y}{z - 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 - y) / Float64(z - y))
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (y / (y - z)) - (x / (y - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{z - y} \]
2. Step-by-step derivation

   1. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. neg-sub0 100.0%

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

   4. associate-+l- 100.0%

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

   5. sub0-neg 100.0%

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

   6. neg-mul-1 100.0%

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

   7. sub-neg 100.0%

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

   8. +-commutative 100.0%

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

   9. neg-sub0 100.0%

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

   10. associate-+l- 100.0%

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

   11. sub0-neg 100.0%

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

   12. neg-mul-1 100.0%

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

   13. times-frac 100.0%

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

   14. metadata-eval 100.0%

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

   15. *-lft-identity 100.0%

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

3. Simplified 100.0%

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

   1. div-sub 100.0%

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

5. Applied egg-rr 100.0%

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

6. Final simplification 100.0%

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

Alternative 2: 70.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{y}{y - z}\\ t_1 := 1 - \frac{x}{y}\\ \mathbf{if}\;y \leq -2 \cdot 10^{+152}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq -3.9 \cdot 10^{-7}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;y \leq -5.8 \cdot 10^{-52}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 7 \cdot 10^{-75}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ y (- y z))) (t_1 (- 1.0 (/ x y))))
   (if (<= y -2e+152)
     t_0
     (if (<= y -3.9e-7)
       t_1
       (if (<= y -5.8e-52) t_0 (if (<= y 7e-75) (/ x z) t_1))))))

C

double code(double x, double y, double z) {
	double t_0 = y / (y - z);
	double t_1 = 1.0 - (x / y);
	double tmp;
	if (y <= -2e+152) {
		tmp = t_0;
	} else if (y <= -3.9e-7) {
		tmp = t_1;
	} else if (y <= -5.8e-52) {
		tmp = t_0;
	} else if (y <= 7e-75) {
		tmp = x / z;
	} else {
		tmp = t_1;
	}
	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) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = y / (y - z)
    t_1 = 1.0d0 - (x / y)
    if (y <= (-2d+152)) then
        tmp = t_0
    else if (y <= (-3.9d-7)) then
        tmp = t_1
    else if (y <= (-5.8d-52)) then
        tmp = t_0
    else if (y <= 7d-75) then
        tmp = x / z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y / (y - z);
	double t_1 = 1.0 - (x / y);
	double tmp;
	if (y <= -2e+152) {
		tmp = t_0;
	} else if (y <= -3.9e-7) {
		tmp = t_1;
	} else if (y <= -5.8e-52) {
		tmp = t_0;
	} else if (y <= 7e-75) {
		tmp = x / z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y / (y - z)
	t_1 = 1.0 - (x / y)
	tmp = 0
	if y <= -2e+152:
		tmp = t_0
	elif y <= -3.9e-7:
		tmp = t_1
	elif y <= -5.8e-52:
		tmp = t_0
	elif y <= 7e-75:
		tmp = x / z
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y / Float64(y - z))
	t_1 = Float64(1.0 - Float64(x / y))
	tmp = 0.0
	if (y <= -2e+152)
		tmp = t_0;
	elseif (y <= -3.9e-7)
		tmp = t_1;
	elseif (y <= -5.8e-52)
		tmp = t_0;
	elseif (y <= 7e-75)
		tmp = Float64(x / z);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y / (y - z);
	t_1 = 1.0 - (x / y);
	tmp = 0.0;
	if (y <= -2e+152)
		tmp = t_0;
	elseif (y <= -3.9e-7)
		tmp = t_1;
	elseif (y <= -5.8e-52)
		tmp = t_0;
	elseif (y <= 7e-75)
		tmp = x / z;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2e+152], t$95$0, If[LessEqual[y, -3.9e-7], t$95$1, If[LessEqual[y, -5.8e-52], t$95$0, If[LessEqual[y, 7e-75], N[(x / z), $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.0000000000000001e152 or -3.90000000000000025e-7 < y < -5.8000000000000003e-52

   1. Initial program 99.9%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. sub-neg 99.9%

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

      8. +-commutative 99.9%

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

      9. neg-sub0 99.9%

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

      10. associate-+l- 99.9%

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

      11. sub0-neg 99.9%

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

      12. neg-mul-1 99.9%

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

      13. times-frac 99.9%

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

      14. metadata-eval 99.9%

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

      15. *-lft-identity 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 76.7%

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

   if -2.0000000000000001e152 < y < -3.90000000000000025e-7 or 6.9999999999999997e-75 < y

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in z around 0 74.9%

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

      1. div-sub 74.9%

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

      2. *-inverses 74.9%

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

   6. Simplified 74.9%

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

   if -5.8000000000000003e-52 < y < 6.9999999999999997e-75

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 82.5%

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

4. Final simplification 78.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2 \cdot 10^{+152}:\\ \;\;\;\;\frac{y}{y - z}\\ \mathbf{elif}\;y \leq -3.9 \cdot 10^{-7}:\\ \;\;\;\;1 - \frac{x}{y}\\ \mathbf{elif}\;y \leq -5.8 \cdot 10^{-52}:\\ \;\;\;\;\frac{y}{y - z}\\ \mathbf{elif}\;y \leq 7 \cdot 10^{-75}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{x}{y}\\ \end{array} \]

Alternative 3: 75.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.5 \cdot 10^{+151}:\\ \;\;\;\;\frac{y}{y - z}\\ \mathbf{elif}\;y \leq -3.45 \cdot 10^{-6} \lor \neg \left(y \leq 2 \cdot 10^{+38}\right):\\ \;\;\;\;1 - \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -6.5e+151)
   (/ y (- y z))
   (if (or (<= y -3.45e-6) (not (<= y 2e+38))) (- 1.0 (/ x y)) (/ (- x y) z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -6.5e+151) {
		tmp = y / (y - z);
	} else if ((y <= -3.45e-6) || !(y <= 2e+38)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = (x - y) / z;
	}
	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 (y <= (-6.5d+151)) then
        tmp = y / (y - z)
    else if ((y <= (-3.45d-6)) .or. (.not. (y <= 2d+38))) then
        tmp = 1.0d0 - (x / y)
    else
        tmp = (x - y) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -6.5e+151) {
		tmp = y / (y - z);
	} else if ((y <= -3.45e-6) || !(y <= 2e+38)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = (x - y) / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -6.5e+151:
		tmp = y / (y - z)
	elif (y <= -3.45e-6) or not (y <= 2e+38):
		tmp = 1.0 - (x / y)
	else:
		tmp = (x - y) / z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -6.5e+151)
		tmp = Float64(y / Float64(y - z));
	elseif ((y <= -3.45e-6) || !(y <= 2e+38))
		tmp = Float64(1.0 - Float64(x / y));
	else
		tmp = Float64(Float64(x - y) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -6.5e+151)
		tmp = y / (y - z);
	elseif ((y <= -3.45e-6) || ~((y <= 2e+38)))
		tmp = 1.0 - (x / y);
	else
		tmp = (x - y) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -6.5e+151], N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[y, -3.45e-6], N[Not[LessEqual[y, 2e+38]], $MachinePrecision]], N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision], N[(N[(x - y), $MachinePrecision] / z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -6.5000000000000002e151

   1. Initial program 99.9%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. sub-neg 99.9%

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

      8. +-commutative 99.9%

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

      9. neg-sub0 99.9%

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

      10. associate-+l- 99.9%

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

      11. sub0-neg 99.9%

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

      12. neg-mul-1 99.9%

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

      13. times-frac 99.9%

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

      14. metadata-eval 99.9%

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

      15. *-lft-identity 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 83.2%

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

   if -6.5000000000000002e151 < y < -3.45e-6 or 1.99999999999999995e38 < y

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in z around 0 80.7%

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

      1. div-sub 80.7%

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

      2. *-inverses 80.7%

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

   6. Simplified 80.7%

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

   if -3.45e-6 < y < 1.99999999999999995e38

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in z around inf 81.5%

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

      1. associate-*r/ 81.5%

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

      2. neg-mul-1 81.5%

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

      3. neg-sub0 81.5%

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

      4. associate--r- 81.5%

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

      5. neg-sub0 81.5%

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

   6. Simplified 81.5%

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

   7. Taylor expanded in y around 0 81.5%

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

      1. +-commutative 81.5%

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

      2. mul-1-neg 81.5%

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

      3. sub-neg 81.5%

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

      4. div-sub 81.5%

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

   9. Simplified 81.5%

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

4. Final simplification 81.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.5 \cdot 10^{+151}:\\ \;\;\;\;\frac{y}{y - z}\\ \mathbf{elif}\;y \leq -3.45 \cdot 10^{-6} \lor \neg \left(y \leq 2 \cdot 10^{+38}\right):\\ \;\;\;\;1 - \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x - y}{z}\\ \end{array} \]

Alternative 4: 75.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.4 \cdot 10^{+113} \lor \neg \left(x \leq 2 \cdot 10^{+71}\right):\\ \;\;\;\;\frac{-x}{y - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{y - z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.4e+113) (not (<= x 2e+71))) (/ (- x) (- y z)) (/ y (- y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.4e+113) || !(x <= 2e+71)) {
		tmp = -x / (y - z);
	} else {
		tmp = y / (y - z);
	}
	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 ((x <= (-1.4d+113)) .or. (.not. (x <= 2d+71))) then
        tmp = -x / (y - z)
    else
        tmp = y / (y - z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.4e+113) || !(x <= 2e+71)) {
		tmp = -x / (y - z);
	} else {
		tmp = y / (y - z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.4e+113) or not (x <= 2e+71):
		tmp = -x / (y - z)
	else:
		tmp = y / (y - z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.4e+113) || !(x <= 2e+71))
		tmp = Float64(Float64(-x) / Float64(y - z));
	else
		tmp = Float64(y / Float64(y - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.4e+113) || ~((x <= 2e+71)))
		tmp = -x / (y - z);
	else
		tmp = y / (y - z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.4e+113], N[Not[LessEqual[x, 2e+71]], $MachinePrecision]], N[((-x) / N[(y - z), $MachinePrecision]), $MachinePrecision], N[(y / N[(y - z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.39999999999999999e113 or 2.0000000000000001e71 < x

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 86.5%

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

      1. neg-mul-1 86.5%

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

      2. distribute-neg-frac 86.5%

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

   6. Simplified 86.5%

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

   if -1.39999999999999999e113 < x < 2.0000000000000001e71

   1. Initial program 99.9%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. sub-neg 99.9%

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

      8. +-commutative 99.9%

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

      9. neg-sub0 99.9%

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

      10. associate-+l- 99.9%

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

      11. sub0-neg 99.9%

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

      12. neg-mul-1 99.9%

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

      13. times-frac 99.9%

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

      14. metadata-eval 99.9%

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

      15. *-lft-identity 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in x around 0 74.9%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.4 \cdot 10^{+113} \lor \neg \left(x \leq 2 \cdot 10^{+71}\right):\\ \;\;\;\;\frac{-x}{y - z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{y - z}\\ \end{array} \]

Alternative 5: 70.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.05 \cdot 10^{-25} \lor \neg \left(y \leq 4.4 \cdot 10^{-75}\right):\\ \;\;\;\;1 - \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.05e-25) (not (<= y 4.4e-75))) (- 1.0 (/ x y)) (/ x z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.05e-25) || !(y <= 4.4e-75)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = x / z;
	}
	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 ((y <= (-1.05d-25)) .or. (.not. (y <= 4.4d-75))) then
        tmp = 1.0d0 - (x / y)
    else
        tmp = x / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.05e-25) || !(y <= 4.4e-75)) {
		tmp = 1.0 - (x / y);
	} else {
		tmp = x / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1.05e-25) or not (y <= 4.4e-75):
		tmp = 1.0 - (x / y)
	else:
		tmp = x / z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.05e-25) || !(y <= 4.4e-75))
		tmp = Float64(1.0 - Float64(x / y));
	else
		tmp = Float64(x / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1.05e-25) || ~((y <= 4.4e-75)))
		tmp = 1.0 - (x / y);
	else
		tmp = x / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.05e-25], N[Not[LessEqual[y, 4.4e-75]], $MachinePrecision]], N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision], N[(x / z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.05000000000000001e-25 or 4.40000000000000011e-75 < y

   1. Initial program 99.9%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. sub-neg 99.9%

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

      8. +-commutative 99.9%

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

      9. neg-sub0 99.9%

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

      10. associate-+l- 99.9%

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

      11. sub0-neg 99.9%

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

      12. neg-mul-1 99.9%

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

      13. times-frac 99.9%

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

      14. metadata-eval 99.9%

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

      15. *-lft-identity 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in z around 0 72.1%

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

      1. div-sub 72.2%

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

      2. *-inverses 72.2%

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

   6. Simplified 72.2%

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

   if -1.05000000000000001e-25 < y < 4.40000000000000011e-75

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 79.0%

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

4. Final simplification 74.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.05 \cdot 10^{-25} \lor \neg \left(y \leq 4.4 \cdot 10^{-75}\right):\\ \;\;\;\;1 - \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z}\\ \end{array} \]

Alternative 6: 61.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.6 \cdot 10^{-15}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 6.2 \cdot 10^{+38}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.6e-15) 1.0 (if (<= y 6.2e+38) (/ x z) 1.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.6e-15) {
		tmp = 1.0;
	} else if (y <= 6.2e+38) {
		tmp = x / z;
	} else {
		tmp = 1.0;
	}
	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 (y <= (-1.6d-15)) then
        tmp = 1.0d0
    else if (y <= 6.2d+38) then
        tmp = x / z
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.6e-15) {
		tmp = 1.0;
	} else if (y <= 6.2e+38) {
		tmp = x / z;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.6e-15:
		tmp = 1.0
	elif y <= 6.2e+38:
		tmp = x / z
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.6e-15)
		tmp = 1.0;
	elseif (y <= 6.2e+38)
		tmp = Float64(x / z);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.6e-15)
		tmp = 1.0;
	elseif (y <= 6.2e+38)
		tmp = x / z;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.6e-15], 1.0, If[LessEqual[y, 6.2e+38], N[(x / z), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -1.6e-15 or 6.20000000000000035e38 < y

   1. Initial program 100.0%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 58.0%

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

   if -1.6e-15 < y < 6.20000000000000035e38

   1. Initial program 99.9%

      \[\frac{x - y}{z - y} \]
   2. Step-by-step derivation

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. neg-sub0 99.9%

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

      4. associate-+l- 99.9%

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

      5. sub0-neg 99.9%

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

      6. neg-mul-1 99.9%

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

      7. sub-neg 99.9%

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

      8. +-commutative 99.9%

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

      9. neg-sub0 99.9%

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

      10. associate-+l- 99.9%

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

      11. sub0-neg 99.9%

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

      12. neg-mul-1 99.9%

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

      13. times-frac 99.9%

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

      14. metadata-eval 99.9%

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

      15. *-lft-identity 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 72.5%

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

4. Final simplification 65.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.6 \cdot 10^{-15}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 6.2 \cdot 10^{+38}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 7: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - y}{z - 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 - y) / Float64(z - y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{z - y} \]

2. Final simplification 100.0%

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

Alternative 8: 35.6% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 1.0)

C

double code(double x, double y, double z) {
	return 1.0;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 1.0d0
end function

Java

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

Python

def code(x, y, z):
	return 1.0

Julia

function code(x, y, z)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_, z_] := 1.0

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{z - y} \]
2. Step-by-step derivation

   1. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. neg-sub0 100.0%

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

   4. associate-+l- 100.0%

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

   5. sub0-neg 100.0%

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

   6. neg-mul-1 100.0%

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

   7. sub-neg 100.0%

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

   8. +-commutative 100.0%

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

   9. neg-sub0 100.0%

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

   10. associate-+l- 100.0%

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

   11. sub0-neg 100.0%

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

   12. neg-mul-1 100.0%

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

   13. times-frac 100.0%

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

   14. metadata-eval 100.0%

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

   15. *-lft-identity 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in y around inf 35.7%

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

5. Final simplification 35.7%

   \[\leadsto 1 \]

Developer target: 100.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023199 
(FPCore (x y z)
  :name "Graphics.Rasterific.Shading:$sgradientColorAt from Rasterific-0.6.1"
  :precision binary64

  :herbie-target
  (- (/ x (- z y)) (/ y (- z y)))

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