quad2p (problem 3.2.1, positive)

Average Error: 34.9 → 8.8

Time: 15.1s

Precision: binary64

Cost: 7820

Math

\[\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

↓

\[\begin{array}{l} t_0 := \sqrt{b_2 \cdot b_2 - a \cdot c}\\ \mathbf{if}\;b_2 \leq -1.3 \cdot 10^{+103}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 2 \cdot 10^{-181}:\\ \;\;\;\;\frac{t_0 - b_2}{a}\\ \mathbf{elif}\;b_2 \leq 7.5 \cdot 10^{+65}:\\ \;\;\;\;\frac{\frac{c \cdot \left(-a\right)}{b_2 + t_0}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

FPCore

(FPCore (a b_2 c)
 :precision binary64
 (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))

↓

(FPCore (a b_2 c)
 :precision binary64
 (let* ((t_0 (sqrt (- (* b_2 b_2) (* a c)))))
   (if (<= b_2 -1.3e+103)
     (+ (* -2.0 (/ b_2 a)) (* 0.5 (/ c b_2)))
     (if (<= b_2 2e-181)
       (/ (- t_0 b_2) a)
       (if (<= b_2 7.5e+65)
         (/ (/ (* c (- a)) (+ b_2 t_0)) a)
         (* (/ c b_2) -0.5))))))

C

double code(double a, double b_2, double c) {
	return (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
}

↓

double code(double a, double b_2, double c) {
	double t_0 = sqrt(((b_2 * b_2) - (a * c)));
	double tmp;
	if (b_2 <= -1.3e+103) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 2e-181) {
		tmp = (t_0 - b_2) / a;
	} else if (b_2 <= 7.5e+65) {
		tmp = ((c * -a) / (b_2 + t_0)) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Fortran

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    code = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a
end function

↓

real(8) function code(a, b_2, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_2
    real(8), intent (in) :: c
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt(((b_2 * b_2) - (a * c)))
    if (b_2 <= (-1.3d+103)) then
        tmp = ((-2.0d0) * (b_2 / a)) + (0.5d0 * (c / b_2))
    else if (b_2 <= 2d-181) then
        tmp = (t_0 - b_2) / a
    else if (b_2 <= 7.5d+65) then
        tmp = ((c * -a) / (b_2 + t_0)) / a
    else
        tmp = (c / b_2) * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b_2, double c) {
	return (-b_2 + Math.sqrt(((b_2 * b_2) - (a * c)))) / a;
}

↓

public static double code(double a, double b_2, double c) {
	double t_0 = Math.sqrt(((b_2 * b_2) - (a * c)));
	double tmp;
	if (b_2 <= -1.3e+103) {
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	} else if (b_2 <= 2e-181) {
		tmp = (t_0 - b_2) / a;
	} else if (b_2 <= 7.5e+65) {
		tmp = ((c * -a) / (b_2 + t_0)) / a;
	} else {
		tmp = (c / b_2) * -0.5;
	}
	return tmp;
}

Python

def code(a, b_2, c):
	return (-b_2 + math.sqrt(((b_2 * b_2) - (a * c)))) / a

↓

def code(a, b_2, c):
	t_0 = math.sqrt(((b_2 * b_2) - (a * c)))
	tmp = 0
	if b_2 <= -1.3e+103:
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2))
	elif b_2 <= 2e-181:
		tmp = (t_0 - b_2) / a
	elif b_2 <= 7.5e+65:
		tmp = ((c * -a) / (b_2 + t_0)) / a
	else:
		tmp = (c / b_2) * -0.5
	return tmp

Julia

function code(a, b_2, c)
	return Float64(Float64(Float64(-b_2) + sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))) / a)
end

↓

function code(a, b_2, c)
	t_0 = sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c)))
	tmp = 0.0
	if (b_2 <= -1.3e+103)
		tmp = Float64(Float64(-2.0 * Float64(b_2 / a)) + Float64(0.5 * Float64(c / b_2)));
	elseif (b_2 <= 2e-181)
		tmp = Float64(Float64(t_0 - b_2) / a);
	elseif (b_2 <= 7.5e+65)
		tmp = Float64(Float64(Float64(c * Float64(-a)) / Float64(b_2 + t_0)) / a);
	else
		tmp = Float64(Float64(c / b_2) * -0.5);
	end
	return tmp
end

MATLAB

function tmp = code(a, b_2, c)
	tmp = (-b_2 + sqrt(((b_2 * b_2) - (a * c)))) / a;
end

↓

function tmp_2 = code(a, b_2, c)
	t_0 = sqrt(((b_2 * b_2) - (a * c)));
	tmp = 0.0;
	if (b_2 <= -1.3e+103)
		tmp = (-2.0 * (b_2 / a)) + (0.5 * (c / b_2));
	elseif (b_2 <= 2e-181)
		tmp = (t_0 - b_2) / a;
	elseif (b_2 <= 7.5e+65)
		tmp = ((c * -a) / (b_2 + t_0)) / a;
	else
		tmp = (c / b_2) * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b$95$2_, c_] := N[(N[((-b$95$2) + N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

↓

code[a_, b$95$2_, c_] := Block[{t$95$0 = N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[b$95$2, -1.3e+103], N[(N[(-2.0 * N[(b$95$2 / a), $MachinePrecision]), $MachinePrecision] + N[(0.5 * N[(c / b$95$2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b$95$2, 2e-181], N[(N[(t$95$0 - b$95$2), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 7.5e+65], N[(N[(N[(c * (-a)), $MachinePrecision] / N[(b$95$2 + t$95$0), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision], N[(N[(c / b$95$2), $MachinePrecision] * -0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if b_2 < -1.3000000000000001e103

   1. Initial program 48.1

      \[\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   2. Simplified 48.1

      \[\leadsto \color{blue}{\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}} \]
      Proof

      [Start] 48.1	\[ \frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]
      +-commutative [=>] 48.1	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} + \left(-b_2\right)}}{a} \]
      unsub-neg [=>] 48.1	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}}{a} \]

   3. Taylor expanded in b_2 around -inf 3.8

      \[\leadsto \color{blue}{-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}} \]

   if -1.3000000000000001e103 < b_2 < 2.00000000000000009e-181

   1. Initial program 11.1

      \[\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   2. Simplified 11.1

      \[\leadsto \color{blue}{\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}} \]
      Proof

      [Start] 11.1	\[ \frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]
      +-commutative [=>] 11.1	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} + \left(-b_2\right)}}{a} \]
      unsub-neg [=>] 11.1	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}}{a} \]

   if 2.00000000000000009e-181 < b_2 < 7.50000000000000006e65

   1. Initial program 35.5

      \[\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   2. Simplified 35.5

      \[\leadsto \color{blue}{\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}} \]
      Proof

      [Start] 35.5	\[ \frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]
      +-commutative [=>] 35.5	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} + \left(-b_2\right)}}{a} \]
      unsub-neg [=>] 35.5	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}}{a} \]

   3. Applied egg-rr 35.5

      \[\leadsto \frac{\color{blue}{\frac{\left(b_2 \cdot b_2 - a \cdot c\right) - \left(-b_2\right) \cdot \left(-b_2\right)}{\sqrt{b_2 \cdot b_2 - a \cdot c} - \left(-b_2\right)}}}{a} \]

   4. Simplified 35.5

      \[\leadsto \frac{\color{blue}{\frac{b_2 \cdot b_2 - \left(c \cdot a + b_2 \cdot b_2\right)}{\sqrt{b_2 \cdot b_2 - c \cdot a} - \left(-b_2\right)}}}{a} \]
      Proof

      [Start] 35.5	\[ \frac{\frac{\left(b_2 \cdot b_2 - a \cdot c\right) - \left(-b_2\right) \cdot \left(-b_2\right)}{\sqrt{b_2 \cdot b_2 - a \cdot c} - \left(-b_2\right)}}{a} \]
      associate--l- [=>] 35.5	\[ \frac{\frac{\color{blue}{b_2 \cdot b_2 - \left(a \cdot c + \left(-b_2\right) \cdot \left(-b_2\right)\right)}}{\sqrt{b_2 \cdot b_2 - a \cdot c} - \left(-b_2\right)}}{a} \]
      sqr-neg [=>] 35.5	\[ \frac{\frac{b_2 \cdot b_2 - \left(a \cdot c + \color{blue}{b_2 \cdot b_2}\right)}{\sqrt{b_2 \cdot b_2 - a \cdot c} - \left(-b_2\right)}}{a} \]
      *-commutative [=>] 35.5	\[ \frac{\frac{b_2 \cdot b_2 - \left(\color{blue}{c \cdot a} + b_2 \cdot b_2\right)}{\sqrt{b_2 \cdot b_2 - a \cdot c} - \left(-b_2\right)}}{a} \]
      *-commutative [=>] 35.5	\[ \frac{\frac{b_2 \cdot b_2 - \left(c \cdot a + b_2 \cdot b_2\right)}{\sqrt{b_2 \cdot b_2 - \color{blue}{c \cdot a}} - \left(-b_2\right)}}{a} \]

   5. Applied egg-rr 35.5

      \[\leadsto \frac{\color{blue}{\left(b_2 \cdot b_2 - \mathsf{fma}\left(b_2, b_2, c \cdot a\right)\right) \cdot \frac{1}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}}{a} \]

   6. Simplified 16.5

      \[\leadsto \frac{\color{blue}{\frac{0 - c \cdot a}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}}{a} \]
      Proof

      [Start] 35.5	\[ \frac{\left(b_2 \cdot b_2 - \mathsf{fma}\left(b_2, b_2, c \cdot a\right)\right) \cdot \frac{1}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}{a} \]
      associate-*r/ [=>] 35.5	\[ \frac{\color{blue}{\frac{\left(b_2 \cdot b_2 - \mathsf{fma}\left(b_2, b_2, c \cdot a\right)\right) \cdot 1}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}}{a} \]
      *-rgt-identity [=>] 35.5	\[ \frac{\frac{\color{blue}{b_2 \cdot b_2 - \mathsf{fma}\left(b_2, b_2, c \cdot a\right)}}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}{a} \]
      fma-udef [=>] 35.5	\[ \frac{\frac{b_2 \cdot b_2 - \color{blue}{\left(b_2 \cdot b_2 + c \cdot a\right)}}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}{a} \]
      associate--r+ [=>] 16.5	\[ \frac{\frac{\color{blue}{\left(b_2 \cdot b_2 - b_2 \cdot b_2\right) - c \cdot a}}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}{a} \]
      +-inverses [=>] 16.5	\[ \frac{\frac{\color{blue}{0} - c \cdot a}{b_2 + \sqrt{b_2 \cdot b_2 - c \cdot a}}}{a} \]

   if 7.50000000000000006e65 < b_2

   1. Initial program 58.3

      \[\frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]

   2. Simplified 58.3

      \[\leadsto \color{blue}{\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}} \]
      Proof

      [Start] 58.3	\[ \frac{\left(-b_2\right) + \sqrt{b_2 \cdot b_2 - a \cdot c}}{a} \]
      +-commutative [=>] 58.3	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} + \left(-b_2\right)}}{a} \]
      unsub-neg [=>] 58.3	\[ \frac{\color{blue}{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}}{a} \]

   3. Taylor expanded in b_2 around inf 2.9

      \[\leadsto \color{blue}{-0.5 \cdot \frac{c}{b_2}} \]
3. Recombined 4 regimes into one program.

4. Final simplification 8.8

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -1.3 \cdot 10^{+103}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 2 \cdot 10^{-181}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{elif}\;b_2 \leq 7.5 \cdot 10^{+65}:\\ \;\;\;\;\frac{\frac{c \cdot \left(-a\right)}{b_2 + \sqrt{b_2 \cdot b_2 - a \cdot c}}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternatives

Alternative 1
Error	10.2
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -1.02 \cdot 10^{+103}:\\ \;\;\;\;-2 \cdot \frac{b_2}{a} + 0.5 \cdot \frac{c}{b_2}\\ \mathbf{elif}\;b_2 \leq 1.5 \cdot 10^{-109}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 2
Error	13.4
Cost	7176

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -1 \cdot 10^{-95}:\\ \;\;\;\;\frac{b_2}{\frac{a}{-2}}\\ \mathbf{elif}\;b_2 \leq 6.4 \cdot 10^{-108}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(-a\right)} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 3
Error	13.5
Cost	7048

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -1.85 \cdot 10^{-95}:\\ \;\;\;\;\frac{b_2}{\frac{a}{-2}}\\ \mathbf{elif}\;b_2 \leq 1.8 \cdot 10^{-106}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(-a\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 4
Error	35.8
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 2.5 \cdot 10^{-245}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 5
Error	22.2
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 1.15 \cdot 10^{-249}:\\ \;\;\;\;\frac{-2}{\frac{a}{b_2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 6
Error	22.2
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 5 \cdot 10^{-248}:\\ \;\;\;\;\frac{b_2}{\frac{a}{-2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{b_2} \cdot -0.5\\ \end{array} \]

Alternative 7
Error	53.4
Cost	388

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 4.4 \cdot 10^{-100}:\\ \;\;\;\;\frac{-b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 8
Error	56.4
Cost	64

\[0 \]

Reproduce

herbie shell --seed 2023059 
(FPCore (a b_2 c)
  :name "quad2p (problem 3.2.1, positive)"
  :precision binary64
  (/ (+ (- b_2) (sqrt (- (* b_2 b_2) (* a c)))) a))