Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A

Percentage Accurate: 69.0% → 99.9%

Time: 4.1s

Alternatives: 7

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 69.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 69.2%

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

3. Taylor expanded in y around inf

   \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
4. Step-by-step derivation

5. Applied rewrites 81.2%

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

7. Applied rewrites 94.1%

   \[\leadsto \mathsf{fma}\left(\frac{\left(z + x\right) \cdot \frac{x - z}{y}}{y}, 0.5, 0.5\right) \cdot y \]

9. Applied rewrites 92.6%

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

10. Taylor expanded in y around 0

    \[\leadsto \mathsf{fma}\left(y, \frac{1}{2}, \frac{1}{2} \cdot \frac{\left(x + z\right) \cdot \left(x - z\right)}{y}\right) \]
11. Step-by-step derivation

12. Applied rewrites 99.9%

    \[\leadsto \mathsf{fma}\left(y, 0.5, \left(\left(z + x\right) \cdot \frac{x - z}{y}\right) \cdot 0.5\right) \]
13. Add Preprocessing

Alternative 2: 36.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;\left(z \cdot \frac{z}{y}\right) \cdot -0.5\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+153} \lor \neg \left(t\_0 \leq \infty\right):\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot x}{y + y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_0 0.0)
     (* (* z (/ z y)) -0.5)
     (if (or (<= t_0 5e+153) (not (<= t_0 INFINITY)))
       (* 0.5 y)
       (/ (* x x) (+ y y))))))

C

double code(double x, double y, double z) {
	double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = (z * (z / y)) * -0.5;
	} else if ((t_0 <= 5e+153) || !(t_0 <= ((double) INFINITY))) {
		tmp = 0.5 * y;
	} else {
		tmp = (x * x) / (y + y);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = (z * (z / y)) * -0.5;
	} else if ((t_0 <= 5e+153) || !(t_0 <= Double.POSITIVE_INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = (x * x) / (y + y);
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_0 <= 0.0:
		tmp = (z * (z / y)) * -0.5
	elif (t_0 <= 5e+153) or not (t_0 <= math.inf):
		tmp = 0.5 * y
	else:
		tmp = (x * x) / (y + y)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(Float64(z * Float64(z / y)) * -0.5);
	elseif ((t_0 <= 5e+153) || !(t_0 <= Inf))
		tmp = Float64(0.5 * y);
	else
		tmp = Float64(Float64(x * x) / Float64(y + y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = (z * (z / y)) * -0.5;
	elseif ((t_0 <= 5e+153) || ~((t_0 <= Inf)))
		tmp = 0.5 * y;
	else
		tmp = (x * x) / (y + y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], N[(N[(z * N[(z / y), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision], If[Or[LessEqual[t$95$0, 5e+153], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]], N[(0.5 * y), $MachinePrecision], N[(N[(x * x), $MachinePrecision] / N[(y + y), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0

   1. Initial program 81.1%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.2%

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

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{{z}^{2}}{y}} \]
   7. Step-by-step derivation

   8. Applied rewrites 29.1%

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

   10. Applied rewrites 31.3%

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

   if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5.00000000000000018e153 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 50.6%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 48.6%

      \[\leadsto \color{blue}{0.5 \cdot y} \]

   if 5.00000000000000018e153 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 66.3%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 65.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 65.2

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

   7. Applied rewrites 65.2%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 34.3%

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

4. Final simplification 36.5%

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

Alternative 3: 35.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{-103}:\\ \;\;\;\;-0.5 \cdot \frac{z \cdot z}{y}\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+153} \lor \neg \left(t\_0 \leq \infty\right):\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot x}{y + y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_0 -5e-103)
     (* -0.5 (/ (* z z) y))
     (if (or (<= t_0 5e+153) (not (<= t_0 INFINITY)))
       (* 0.5 y)
       (/ (* x x) (+ y y))))))

C

double code(double x, double y, double z) {
	double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_0 <= -5e-103) {
		tmp = -0.5 * ((z * z) / y);
	} else if ((t_0 <= 5e+153) || !(t_0 <= ((double) INFINITY))) {
		tmp = 0.5 * y;
	} else {
		tmp = (x * x) / (y + y);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_0 <= -5e-103) {
		tmp = -0.5 * ((z * z) / y);
	} else if ((t_0 <= 5e+153) || !(t_0 <= Double.POSITIVE_INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = (x * x) / (y + y);
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_0 <= -5e-103:
		tmp = -0.5 * ((z * z) / y)
	elif (t_0 <= 5e+153) or not (t_0 <= math.inf):
		tmp = 0.5 * y
	else:
		tmp = (x * x) / (y + y)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_0 <= -5e-103)
		tmp = Float64(-0.5 * Float64(Float64(z * z) / y));
	elseif ((t_0 <= 5e+153) || !(t_0 <= Inf))
		tmp = Float64(0.5 * y);
	else
		tmp = Float64(Float64(x * x) / Float64(y + y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_0 <= -5e-103)
		tmp = -0.5 * ((z * z) / y);
	elseif ((t_0 <= 5e+153) || ~((t_0 <= Inf)))
		tmp = 0.5 * y;
	else
		tmp = (x * x) / (y + y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -5e-103], N[(-0.5 * N[(N[(z * z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, 5e+153], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]], N[(0.5 * y), $MachinePrecision], N[(N[(x * x), $MachinePrecision] / N[(y + y), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < -4.99999999999999966e-103

   1. Initial program 83.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 30.1%

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

   if -4.99999999999999966e-103 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5.00000000000000018e153 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 49.5%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 48.2%

      \[\leadsto \color{blue}{0.5 \cdot y} \]

   if 5.00000000000000018e153 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 66.3%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 65.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 65.2

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

   7. Applied rewrites 65.2%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 34.3%

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

4. Final simplification 36.2%

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

Alternative 4: 62.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (((((x * x) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0) {
		tmp = ((z + x) * ((x - z) / y)) * 0.5;
	} else {
		tmp = 0.5 * (((x * x) / y) + y);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)) <= 0.0d0) then
        tmp = ((z + x) * ((x - z) / y)) * 0.5d0
    else
        tmp = 0.5d0 * (((x * x) / y) + y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0

   1. Initial program 81.1%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.2%

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

   6. Taylor expanded in y around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{y}} \]
   7. Step-by-step derivation

   8. Applied rewrites 63.8%

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

   if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 58.8%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 75.1%

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

   7. Applied rewrites 93.1%

      \[\leadsto \mathsf{fma}\left(\frac{\left(z + x\right) \cdot \frac{x - z}{y}}{y}, 0.5, 0.5\right) \cdot y \]

   9. Applied rewrites 92.4%

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

   10. Taylor expanded in z around 0

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

   12. Applied rewrites 62.0%

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

Alternative 5: 47.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (((((x * x) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0) {
		tmp = (z * (z / y)) * -0.5;
	} else {
		tmp = 0.5 * (((x * x) / y) + y);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)) <= 0.0d0) then
        tmp = (z * (z / y)) * (-0.5d0)
    else
        tmp = 0.5d0 * (((x * x) / y) + y)
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0

   1. Initial program 81.1%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.2%

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

   6. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{{z}^{2}}{y}} \]
   7. Step-by-step derivation

   8. Applied rewrites 29.1%

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

   10. Applied rewrites 31.3%

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

   if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 58.8%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(\frac{1}{2} + \frac{1}{2} \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 75.1%

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

   7. Applied rewrites 93.1%

      \[\leadsto \mathsf{fma}\left(\frac{\left(z + x\right) \cdot \frac{x - z}{y}}{y}, 0.5, 0.5\right) \cdot y \]

   9. Applied rewrites 92.4%

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

   10. Taylor expanded in z around 0

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

   12. Applied rewrites 62.0%

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

Alternative 6: 42.4% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 260000000000:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot x}{y + y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x 260000000000.0) (* 0.5 y) (/ (* x x) (+ y y))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= 260000000000.0d0) then
        tmp = 0.5d0 * y
    else
        tmp = (x * x) / (y + y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= 260000000000.0) {
		tmp = 0.5 * y;
	} else {
		tmp = (x * x) / (y + y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 260000000000.0:
		tmp = 0.5 * y
	else:
		tmp = (x * x) / (y + y)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= 260000000000.0)
		tmp = 0.5 * y;
	else
		tmp = (x * x) / (y + y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 260000000000.0], N[(0.5 * y), $MachinePrecision], N[(N[(x * x), $MachinePrecision] / N[(y + y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2.6e11

   1. Initial program 70.9%

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

   3. Taylor expanded in y around inf

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

   5. Applied rewrites 42.4%

      \[\leadsto \color{blue}{0.5 \cdot y} \]

   if 2.6e11 < x

   1. Initial program 63.2%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 76.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 76.3

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

   7. Applied rewrites 76.3%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 54.6%

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

Alternative 7: 34.4% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* 0.5 y))

C

double code(double x, double y, double z) {
	return 0.5 * y;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 0.5d0 * y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 69.2%

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

3. Taylor expanded in y around inf

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

5. Applied rewrites 37.4%

   \[\leadsto \color{blue}{0.5 \cdot y} \]
6. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (y * 0.5d0) - (((0.5d0 / y) * (z + x)) * (z - x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025026 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* y 1/2) (* (* (/ 1/2 y) (+ z x)) (- z x))))

  (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))