quadp (p42, positive)

Average Error: 34.9 → 10.3

Time: 18.2s

Precision: binary64

Cost: 7624

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;b \leq -2.3 \cdot 10^{+120}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 9.4 \cdot 10^{-85}:\\ \;\;\;\;\frac{\sqrt{b \cdot b + -4 \cdot \left(c \cdot a\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))

↓

(FPCore (a b c)
 :precision binary64
 (if (<= b -2.3e+120)
   (- (/ c b) (/ b a))
   (if (<= b 9.4e-85)
     (/ (- (sqrt (+ (* b b) (* -4.0 (* c a)))) b) (* a 2.0))
     (/ (- c) b))))

C

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

↓

double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.3e+120) {
		tmp = (c / b) - (b / a);
	} else if (b <= 9.4e-85) {
		tmp = (sqrt(((b * b) + (-4.0 * (c * a)))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (-b + sqrt(((b * b) - (4.0d0 * (a * c))))) / (2.0d0 * a)
end function

↓

real(8) function code(a, b, c)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8) :: tmp
    if (b <= (-2.3d+120)) then
        tmp = (c / b) - (b / a)
    else if (b <= 9.4d-85) then
        tmp = (sqrt(((b * b) + ((-4.0d0) * (c * a)))) - b) / (a * 2.0d0)
    else
        tmp = -c / b
    end if
    code = tmp
end function

Java

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

↓

public static double code(double a, double b, double c) {
	double tmp;
	if (b <= -2.3e+120) {
		tmp = (c / b) - (b / a);
	} else if (b <= 9.4e-85) {
		tmp = (Math.sqrt(((b * b) + (-4.0 * (c * a)))) - b) / (a * 2.0);
	} else {
		tmp = -c / b;
	}
	return tmp;
}

Python

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

↓

def code(a, b, c):
	tmp = 0
	if b <= -2.3e+120:
		tmp = (c / b) - (b / a)
	elif b <= 9.4e-85:
		tmp = (math.sqrt(((b * b) + (-4.0 * (c * a)))) - b) / (a * 2.0)
	else:
		tmp = -c / b
	return tmp

Julia

function code(a, b, c)
	return Float64(Float64(Float64(-b) + sqrt(Float64(Float64(b * b) - Float64(4.0 * Float64(a * c))))) / Float64(2.0 * a))
end

↓

function code(a, b, c)
	tmp = 0.0
	if (b <= -2.3e+120)
		tmp = Float64(Float64(c / b) - Float64(b / a));
	elseif (b <= 9.4e-85)
		tmp = Float64(Float64(sqrt(Float64(Float64(b * b) + Float64(-4.0 * Float64(c * a)))) - b) / Float64(a * 2.0));
	else
		tmp = Float64(Float64(-c) / b);
	end
	return tmp
end

MATLAB

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

↓

function tmp_2 = code(a, b, c)
	tmp = 0.0;
	if (b <= -2.3e+120)
		tmp = (c / b) - (b / a);
	elseif (b <= 9.4e-85)
		tmp = (sqrt(((b * b) + (-4.0 * (c * a)))) - b) / (a * 2.0);
	else
		tmp = -c / b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, c_] := N[(N[((-b) + N[Sqrt[N[(N[(b * b), $MachinePrecision] - N[(4.0 * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / N[(2.0 * a), $MachinePrecision]), $MachinePrecision]

↓

code[a_, b_, c_] := If[LessEqual[b, -2.3e+120], N[(N[(c / b), $MachinePrecision] - N[(b / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 9.4e-85], N[(N[(N[Sqrt[N[(N[(b * b), $MachinePrecision] + N[(-4.0 * N[(c * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b), $MachinePrecision] / N[(a * 2.0), $MachinePrecision]), $MachinePrecision], N[((-c) / b), $MachinePrecision]]]

Target

Original	34.9
Target	21.6
Herbie	10.3

\[\begin{array}{l} \mathbf{if}\;b < 0:\\ \;\;\;\;\frac{\left(-b\right) + \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c}{a \cdot \frac{\left(-b\right) - \sqrt{b \cdot b - 4 \cdot \left(a \cdot c\right)}}{2 \cdot a}}\\ \end{array} \]

Derivation

1. Split input into 3 regimes

2. if b < -2.29999999999999993e120

   1. Initial program 52.6

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

   2. Simplified 52.6

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
      Proof
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (+.f64 (*.f64 b b) (*.f64 -4 (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (+.f64 (*.f64 b b) (*.f64 (Rewrite<= metadata-eval (neg.f64 4)) (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (Rewrite=> neg-sub0_binary64 (-.f64 0 b)) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite=> associate-+l-_binary64 (-.f64 0 (-.f64 b (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (-.f64 0 (-.f64 b (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (Rewrite<= *-commutative_binary64 (*.f64 2 a))): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= associate-+l-_binary64 (+.f64 (-.f64 0 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (*.f64 2 a)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (Rewrite<= neg-sub0_binary64 (neg.f64 b)) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))) (*.f64 2 a)): 0 points increase in error, 0 points decrease in error

   3. Taylor expanded in b around -inf 2.6

      \[\leadsto \color{blue}{\frac{c}{b} + -1 \cdot \frac{b}{a}} \]

   4. Simplified 2.6

      \[\leadsto \color{blue}{\frac{c}{b} - \frac{b}{a}} \]
      Proof
      (-.f64 (/.f64 c b) (/.f64 b a)): 0 points increase in error, 0 points decrease in error
      (Rewrite<= unsub-neg_binary64 (+.f64 (/.f64 c b) (neg.f64 (/.f64 b a)))): 0 points increase in error, 0 points decrease in error
      (+.f64 (/.f64 c b) (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (/.f64 b a)))): 0 points increase in error, 0 points decrease in error

   if -2.29999999999999993e120 < b < 9.40000000000000019e-85

   1. Initial program 13.4

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

   2. Simplified 13.4

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
      Proof
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (+.f64 (*.f64 b b) (*.f64 -4 (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (+.f64 (*.f64 b b) (*.f64 (Rewrite<= metadata-eval (neg.f64 4)) (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (Rewrite=> neg-sub0_binary64 (-.f64 0 b)) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite=> associate-+l-_binary64 (-.f64 0 (-.f64 b (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (-.f64 0 (-.f64 b (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (Rewrite<= *-commutative_binary64 (*.f64 2 a))): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= associate-+l-_binary64 (+.f64 (-.f64 0 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (*.f64 2 a)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (Rewrite<= neg-sub0_binary64 (neg.f64 b)) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))) (*.f64 2 a)): 0 points increase in error, 0 points decrease in error

   if 9.40000000000000019e-85 < b

   1. Initial program 53.7

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

   2. Simplified 53.7

      \[\leadsto \color{blue}{\frac{\left(-b\right) + \sqrt{b \cdot b + -4 \cdot \left(a \cdot c\right)}}{a \cdot 2}} \]
      Proof
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (+.f64 (*.f64 b b) (*.f64 -4 (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (+.f64 (*.f64 b b) (*.f64 (Rewrite<= metadata-eval (neg.f64 4)) (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (neg.f64 b) (sqrt.f64 (Rewrite<= cancel-sign-sub-inv_binary64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (Rewrite=> neg-sub0_binary64 (-.f64 0 b)) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite=> associate-+l-_binary64 (-.f64 0 (-.f64 b (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))))) (*.f64 a 2)): 0 points increase in error, 0 points decrease in error
      (/.f64 (-.f64 0 (-.f64 b (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (Rewrite<= *-commutative_binary64 (*.f64 2 a))): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= associate-+l-_binary64 (+.f64 (-.f64 0 b) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c)))))) (*.f64 2 a)): 0 points increase in error, 0 points decrease in error
      (/.f64 (+.f64 (Rewrite<= neg-sub0_binary64 (neg.f64 b)) (sqrt.f64 (-.f64 (*.f64 b b) (*.f64 4 (*.f64 a c))))) (*.f64 2 a)): 0 points increase in error, 0 points decrease in error

   3. Taylor expanded in b around inf 9.3

      \[\leadsto \color{blue}{-1 \cdot \frac{c}{b}} \]

   4. Simplified 9.3

      \[\leadsto \color{blue}{\frac{-c}{b}} \]
      Proof
      (/.f64 (neg.f64 c) b): 0 points increase in error, 0 points decrease in error
      (/.f64 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 c)) b): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-*r/_binary64 (*.f64 -1 (/.f64 c b))): 0 points increase in error, 0 points decrease in error
3. Recombined 3 regimes into one program.

4. Final simplification 10.3

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -2.3 \cdot 10^{+120}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 9.4 \cdot 10^{-85}:\\ \;\;\;\;\frac{\sqrt{b \cdot b + -4 \cdot \left(c \cdot a\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternatives

Alternative 1
Error	14.1
Cost	7632

\[\begin{array}{l} t_0 := b + \sqrt{a \cdot \left(c \cdot -4\right)}\\ \mathbf{if}\;b \leq -5.5 \cdot 10^{-46}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq -2.1 \cdot 10^{-63}:\\ \;\;\;\;0.5 \cdot \frac{t_0}{a}\\ \mathbf{elif}\;b \leq -2.55 \cdot 10^{-95}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{elif}\;b \leq 1.64 \cdot 10^{-83}:\\ \;\;\;\;t_0 \cdot \frac{0.5}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 2
Error	13.9
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -5.1 \cdot 10^{-46}:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.2 \cdot 10^{-83}:\\ \;\;\;\;0.5 \cdot \frac{b + \sqrt{a \cdot \left(c \cdot -4\right)}}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 3
Error	14.3
Cost	7368

\[\begin{array}{l} \mathbf{if}\;b \leq -0.0285:\\ \;\;\;\;\frac{c}{b} - \frac{b}{a}\\ \mathbf{elif}\;b \leq 1.95 \cdot 10^{-84}:\\ \;\;\;\;\frac{\sqrt{c \cdot \left(a \cdot -4\right)} - b}{a \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 4
Error	22.7
Cost	388

\[\begin{array}{l} \mathbf{if}\;b \leq 5.2 \cdot 10^{-194}:\\ \;\;\;\;\frac{-b}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{-c}{b}\\ \end{array} \]

Alternative 5
Error	39.8
Cost	256

\[\frac{-c}{b} \]

Alternative 6
Error	62.3
Cost	192

\[\frac{b}{a} \]

Alternative 7
Error	56.7
Cost	192

\[\frac{c}{b} \]

Reproduce

herbie shell --seed 2022318 
(FPCore (a b c)
  :name "quadp (p42, positive)"
  :precision binary64

  :herbie-target
  (if (< b 0.0) (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)) (/ c (* a (/ (- (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))))

  (/ (+ (- b) (sqrt (- (* b b) (* 4.0 (* a c))))) (* 2.0 a)))