Diagrams.Backend.Rasterific:rasterificRadialGradient from diagrams-rasterific-1.3.1.3

Percentage Accurate: 88.5% → 99.9%

Time: 10.9s

Alternatives: 8

Speedup: 1.1×

• 20.4% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 88.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(1 - y, \frac{x}{z}, y\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 89.3%

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

3. Taylor expanded in x around 0

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

   1. distribute-lft-in N/A

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

   2. mul-1-neg N/A

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

   3. distribute-rgt-neg-in N/A

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

   4. associate-/l* N/A

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

   5. mul-1-neg N/A

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

   6. associate-+r+ N/A

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

   7. associate-*r/ N/A

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

   8. *-rgt-identity N/A

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

   9. associate-+r+ N/A

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

   10. +-commutative N/A

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

   11. +-commutative N/A

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

5. Simplified 99.9%

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

Alternative 2: 99.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x + y \cdot \left(z - x\right)}{z}\\ t_1 := \mathsf{fma}\left(x, \frac{1 - y}{z}, y\right)\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+297}:\\ \;\;\;\;\frac{\mathsf{fma}\left(z - x, y, x\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (+ x (* y (- z x))) z)) (t_1 (fma x (/ (- 1.0 y) z) y)))
   (if (<= t_0 (- INFINITY))
     t_1
     (if (<= t_0 5e+297) (/ (fma (- z x) y x) z) t_1))))

C

double code(double x, double y, double z) {
	double t_0 = (x + (y * (z - x))) / z;
	double t_1 = fma(x, ((1.0 - y) / z), y);
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_0 <= 5e+297) {
		tmp = fma((z - x), y, x) / z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x + Float64(y * Float64(z - x))) / z)
	t_1 = fma(x, Float64(Float64(1.0 - y) / z), y)
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_0 <= 5e+297)
		tmp = Float64(fma(Float64(z - x), y, x) / z);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x + N[(y * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, Block[{t$95$1 = N[(x * N[(N[(1.0 - y), $MachinePrecision] / z), $MachinePrecision] + y), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], t$95$1, If[LessEqual[t$95$0, 5e+297], N[(N[(N[(z - x), $MachinePrecision] * y + x), $MachinePrecision] / z), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 x (*.f64 y (-.f64 z x))) z) < -inf.0 or 4.9999999999999998e297 < (/.f64 (+.f64 x (*.f64 y (-.f64 z x))) z)

   1. Initial program 69.5%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft-in N/A

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

      2. mul-1-neg N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. associate-/l* N/A

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

      5. mul-1-neg N/A

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

      6. associate-+r+ N/A

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

      7. associate-*r/ N/A

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

      8. *-rgt-identity N/A

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

      9. associate-+r+ N/A

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

      10. +-commutative N/A

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

      11. +-commutative N/A

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

   5. Simplified 100.0%

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

   6. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

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

      3. associate-+l+ N/A

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

      4. associate-*r/ N/A

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

      5. mul-1-neg N/A

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

      6. associate-*l/ N/A

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

      7. associate-/l* N/A

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

      8. distribute-lft-neg-in N/A

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

      9. *-commutative N/A

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

      10. distribute-lft-neg-out N/A

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

      11. mul-1-neg N/A

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

      12. *-lft-identity N/A

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

      13. associate-*l/ N/A

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

      14. distribute-rgt-in N/A

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

      15. +-commutative N/A

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

   8. Simplified 100.0%

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

   if -inf.0 < (/.f64 (+.f64 x (*.f64 y (-.f64 z x))) z) < 4.9999999999999998e297

   1. Initial program 99.9%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. --lowering--.f64 99.9

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

   4. Applied egg-rr 99.9%

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

Alternative 3: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 - \frac{x}{z}\right)\\ \mathbf{if}\;y \leq -1.55 \cdot 10^{+36}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1.05 \cdot 10^{+15}:\\ \;\;\;\;\frac{\mathsf{fma}\left(z - x, y, x\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- 1.0 (/ x z)))))
   (if (<= y -1.55e+36) t_0 (if (<= y 1.05e+15) (/ (fma (- z x) y x) z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 - (x / z));
	double tmp;
	if (y <= -1.55e+36) {
		tmp = t_0;
	} else if (y <= 1.05e+15) {
		tmp = fma((z - x), y, x) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 - Float64(x / z)))
	tmp = 0.0
	if (y <= -1.55e+36)
		tmp = t_0;
	elseif (y <= 1.05e+15)
		tmp = Float64(fma(Float64(z - x), y, x) / z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(1.0 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.55e+36], t$95$0, If[LessEqual[y, 1.05e+15], N[(N[(N[(z - x), $MachinePrecision] * y + x), $MachinePrecision] / z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.55e36 or 1.05e15 < y

   1. Initial program 76.3%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft-in N/A

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

      2. mul-1-neg N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. associate-/l* N/A

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

      5. mul-1-neg N/A

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

      6. associate-+r+ N/A

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

      7. associate-*r/ N/A

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

      8. *-rgt-identity N/A

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

      9. associate-+r+ N/A

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

      10. +-commutative N/A

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

      11. +-commutative N/A

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

   5. Simplified 99.9%

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

   6. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. *-inverses N/A

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

      3. sub-neg N/A

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

      4. div-sub N/A

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

      5. *-lowering-*.f64 N/A

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

      6. div-sub N/A

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

      7. *-inverses N/A

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

      8. --lowering--.f64 N/A

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

      9. /-lowering-/.f64 99.9

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

   8. Simplified 99.9%

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

   if -1.55e36 < y < 1.05e15

   1. Initial program 99.9%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. --lowering--.f64 99.9

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

   4. Applied egg-rr 99.9%

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

Alternative 4: 99.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 - \frac{x}{z}\right)\\ \mathbf{if}\;y \leq -1:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;y + \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- 1.0 (/ x z)))))
   (if (<= y -1.0) t_0 (if (<= y 1.0) (+ y (/ x z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 - (x / z));
	double tmp;
	if (y <= -1.0) {
		tmp = t_0;
	} else if (y <= 1.0) {
		tmp = y + (x / z);
	} else {
		tmp = t_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) :: t_0
    real(8) :: tmp
    t_0 = y * (1.0d0 - (x / z))
    if (y <= (-1.0d0)) then
        tmp = t_0
    else if (y <= 1.0d0) then
        tmp = y + (x / z)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = y * (1.0 - (x / z));
	double tmp;
	if (y <= -1.0) {
		tmp = t_0;
	} else if (y <= 1.0) {
		tmp = y + (x / z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * (1.0 - (x / z))
	tmp = 0
	if y <= -1.0:
		tmp = t_0
	elif y <= 1.0:
		tmp = y + (x / z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 - Float64(x / z)))
	tmp = 0.0
	if (y <= -1.0)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = Float64(y + Float64(x / z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (1.0 - (x / z));
	tmp = 0.0;
	if (y <= -1.0)
		tmp = t_0;
	elseif (y <= 1.0)
		tmp = y + (x / z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(1.0 - N[(x / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.0], t$95$0, If[LessEqual[y, 1.0], N[(y + N[(x / z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 78.5%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft-in N/A

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

      2. mul-1-neg N/A

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

      3. distribute-rgt-neg-in N/A

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

      4. associate-/l* N/A

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

      5. mul-1-neg N/A

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

      6. associate-+r+ N/A

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

      7. associate-*r/ N/A

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

      8. *-rgt-identity N/A

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

      9. associate-+r+ N/A

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

      10. +-commutative N/A

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

      11. +-commutative N/A

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

   5. Simplified 99.9%

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

   6. Taylor expanded in y around inf

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

      1. mul-1-neg N/A

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

      2. *-inverses N/A

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

      3. sub-neg N/A

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

      4. div-sub N/A

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

      5. *-lowering-*.f64 N/A

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

      6. div-sub N/A

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

      7. *-inverses N/A

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

      8. --lowering--.f64 N/A

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

      9. /-lowering-/.f64 99.0

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

   8. Simplified 99.0%

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

   if -1 < y < 1

   1. Initial program 99.9%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. --lowering--.f64 99.9

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

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in z around inf

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

   7. Simplified 98.7%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. associate-/r/ N/A

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

      6. *-commutative N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

      9. div-inv N/A

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

      10. *-inverses N/A

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

      11. *-rgt-identity N/A

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

      12. +-lowering-+.f64 N/A

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

      13. clear-num N/A

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

      14. /-lowering-/.f64 98.8

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

   9. Applied egg-rr 98.8%

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

4. Final simplification 98.9%

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

Alternative 5: 58.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.2 \cdot 10^{+33}:\\ \;\;\;\;\frac{x}{z}\\ \mathbf{elif}\;x \leq 5.6 \cdot 10^{-40}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.2e+33) (/ x z) (if (<= x 5.6e-40) y (/ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.2e+33) {
		tmp = x / z;
	} else if (x <= 5.6e-40) {
		tmp = 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 (x <= (-1.2d+33)) then
        tmp = x / z
    else if (x <= 5.6d-40) then
        tmp = 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 (x <= -1.2e+33) {
		tmp = x / z;
	} else if (x <= 5.6e-40) {
		tmp = y;
	} else {
		tmp = x / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.2e+33:
		tmp = x / z
	elif x <= 5.6e-40:
		tmp = y
	else:
		tmp = x / z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.2e+33)
		tmp = Float64(x / z);
	elseif (x <= 5.6e-40)
		tmp = y;
	else
		tmp = Float64(x / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.2e+33)
		tmp = x / z;
	elseif (x <= 5.6e-40)
		tmp = y;
	else
		tmp = x / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.2e+33], N[(x / z), $MachinePrecision], If[LessEqual[x, 5.6e-40], y, N[(x / z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.2e33 or 5.5999999999999999e-40 < x

   1. Initial program 93.4%

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

   3. Taylor expanded in y around 0

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

   5. Simplified 58.5%

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

   if -1.2e33 < x < 5.5999999999999999e-40

   1. Initial program 84.1%

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

   3. Taylor expanded in x around 0

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

   5. Simplified 64.8%

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

Alternative 6: 79.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 1:\\ \;\;\;\;y + \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{y}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 1.0) (+ y (/ x z)) (* z (/ y z))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 1.0) {
		tmp = y + (x / z);
	} else {
		tmp = z * (y / z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 1.0:
		tmp = y + (x / z)
	else:
		tmp = z * (y / z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 1.0)
		tmp = Float64(y + Float64(x / z));
	else
		tmp = Float64(z * Float64(y / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 1.0)
		tmp = y + (x / z);
	else
		tmp = z * (y / z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1

   1. Initial program 92.1%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. --lowering--.f64 92.1

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

   4. Applied egg-rr 92.1%

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

   5. Taylor expanded in z around inf

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

   7. Simplified 79.2%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. associate-/r/ N/A

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

      6. *-commutative N/A

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

      7. *-commutative N/A

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

      8. associate-*l* N/A

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

      9. div-inv N/A

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

      10. *-inverses N/A

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

      11. *-rgt-identity N/A

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

      12. +-lowering-+.f64 N/A

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

      13. clear-num N/A

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

      14. /-lowering-/.f64 84.1

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

   9. Applied egg-rr 84.1%

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

   if 1 < y

   1. Initial program 80.9%

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

   3. Taylor expanded in x around 0

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

      1. +-rgt-identity N/A

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

      2. accelerator-lowering-fma.f64 33.2

         \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(y, z, 0\right)}}{z} \]

   5. Simplified 33.2%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(y, z, 0\right)}}{z} \]
   6. Step-by-step derivation

      1. frac-2neg N/A

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

      2. +-rgt-identity N/A

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

      3. distribute-lft-neg-in N/A

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

      4. *-rgt-identity N/A

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

      5. times-frac N/A

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

      6. frac-2neg N/A

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

      7. /-rgt-identity N/A

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

      8. *-lowering-*.f64 N/A

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

      9. /-lowering-/.f64 56.4

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

   7. Applied egg-rr 56.4%

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

4. Final simplification 77.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 1:\\ \;\;\;\;y + \frac{x}{z}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 78.2% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.3%

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. accelerator-lowering-fma.f64 N/A

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

   4. --lowering--.f64 89.3

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

4. Applied egg-rr 89.3%

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

5. Taylor expanded in z around inf

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

7. Simplified 67.4%

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

   1. clear-num N/A

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

   2. associate-/r/ N/A

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

   3. +-commutative N/A

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

   4. distribute-lft-in N/A

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

   5. associate-/r/ N/A

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

   6. *-commutative N/A

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

   7. *-commutative N/A

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

   8. associate-*l* N/A

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

   9. div-inv N/A

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

   10. *-inverses N/A

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

   11. *-rgt-identity N/A

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

   12. +-lowering-+.f64 N/A

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

   13. clear-num N/A

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

   14. /-lowering-/.f64 74.8

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

9. Applied egg-rr 74.8%

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

10. Final simplification 74.8%

    \[\leadsto y + \frac{x}{z} \]
11. Add Preprocessing

Alternative 8: 40.5% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 89.3%

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

3. Taylor expanded in x around 0

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

5. Simplified 34.5%

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

Developer Target 1: 94.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

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 + (x / z)) - (y / (z / x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024198 
(FPCore (x y z)
  :name "Diagrams.Backend.Rasterific:rasterificRadialGradient from diagrams-rasterific-1.3.1.3"
  :precision binary64

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

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