Optimisation.CirclePacking:place from circle-packing-0.1.0.4, E

Percentage Accurate: 92.9% → 97.7%

Time: 10.0s

Alternatives: 9

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 92.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.8%

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

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

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

   6. /-lowering-/.f64 N/A

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

   7. --lowering--.f64 97.1

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

4. Applied egg-rr 97.1%

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

Alternative 2: 85.6% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) a)) (t_2 (* (/ y a) (- z t))))
   (if (<= t_1 -1e+52) t_2 (if (<= t_1 100000000.0) (fma y (/ z a) x) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double t_2 = (y / a) * (z - t);
	double tmp;
	if (t_1 <= -1e+52) {
		tmp = t_2;
	} else if (t_1 <= 100000000.0) {
		tmp = fma(y, (z / a), x);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / a)
	t_2 = Float64(Float64(y / a) * Float64(z - t))
	tmp = 0.0
	if (t_1 <= -1e+52)
		tmp = t_2;
	elseif (t_1 <= 100000000.0)
		tmp = fma(y, Float64(z / a), x);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -9.9999999999999999e51 or 1e8 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 89.3%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

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

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

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

      3. --lowering--.f64 78.6

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

   5. Simplified 78.6%

      \[\leadsto \color{blue}{\frac{y \cdot \left(z - t\right)}{a}} \]
   6. Step-by-step derivation

      1. associate-*l/ N/A

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

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

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

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

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

      4. --lowering--.f64 85.4

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

   7. Applied egg-rr 85.4%

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

   if -9.9999999999999999e51 < (/.f64 (*.f64 y (-.f64 z t)) a) < 1e8

   1. Initial program 95.9%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

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

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

      4. /-lowering-/.f64 86.9

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

   5. Simplified 86.9%

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

Alternative 3: 58.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(z - t\right)}{a}\\ t_2 := \frac{y}{a} \cdot z\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{-34}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+116}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- z t)) a)) (t_2 (* (/ y a) z)))
   (if (<= t_1 -5e-34) t_2 (if (<= t_1 4e+116) x t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double t_2 = (y / a) * z;
	double tmp;
	if (t_1 <= -5e-34) {
		tmp = t_2;
	} else if (t_1 <= 4e+116) {
		tmp = x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (y * (z - t)) / a
    t_2 = (y / a) * z
    if (t_1 <= (-5d-34)) then
        tmp = t_2
    else if (t_1 <= 4d+116) then
        tmp = x
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (z - t)) / a;
	double t_2 = (y / a) * z;
	double tmp;
	if (t_1 <= -5e-34) {
		tmp = t_2;
	} else if (t_1 <= 4e+116) {
		tmp = x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (z - t)) / a
	t_2 = (y / a) * z
	tmp = 0
	if t_1 <= -5e-34:
		tmp = t_2
	elif t_1 <= 4e+116:
		tmp = x
	else:
		tmp = t_2
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(z - t)) / a)
	t_2 = Float64(Float64(y / a) * z)
	tmp = 0.0
	if (t_1 <= -5e-34)
		tmp = t_2;
	elseif (t_1 <= 4e+116)
		tmp = x;
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * (z - t)) / a;
	t_2 = (y / a) * z;
	tmp = 0.0;
	if (t_1 <= -5e-34)
		tmp = t_2;
	elseif (t_1 <= 4e+116)
		tmp = x;
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]}, Block[{t$95$2 = N[(N[(y / a), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[t$95$1, -5e-34], t$95$2, If[LessEqual[t$95$1, 4e+116], x, t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 y (-.f64 z t)) a) < -5.0000000000000003e-34 or 4.00000000000000006e116 < (/.f64 (*.f64 y (-.f64 z t)) a)

   1. Initial program 88.8%

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

   3. Taylor expanded in z around inf

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

      1. /-lowering-/.f64 N/A

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

      2. *-lowering-*.f64 40.4

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

   5. Simplified 40.4%

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

      1. clear-num N/A

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

      2. associate-/r/ N/A

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

      3. associate-*r* N/A

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

      4. associate-/r/ N/A

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

      5. clear-num N/A

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

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

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

      7. /-lowering-/.f64 47.9

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

   7. Applied egg-rr 47.9%

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

   if -5.0000000000000003e-34 < (/.f64 (*.f64 y (-.f64 z t)) a) < 4.00000000000000006e116

   1. Initial program 96.2%

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

   3. Taylor expanded in x around inf

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

   5. Simplified 69.8%

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

Alternative 4: 86.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{y}{a}, z, x\right)\\ \mathbf{if}\;z \leq -9 \cdot 10^{+39}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 9.5 \cdot 10^{+71}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{a}, -t, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ y a) z x)))
   (if (<= z -9e+39) t_1 (if (<= z 9.5e+71) (fma (/ y a) (- t) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y / a), z, x);
	double tmp;
	if (z <= -9e+39) {
		tmp = t_1;
	} else if (z <= 9.5e+71) {
		tmp = fma((y / a), -t, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y / a), z, x)
	tmp = 0.0
	if (z <= -9e+39)
		tmp = t_1;
	elseif (z <= 9.5e+71)
		tmp = fma(Float64(y / a), Float64(-t), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y / a), $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[z, -9e+39], t$95$1, If[LessEqual[z, 9.5e+71], N[(N[(y / a), $MachinePrecision] * (-t) + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -8.99999999999999991e39 or 9.50000000000000015e71 < z

   1. Initial program 87.4%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. /-lowering-/.f64 N/A

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

      7. --lowering--.f64 96.6

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

   4. Applied egg-rr 96.6%

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

   5. Taylor expanded in z around inf

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

   7. Simplified 84.9%

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

   if -8.99999999999999991e39 < z < 9.50000000000000015e71

   1. Initial program 94.8%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. /-lowering-/.f64 N/A

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

      7. --lowering--.f64 97.4

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

   4. Applied egg-rr 97.4%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. neg-lowering-neg.f64 91.4

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

   7. Simplified 91.4%

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

Alternative 5: 84.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{y}{a}, z, x\right)\\ \mathbf{if}\;z \leq -9 \cdot 10^{+39}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 3.1 \cdot 10^{+65}:\\ \;\;\;\;x - \frac{y \cdot t}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ y a) z x)))
   (if (<= z -9e+39) t_1 (if (<= z 3.1e+65) (- x (/ (* y t) a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y / a), z, x);
	double tmp;
	if (z <= -9e+39) {
		tmp = t_1;
	} else if (z <= 3.1e+65) {
		tmp = x - ((y * t) / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y / a), z, x)
	tmp = 0.0
	if (z <= -9e+39)
		tmp = t_1;
	elseif (z <= 3.1e+65)
		tmp = Float64(x - Float64(Float64(y * t) / a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y / a), $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[z, -9e+39], t$95$1, If[LessEqual[z, 3.1e+65], N[(x - N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -8.99999999999999991e39 or 3.09999999999999991e65 < z

   1. Initial program 87.4%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. /-lowering-/.f64 N/A

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

      7. --lowering--.f64 96.6

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

   4. Applied egg-rr 96.6%

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

   5. Taylor expanded in z around inf

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

   7. Simplified 84.9%

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

   if -8.99999999999999991e39 < z < 3.09999999999999991e65

   1. Initial program 94.8%

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

   3. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

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

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

      4. /-lowering-/.f64 N/A

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

      5. *-commutative N/A

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

      6. *-lowering-*.f64 88.6

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

   5. Simplified 88.6%

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

Alternative 6: 77.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := -\frac{y}{a} \cdot t\\ \mathbf{if}\;t \leq -1.75 \cdot 10^{+197}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 1.55 \cdot 10^{+116}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{a}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (* (/ y a) t))))
   (if (<= t -1.75e+197) t_1 (if (<= t 1.55e+116) (fma (/ y a) z x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = -((y / a) * t);
	double tmp;
	if (t <= -1.75e+197) {
		tmp = t_1;
	} else if (t <= 1.55e+116) {
		tmp = fma((y / a), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(-Float64(Float64(y / a) * t))
	tmp = 0.0
	if (t <= -1.75e+197)
		tmp = t_1;
	elseif (t <= 1.55e+116)
		tmp = fma(Float64(y / a), z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = (-N[(N[(y / a), $MachinePrecision] * t), $MachinePrecision])}, If[LessEqual[t, -1.75e+197], t$95$1, If[LessEqual[t, 1.55e+116], N[(N[(y / a), $MachinePrecision] * z + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -1.75e197 or 1.54999999999999998e116 < t

   1. Initial program 87.3%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. associate-/l* N/A

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

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

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

      4. mul-1-neg N/A

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

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

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

      6. associate-*r/ N/A

         \[\leadsto t \cdot \color{blue}{\frac{-1 \cdot y}{a}} \]

      7. /-lowering-/.f64 N/A

         \[\leadsto t \cdot \color{blue}{\frac{-1 \cdot y}{a}} \]

      8. mul-1-neg N/A

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

      9. neg-lowering-neg.f64 78.5

         \[\leadsto t \cdot \frac{\color{blue}{-y}}{a} \]

   5. Simplified 78.5%

      \[\leadsto \color{blue}{t \cdot \frac{-y}{a}} \]

   if -1.75e197 < t < 1.54999999999999998e116

   1. Initial program 93.4%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. /-lowering-/.f64 N/A

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

      7. --lowering--.f64 96.6

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

   4. Applied egg-rr 96.6%

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

   5. Taylor expanded in z around inf

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

   7. Simplified 81.1%

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

4. Final simplification 80.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.75 \cdot 10^{+197}:\\ \;\;\;\;-\frac{y}{a} \cdot t\\ \mathbf{elif}\;t \leq 1.55 \cdot 10^{+116}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{a}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;-\frac{y}{a} \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 71.7% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.8%

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. associate-/l* N/A

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

   4. *-commutative N/A

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

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

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

   6. /-lowering-/.f64 N/A

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

   7. --lowering--.f64 97.1

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

4. Applied egg-rr 97.1%

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

5. Taylor expanded in z around inf

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

7. Simplified 67.1%

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

Alternative 8: 68.5% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 91.8%

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

3. Taylor expanded in t around 0

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

   1. +-commutative N/A

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

   2. associate-/l* N/A

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

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

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

   4. /-lowering-/.f64 64.9

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

5. Simplified 64.9%

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

Alternative 9: 39.6% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := x

Derivation

1. Initial program 91.8%

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

3. Taylor expanded in x around inf

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

5. Simplified 35.4%

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

Developer Target 1: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{z - t}\\ \mathbf{if}\;y < -1.0761266216389975 \cdot 10^{-10}:\\ \;\;\;\;x + \frac{1}{\frac{t\_1}{y}}\\ \mathbf{elif}\;y < 2.894426862792089 \cdot 10^{-49}:\\ \;\;\;\;x + \frac{y \cdot \left(z - t\right)}{a}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{t\_1}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ a (- z t))))
   (if (< y -1.0761266216389975e-10)
     (+ x (/ 1.0 (/ t_1 y)))
     (if (< y 2.894426862792089e-49)
       (+ x (/ (* y (- z t)) a))
       (+ x (/ y t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = a / (z - t);
	double tmp;
	if (y < -1.0761266216389975e-10) {
		tmp = x + (1.0 / (t_1 / y));
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) / a);
	} else {
		tmp = x + (y / t_1);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = a / (z - t)
    if (y < (-1.0761266216389975d-10)) then
        tmp = x + (1.0d0 / (t_1 / y))
    else if (y < 2.894426862792089d-49) then
        tmp = x + ((y * (z - t)) / a)
    else
        tmp = x + (y / t_1)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = a / (z - t);
	double tmp;
	if (y < -1.0761266216389975e-10) {
		tmp = x + (1.0 / (t_1 / y));
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) / a);
	} else {
		tmp = x + (y / t_1);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = a / (z - t)
	tmp = 0
	if y < -1.0761266216389975e-10:
		tmp = x + (1.0 / (t_1 / y))
	elif y < 2.894426862792089e-49:
		tmp = x + ((y * (z - t)) / a)
	else:
		tmp = x + (y / t_1)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(a / Float64(z - t))
	tmp = 0.0
	if (y < -1.0761266216389975e-10)
		tmp = Float64(x + Float64(1.0 / Float64(t_1 / y)));
	elseif (y < 2.894426862792089e-49)
		tmp = Float64(x + Float64(Float64(y * Float64(z - t)) / a));
	else
		tmp = Float64(x + Float64(y / t_1));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = a / (z - t);
	tmp = 0.0;
	if (y < -1.0761266216389975e-10)
		tmp = x + (1.0 / (t_1 / y));
	elseif (y < 2.894426862792089e-49)
		tmp = x + ((y * (z - t)) / a);
	else
		tmp = x + (y / t_1);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(a / N[(z - t), $MachinePrecision]), $MachinePrecision]}, If[Less[y, -1.0761266216389975e-10], N[(x + N[(1.0 / N[(t$95$1 / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Less[y, 2.894426862792089e-49], N[(x + N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(x + N[(y / t$95$1), $MachinePrecision]), $MachinePrecision]]]]

Reproduce

herbie shell --seed 2024204 
(FPCore (x y z t a)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, E"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< y -430450648655599/4000000000000000000000000) (+ x (/ 1 (/ (/ a (- z t)) y))) (if (< y 2894426862792089/10000000000000000000000000000000000000000000000000000000000000000) (+ x (/ (* y (- z t)) a)) (+ x (/ y (/ a (- z t)))))))

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