Graphics.Rasterific.Svg.PathConverter:arcToSegments from rasterific-svg-0.2.3.1

Percentage Accurate: 67.1% → 97.1%

Time: 10.6s

Alternatives: 14

Speedup: 0.9×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 67.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.1% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (fma (/ z t) (/ z t) (/ (* x (/ x y)) y)))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 71.1%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. lift-*.f64 N/A

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

   6. times-frac N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 N/A

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

   9. lower-/.f64 84.6

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

4. Applied rewrites 84.6%

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

   1. lift-/.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. times-frac N/A

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

   5. associate-*r/ N/A

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

   6. lower-/.f64 N/A

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

   7. lower-*.f64 N/A

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

   8. lower-/.f64 97.3

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

6. Applied rewrites 97.3%

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

7. Final simplification 97.3%

   \[\leadsto \mathsf{fma}\left(\frac{z}{t}, \frac{z}{t}, \frac{x \cdot \frac{x}{y}}{y}\right) \]
8. Add Preprocessing

Alternative 2: 90.8% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x x) (* y y))))
   (if (<= t_1 0.0)
     (/ (/ z t) (/ t z))
     (if (<= t_1 2e+303)
       (fma (/ z (* t t)) z t_1)
       (if (<= t_1 INFINITY)
         (/ 1.0 (/ y (* x (/ x y))))
         (fma (/ x y) (/ x y) (/ (* z z) (* t t))))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * x) / (y * y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = (z / t) / (t / z);
	} else if (t_1 <= 2e+303) {
		tmp = fma((z / (t * t)), z, t_1);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 1.0 / (y / (x * (x / y)));
	} else {
		tmp = fma((x / y), (x / y), ((z * z) / (t * t)));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * x) / Float64(y * y))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(Float64(z / t) / Float64(t / z));
	elseif (t_1 <= 2e+303)
		tmp = fma(Float64(z / Float64(t * t)), z, t_1);
	elseif (t_1 <= Inf)
		tmp = Float64(1.0 / Float64(y / Float64(x * Float64(x / y))));
	else
		tmp = fma(Float64(x / y), Float64(x / y), Float64(Float64(z * z) / Float64(t * t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(z / t), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+303], N[(N[(z / N[(t * t), $MachinePrecision]), $MachinePrecision] * z + t$95$1), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(1.0 / N[(y / N[(x * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision] + N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 0.0

   1. Initial program 67.0%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 75.2

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

   5. Applied rewrites 75.2%

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

   7. Applied rewrites 97.7%

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

   if 0.0 < (/.f64 (*.f64 x x) (*.f64 y y)) < 2e303

   1. Initial program 88.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 94.3

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

   4. Applied rewrites 94.3%

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

   if 2e303 < (/.f64 (*.f64 x x) (*.f64 y y)) < +inf.0

   1. Initial program 85.6%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 93.5

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

   5. Applied rewrites 93.5%

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

   7. Applied rewrites 97.3%

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

   if +inf.0 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 0.0%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. times-frac N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 92.5

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

   4. Applied rewrites 92.5%

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

4. Final simplification 96.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot x}{y \cdot y} \leq 0:\\ \;\;\;\;\frac{\frac{z}{t}}{\frac{t}{z}}\\ \mathbf{elif}\;\frac{x \cdot x}{y \cdot y} \leq 2 \cdot 10^{+303}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t \cdot t}, z, \frac{x \cdot x}{y \cdot y}\right)\\ \mathbf{elif}\;\frac{x \cdot x}{y \cdot y} \leq \infty:\\ \;\;\;\;\frac{1}{\frac{y}{x \cdot \frac{x}{y}}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x}{y}, \frac{z \cdot z}{t \cdot t}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.2% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x x) (* y y))))
   (if (<= t_1 2e+303)
     (fma (/ z t) (/ z t) t_1)
     (if (<= t_1 INFINITY)
       (/ 1.0 (/ y (* x (/ x y))))
       (fma (/ x y) (/ x y) (/ (* z z) (* t t)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * x) / (y * y);
	double tmp;
	if (t_1 <= 2e+303) {
		tmp = fma((z / t), (z / t), t_1);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 1.0 / (y / (x * (x / y)));
	} else {
		tmp = fma((x / y), (x / y), ((z * z) / (t * t)));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * x) / Float64(y * y))
	tmp = 0.0
	if (t_1 <= 2e+303)
		tmp = fma(Float64(z / t), Float64(z / t), t_1);
	elseif (t_1 <= Inf)
		tmp = Float64(1.0 / Float64(y / Float64(x * Float64(x / y))));
	else
		tmp = fma(Float64(x / y), Float64(x / y), Float64(Float64(z * z) / Float64(t * t)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 2e303

   1. Initial program 75.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. times-frac N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower-/.f64 98.3

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

   4. Applied rewrites 98.3%

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

   if 2e303 < (/.f64 (*.f64 x x) (*.f64 y y)) < +inf.0

   1. Initial program 85.6%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 93.5

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

   5. Applied rewrites 93.5%

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

   7. Applied rewrites 97.3%

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

   if +inf.0 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 0.0%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. times-frac N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower-/.f64 92.5

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

   4. Applied rewrites 92.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{y}, \frac{x}{y}, \frac{z \cdot z}{t \cdot t}\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 97.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot x}{y \cdot y} \leq 2 \cdot 10^{+303}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t}, \frac{z}{t}, \frac{x \cdot x}{y \cdot y}\right)\\ \mathbf{elif}\;\frac{x \cdot x}{y \cdot y} \leq \infty:\\ \;\;\;\;\frac{1}{\frac{y}{x \cdot \frac{x}{y}}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x}{y}, \frac{z \cdot z}{t \cdot t}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 87.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x x) (* y y))))
   (if (<= t_1 0.0)
     (/ (/ z t) (/ t z))
     (if (<= t_1 2e+251)
       (fma (/ z (* t t)) z t_1)
       (* (/ x y) (* x (/ 1.0 y)))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * x) / (y * y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = (z / t) / (t / z);
	} else if (t_1 <= 2e+251) {
		tmp = fma((z / (t * t)), z, t_1);
	} else {
		tmp = (x / y) * (x * (1.0 / y));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * x) / Float64(y * y))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(Float64(z / t) / Float64(t / z));
	elseif (t_1 <= 2e+251)
		tmp = fma(Float64(z / Float64(t * t)), z, t_1);
	else
		tmp = Float64(Float64(x / y) * Float64(x * Float64(1.0 / y)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(z / t), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+251], N[(N[(z / N[(t * t), $MachinePrecision]), $MachinePrecision] * z + t$95$1), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(x * N[(1.0 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 0.0

   1. Initial program 67.0%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 75.2

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

   5. Applied rewrites 75.2%

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

   7. Applied rewrites 97.7%

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

   if 0.0 < (/.f64 (*.f64 x x) (*.f64 y y)) < 2.0000000000000001e251

   1. Initial program 88.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 94.2

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

   4. Applied rewrites 94.2%

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

   if 2.0000000000000001e251 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 66.8%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 73.5

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

   5. Applied rewrites 73.5%

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

   7. Applied rewrites 87.6%

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

   9. Applied rewrites 87.7%

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

4. Final simplification 91.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x \cdot x}{y \cdot y} \leq 0:\\ \;\;\;\;\frac{\frac{z}{t}}{\frac{t}{z}}\\ \mathbf{elif}\;\frac{x \cdot x}{y \cdot y} \leq 2 \cdot 10^{+251}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t \cdot t}, z, \frac{x \cdot x}{y \cdot y}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} \cdot \left(x \cdot \frac{1}{y}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 85.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot x}{y \cdot y}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;\frac{\frac{z}{t}}{\frac{t}{z}}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y \cdot y}, x, \frac{z \cdot z}{t \cdot t}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x}{y}}{\frac{y}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x x) (* y y))))
   (if (<= t_1 0.0)
     (/ (/ z t) (/ t z))
     (if (<= t_1 2e+152)
       (fma (/ x (* y y)) x (/ (* z z) (* t t)))
       (/ (/ x y) (/ y x))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x * x) / (y * y);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = (z / t) / (t / z);
	} else if (t_1 <= 2e+152) {
		tmp = fma((x / (y * y)), x, ((z * z) / (t * t)));
	} else {
		tmp = (x / y) / (y / x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x * x) / Float64(y * y))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(Float64(z / t) / Float64(t / z));
	elseif (t_1 <= 2e+152)
		tmp = fma(Float64(x / Float64(y * y)), x, Float64(Float64(z * z) / Float64(t * t)));
	else
		tmp = Float64(Float64(x / y) / Float64(y / x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(N[(z / t), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+152], N[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] * x + N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 0.0

   1. Initial program 67.0%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 75.2

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

   5. Applied rewrites 75.2%

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

   7. Applied rewrites 97.7%

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

   if 0.0 < (/.f64 (*.f64 x x) (*.f64 y y)) < 2.0000000000000001e152

   1. Initial program 90.7%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 90.7

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

   4. Applied rewrites 90.7%

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

   if 2.0000000000000001e152 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 67.3%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 73.6

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

   5. Applied rewrites 73.6%

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

   7. Applied rewrites 87.0%

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

   9. Applied rewrites 87.1%

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

Alternative 6: 78.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot z}{t \cdot t}\\ t_2 := x \cdot \frac{\frac{x}{y}}{y}\\ \mathbf{if}\;t\_1 \leq 10^{+135}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;z \cdot \frac{z}{t \cdot t}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* z z) (* t t))) (t_2 (* x (/ (/ x y) y))))
   (if (<= t_1 1e+135) t_2 (if (<= t_1 INFINITY) (* z (/ z (* t t))) t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * z) / (t * t);
	double t_2 = x * ((x / y) / y);
	double tmp;
	if (t_1 <= 1e+135) {
		tmp = t_2;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = z * (z / (t * t));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (z * z) / (t * t);
	double t_2 = x * ((x / y) / y);
	double tmp;
	if (t_1 <= 1e+135) {
		tmp = t_2;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = z * (z / (t * t));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * z) / (t * t)
	t_2 = x * ((x / y) / y)
	tmp = 0
	if t_1 <= 1e+135:
		tmp = t_2
	elif t_1 <= math.inf:
		tmp = z * (z / (t * t))
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * z) / Float64(t * t))
	t_2 = Float64(x * Float64(Float64(x / y) / y))
	tmp = 0.0
	if (t_1 <= 1e+135)
		tmp = t_2;
	elseif (t_1 <= Inf)
		tmp = Float64(z * Float64(z / Float64(t * t)));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) / (t * t);
	t_2 = x * ((x / y) / y);
	tmp = 0.0;
	if (t_1 <= 1e+135)
		tmp = t_2;
	elseif (t_1 <= Inf)
		tmp = z * (z / (t * t));
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x * N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1e+135], t$95$2, If[LessEqual[t$95$1, Infinity], N[(z * N[(z / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 9.99999999999999962e134 or +inf.0 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 65.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 67.3

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

   5. Applied rewrites 67.3%

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

   7. Applied rewrites 78.4%

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

   if 9.99999999999999962e134 < (/.f64 (*.f64 z z) (*.f64 t t)) < +inf.0

   1. Initial program 79.5%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 91.9

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

   5. Applied rewrites 91.9%

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

Alternative 7: 82.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* x x) (* y y)) 0.01) (/ (/ z t) (/ t z)) (/ (/ x y) (/ y x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x * x) / (y * y)) <= 0.01) {
		tmp = (z / t) / (t / z);
	} else {
		tmp = (x / y) / (y / x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((x * x) / (y * y)) <= 0.01d0) then
        tmp = (z / t) / (t / z)
    else
        tmp = (x / y) / (y / x)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 0.0100000000000000002

   1. Initial program 72.2%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 88.9%

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

   if 0.0100000000000000002 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 70.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 72.4

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

   5. Applied rewrites 72.4%

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

   7. Applied rewrites 84.5%

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

   9. Applied rewrites 84.5%

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

Alternative 8: 82.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* x x) (* y y)) 0.01) (* (/ z t) (/ z t)) (/ (/ x y) (/ y x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x * x) / (y * y)) <= 0.01) {
		tmp = (z / t) * (z / t);
	} else {
		tmp = (x / y) / (y / x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((x * x) / (y * y)) <= 0.01d0) then
        tmp = (z / t) * (z / t)
    else
        tmp = (x / y) / (y / x)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 0.0100000000000000002

   1. Initial program 72.2%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 88.7%

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

   if 0.0100000000000000002 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 70.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 72.4

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

   5. Applied rewrites 72.4%

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

   7. Applied rewrites 84.5%

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

   9. Applied rewrites 84.5%

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

Alternative 9: 82.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x \cdot x}{y \cdot y} \leq 2 \cdot 10^{+34}:\\ \;\;\;\;\frac{z}{t} \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y} \cdot \left(x \cdot \frac{1}{y}\right)\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x * x) / (y * y)) <= 2e+34) {
		tmp = (z / t) * (z / t);
	} else {
		tmp = (x / y) * (x * (1.0 / y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((x * x) / (y * y)) <= 2d+34) then
        tmp = (z / t) * (z / t)
    else
        tmp = (x / y) * (x * (1.0d0 / y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 1.99999999999999989e34

   1. Initial program 73.7%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 69.6

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

   5. Applied rewrites 69.6%

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

   7. Applied rewrites 86.6%

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

   if 1.99999999999999989e34 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 69.2%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 73.3

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

   5. Applied rewrites 73.3%

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

   7. Applied rewrites 85.8%

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

   9. Applied rewrites 85.9%

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

4. Final simplification 86.2%

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

Alternative 10: 82.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* x x) (* y y)) 0.01) (* (/ z t) (/ z t)) (* (/ x y) (/ x y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((x * x) / (y * y)) <= 0.01) {
		tmp = (z / t) * (z / t);
	} else {
		tmp = (x / y) * (x / y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((x * x) / (y * y)) <= 0.01d0) then
        tmp = (z / t) * (z / t)
    else
        tmp = (x / y) * (x / y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 0.0100000000000000002

   1. Initial program 72.2%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 88.7%

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

   if 0.0100000000000000002 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 70.4%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 72.4

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

   5. Applied rewrites 72.4%

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

   7. Applied rewrites 84.5%

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

Alternative 11: 81.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 2 \cdot 10^{-62}:\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{\frac{z}{t}}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 2e-62) (* (/ x y) (/ x y)) (* z (/ (/ z t) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-62) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = z * ((z / t) / t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((z * z) / (t * t)) <= 2d-62) then
        tmp = (x / y) * (x / y)
    else
        tmp = z * ((z / t) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-62) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = z * ((z / t) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((z * z) / (t * t)) <= 2e-62:
		tmp = (x / y) * (x / y)
	else:
		tmp = z * ((z / t) / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(z * z) / Float64(t * t)) <= 2e-62)
		tmp = Float64(Float64(x / y) * Float64(x / y));
	else
		tmp = Float64(z * Float64(Float64(z / t) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z * z) / (t * t)) <= 2e-62)
		tmp = (x / y) * (x / y);
	else
		tmp = z * ((z / t) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 2e-62], N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision], N[(z * N[(N[(z / t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 2.0000000000000001e-62

   1. Initial program 80.8%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 78.6

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

   5. Applied rewrites 78.6%

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

   7. Applied rewrites 92.4%

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

   if 2.0000000000000001e-62 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 63.7%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 74.6

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

   5. Applied rewrites 74.6%

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

   7. Applied rewrites 80.7%

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

Alternative 12: 78.4% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 1e+135) (* x (/ (/ x y) y)) (* z (/ (/ z t) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 1e+135) {
		tmp = x * ((x / y) / y);
	} else {
		tmp = z * ((z / t) / t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((z * z) / (t * t)) <= 1d+135) then
        tmp = x * ((x / y) / y)
    else
        tmp = z * ((z / t) / t)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if ((z * z) / (t * t)) <= 1e+135:
		tmp = x * ((x / y) / y)
	else:
		tmp = z * ((z / t) / t)
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 1e+135], N[(x * N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(z * N[(N[(z / t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 9.99999999999999962e134

   1. Initial program 79.5%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 74.1

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

   5. Applied rewrites 74.1%

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

   7. Applied rewrites 85.7%

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

   if 9.99999999999999962e134 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 63.1%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 77.3

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

   5. Applied rewrites 77.3%

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

   7. Applied rewrites 83.7%

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

Alternative 13: 70.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 2 \cdot 10^{-62}:\\ \;\;\;\;x \cdot \frac{x}{y \cdot y}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{z}{t \cdot t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (* z z) (* t t)) 2e-62) (* x (/ x (* y y))) (* z (/ z (* t t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-62) {
		tmp = x * (x / (y * y));
	} else {
		tmp = z * (z / (t * t));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((z * z) / (t * t)) <= 2d-62) then
        tmp = x * (x / (y * y))
    else
        tmp = z * (z / (t * t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-62) {
		tmp = x * (x / (y * y));
	} else {
		tmp = z * (z / (t * t));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((z * z) / (t * t)) <= 2e-62:
		tmp = x * (x / (y * y))
	else:
		tmp = z * (z / (t * t))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(z * z) / Float64(t * t)) <= 2e-62)
		tmp = Float64(x * Float64(x / Float64(y * y)));
	else
		tmp = Float64(z * Float64(z / Float64(t * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z * z) / (t * t)) <= 2e-62)
		tmp = x * (x / (y * y));
	else
		tmp = z * (z / (t * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(N[(z * z), $MachinePrecision] / N[(t * t), $MachinePrecision]), $MachinePrecision], 2e-62], N[(x * N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[(z / N[(t * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 2.0000000000000001e-62

   1. Initial program 80.8%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. unpow2 N/A

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

      6. lower-*.f64 78.6

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

   5. Applied rewrites 78.6%

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

   if 2.0000000000000001e-62 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 63.7%

      \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. unpow2 N/A

         \[\leadsto \frac{\color{blue}{z \cdot z}}{{t}^{2}} \]

      2. associate-/l* N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{z \cdot \frac{z}{{t}^{2}}} \]

      4. lower-/.f64 N/A

         \[\leadsto z \cdot \color{blue}{\frac{z}{{t}^{2}}} \]

      5. unpow2 N/A

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

      6. lower-*.f64 74.6

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

   5. Applied rewrites 74.6%

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

Alternative 14: 52.3% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.1%

   \[\frac{x \cdot x}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. unpow2 N/A

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

   2. associate-/l* N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. unpow2 N/A

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

   6. lower-*.f64 56.2

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

5. Applied rewrites 56.2%

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

Developer Target 1: 99.7% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (+ (pow (/ x y) 2.0) (pow (/ z t) 2.0)))

C

double code(double x, double y, double z, double t) {
	return pow((x / y), 2.0) + pow((z / t), 2.0);
}

Fortran

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

Java

public static double code(double x, double y, double z, double t) {
	return Math.pow((x / y), 2.0) + Math.pow((z / t), 2.0);
}

Python

def code(x, y, z, t):
	return math.pow((x / y), 2.0) + math.pow((z / t), 2.0)

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024219 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Svg.PathConverter:arcToSegments from rasterific-svg-0.2.3.1"
  :precision binary64

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

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