Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5

Average Error: 19.8 → 10.5

Time: 12.9s

Precision: binary64

Cost: 14665

\[ \begin{array}{c}[x, y, z] = \mathsf{sort}([x, y, z])\\ \end{array} \]

Math

\[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]

↓

\[\begin{array}{l} t_0 := \left(x \cdot y + x \cdot z\right) + y \cdot z\\ \mathbf{if}\;t_0 \leq 2 \cdot 10^{-318} \lor \neg \left(t_0 \leq 5 \cdot 10^{+305}\right):\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot z + y \cdot \left(x + z\right)}\\ \end{array} \]

FPCore

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

↓

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (+ (* x y) (* x z)) (* y z))))
   (if (or (<= t_0 2e-318) (not (<= t_0 5e+305)))
     (* 2.0 (* (sqrt z) (sqrt y)))
     (* 2.0 (sqrt (+ (* x z) (* y (+ x z))))))))

C

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

↓

double code(double x, double y, double z) {
	double t_0 = ((x * y) + (x * z)) + (y * z);
	double tmp;
	if ((t_0 <= 2e-318) || !(t_0 <= 5e+305)) {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	} else {
		tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 2.0d0 * sqrt((((x * y) + (x * z)) + (y * z)))
end function

↓

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = ((x * y) + (x * z)) + (y * z)
    if ((t_0 <= 2d-318) .or. (.not. (t_0 <= 5d+305))) then
        tmp = 2.0d0 * (sqrt(z) * sqrt(y))
    else
        tmp = 2.0d0 * sqrt(((x * z) + (y * (x + z))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}

↓

public static double code(double x, double y, double z) {
	double t_0 = ((x * y) + (x * z)) + (y * z);
	double tmp;
	if ((t_0 <= 2e-318) || !(t_0 <= 5e+305)) {
		tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
	} else {
		tmp = 2.0 * Math.sqrt(((x * z) + (y * (x + z))));
	}
	return tmp;
}

Python

def code(x, y, z):
	return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))

↓

def code(x, y, z):
	t_0 = ((x * y) + (x * z)) + (y * z)
	tmp = 0
	if (t_0 <= 2e-318) or not (t_0 <= 5e+305):
		tmp = 2.0 * (math.sqrt(z) * math.sqrt(y))
	else:
		tmp = 2.0 * math.sqrt(((x * z) + (y * (x + z))))
	return tmp

Julia

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

↓

function code(x, y, z)
	t_0 = Float64(Float64(Float64(x * y) + Float64(x * z)) + Float64(y * z))
	tmp = 0.0
	if ((t_0 <= 2e-318) || !(t_0 <= 5e+305))
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	else
		tmp = Float64(2.0 * sqrt(Float64(Float64(x * z) + Float64(y * Float64(x + z)))));
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(x, y, z)
	t_0 = ((x * y) + (x * z)) + (y * z);
	tmp = 0.0;
	if ((t_0 <= 2e-318) || ~((t_0 <= 5e+305)))
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	else
		tmp = 2.0 * sqrt(((x * z) + (y * (x + z))));
	end
	tmp_2 = tmp;
end

Wolfram

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

↓

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(x * y), $MachinePrecision] + N[(x * z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 2e-318], N[Not[LessEqual[t$95$0, 5e+305]], $MachinePrecision]], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(N[(x * z), $MachinePrecision] + N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Target

Original	19.8
Target	11.5
Herbie	10.5

\[\begin{array}{l} \mathbf{if}\;z < 7.636950090573675 \cdot 10^{+176}:\\ \;\;\;\;2 \cdot \sqrt{\left(x + y\right) \cdot z + x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\right) \cdot \left(0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\right)\right) \cdot 2\\ \end{array} \]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 2.0000024e-318 or 5.00000000000000009e305 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z))

   1. Initial program 62.6

      \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]

   2. Simplified 62.6

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

      [Start] 62.6	\[ 2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
      distribute-lft-out [=>] 62.6	\[ 2 \cdot \sqrt{\color{blue}{x \cdot \left(y + z\right)} + y \cdot z} \]

   3. Applied egg-rr 63.6

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

   4. Simplified 63.1

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

      [Start] 63.6	\[ 2 \cdot \sqrt{\frac{x \cdot \left(z \cdot z - y \cdot y\right)}{z - y} + y \cdot z} \]
      associate-/l* [=>] 63.1	\[ 2 \cdot \sqrt{\color{blue}{\frac{x}{\frac{z - y}{z \cdot z - y \cdot y}}} + y \cdot z} \]
      associate-/r/ [=>] 63.1	\[ 2 \cdot \sqrt{\color{blue}{\frac{x}{z - y} \cdot \left(z \cdot z - y \cdot y\right)} + y \cdot z} \]

   5. Taylor expanded in x around 0 62.6

      \[\leadsto 2 \cdot \color{blue}{\sqrt{y \cdot z}} \]

   6. Simplified 62.6

      \[\leadsto 2 \cdot \color{blue}{\sqrt{z \cdot y}} \]
      Proof

      [Start] 62.6	\[ 2 \cdot \sqrt{y \cdot z} \]
      *-commutative [=>] 62.6	\[ 2 \cdot \sqrt{\color{blue}{z \cdot y}} \]

   7. Applied egg-rr 32.9

      \[\leadsto 2 \cdot \color{blue}{\left(\sqrt{z} \cdot \sqrt{y}\right)} \]

   if 2.0000024e-318 < (+.f64 (+.f64 (*.f64 x y) (*.f64 x z)) (*.f64 y z)) < 5.00000000000000009e305

   1. Initial program 0.2

      \[2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]

   2. Simplified 0.2

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

      [Start] 0.2	\[ 2 \cdot \sqrt{\left(x \cdot y + x \cdot z\right) + y \cdot z} \]
      distribute-lft-out [=>] 0.2	\[ 2 \cdot \sqrt{\color{blue}{x \cdot \left(y + z\right)} + y \cdot z} \]

   3. Taylor expanded in y around 0 0.2

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

4. Final simplification 10.5

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x \cdot y + x \cdot z\right) + y \cdot z \leq 2 \cdot 10^{-318} \lor \neg \left(\left(x \cdot y + x \cdot z\right) + y \cdot z \leq 5 \cdot 10^{+305}\right):\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot z + y \cdot \left(x + z\right)}\\ \end{array} \]

Alternatives

Alternative 1
Error	19.8
Cost	7104

\[2 \cdot \sqrt{y \cdot z + x \cdot \left(y + z\right)} \]

Alternative 2
Error	19.8
Cost	7104

\[2 \cdot \sqrt{x \cdot z + y \cdot \left(x + z\right)} \]

Alternative 3
Error	20.7
Cost	6980

\[\begin{array}{l} \mathbf{if}\;y \leq -1.02 \cdot 10^{-268}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(x + y\right)}\\ \end{array} \]

Alternative 4
Error	20.0
Cost	6980

\[\begin{array}{l} \mathbf{if}\;y \leq -1.06 \cdot 10^{-271}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(x + y\right)}\\ \end{array} \]

Alternative 5
Error	21.4
Cost	6852

\[\begin{array}{l} \mathbf{if}\;y \leq -1.06 \cdot 10^{-271}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot z}\\ \end{array} \]

Alternative 6
Error	41.8
Cost	6720

\[2 \cdot \sqrt{x \cdot y} \]

Reproduce

herbie shell --seed 2023067 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
  :precision binary64

  :herbie-target
  (if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))

  (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))