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

Percentage Accurate: 65.8% → 99.7%

Time: 9.0s

Alternatives: 11

Speedup: 0.8×

• 48.0% 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: 65.8% 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: 99.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 70.5%

   \[\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 82.0

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

   10. lift-/.f64 N/A

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

   11. lift-*.f64 N/A

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

   12. lift-*.f64 N/A

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

   13. times-frac N/A

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

   14. pow2 N/A

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

   15. lower-pow.f64 N/A

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

   16. lower-/.f64 99.7

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

4. Applied rewrites 99.7%

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

   1. lift-pow.f64 N/A

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

   2. unpow2 N/A

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

   3. lower-*.f64 99.7

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

6. Applied rewrites 99.7%

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

Alternative 2: 85.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot z}{t \cdot t}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-198}:\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+167}:\\ \;\;\;\;\frac{x \cdot x}{y \cdot y} + t\_1\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{z}{t}}{\frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* z z) (* t t))))
   (if (<= t_1 2e-198)
     (* (/ x y) (/ x y))
     (if (<= t_1 2e+167) (+ (/ (* x x) (* y y)) t_1) (/ (/ z t) (/ t z))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * z) / (t * t);
	double tmp;
	if (t_1 <= 2e-198) {
		tmp = (x / y) * (x / y);
	} else if (t_1 <= 2e+167) {
		tmp = ((x * x) / (y * y)) + t_1;
	} else {
		tmp = (z / t) / (t / z);
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = (z * z) / (t * t)
    if (t_1 <= 2d-198) then
        tmp = (x / y) * (x / y)
    else if (t_1 <= 2d+167) then
        tmp = ((x * x) / (y * y)) + t_1
    else
        tmp = (z / t) / (t / z)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	t_1 = (z * z) / (t * t)
	tmp = 0
	if t_1 <= 2e-198:
		tmp = (x / y) * (x / y)
	elif t_1 <= 2e+167:
		tmp = ((x * x) / (y * y)) + t_1
	else:
		tmp = (z / t) / (t / z)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) / (t * t);
	tmp = 0.0;
	if (t_1 <= 2e-198)
		tmp = (x / y) * (x / y);
	elseif (t_1 <= 2e+167)
		tmp = ((x * x) / (y * y)) + t_1;
	else
		tmp = (z / t) / (t / z);
	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]}, If[LessEqual[t$95$1, 2e-198], N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+167], N[(N[(N[(x * x), $MachinePrecision] / N[(y * y), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(z / t), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 1.9999999999999998e-198

   1. Initial program 73.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 \frac{x \cdot x}{y \cdot y} + \color{blue}{\frac{z \cdot z}{t \cdot t}} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 75.0

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

   4. Applied rewrites 75.0%

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

   5. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{{x}^{2}}{{y}^{2}}} \]
   6. 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}{\frac{x}{{y}^{2}} \cdot x} \]

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 93.1

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

   7. Applied rewrites 93.1%

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

   9. Applied rewrites 96.1%

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

   if 1.9999999999999998e-198 < (/.f64 (*.f64 z z) (*.f64 t t)) < 2.0000000000000001e167

   1. Initial program 86.3%

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

   if 2.0000000000000001e167 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 64.5%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 83.0

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

   5. Applied rewrites 83.0%

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

   7. Applied rewrites 83.1%

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

Alternative 3: 81.1% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* x x) (* y y))) (t_2 (* (/ z t) (/ z t))))
   (if (<= t_1 2e-32) t_2 (if (<= t_1 INFINITY) (* (/ x (* y y)) x) t_2))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x x) (*.f64 y y)) < 2.00000000000000011e-32 or +inf.0 < (/.f64 (*.f64 x x) (*.f64 y y))

   1. Initial program 63.3%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 82.2

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

   5. Applied rewrites 82.2%

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

   if 2.00000000000000011e-32 < (/.f64 (*.f64 x x) (*.f64 y y)) < +inf.0

   1. Initial program 80.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 \frac{x \cdot x}{y \cdot y} + \color{blue}{\frac{z \cdot z}{t \cdot t}} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 90.3

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

   4. Applied rewrites 90.3%

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

   5. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{{x}^{2}}{{y}^{2}}} \]
   6. 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}{\frac{x}{{y}^{2}} \cdot x} \]

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 87.5

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

   7. Applied rewrites 87.5%

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

   9. Applied rewrites 84.8%

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

Alternative 4: 89.8% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) / (t * t);
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1 + ((x / y) * (x / y));
	else
		tmp = (((z / t) * z) / t) + ((x * x) / (y * y));
	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]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(z / t), $MachinePrecision] * z), $MachinePrecision] / t), $MachinePrecision] + N[(N[(x * x), $MachinePrecision] / N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.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. 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 \frac{\color{blue}{x \cdot x}}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 96.1

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

   4. Applied rewrites 96.1%

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

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

   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 \frac{x \cdot x}{y \cdot y} + \color{blue}{\frac{z \cdot z}{t \cdot t}} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 70.0

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

   4. Applied rewrites 70.0%

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

4. Final simplification 93.2%

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

Alternative 5: 87.6% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * z) / (t * t);
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1 + ((x / y) * (x / y));
	else
		tmp = (z / t) / (t / z);
	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]}, If[LessEqual[t$95$1, Infinity], N[(t$95$1 + N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(z / t), $MachinePrecision] / N[(t / z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.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. 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 \frac{\color{blue}{x \cdot x}}{y \cdot y} + \frac{z \cdot z}{t \cdot t} \]

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 96.1

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

   4. Applied rewrites 96.1%

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

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

   1. Initial program 0.0%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 50.8

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

   5. Applied rewrites 50.8%

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

   7. Applied rewrites 51.0%

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

4. Final simplification 91.0%

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

Alternative 6: 72.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot z}{t \cdot t}\\ t_2 := \frac{x}{y \cdot y} \cdot x\\ \mathbf{if}\;t\_1 \leq 7.5 \cdot 10^{-185}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1\\ \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 (* y y)) x)))
   (if (<= t_1 7.5e-185) t_2 (if (<= t_1 INFINITY) t_1 t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * z) / (t * t);
	double t_2 = (x / (y * y)) * x;
	double tmp;
	if (t_1 <= 7.5e-185) {
		tmp = t_2;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} 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 / (y * y)) * x;
	double tmp;
	if (t_1 <= 7.5e-185) {
		tmp = t_2;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * z) / (t * t)
	t_2 = (x / (y * y)) * x
	tmp = 0
	if t_1 <= 7.5e-185:
		tmp = t_2
	elif t_1 <= math.inf:
		tmp = t_1
	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(Float64(x / Float64(y * y)) * x)
	tmp = 0.0
	if (t_1 <= 7.5e-185)
		tmp = t_2;
	elseif (t_1 <= Inf)
		tmp = t_1;
	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 / (y * y)) * x;
	tmp = 0.0;
	if (t_1 <= 7.5e-185)
		tmp = t_2;
	elseif (t_1 <= Inf)
		tmp = t_1;
	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[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[t$95$1, 7.5e-185], t$95$2, If[LessEqual[t$95$1, Infinity], t$95$1, t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 7.49999999999999978e-185 or +inf.0 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 56.3%

      \[\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 \frac{x \cdot x}{y \cdot y} + \color{blue}{\frac{z \cdot z}{t \cdot t}} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 74.0

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

   4. Applied rewrites 74.0%

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

   5. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{{x}^{2}}{{y}^{2}}} \]
   6. 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}{\frac{x}{{y}^{2}} \cdot x} \]

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 82.9

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

   7. Applied rewrites 82.9%

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

   9. Applied rewrites 71.6%

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

   if 7.49999999999999978e-185 < (/.f64 (*.f64 z z) (*.f64 t t)) < +inf.0

   1. Initial program 83.1%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 85.9

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

   5. Applied rewrites 85.9%

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

   7. Applied rewrites 86.4%

      \[\leadsto \frac{z \cdot z}{\color{blue}{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{z \cdot z}{t \cdot t} \leq 2 \cdot 10^{-146}:\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{z}{t}}{\frac{t}{z}}\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-146) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = (z / t) / (t / z);
	}
	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-146) then
        tmp = (x / y) * (x / y)
    else
        tmp = (z / t) / (t / z)
    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-146) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = (z / t) / (t / z);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 2.00000000000000005e-146

   1. Initial program 74.3%

      \[\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 \frac{x \cdot x}{y \cdot y} + \color{blue}{\frac{z \cdot z}{t \cdot t}} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 75.3

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

   4. Applied rewrites 75.3%

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

   5. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{{x}^{2}}{{y}^{2}}} \]
   6. 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}{\frac{x}{{y}^{2}} \cdot x} \]

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 91.5

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

   7. Applied rewrites 91.5%

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

   9. Applied rewrites 94.3%

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

   if 2.00000000000000005e-146 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 68.3%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 80.4

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

   5. Applied rewrites 80.4%

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

   7. Applied rewrites 80.6%

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

Alternative 8: 96.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 70.5%

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

3. Taylor expanded in t around inf

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

   1. unpow2 N/A

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

   2. associate-*l/ N/A

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

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

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

   5. associate-/r* N/A

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

   6. lower-/.f64 N/A

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

   7. lower-/.f64 N/A

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

   8. unpow2 N/A

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

   9. unpow2 N/A

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

   10. times-frac N/A

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

   11. lower-*.f64 N/A

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

   12. lower-/.f64 N/A

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

   13. lower-/.f64 98.2

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

5. Applied rewrites 98.2%

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

Alternative 9: 82.3% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-146) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = (z / t) * (z / 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-146) then
        tmp = (x / y) * (x / y)
    else
        tmp = (z / t) * (z / 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-146) {
		tmp = (x / y) * (x / y);
	} else {
		tmp = (z / t) * (z / t);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z * z) / (t * t)) <= 2e-146)
		tmp = (x / y) * (x / y);
	else
		tmp = (z / t) * (z / 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-146], N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision], N[(N[(z / t), $MachinePrecision] * N[(z / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 2.00000000000000005e-146

   1. Initial program 74.3%

      \[\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 \frac{x \cdot x}{y \cdot y} + \color{blue}{\frac{z \cdot z}{t \cdot t}} \]

      2. lift-*.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. times-frac N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 75.3

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

   4. Applied rewrites 75.3%

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

   5. Taylor expanded in t around inf

      \[\leadsto \color{blue}{\frac{{x}^{2}}{{y}^{2}}} \]
   6. 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}{\frac{x}{{y}^{2}} \cdot x} \]

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 91.5

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

   7. Applied rewrites 91.5%

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

   9. Applied rewrites 94.3%

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

   if 2.00000000000000005e-146 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 68.3%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 80.4

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

   5. Applied rewrites 80.4%

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

Alternative 10: 80.2% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z * z) / (t * t)) <= 2e-146) {
		tmp = ((x / y) / y) * x;
	} else {
		tmp = (z / t) * (z / 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-146) then
        tmp = ((x / y) / y) * x
    else
        tmp = (z / t) * (z / 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-146) {
		tmp = ((x / y) / y) * x;
	} else {
		tmp = (z / t) * (z / t);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z * z) / (t * t)) <= 2e-146)
		tmp = ((x / y) / y) * x;
	else
		tmp = (z / t) * (z / 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-146], N[(N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision] * x), $MachinePrecision], N[(N[(z / t), $MachinePrecision] * N[(z / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 2.00000000000000005e-146

   1. Initial program 74.3%

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

   3. Taylor expanded in t 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}{\frac{x}{{y}^{2}} \cdot x} \]

      3. lower-*.f64 N/A

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

      4. unpow2 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 91.5

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

   5. Applied rewrites 91.5%

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

   if 2.00000000000000005e-146 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 68.3%

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

   3. Taylor expanded in t 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. unpow2 N/A

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

      3. times-frac N/A

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

      4. lower-*.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 80.4

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

   5. Applied rewrites 80.4%

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

Alternative 11: 48.2% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 70.5%

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

3. Taylor expanded in t 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. unpow2 N/A

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

   3. times-frac N/A

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

   4. lower-*.f64 N/A

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

   5. lower-/.f64 N/A

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

   6. lower-/.f64 63.1

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

5. Applied rewrites 63.1%

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

7. Applied rewrites 56.7%

   \[\leadsto \frac{z \cdot z}{\color{blue}{t \cdot t}} \]
8. 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 2024244 
(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))))