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

Percentage Accurate: 65.9% → 99.8%

Time: 8.8s

Alternatives: 6

Speedup: 1.0×

• 48.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: 65.9% 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.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.9%

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

   1. times-frac 78.0%

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

   2. times-frac 99.6%

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

3. Simplified 99.6%

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

   1. clear-num 99.6%

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

   2. un-div-inv 99.7%

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

5. Applied egg-rr 99.7%

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

   1. clear-num 99.7%

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

   2. div-inv 99.7%

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

7. Applied egg-rr 99.7%

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

8. Final simplification 99.7%

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

Alternative 2: 80.1% 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 170000000000 \lor \neg \left(t_1 \leq \infty\right):\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * z) / Float64(t * t))
	tmp = 0.0
	if ((t_1 <= 170000000000.0) || !(t_1 <= Inf))
		tmp = Float64(Float64(x / y) * Float64(x / y));
	else
		tmp = t_1;
	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 <= 170000000000.0) || ~((t_1 <= Inf)))
		tmp = (x / y) * (x / y);
	else
		tmp = t_1;
	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[Or[LessEqual[t$95$1, 170000000000.0], N[Not[LessEqual[t$95$1, Infinity]], $MachinePrecision]], N[(N[(x / y), $MachinePrecision] * N[(x / y), $MachinePrecision]), $MachinePrecision], t$95$1]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z z) (*.f64 t t)) < 1.7e11 or +inf.0 < (/.f64 (*.f64 z z) (*.f64 t t))

   1. Initial program 51.3%

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

      1. times-frac 73.3%

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

      2. times-frac 99.6%

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

   3. Simplified 99.6%

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

      1. clear-num 99.6%

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

      2. un-div-inv 99.6%

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

   5. Applied egg-rr 99.6%

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

      1. clear-num 99.6%

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

      2. div-inv 99.7%

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

   7. Applied egg-rr 99.7%

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

   8. Taylor expanded in x around inf 53.2%

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

      1. unpow2 53.2%

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

      2. unpow2 53.2%

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

   10. Simplified 53.2%

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

       1. frac-times 77.8%

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

   12. Applied egg-rr 77.8%

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

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

   1. Initial program 74.1%

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

      1. times-frac 85.7%

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

      2. times-frac 99.7%

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

   3. Simplified 99.7%

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

      1. clear-num 99.7%

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

      2. un-div-inv 99.7%

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

   5. Applied egg-rr 99.7%

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

      1. clear-num 99.7%

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

      2. div-inv 99.8%

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

   7. Applied egg-rr 99.8%

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

      1. associate-/r/ 99.8%

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

   9. Applied egg-rr 99.8%

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

   10. Taylor expanded in x around 0 82.8%

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

       1. unpow2 82.8%

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

       2. unpow2 82.8%

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

   12. Simplified 82.8%

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

4. Final simplification 79.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z \cdot z}{t \cdot t} \leq 170000000000 \lor \neg \left(\frac{z \cdot z}{t \cdot t} \leq \infty\right):\\ \;\;\;\;\frac{x}{y} \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot z}{t \cdot t}\\ \end{array} \]

Alternative 3: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.9%

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

   1. times-frac 78.0%

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

   2. times-frac 99.6%

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

3. Simplified 99.6%

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

4. Final simplification 99.6%

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

Alternative 4: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.9%

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

   1. times-frac 78.0%

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

   2. times-frac 99.6%

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

3. Simplified 99.6%

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

   1. clear-num 99.7%

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

   2. div-inv 99.7%

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

5. Applied egg-rr 99.7%

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

6. Final simplification 99.7%

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

Alternative 5: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.9%

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

   1. times-frac 78.0%

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

   2. times-frac 99.6%

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

3. Simplified 99.6%

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

   1. clear-num 99.6%

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

   2. un-div-inv 99.7%

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

5. Applied egg-rr 99.7%

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

6. Final simplification 99.7%

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

Alternative 6: 58.2% accurate, 2.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 59.9%

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

   1. times-frac 78.0%

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

   2. times-frac 99.6%

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

3. Simplified 99.6%

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

   1. clear-num 99.6%

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

   2. un-div-inv 99.7%

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

5. Applied egg-rr 99.7%

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

   1. clear-num 99.7%

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

   2. div-inv 99.7%

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

7. Applied egg-rr 99.7%

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

8. Taylor expanded in x around inf 44.1%

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

   1. unpow2 44.1%

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

   2. unpow2 44.1%

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

10. Simplified 44.1%

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

    1. frac-times 56.8%

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

12. Applied egg-rr 56.8%

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

13. Final simplification 56.8%

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

Developer target: 99.7% accurate, 0.1× 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 2023185 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Svg.PathConverter:arcToSegments from rasterific-svg-0.2.3.1"
  :precision binary64

  :herbie-target
  (+ (pow (/ x y) 2.0) (pow (/ z t) 2.0))

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