quad2p (problem 3.2.1, positive)

Average Error: 34.0 → 10.2

Time: 15.9s

Precision: binary64

Cost: 7368

Math

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

↓

\[\begin{array}{l} \mathbf{if}\;b_2 \leq -2.1 \cdot 10^{+137}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 8.5 \cdot 10^{-29}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \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
 (if (<= b_2 -2.1e+137)
   (/ (* b_2 -2.0) a)
   (if (<= b_2 8.5e-29)
     (/ (- (sqrt (- (* b_2 b_2) (* a c))) b_2) a)
     (/ (* c -0.5) b_2))))

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 tmp;
	if (b_2 <= -2.1e+137) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 8.5e-29) {
		tmp = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	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) :: tmp
    if (b_2 <= (-2.1d+137)) then
        tmp = (b_2 * (-2.0d0)) / a
    else if (b_2 <= 8.5d-29) then
        tmp = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a
    else
        tmp = (c * (-0.5d0)) / b_2
    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 tmp;
	if (b_2 <= -2.1e+137) {
		tmp = (b_2 * -2.0) / a;
	} else if (b_2 <= 8.5e-29) {
		tmp = (Math.sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	} else {
		tmp = (c * -0.5) / b_2;
	}
	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):
	tmp = 0
	if b_2 <= -2.1e+137:
		tmp = (b_2 * -2.0) / a
	elif b_2 <= 8.5e-29:
		tmp = (math.sqrt(((b_2 * b_2) - (a * c))) - b_2) / a
	else:
		tmp = (c * -0.5) / b_2
	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)
	tmp = 0.0
	if (b_2 <= -2.1e+137)
		tmp = Float64(Float64(b_2 * -2.0) / a);
	elseif (b_2 <= 8.5e-29)
		tmp = Float64(Float64(sqrt(Float64(Float64(b_2 * b_2) - Float64(a * c))) - b_2) / a);
	else
		tmp = Float64(Float64(c * -0.5) / b_2);
	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)
	tmp = 0.0;
	if (b_2 <= -2.1e+137)
		tmp = (b_2 * -2.0) / a;
	elseif (b_2 <= 8.5e-29)
		tmp = (sqrt(((b_2 * b_2) - (a * c))) - b_2) / a;
	else
		tmp = (c * -0.5) / b_2;
	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_] := If[LessEqual[b$95$2, -2.1e+137], N[(N[(b$95$2 * -2.0), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[b$95$2, 8.5e-29], N[(N[(N[Sqrt[N[(N[(b$95$2 * b$95$2), $MachinePrecision] - N[(a * c), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - b$95$2), $MachinePrecision] / a), $MachinePrecision], N[(N[(c * -0.5), $MachinePrecision] / b$95$2), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b_2 < -2.0999999999999999e137

   1. Initial program 56.6

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

   2. Applied egg-rr 56.6

      \[\leadsto \frac{\left(-b_2\right) + \color{blue}{{\left({\left(b_2 \cdot b_2 - a \cdot c\right)}^{0.25}\right)}^{2}}}{a} \]

   3. Taylor expanded in b_2 around -inf 3.2

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

   4. Simplified 3.2

      \[\leadsto \frac{\color{blue}{b_2 \cdot -2}}{a} \]
      Proof
      (*.f64 b_2 -2): 0 points increase in error, 0 points decrease in error
      (*.f64 b_2 (Rewrite<= metadata-eval (*.f64 -1 2))): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-*l*_binary64 (*.f64 (*.f64 b_2 -1) 2)): 0 points increase in error, 0 points decrease in error
      (*.f64 (Rewrite<= *-commutative_binary64 (*.f64 -1 b_2)) 2): 0 points increase in error, 0 points decrease in error
      (*.f64 (Rewrite=> mul-1-neg_binary64 (neg.f64 b_2)) 2): 0 points increase in error, 0 points decrease in error
      (Rewrite<= *-commutative_binary64 (*.f64 2 (neg.f64 b_2))): 0 points increase in error, 0 points decrease in error
      (*.f64 2 (Rewrite<= mul-1-neg_binary64 (*.f64 -1 b_2))): 0 points increase in error, 0 points decrease in error

   if -2.0999999999999999e137 < b_2 < 8.5000000000000001e-29

   1. Initial program 14.0

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

   if 8.5000000000000001e-29 < b_2

   1. Initial program 54.4

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

   2. Taylor expanded in b_2 around inf 7.1

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

   3. Simplified 7.1

      \[\leadsto \color{blue}{\frac{c \cdot -0.5}{b_2}} \]
      Proof
      (/.f64 (*.f64 c -1/2) b_2): 0 points increase in error, 0 points decrease in error
      (Rewrite<= associate-*l/_binary64 (*.f64 (/.f64 c b_2) -1/2)): 1 points increase in error, 0 points decrease in error
      (Rewrite<= *-commutative_binary64 (*.f64 -1/2 (/.f64 c b_2))): 0 points increase in error, 0 points decrease in error
3. Recombined 3 regimes into one program.

4. Final simplification 10.2

   \[\leadsto \begin{array}{l} \mathbf{if}\;b_2 \leq -2.1 \cdot 10^{+137}:\\ \;\;\;\;\frac{b_2 \cdot -2}{a}\\ \mathbf{elif}\;b_2 \leq 8.5 \cdot 10^{-29}:\\ \;\;\;\;\frac{\sqrt{b_2 \cdot b_2 - a \cdot c} - b_2}{a}\\ \mathbf{else}:\\ \;\;\;\;\frac{c \cdot -0.5}{b_2}\\ \end{array} \]

Alternatives

Alternative 1
Error	14.4
Cost	7176

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

Alternative 2
Error	22.8
Cost	836

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

Alternative 3
Error	39.5
Cost	452

\[\begin{array}{l} \mathbf{if}\;b_2 \leq 0:\\ \;\;\;\;\frac{-2}{\frac{a}{b_2}}\\ \mathbf{else}:\\ \;\;\;\;\frac{0}{a}\\ \end{array} \]

Alternative 4
Error	39.4
Cost	452

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

Alternative 5
Error	23.1
Cost	452

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

Alternative 6
Error	22.8
Cost	452

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

Alternative 7
Error	53.2
Cost	388

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

Alternative 8
Error	56.2
Cost	192

\[\frac{0}{a} \]

Reproduce

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