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

Percentage Accurate: 99.9% → 99.9%

Time: 7.8s

Alternatives: 12

Speedup: 1.0×

• 26.8% 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: 99.9% 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: 99.9% 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: 82.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4 \cdot 10^{+89} \lor \neg \left(z \leq 1.12 \cdot 10^{+77}\right):\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) \cdot \frac{0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -4e+89) (not (<= z 1.12e+77)))
   (/ (* z -0.5) t)
   (* (+ x y) (/ 0.5 t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -4e+89) || !(z <= 1.12e+77)) {
		tmp = (z * -0.5) / t;
	} else {
		tmp = (x + y) * (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 ((z <= (-4d+89)) .or. (.not. (z <= 1.12d+77))) then
        tmp = (z * (-0.5d0)) / t
    else
        tmp = (x + y) * (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 ((z <= -4e+89) || !(z <= 1.12e+77)) {
		tmp = (z * -0.5) / t;
	} else {
		tmp = (x + y) * (0.5 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -4e+89) or not (z <= 1.12e+77):
		tmp = (z * -0.5) / t
	else:
		tmp = (x + y) * (0.5 / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -4e+89) || !(z <= 1.12e+77))
		tmp = Float64(Float64(z * -0.5) / t);
	else
		tmp = Float64(Float64(x + y) * Float64(0.5 / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -4e+89) || ~((z <= 1.12e+77)))
		tmp = (z * -0.5) / t;
	else
		tmp = (x + y) * (0.5 / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[z, -4e+89], N[Not[LessEqual[z, 1.12e+77]], $MachinePrecision]], N[(N[(z * -0.5), $MachinePrecision] / t), $MachinePrecision], N[(N[(x + y), $MachinePrecision] * N[(0.5 / t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.99999999999999998e89 or 1.1199999999999999e77 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 77.2%

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

      1. associate-*r/ 77.2%

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

   5. Simplified 77.2%

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

   if -3.99999999999999998e89 < z < 1.1199999999999999e77

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 96.9%

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

      1. associate-*r/ 96.9%

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

      2. associate-*l/ 96.7%

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

      3. associate-*r/ 96.7%

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

      4. associate-*l/ 96.6%

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

      5. distribute-lft-in 99.6%

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

      6. +-commutative 99.6%

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

   5. Simplified 99.6%

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

   6. Taylor expanded in z around 0 89.7%

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

4. Final simplification 85.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4 \cdot 10^{+89} \lor \neg \left(z \leq 1.12 \cdot 10^{+77}\right):\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) \cdot \frac{0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 45.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.8 \cdot 10^{-277}:\\ \;\;\;\;\frac{x}{t \cdot 2}\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{+69}:\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4.8e-277)
   (/ x (* t 2.0))
   (if (<= y 2.6e+69) (/ (* z -0.5) t) (/ y (* t 2.0)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4.8e-277) {
		tmp = x / (t * 2.0);
	} else if (y <= 2.6e+69) {
		tmp = (z * -0.5) / 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 (y <= (-4.8d-277)) then
        tmp = x / (t * 2.0d0)
    else if (y <= 2.6d+69) then
        tmp = (z * (-0.5d0)) / 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 (y <= -4.8e-277) {
		tmp = x / (t * 2.0);
	} else if (y <= 2.6e+69) {
		tmp = (z * -0.5) / t;
	} else {
		tmp = y / (t * 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -4.8e-277:
		tmp = x / (t * 2.0)
	elif y <= 2.6e+69:
		tmp = (z * -0.5) / t
	else:
		tmp = y / (t * 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4.8e-277)
		tmp = Float64(x / Float64(t * 2.0));
	elseif (y <= 2.6e+69)
		tmp = Float64(Float64(z * -0.5) / 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 (y <= -4.8e-277)
		tmp = x / (t * 2.0);
	elseif (y <= 2.6e+69)
		tmp = (z * -0.5) / t;
	else
		tmp = y / (t * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -4.8e-277

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 39.3%

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

   if -4.8e-277 < y < 2.6000000000000002e69

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf 48.6%

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

      1. associate-*r/ 48.6%

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

   5. Simplified 48.6%

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

   if 2.6000000000000002e69 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 74.5%

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

4. Final simplification 49.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.8 \cdot 10^{-277}:\\ \;\;\;\;\frac{x}{t \cdot 2}\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{+69}:\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 45.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.8 \cdot 10^{-277}:\\ \;\;\;\;\frac{x}{t \cdot 2}\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{+70}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4.8e-277)
   (/ x (* t 2.0))
   (if (<= y 2.8e+70) (* z (/ -0.5 t)) (/ y (* t 2.0)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4.8e-277) {
		tmp = x / (t * 2.0);
	} else if (y <= 2.8e+70) {
		tmp = z * (-0.5 / 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 (y <= (-4.8d-277)) then
        tmp = x / (t * 2.0d0)
    else if (y <= 2.8d+70) then
        tmp = z * ((-0.5d0) / 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 (y <= -4.8e-277) {
		tmp = x / (t * 2.0);
	} else if (y <= 2.8e+70) {
		tmp = z * (-0.5 / t);
	} else {
		tmp = y / (t * 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -4.8e-277:
		tmp = x / (t * 2.0)
	elif y <= 2.8e+70:
		tmp = z * (-0.5 / t)
	else:
		tmp = y / (t * 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4.8e-277)
		tmp = Float64(x / Float64(t * 2.0));
	elseif (y <= 2.8e+70)
		tmp = Float64(z * Float64(-0.5 / 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 (y <= -4.8e-277)
		tmp = x / (t * 2.0);
	elseif (y <= 2.8e+70)
		tmp = z * (-0.5 / t);
	else
		tmp = y / (t * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -4.8e-277

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 39.3%

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

   if -4.8e-277 < y < 2.7999999999999999e70

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 100.0%

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

      1. associate-*r/ 100.0%

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

      2. associate-*l/ 99.9%

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

      3. associate-*r/ 99.9%

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

      4. associate-*l/ 99.6%

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

      5. distribute-lft-in 99.6%

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

      6. +-commutative 99.6%

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

   5. Simplified 99.6%

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

   6. Taylor expanded in z around inf 48.6%

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

      1. *-commutative 48.6%

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

      2. associate-*l/ 48.6%

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

      3. associate-*r/ 48.4%

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

   8. Simplified 48.4%

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

   if 2.7999999999999999e70 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf 74.5%

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

Alternative 5: 45.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.2 \cdot 10^{-277}:\\ \;\;\;\;\frac{x}{t \cdot 2}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+70}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -7.2e-277)
   (/ x (* t 2.0))
   (if (<= y 5.5e+70) (* z (/ -0.5 t)) (* y (/ 0.5 t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -7.2e-277) {
		tmp = x / (t * 2.0);
	} else if (y <= 5.5e+70) {
		tmp = z * (-0.5 / t);
	} else {
		tmp = y * (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 <= (-7.2d-277)) then
        tmp = x / (t * 2.0d0)
    else if (y <= 5.5d+70) then
        tmp = z * ((-0.5d0) / t)
    else
        tmp = y * (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 <= -7.2e-277) {
		tmp = x / (t * 2.0);
	} else if (y <= 5.5e+70) {
		tmp = z * (-0.5 / t);
	} else {
		tmp = y * (0.5 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -7.2e-277:
		tmp = x / (t * 2.0)
	elif y <= 5.5e+70:
		tmp = z * (-0.5 / t)
	else:
		tmp = y * (0.5 / t)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -7.2e-277)
		tmp = Float64(x / Float64(t * 2.0));
	elseif (y <= 5.5e+70)
		tmp = Float64(z * Float64(-0.5 / t));
	else
		tmp = Float64(y * Float64(0.5 / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= -7.2e-277)
		tmp = x / (t * 2.0);
	elseif (y <= 5.5e+70)
		tmp = z * (-0.5 / t);
	else
		tmp = y * (0.5 / t);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if y < -7.19999999999999968e-277

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 39.3%

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

   if -7.19999999999999968e-277 < y < 5.49999999999999986e70

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 100.0%

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

      1. associate-*r/ 100.0%

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

      2. associate-*l/ 99.9%

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

      3. associate-*r/ 99.9%

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

      4. associate-*l/ 99.6%

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

      5. distribute-lft-in 99.6%

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

      6. +-commutative 99.6%

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

   5. Simplified 99.6%

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

   6. Taylor expanded in z around inf 48.6%

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

      1. *-commutative 48.6%

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

      2. associate-*l/ 48.6%

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

      3. associate-*r/ 48.4%

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

   8. Simplified 48.4%

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

   if 5.49999999999999986e70 < 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 96.5%

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

      1. associate-*r/ 96.5%

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

      2. associate-*l/ 96.4%

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

      3. associate-*r/ 96.4%

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

      4. associate-*l/ 96.2%

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

      5. distribute-lft-in 99.7%

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

      6. +-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in y around inf 74.3%

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

4. Final simplification 49.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.2 \cdot 10^{-277}:\\ \;\;\;\;\frac{x}{t \cdot 2}\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{+70}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 69.0% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -5e-171) (/ (- x z) (* t 2.0)) (/ (- y z) (* t 2.0))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -4.99999999999999992e-171

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 67.9%

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

   if -4.99999999999999992e-171 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 71.6%

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

Alternative 7: 75.4% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) 4e+69) (/ (- x z) (* t 2.0)) (/ (+ x y) (* t 2.0))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 4.0000000000000003e69

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 74.2%

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

   if 4.0000000000000003e69 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0 89.0%

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

      1. +-commutative 89.0%

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

   5. Simplified 89.0%

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

4. Final simplification 79.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq 4 \cdot 10^{+69}:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x + y}{t \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 74.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 4.9999999999999999e23

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.1%

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

      1. associate-*r/ 98.1%

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

      2. associate-*l/ 98.0%

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

      3. associate-*r/ 98.0%

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

      4. associate-*l/ 97.8%

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

      5. distribute-lft-in 99.7%

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

      6. +-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in y around 0 73.1%

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

   if 4.9999999999999999e23 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0 83.9%

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

      1. +-commutative 83.9%

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

   5. Simplified 83.9%

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

4. Final simplification 77.3%

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

Alternative 9: 75.3% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) 4e+69) (* (/ 0.5 t) (- x z)) (* (+ x y) (/ 0.5 t))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 4.0000000000000003e69

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.2%

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

      1. associate-*r/ 98.2%

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

      2. associate-*l/ 98.1%

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

      3. associate-*r/ 98.1%

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

      4. associate-*l/ 97.9%

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

      5. distribute-lft-in 99.7%

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

      6. +-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in y around 0 73.9%

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

   if 4.0000000000000003e69 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 96.6%

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

      1. associate-*r/ 96.6%

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

      2. associate-*l/ 96.4%

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

      3. associate-*r/ 96.4%

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

      4. associate-*l/ 96.3%

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

      5. distribute-lft-in 99.7%

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

      6. +-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in z around 0 88.8%

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

4. Final simplification 79.0%

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

Alternative 10: 46.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4.3 \cdot 10^{+71}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 4.3e+71) (* z (/ -0.5 t)) (* y (/ 0.5 t))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 4.29999999999999984e71

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.0%

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

      1. associate-*r/ 98.0%

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

      2. associate-*l/ 97.9%

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

      3. associate-*r/ 97.9%

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

      4. associate-*l/ 97.7%

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

      5. distribute-lft-in 99.7%

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

      6. +-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in z around inf 42.5%

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

      1. *-commutative 42.5%

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

      2. associate-*l/ 42.5%

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

      3. associate-*r/ 42.4%

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

   8. Simplified 42.4%

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

   if 4.29999999999999984e71 < 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 96.5%

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

      1. associate-*r/ 96.5%

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

      2. associate-*l/ 96.4%

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

      3. associate-*r/ 96.4%

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

      4. associate-*l/ 96.2%

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

      5. distribute-lft-in 99.7%

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

      6. +-commutative 99.7%

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

   5. Simplified 99.7%

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

   6. Taylor expanded in y around inf 74.3%

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

4. Final simplification 49.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4.3 \cdot 10^{+71}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around 0 97.6%

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

   1. associate-*r/ 97.6%

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

   2. associate-*l/ 97.5%

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

   3. associate-*r/ 97.5%

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

   4. associate-*l/ 97.3%

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

   5. distribute-lft-in 99.7%

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

   6. +-commutative 99.7%

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

5. Simplified 99.7%

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

6. Final simplification 99.7%

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

Alternative 12: 37.4% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(z * N[(-0.5 / 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 x around 0 97.6%

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

   1. associate-*r/ 97.6%

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

   2. associate-*l/ 97.5%

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

   3. associate-*r/ 97.5%

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

   4. associate-*l/ 97.3%

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

   5. distribute-lft-in 99.7%

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

   6. +-commutative 99.7%

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

5. Simplified 99.7%

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

6. Taylor expanded in z around inf 37.1%

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

   1. *-commutative 37.1%

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

   2. associate-*l/ 37.1%

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

   3. associate-*r/ 37.0%

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

8. Simplified 37.0%

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

Reproduce

herbie shell --seed 2024146 
(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)))