ab-angle->ABCF D

Percentage Accurate: 82.2% → 99.7%

Time: 3.7s

Alternatives: 5

Speedup: 1.0×

• 28.2% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ -\left(\left(a \cdot a\right) \cdot b\right) \cdot b \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (- (* (* (* a a) b) b)))

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = -(((a * a) * b) * b)
end function

Java

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

Python

def code(a, b):
	return -(((a * a) * b) * b)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 82.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ -\left(\left(a \cdot a\right) \cdot b\right) \cdot b \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (- (* (* (* a a) b) b)))

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = -(((a * a) * b) * b)
end function

Java

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

Python

def code(a, b):
	return -(((a * a) * b) * b)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ [a, b_m] = \mathsf{sort}([a, b_m])\\ \\ \left(b\_m \cdot a\right) \cdot \frac{a}{\frac{-1}{b\_m}} \end{array} \]

FPCore

b_m = (fabs.f64 b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
(FPCore (a b_m) :precision binary64 (* (* b_m a) (/ a (/ -1.0 b_m))))

C

b_m = fabs(b);
assert(a < b_m);
double code(double a, double b_m) {
	return (b_m * a) * (a / (-1.0 / b_m));
}

Fortran

b_m = abs(b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
real(8) function code(a, b_m)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    code = (b_m * a) * (a / ((-1.0d0) / b_m))
end function

Java

b_m = Math.abs(b);
assert a < b_m;
public static double code(double a, double b_m) {
	return (b_m * a) * (a / (-1.0 / b_m));
}

Python

b_m = math.fabs(b)
[a, b_m] = sort([a, b_m])
def code(a, b_m):
	return (b_m * a) * (a / (-1.0 / b_m))

Julia

b_m = abs(b)
a, b_m = sort([a, b_m])
function code(a, b_m)
	return Float64(Float64(b_m * a) * Float64(a / Float64(-1.0 / b_m)))
end

MATLAB

b_m = abs(b);
a, b_m = num2cell(sort([a, b_m])){:}
function tmp = code(a, b_m)
	tmp = (b_m * a) * (a / (-1.0 / b_m));
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
NOTE: a and b_m should be sorted in increasing order before calling this function.
code[a_, b$95$m_] := N[(N[(b$95$m * a), $MachinePrecision] * N[(a / N[(-1.0 / b$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 83.6%

   \[-\left(\left(a \cdot a\right) \cdot b\right) \cdot b \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-neg.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. associate-*l* N/A

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

   5. lift-*.f64 N/A

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

   6. unswap-sqr N/A

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

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

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

   8. lower-*.f64 N/A

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

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

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

   10. lower-*.f64 N/A

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

   11. lower-neg.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 99.6

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

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\left(\left(-a\right) \cdot b\right) \cdot \left(b \cdot a\right)} \]
5. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-neg.f64 N/A

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

   3. neg-mul-1 N/A

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

   4. remove-double-div N/A

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

   5. unpow-1 N/A

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

   6. div-inv N/A

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

   7. remove-double-div N/A

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

   8. unpow-1 N/A

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

   9. div-inv N/A

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

   10. div-inv N/A

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

   11. unpow-1 N/A

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

   12. remove-double-div N/A

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

   13. neg-mul-1 N/A

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

   14. distribute-neg-frac N/A

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

   15. distribute-neg-frac2 N/A

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

   16. lower-/.f64 N/A

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

   17. unpow-1 N/A

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

   18. metadata-eval N/A

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

   19. distribute-neg-frac N/A

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

   20. metadata-eval N/A

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

   21. metadata-eval N/A

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

   22. lower-/.f64 99.7

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

6. Applied rewrites 99.7%

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

7. Final simplification 99.7%

   \[\leadsto \left(b \cdot a\right) \cdot \frac{a}{\frac{-1}{b}} \]
8. Add Preprocessing

Alternative 2: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ [a, b_m] = \mathsf{sort}([a, b_m])\\ \\ \left(\left(-a\right) \cdot b\_m\right) \cdot \left(b\_m \cdot a\right) \end{array} \]

FPCore

b_m = (fabs.f64 b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
(FPCore (a b_m) :precision binary64 (* (* (- a) b_m) (* b_m a)))

C

b_m = fabs(b);
assert(a < b_m);
double code(double a, double b_m) {
	return (-a * b_m) * (b_m * a);
}

Fortran

b_m = abs(b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
real(8) function code(a, b_m)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    code = (-a * b_m) * (b_m * a)
end function

Java

b_m = Math.abs(b);
assert a < b_m;
public static double code(double a, double b_m) {
	return (-a * b_m) * (b_m * a);
}

Python

b_m = math.fabs(b)
[a, b_m] = sort([a, b_m])
def code(a, b_m):
	return (-a * b_m) * (b_m * a)

Julia

b_m = abs(b)
a, b_m = sort([a, b_m])
function code(a, b_m)
	return Float64(Float64(Float64(-a) * b_m) * Float64(b_m * a))
end

MATLAB

b_m = abs(b);
a, b_m = num2cell(sort([a, b_m])){:}
function tmp = code(a, b_m)
	tmp = (-a * b_m) * (b_m * a);
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
NOTE: a and b_m should be sorted in increasing order before calling this function.
code[a_, b$95$m_] := N[(N[((-a) * b$95$m), $MachinePrecision] * N[(b$95$m * a), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 83.6%

   \[-\left(\left(a \cdot a\right) \cdot b\right) \cdot b \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-neg.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-*.f64 N/A

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

   4. associate-*l* N/A

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

   5. lift-*.f64 N/A

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

   6. unswap-sqr N/A

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

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

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

   8. lower-*.f64 N/A

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

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

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

   10. lower-*.f64 N/A

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

   11. lower-neg.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 99.6

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

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\left(\left(-a\right) \cdot b\right) \cdot \left(b \cdot a\right)} \]
5. Add Preprocessing

Alternative 3: 82.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ [a, b_m] = \mathsf{sort}([a, b_m])\\ \\ \left(-b\_m\right) \cdot \left(\left(a \cdot a\right) \cdot b\_m\right) \end{array} \]

FPCore

b_m = (fabs.f64 b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
(FPCore (a b_m) :precision binary64 (* (- b_m) (* (* a a) b_m)))

C

b_m = fabs(b);
assert(a < b_m);
double code(double a, double b_m) {
	return -b_m * ((a * a) * b_m);
}

Fortran

b_m = abs(b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
real(8) function code(a, b_m)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    code = -b_m * ((a * a) * b_m)
end function

Java

b_m = Math.abs(b);
assert a < b_m;
public static double code(double a, double b_m) {
	return -b_m * ((a * a) * b_m);
}

Python

b_m = math.fabs(b)
[a, b_m] = sort([a, b_m])
def code(a, b_m):
	return -b_m * ((a * a) * b_m)

Julia

b_m = abs(b)
a, b_m = sort([a, b_m])
function code(a, b_m)
	return Float64(Float64(-b_m) * Float64(Float64(a * a) * b_m))
end

MATLAB

b_m = abs(b);
a, b_m = num2cell(sort([a, b_m])){:}
function tmp = code(a, b_m)
	tmp = -b_m * ((a * a) * b_m);
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
NOTE: a and b_m should be sorted in increasing order before calling this function.
code[a_, b$95$m_] := N[((-b$95$m) * N[(N[(a * a), $MachinePrecision] * b$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 83.6%

   \[-\left(\left(a \cdot a\right) \cdot b\right) \cdot b \]
2. Add Preprocessing

3. Final simplification 83.6%

   \[\leadsto \left(-b\right) \cdot \left(\left(a \cdot a\right) \cdot b\right) \]
4. Add Preprocessing

Alternative 4: 28.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ [a, b_m] = \mathsf{sort}([a, b_m])\\ \\ \left(\left(a \cdot a\right) \cdot b\_m\right) \cdot b\_m \end{array} \]

FPCore

b_m = (fabs.f64 b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
(FPCore (a b_m) :precision binary64 (* (* (* a a) b_m) b_m))

C

b_m = fabs(b);
assert(a < b_m);
double code(double a, double b_m) {
	return ((a * a) * b_m) * b_m;
}

Fortran

b_m = abs(b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
real(8) function code(a, b_m)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    code = ((a * a) * b_m) * b_m
end function

Java

b_m = Math.abs(b);
assert a < b_m;
public static double code(double a, double b_m) {
	return ((a * a) * b_m) * b_m;
}

Python

b_m = math.fabs(b)
[a, b_m] = sort([a, b_m])
def code(a, b_m):
	return ((a * a) * b_m) * b_m

Julia

b_m = abs(b)
a, b_m = sort([a, b_m])
function code(a, b_m)
	return Float64(Float64(Float64(a * a) * b_m) * b_m)
end

MATLAB

b_m = abs(b);
a, b_m = num2cell(sort([a, b_m])){:}
function tmp = code(a, b_m)
	tmp = ((a * a) * b_m) * b_m;
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
NOTE: a and b_m should be sorted in increasing order before calling this function.
code[a_, b$95$m_] := N[(N[(N[(a * a), $MachinePrecision] * b$95$m), $MachinePrecision] * b$95$m), $MachinePrecision]

Derivation

1. Initial program 83.6%

   \[-\left(\left(a \cdot a\right) \cdot b\right) \cdot b \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-neg.f64 N/A

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

   2. +-lft-identity N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{\left(0 + \left(\left(a \cdot a\right) \cdot b\right) \cdot b\right)}\right) \]

   3. flip3-+ N/A

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

   4. distribute-neg-frac N/A

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

4. Applied rewrites 27.7%

   \[\leadsto \color{blue}{\left(b \cdot \left(a \cdot a\right)\right) \cdot b} \]

5. Final simplification 27.7%

   \[\leadsto \left(\left(a \cdot a\right) \cdot b\right) \cdot b \]
6. Add Preprocessing

Alternative 5: 28.7% accurate, 1.1× speedup

Math

\[\begin{array}{l} b_m = \left|b\right| \\ [a, b_m] = \mathsf{sort}([a, b_m])\\ \\ \left(b\_m \cdot a\right) \cdot \left(b\_m \cdot a\right) \end{array} \]

FPCore

b_m = (fabs.f64 b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
(FPCore (a b_m) :precision binary64 (* (* b_m a) (* b_m a)))

C

b_m = fabs(b);
assert(a < b_m);
double code(double a, double b_m) {
	return (b_m * a) * (b_m * a);
}

Fortran

b_m = abs(b)
NOTE: a and b_m should be sorted in increasing order before calling this function.
real(8) function code(a, b_m)
    real(8), intent (in) :: a
    real(8), intent (in) :: b_m
    code = (b_m * a) * (b_m * a)
end function

Java

b_m = Math.abs(b);
assert a < b_m;
public static double code(double a, double b_m) {
	return (b_m * a) * (b_m * a);
}

Python

b_m = math.fabs(b)
[a, b_m] = sort([a, b_m])
def code(a, b_m):
	return (b_m * a) * (b_m * a)

Julia

b_m = abs(b)
a, b_m = sort([a, b_m])
function code(a, b_m)
	return Float64(Float64(b_m * a) * Float64(b_m * a))
end

MATLAB

b_m = abs(b);
a, b_m = num2cell(sort([a, b_m])){:}
function tmp = code(a, b_m)
	tmp = (b_m * a) * (b_m * a);
end

Wolfram

b_m = N[Abs[b], $MachinePrecision]
NOTE: a and b_m should be sorted in increasing order before calling this function.
code[a_, b$95$m_] := N[(N[(b$95$m * a), $MachinePrecision] * N[(b$95$m * a), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 83.6%

   \[-\left(\left(a \cdot a\right) \cdot b\right) \cdot b \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-neg.f64 N/A

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

   2. +-lft-identity N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{\left(0 + \left(\left(a \cdot a\right) \cdot b\right) \cdot b\right)}\right) \]

   3. flip3-+ N/A

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

   4. distribute-neg-frac N/A

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

4. Applied rewrites 27.6%

   \[\leadsto \color{blue}{\left(b \cdot a\right) \cdot \left(b \cdot a\right)} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024331 
(FPCore (a b)
  :name "ab-angle->ABCF D"
  :precision binary64
  (- (* (* (* a a) b) b)))