Quadratic roots, wide range

Percentage Accurate: 17.6% → 97.6%

Time: 10.5s

Alternatives: 11

Speedup: 3.6×

Specification

\[\left(\left(4.930380657631324 \cdot 10^{-32} < a \land a < 2.028240960365167 \cdot 10^{+31}\right) \land \left(4.930380657631324 \cdot 10^{-32} < b \land b < 2.028240960365167 \cdot 10^{+31}\right)\right) \land \left(4.930380657631324 \cdot 10^{-32} < c \land c < 2.028240960365167 \cdot 10^{+31}\right)\]

Math

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

FPCore

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

C

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

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(a, b, c)
use fmin_fmax_functions
    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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 17.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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(a, b, c)
use fmin_fmax_functions
    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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.6% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{\mathsf{fma}\left(\mathsf{fma}\left(\left(b \cdot b\right) \cdot a, -2, \left(\left(a \cdot a\right) \cdot c\right) \cdot -5\right), c, -{b}^{4}\right) \cdot \left(c \cdot c\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (fma
  (/
   (*
    (fma (fma (* (* b b) a) -2.0 (* (* (* a a) c) -5.0)) c (- (pow b 4.0)))
    (* c c))
   (pow b 7.0))
  a
  (/ (- c) b)))

C

double code(double a, double b, double c) {
	return fma(((fma(fma(((b * b) * a), -2.0, (((a * a) * c) * -5.0)), c, -pow(b, 4.0)) * (c * c)) / pow(b, 7.0)), a, (-c / b));
}

Julia

function code(a, b, c)
	return fma(Float64(Float64(fma(fma(Float64(Float64(b * b) * a), -2.0, Float64(Float64(Float64(a * a) * c) * -5.0)), c, Float64(-(b ^ 4.0))) * Float64(c * c)) / (b ^ 7.0)), a, Float64(Float64(-c) / b))
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{-1 \cdot \frac{c}{b} + a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right) + -1 \cdot \frac{c}{b}} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right) \cdot a} + -1 \cdot \frac{c}{b} \]

   3. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right), a, -1 \cdot \frac{c}{b}\right)} \]

5. Applied rewrites 96.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.25 \cdot a, \frac{{c}^{4}}{{b}^{6}} \cdot \frac{20}{b}, \frac{{c}^{3} \cdot -2}{{b}^{5}}\right), a, \frac{\left(-c\right) \cdot c}{{b}^{3}}\right), a, \frac{-c}{b}\right)} \]

6. Taylor expanded in b around 0

   \[\leadsto \mathsf{fma}\left(\frac{-5 \cdot \left({a}^{2} \cdot {c}^{4}\right) + {b}^{2} \cdot \left(-2 \cdot \left(a \cdot {c}^{3}\right) + -1 \cdot \left({b}^{2} \cdot {c}^{2}\right)\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
7. Step-by-step derivation

8. Applied rewrites 96.8%

   \[\leadsto \mathsf{fma}\left(\frac{\mathsf{fma}\left(-5 \cdot {c}^{4}, a \cdot a, \mathsf{fma}\left(\left(-b\right) \cdot b, c \cdot c, \left({c}^{3} \cdot a\right) \cdot -2\right) \cdot \left(b \cdot b\right)\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]

9. Taylor expanded in c around 0

   \[\leadsto \mathsf{fma}\left(\frac{{c}^{2} \cdot \left(-1 \cdot {b}^{4} + c \cdot \left(-5 \cdot \left({a}^{2} \cdot c\right) + -2 \cdot \left(a \cdot {b}^{2}\right)\right)\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
10. Step-by-step derivation

11. Applied rewrites 96.8%

    \[\leadsto \mathsf{fma}\left(\frac{\mathsf{fma}\left(\mathsf{fma}\left(\left(b \cdot b\right) \cdot a, -2, \left(\left(a \cdot a\right) \cdot c\right) \cdot -5\right), c, -{b}^{4}\right) \cdot \left(c \cdot c\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
12. Add Preprocessing

Alternative 2: 96.5% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \left(\frac{\mathsf{fma}\left(\left(-a\right) \cdot b, b, \left(\left(a \cdot a\right) \cdot c\right) \cdot -2\right)}{{b}^{5}} \cdot c - {b}^{-1}\right) \cdot c \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  (-
   (* (/ (fma (* (- a) b) b (* (* (* a a) c) -2.0)) (pow b 5.0)) c)
   (pow b -1.0))
  c))

C

double code(double a, double b, double c) {
	return (((fma((-a * b), b, (((a * a) * c) * -2.0)) / pow(b, 5.0)) * c) - pow(b, -1.0)) * c;
}

Julia

function code(a, b, c)
	return Float64(Float64(Float64(Float64(fma(Float64(Float64(-a) * b), b, Float64(Float64(Float64(a * a) * c) * -2.0)) / (b ^ 5.0)) * c) - (b ^ -1.0)) * c)
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in c around 0

   \[\leadsto \color{blue}{c \cdot \left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

5. Applied rewrites 95.4%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(c \cdot -2, a \cdot \frac{a}{{b}^{5}}, \frac{-a}{{b}^{3}}\right) \cdot c - \frac{1}{b}\right) \cdot c} \]

6. Taylor expanded in b around 0

   \[\leadsto \left(\frac{-2 \cdot \left({a}^{2} \cdot c\right) + -1 \cdot \left(a \cdot {b}^{2}\right)}{{b}^{5}} \cdot c - \frac{1}{b}\right) \cdot c \]
7. Step-by-step derivation

8. Applied rewrites 95.4%

   \[\leadsto \left(\frac{\mathsf{fma}\left(\left(-a\right) \cdot b, b, \left(\left(a \cdot a\right) \cdot c\right) \cdot -2\right)}{{b}^{5}} \cdot c - \frac{1}{b}\right) \cdot c \]

9. Final simplification 95.4%

   \[\leadsto \left(\frac{\mathsf{fma}\left(\left(-a\right) \cdot b, b, \left(\left(a \cdot a\right) \cdot c\right) \cdot -2\right)}{{b}^{5}} \cdot c - {b}^{-1}\right) \cdot c \]
10. Add Preprocessing

Alternative 3: 97.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{\mathsf{fma}\left(\left(a \cdot a\right) \cdot -5, c \cdot c, \mathsf{fma}\left(-b, b, \left(c \cdot a\right) \cdot -2\right) \cdot \left(b \cdot b\right)\right) \cdot \left(c \cdot c\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (fma
  (/
   (*
    (fma (* (* a a) -5.0) (* c c) (* (fma (- b) b (* (* c a) -2.0)) (* b b)))
    (* c c))
   (pow b 7.0))
  a
  (/ (- c) b)))

C

double code(double a, double b, double c) {
	return fma(((fma(((a * a) * -5.0), (c * c), (fma(-b, b, ((c * a) * -2.0)) * (b * b))) * (c * c)) / pow(b, 7.0)), a, (-c / b));
}

Julia

function code(a, b, c)
	return fma(Float64(Float64(fma(Float64(Float64(a * a) * -5.0), Float64(c * c), Float64(fma(Float64(-b), b, Float64(Float64(c * a) * -2.0)) * Float64(b * b))) * Float64(c * c)) / (b ^ 7.0)), a, Float64(Float64(-c) / b))
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{-1 \cdot \frac{c}{b} + a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right) + -1 \cdot \frac{c}{b}} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right) \cdot a} + -1 \cdot \frac{c}{b} \]

   3. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right), a, -1 \cdot \frac{c}{b}\right)} \]

5. Applied rewrites 96.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.25 \cdot a, \frac{{c}^{4}}{{b}^{6}} \cdot \frac{20}{b}, \frac{{c}^{3} \cdot -2}{{b}^{5}}\right), a, \frac{\left(-c\right) \cdot c}{{b}^{3}}\right), a, \frac{-c}{b}\right)} \]

6. Taylor expanded in b around 0

   \[\leadsto \mathsf{fma}\left(\frac{-5 \cdot \left({a}^{2} \cdot {c}^{4}\right) + {b}^{2} \cdot \left(-2 \cdot \left(a \cdot {c}^{3}\right) + -1 \cdot \left({b}^{2} \cdot {c}^{2}\right)\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
7. Step-by-step derivation

8. Applied rewrites 96.8%

   \[\leadsto \mathsf{fma}\left(\frac{\mathsf{fma}\left(-5 \cdot {c}^{4}, a \cdot a, \mathsf{fma}\left(\left(-b\right) \cdot b, c \cdot c, \left({c}^{3} \cdot a\right) \cdot -2\right) \cdot \left(b \cdot b\right)\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]

9. Taylor expanded in c around 0

   \[\leadsto \mathsf{fma}\left(\frac{{c}^{2} \cdot \left(-1 \cdot {b}^{4} + c \cdot \left(-5 \cdot \left({a}^{2} \cdot c\right) + -2 \cdot \left(a \cdot {b}^{2}\right)\right)\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
10. Step-by-step derivation

11. Applied rewrites 96.8%

    \[\leadsto \mathsf{fma}\left(\frac{\mathsf{fma}\left(\mathsf{fma}\left(\left(b \cdot b\right) \cdot a, -2, \left(\left(a \cdot a\right) \cdot c\right) \cdot -5\right), c, -{b}^{4}\right) \cdot \left(c \cdot c\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]

12. Taylor expanded in b around 0

    \[\leadsto \mathsf{fma}\left(\frac{\left(-5 \cdot \left({a}^{2} \cdot {c}^{2}\right) + {b}^{2} \cdot \left(-2 \cdot \left(a \cdot c\right) + -1 \cdot {b}^{2}\right)\right) \cdot \left(c \cdot c\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
13. Step-by-step derivation

14. Applied rewrites 96.8%

    \[\leadsto \mathsf{fma}\left(\frac{\mathsf{fma}\left(\left(a \cdot a\right) \cdot -5, c \cdot c, \mathsf{fma}\left(-b, b, \left(c \cdot a\right) \cdot -2\right) \cdot \left(b \cdot b\right)\right) \cdot \left(c \cdot c\right)}{{b}^{7}}, a, \frac{-c}{b}\right) \]
15. Add Preprocessing

Alternative 4: 96.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(\frac{\left(\left(c \cdot c\right) \cdot a\right) \cdot a}{{b}^{4}}, 2, \mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right)\right)}{-b} \cdot c \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  (/
   (fma (/ (* (* (* c c) a) a) (pow b 4.0)) 2.0 (fma a (/ c (* b b)) 1.0))
   (- b))
  c))

C

double code(double a, double b, double c) {
	return (fma(((((c * c) * a) * a) / pow(b, 4.0)), 2.0, fma(a, (c / (b * b)), 1.0)) / -b) * c;
}

Julia

function code(a, b, c)
	return Float64(Float64(fma(Float64(Float64(Float64(Float64(c * c) * a) * a) / (b ^ 4.0)), 2.0, fma(a, Float64(c / Float64(b * b)), 1.0)) / Float64(-b)) * c)
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in c around 0

   \[\leadsto \color{blue}{c \cdot \left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

5. Applied rewrites 95.4%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(c \cdot -2, a \cdot \frac{a}{{b}^{5}}, \frac{-a}{{b}^{3}}\right) \cdot c - \frac{1}{b}\right) \cdot c} \]

6. Taylor expanded in b around -inf

   \[\leadsto \left(-1 \cdot \frac{1 + \left(2 \cdot \frac{{a}^{2} \cdot {c}^{2}}{{b}^{4}} + \frac{a \cdot c}{{b}^{2}}\right)}{b}\right) \cdot c \]
7. Step-by-step derivation

8. Applied rewrites 95.4%

   \[\leadsto \frac{\mathsf{fma}\left(\frac{\left(\left(c \cdot c\right) \cdot a\right) \cdot a}{{b}^{4}}, 2, \mathsf{fma}\left(a, \frac{c}{b \cdot b}, 1\right)\right)}{-b} \cdot c \]
9. Add Preprocessing

Alternative 5: 96.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(-2 \cdot \left(a \cdot a\right), c \cdot c, \left(\mathsf{fma}\left(c, a, b \cdot b\right) \cdot b\right) \cdot \left(-b\right)\right)}{{b}^{5}} \cdot c \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  (/
   (fma (* -2.0 (* a a)) (* c c) (* (* (fma c a (* b b)) b) (- b)))
   (pow b 5.0))
  c))

C

double code(double a, double b, double c) {
	return (fma((-2.0 * (a * a)), (c * c), ((fma(c, a, (b * b)) * b) * -b)) / pow(b, 5.0)) * c;
}

Julia

function code(a, b, c)
	return Float64(Float64(fma(Float64(-2.0 * Float64(a * a)), Float64(c * c), Float64(Float64(fma(c, a, Float64(b * b)) * b) * Float64(-b))) / (b ^ 5.0)) * c)
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in c around 0

   \[\leadsto \color{blue}{c \cdot \left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

5. Applied rewrites 95.4%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(c \cdot -2, a \cdot \frac{a}{{b}^{5}}, \frac{-a}{{b}^{3}}\right) \cdot c - \frac{1}{b}\right) \cdot c} \]

6. Taylor expanded in a around 0

   \[\leadsto \frac{-1}{b} \cdot c \]
7. Step-by-step derivation

8. Applied rewrites 88.6%

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

9. Taylor expanded in b around 0

   \[\leadsto \frac{-2 \cdot \left({a}^{2} \cdot {c}^{2}\right) + {b}^{2} \cdot \left(-1 \cdot \left(a \cdot c\right) + -1 \cdot {b}^{2}\right)}{{b}^{5}} \cdot c \]
10. Step-by-step derivation

11. Applied rewrites 95.0%

    \[\leadsto \frac{\mathsf{fma}\left(-2 \cdot \left(a \cdot a\right), c \cdot c, \left(-\mathsf{fma}\left(b, b, c \cdot a\right)\right) \cdot \left(b \cdot b\right)\right)}{{b}^{5}} \cdot c \]
12. Step-by-step derivation

13. Applied rewrites 95.1%

    \[\leadsto \frac{\mathsf{fma}\left(-2 \cdot \left(a \cdot a\right), c \cdot c, \left(\left(-\mathsf{fma}\left(c, a, b \cdot b\right)\right) \cdot b\right) \cdot b\right)}{{b}^{5}} \cdot c \]

14. Final simplification 95.1%

    \[\leadsto \frac{\mathsf{fma}\left(-2 \cdot \left(a \cdot a\right), c \cdot c, \left(\mathsf{fma}\left(c, a, b \cdot b\right) \cdot b\right) \cdot \left(-b\right)\right)}{{b}^{5}} \cdot c \]
15. Add Preprocessing

Alternative 6: 96.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(-2 \cdot \left(a \cdot a\right), c \cdot c, \left(-\mathsf{fma}\left(b, b, c \cdot a\right)\right) \cdot \left(b \cdot b\right)\right)}{{b}^{5}} \cdot c \end{array} \]

FPCore

(FPCore (a b c)
 :precision binary64
 (*
  (/
   (fma (* -2.0 (* a a)) (* c c) (* (- (fma b b (* c a))) (* b b)))
   (pow b 5.0))
  c))

C

double code(double a, double b, double c) {
	return (fma((-2.0 * (a * a)), (c * c), (-fma(b, b, (c * a)) * (b * b))) / pow(b, 5.0)) * c;
}

Julia

function code(a, b, c)
	return Float64(Float64(fma(Float64(-2.0 * Float64(a * a)), Float64(c * c), Float64(Float64(-fma(b, b, Float64(c * a))) * Float64(b * b))) / (b ^ 5.0)) * c)
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in c around 0

   \[\leadsto \color{blue}{c \cdot \left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

5. Applied rewrites 95.4%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(c \cdot -2, a \cdot \frac{a}{{b}^{5}}, \frac{-a}{{b}^{3}}\right) \cdot c - \frac{1}{b}\right) \cdot c} \]

6. Taylor expanded in a around 0

   \[\leadsto \frac{-1}{b} \cdot c \]
7. Step-by-step derivation

8. Applied rewrites 88.6%

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

9. Taylor expanded in b around 0

   \[\leadsto \frac{-2 \cdot \left({a}^{2} \cdot {c}^{2}\right) + {b}^{2} \cdot \left(-1 \cdot \left(a \cdot c\right) + -1 \cdot {b}^{2}\right)}{{b}^{5}} \cdot c \]
10. Step-by-step derivation

11. Applied rewrites 95.0%

    \[\leadsto \frac{\mathsf{fma}\left(-2 \cdot \left(a \cdot a\right), c \cdot c, \left(-\mathsf{fma}\left(b, b, c \cdot a\right)\right) \cdot \left(b \cdot b\right)\right)}{{b}^{5}} \cdot c \]
12. Add Preprocessing

Alternative 7: 95.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \frac{-\mathsf{fma}\left(\frac{c \cdot c}{b}, \frac{a}{b}, c\right)}{b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ (- (fma (/ (* c c) b) (/ a b) c)) b))

C

double code(double a, double b, double c) {
	return -fma(((c * c) / b), (a / b), c) / b;
}

Julia

function code(a, b, c)
	return Float64(Float64(-fma(Float64(Float64(c * c) / b), Float64(a / b), c)) / b)
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{-1 \cdot \frac{c}{b} + -1 \cdot \frac{a \cdot {c}^{2}}{{b}^{3}}} \]
4. Step-by-step derivation

   1. distribute-lft-out N/A

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

   2. unpow3 N/A

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

   3. unpow2 N/A

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

   4. associate-/r* N/A

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

   5. div-add-rev N/A

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

   6. associate-/l* N/A

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

   7. distribute-lft-out N/A

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

   8. lower-/.f64 N/A

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

5. Applied rewrites 94.2%

   \[\leadsto \color{blue}{\frac{-\mathsf{fma}\left(\frac{c \cdot c}{b}, \frac{a}{b}, c\right)}{b}} \]
6. Add Preprocessing

Alternative 8: 95.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(\frac{a}{b}, \frac{c}{b}, 1\right) \cdot c}{-b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ (* (fma (/ a b) (/ c b) 1.0) c) (- b)))

C

double code(double a, double b, double c) {
	return (fma((a / b), (c / b), 1.0) * c) / -b;
}

Julia

function code(a, b, c)
	return Float64(Float64(fma(Float64(a / b), Float64(c / b), 1.0) * c) / Float64(-b))
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{-1 \cdot \frac{c}{b} + a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{a \cdot \left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right) + -1 \cdot \frac{c}{b}} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{\left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right)\right) \cdot a} + -1 \cdot \frac{c}{b} \]

   3. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(-1 \cdot \frac{{c}^{2}}{{b}^{3}} + a \cdot \left(-2 \cdot \frac{{c}^{3}}{{b}^{5}} + \frac{-1}{4} \cdot \frac{a \cdot \left(4 \cdot \frac{{c}^{4}}{{b}^{6}} + 16 \cdot \frac{{c}^{4}}{{b}^{6}}\right)}{b}\right), a, -1 \cdot \frac{c}{b}\right)} \]

5. Applied rewrites 96.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.25 \cdot a, \frac{{c}^{4}}{{b}^{6}} \cdot \frac{20}{b}, \frac{{c}^{3} \cdot -2}{{b}^{5}}\right), a, \frac{\left(-c\right) \cdot c}{{b}^{3}}\right), a, \frac{-c}{b}\right)} \]

6. Taylor expanded in b around inf

   \[\leadsto \color{blue}{\frac{-1 \cdot c + -1 \cdot \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}} \]
7. Step-by-step derivation

   1. distribute-lft-out N/A

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

   2. associate-*r/ N/A

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

   3. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{b}\right)} \]

   4. distribute-neg-frac2 N/A

      \[\leadsto \color{blue}{\frac{c + \frac{a \cdot {c}^{2}}{{b}^{2}}}{\mathsf{neg}\left(b\right)}} \]

   5. mul-1-neg N/A

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

   6. lower-/.f64 N/A

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

   7. +-commutative N/A

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

   8. unpow2 N/A

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

   9. times-frac N/A

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

   10. lower-fma.f64 N/A

       \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(\frac{a}{b}, \frac{{c}^{2}}{b}, c\right)}}{-1 \cdot b} \]

   11. lower-/.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{\frac{a}{b}}, \frac{{c}^{2}}{b}, c\right)}{-1 \cdot b} \]

   12. lower-/.f64 N/A

       \[\leadsto \frac{\mathsf{fma}\left(\frac{a}{b}, \color{blue}{\frac{{c}^{2}}{b}}, c\right)}{-1 \cdot b} \]

   13. unpow2 N/A

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

   14. lower-*.f64 N/A

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

   15. mul-1-neg N/A

       \[\leadsto \frac{\mathsf{fma}\left(\frac{a}{b}, \frac{c \cdot c}{b}, c\right)}{\color{blue}{\mathsf{neg}\left(b\right)}} \]

   16. lower-neg.f64 94.2

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

8. Applied rewrites 94.2%

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

9. Taylor expanded in c around 0

   \[\leadsto \frac{c \cdot \left(1 + \frac{a \cdot c}{{b}^{2}}\right)}{-\color{blue}{b}} \]
10. Step-by-step derivation

11. Applied rewrites 94.1%

    \[\leadsto \frac{\mathsf{fma}\left(\frac{a}{b}, \frac{c}{b}, 1\right) \cdot c}{-\color{blue}{b}} \]
12. Add Preprocessing

Alternative 9: 94.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \frac{\mathsf{fma}\left(-a, \frac{c}{b \cdot b}, -1\right)}{b} \cdot c \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (* (/ (fma (- a) (/ c (* b b)) -1.0) b) c))

C

double code(double a, double b, double c) {
	return (fma(-a, (c / (b * b)), -1.0) / b) * c;
}

Julia

function code(a, b, c)
	return Float64(Float64(fma(Float64(-a), Float64(c / Float64(b * b)), -1.0) / b) * c)
end

Wolfram

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

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in c around 0

   \[\leadsto \color{blue}{c \cdot \left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(c \cdot \left(-2 \cdot \frac{{a}^{2} \cdot c}{{b}^{5}} + -1 \cdot \frac{a}{{b}^{3}}\right) - \frac{1}{b}\right) \cdot c} \]

5. Applied rewrites 95.4%

   \[\leadsto \color{blue}{\left(\mathsf{fma}\left(c \cdot -2, a \cdot \frac{a}{{b}^{5}}, \frac{-a}{{b}^{3}}\right) \cdot c - \frac{1}{b}\right) \cdot c} \]

6. Taylor expanded in b around -inf

   \[\leadsto \left(-1 \cdot \frac{1 + \frac{a \cdot c}{{b}^{2}}}{b}\right) \cdot c \]
7. Step-by-step derivation

8. Applied rewrites 93.8%

   \[\leadsto \frac{\mathsf{fma}\left(-a, \frac{c}{b \cdot b}, -1\right)}{b} \cdot c \]
9. Add Preprocessing

Alternative 10: 90.5% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \frac{-c}{b} \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 (/ (- c) b))

C

double code(double a, double b, double c) {
	return -c / b;
}

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(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = -c / b
end function

Java

public static double code(double a, double b, double c) {
	return -c / b;
}

Python

def code(a, b, c):
	return -c / b

Julia

function code(a, b, c)
	return Float64(Float64(-c) / b)
end

MATLAB

function tmp = code(a, b, c)
	tmp = -c / b;
end

Wolfram

code[a_, b_, c_] := N[((-c) / b), $MachinePrecision]

Derivation

1. Initial program 19.5%

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

3. Taylor expanded in a around 0

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

   1. associate-*r/ N/A

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

   2. mul-1-neg N/A

      \[\leadsto \frac{\color{blue}{\mathsf{neg}\left(c\right)}}{b} \]

   3. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(c\right)}{b}} \]

   4. lower-neg.f64 88.9

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

5. Applied rewrites 88.9%

   \[\leadsto \color{blue}{\frac{-c}{b}} \]
6. Add Preprocessing

Alternative 11: 3.3% accurate, 50.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (a b c) :precision binary64 0.0)

C

double code(double a, double b, double c) {
	return 0.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(a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = 0.0d0
end function

Java

public static double code(double a, double b, double c) {
	return 0.0;
}

Python

def code(a, b, c):
	return 0.0

Julia

function code(a, b, c)
	return 0.0
end

MATLAB

function tmp = code(a, b, c)
	tmp = 0.0;
end

Wolfram

code[a_, b_, c_] := 0.0

Derivation

1. Initial program 19.5%

   \[\frac{\left(-b\right) + \sqrt{b \cdot b - \left(4 \cdot a\right) \cdot c}}{2 \cdot a} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. fp-cancel-sub-sign-inv N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\color{blue}{b \cdot b + \left(\mathsf{neg}\left(4 \cdot a\right)\right) \cdot c}}}{2 \cdot a} \]

   4. lift-*.f64 N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\color{blue}{b \cdot b} + \left(\mathsf{neg}\left(4 \cdot a\right)\right) \cdot c}}{2 \cdot a} \]

   5. lower-fma.f64 N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\color{blue}{\mathsf{fma}\left(b, b, \left(\mathsf{neg}\left(4 \cdot a\right)\right) \cdot c\right)}}}{2 \cdot a} \]

   6. lower-*.f64 N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(\mathsf{neg}\left(4 \cdot a\right)\right) \cdot c}\right)}}{2 \cdot a} \]

   7. lift-*.f64 N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\mathsf{fma}\left(b, b, \left(\mathsf{neg}\left(\color{blue}{4 \cdot a}\right)\right) \cdot c\right)}}{2 \cdot a} \]

   8. distribute-lft-neg-in N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(\left(\mathsf{neg}\left(4\right)\right) \cdot a\right)} \cdot c\right)}}{2 \cdot a} \]

   9. lower-*.f64 N/A

      \[\leadsto \frac{\left(-b\right) + \sqrt{\mathsf{fma}\left(b, b, \color{blue}{\left(\left(\mathsf{neg}\left(4\right)\right) \cdot a\right)} \cdot c\right)}}{2 \cdot a} \]

   10. metadata-eval 19.5

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

4. Applied rewrites 19.5%

   \[\leadsto \frac{\left(-b\right) + \sqrt{\color{blue}{\mathsf{fma}\left(b, b, \left(-4 \cdot a\right) \cdot c\right)}}}{2 \cdot a} \]
5. Step-by-step derivation

   1. lift-/.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. div-add N/A

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

   4. +-commutative N/A

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. associate-/r* N/A

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

   8. frac-add N/A

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

   9. lower-/.f64 N/A

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

6. Applied rewrites 20.8%

   \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(\frac{\sqrt{\mathsf{fma}\left(-4 \cdot a, c, b \cdot b\right)}}{a}, 2 \cdot a, 2 \cdot \left(-b\right)\right)}{2 \cdot \left(2 \cdot a\right)}} \]

7. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\frac{1}{4} \cdot \frac{-2 \cdot b + 2 \cdot b}{a}} \]
8. Step-by-step derivation

   1. associate-*r/ N/A

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

   2. fp-cancel-sign-sub-inv N/A

      \[\leadsto \frac{\frac{1}{4} \cdot \color{blue}{\left(-2 \cdot b - \left(\mathsf{neg}\left(2\right)\right) \cdot b\right)}}{a} \]

   3. metadata-eval N/A

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

   4. +-inverses N/A

      \[\leadsto \frac{\frac{1}{4} \cdot \color{blue}{0}}{a} \]

   5. metadata-eval N/A

      \[\leadsto \frac{\color{blue}{0}}{a} \]

   6. +-inverses N/A

      \[\leadsto \frac{\color{blue}{-2 \cdot b - -2 \cdot b}}{a} \]

   7. metadata-eval N/A

      \[\leadsto \frac{-2 \cdot b - \color{blue}{\left(\mathsf{neg}\left(2\right)\right)} \cdot b}{a} \]

   8. fp-cancel-sign-sub-inv N/A

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

   9. lower-/.f64 N/A

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

   10. fp-cancel-sign-sub-inv N/A

       \[\leadsto \frac{\color{blue}{-2 \cdot b - \left(\mathsf{neg}\left(2\right)\right) \cdot b}}{a} \]

   11. metadata-eval N/A

       \[\leadsto \frac{-2 \cdot b - \color{blue}{-2} \cdot b}{a} \]

   12. +-inverses 3.3

       \[\leadsto \frac{\color{blue}{0}}{a} \]

9. Applied rewrites 3.3%

   \[\leadsto \color{blue}{\frac{0}{a}} \]

10. Final simplification 3.3%

    \[\leadsto 0 \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024351 
(FPCore (a b c)
  :name "Quadratic roots, wide range"
  :precision binary64
  :pre (and (and (and (< 4.930380657631324e-32 a) (< a 2.028240960365167e+31)) (and (< 4.930380657631324e-32 b) (< b 2.028240960365167e+31))) (and (< 4.930380657631324e-32 c) (< c 2.028240960365167e+31)))
  (/ (+ (- b) (sqrt (- (* b b) (* (* 4.0 a) c)))) (* 2.0 a)))