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

Percentage Accurate: 100.0% → 100.0%

Time: 6.2s

Alternatives: 7

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 47.5% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -0.072)
   (/ x (* t 2.0))
   (if (<= x -1.15e-249) (* -0.5 (/ z t)) (/ y (* t 2.0)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -0.072) {
		tmp = x / (t * 2.0);
	} else if (x <= -1.15e-249) {
		tmp = -0.5 * (z / t);
	} else {
		tmp = y / (t * 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= (-0.072d0)) then
        tmp = x / (t * 2.0d0)
    else if (x <= (-1.15d-249)) then
        tmp = (-0.5d0) * (z / t)
    else
        tmp = y / (t * 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -0.072) {
		tmp = x / (t * 2.0);
	} else if (x <= -1.15e-249) {
		tmp = -0.5 * (z / t);
	} else {
		tmp = y / (t * 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -0.072:
		tmp = x / (t * 2.0)
	elif x <= -1.15e-249:
		tmp = -0.5 * (z / t)
	else:
		tmp = y / (t * 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -0.072)
		tmp = Float64(x / Float64(t * 2.0));
	elseif (x <= -1.15e-249)
		tmp = Float64(-0.5 * Float64(z / t));
	else
		tmp = Float64(y / Float64(t * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -0.072)
		tmp = x / (t * 2.0);
	elseif (x <= -1.15e-249)
		tmp = -0.5 * (z / t);
	else
		tmp = y / (t * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -0.072], N[(x / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1.15e-249], N[(-0.5 * N[(z / t), $MachinePrecision]), $MachinePrecision], N[(y / N[(t * 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -0.0719999999999999946

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 63.4%

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

   if -0.0719999999999999946 < x < -1.1499999999999999e-249

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf 55.3%

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

   if -1.1499999999999999e-249 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf 40.4%

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

Alternative 3: 78.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 13500000000000:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\left(y - z\right) \cdot \frac{0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 13500000000000.0) (/ (- x z) (* t 2.0)) (* (- y z) (/ 0.5 t))))

C

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 13500000000000.0:
		tmp = (x - z) / (t * 2.0)
	else:
		tmp = (y - z) * (0.5 / t)
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.35e13

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 76.4%

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

   if 1.35e13 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 88.2%

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

      1. *-commutative 88.2%

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

      2. associate-*l/ 88.2%

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

      3. associate-*r/ 87.8%

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

   5. Simplified 87.8%

      \[\leadsto \color{blue}{\left(y - z\right) \cdot \frac{0.5}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 78.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -1.3e-12) (/ (+ x y) (* t 2.0)) (* (- y z) (/ 0.5 t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -1.3e-12) {
		tmp = (x + y) / (t * 2.0);
	} else {
		tmp = (y - z) * (0.5 / 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 (x <= (-1.3d-12)) then
        tmp = (x + y) / (t * 2.0d0)
    else
        tmp = (y - z) * (0.5d0 / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -1.3e-12) {
		tmp = (x + y) / (t * 2.0);
	} else {
		tmp = (y - z) * (0.5 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -1.3e-12:
		tmp = (x + y) / (t * 2.0)
	else:
		tmp = (y - z) * (0.5 / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -1.3e-12)
		tmp = Float64(Float64(x + y) / Float64(t * 2.0));
	else
		tmp = Float64(Float64(y - z) * Float64(0.5 / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -1.3e-12)
		tmp = (x + y) / (t * 2.0);
	else
		tmp = (y - z) * (0.5 / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -1.3e-12], N[(N[(x + y), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] * N[(0.5 / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.29999999999999991e-12

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0 80.7%

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

      1. +-commutative 80.7%

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

   5. Simplified 80.7%

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

   if -1.29999999999999991e-12 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 80.7%

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

      1. *-commutative 80.7%

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

      2. associate-*l/ 80.7%

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

      3. associate-*r/ 80.4%

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

   5. Simplified 80.4%

      \[\leadsto \color{blue}{\left(y - z\right) \cdot \frac{0.5}{t}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 80.5%

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

Alternative 5: 76.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -3.5e+166) (/ x (* t 2.0)) (* (- y z) (/ 0.5 t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -3.5e+166) {
		tmp = x / (t * 2.0);
	} else {
		tmp = (y - z) * (0.5 / 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 (x <= (-3.5d+166)) then
        tmp = x / (t * 2.0d0)
    else
        tmp = (y - z) * (0.5d0 / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -3.5e+166) {
		tmp = x / (t * 2.0);
	} else {
		tmp = (y - z) * (0.5 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -3.5e+166:
		tmp = x / (t * 2.0)
	else:
		tmp = (y - z) * (0.5 / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -3.5e+166)
		tmp = Float64(x / Float64(t * 2.0));
	else
		tmp = Float64(Float64(y - z) * Float64(0.5 / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -3.5e+166)
		tmp = x / (t * 2.0);
	else
		tmp = (y - z) * (0.5 / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -3.5e+166], N[(x / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] * N[(0.5 / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.4999999999999999e166

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 83.2%

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

   if -3.4999999999999999e166 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 78.3%

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

      1. *-commutative 78.3%

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

      2. associate-*l/ 78.3%

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

      3. associate-*r/ 78.0%

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

   5. Simplified 78.0%

      \[\leadsto \color{blue}{\left(y - z\right) \cdot \frac{0.5}{t}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 47.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.042:\\ \;\;\;\;\frac{x}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;-0.5 \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -0.042) (/ x (* t 2.0)) (* -0.5 (/ z t))))

C

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -0.042:
		tmp = x / (t * 2.0)
	else:
		tmp = -0.5 * (z / t)
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -0.042], N[(x / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], N[(-0.5 * N[(z / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -0.0420000000000000026

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 63.4%

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

   if -0.0420000000000000026 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 46.0%

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

Alternative 7: 38.0% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in z around inf 42.5%

   \[\leadsto \color{blue}{-0.5 \cdot \frac{z}{t}} \]
4. Add Preprocessing

Reproduce

herbie shell --seed 2024186 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2.0)))