Trigonometry A

Percentage Accurate: 99.8% → 99.8%

Time: 10.1s

Alternatives: 11

Speedup: 1.0×

Specification

\[0 \leq e \land e \leq 1\]

Math

\[\begin{array}{l} \\ \frac{e \cdot \sin v}{1 + e \cdot \cos v} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))

C

double code(double e, double v) {
	return (e * sin(v)) / (1.0 + (e * cos(v)));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function

Java

public static double code(double e, double v) {
	return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}

Python

def code(e, v):
	return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))

Julia

function code(e, v)
	return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v))))
end

MATLAB

function tmp = code(e, v)
	tmp = (e * sin(v)) / (1.0 + (e * cos(v)));
end

Wolfram

code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e \cdot \sin v}{1 + e \cdot \cos v} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))

C

double code(double e, double v) {
	return (e * sin(v)) / (1.0 + (e * cos(v)));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = (e * sin(v)) / (1.0d0 + (e * cos(v)))
end function

Java

public static double code(double e, double v) {
	return (e * Math.sin(v)) / (1.0 + (e * Math.cos(v)));
}

Python

def code(e, v):
	return (e * math.sin(v)) / (1.0 + (e * math.cos(v)))

Julia

function code(e, v)
	return Float64(Float64(e * sin(v)) / Float64(1.0 + Float64(e * cos(v))))
end

MATLAB

function tmp = code(e, v)
	tmp = (e * sin(v)) / (1.0 + (e * cos(v)));
end

Wolfram

code[e_, v_] := N[(N[(e * N[Sin[v], $MachinePrecision]), $MachinePrecision] / N[(1.0 + N[(e * N[Cos[v], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e \cdot \frac{\sin v}{\mathsf{fma}\left(e, \cos v, 1\right)} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (/ (sin v) (fma e (cos v) 1.0))))

C

double code(double e, double v) {
	return e * (sin(v) / fma(e, cos(v), 1.0));
}

Julia

function code(e, v)
	return Float64(e * Float64(sin(v) / fma(e, cos(v), 1.0)))
end

Wolfram

code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] / N[(e * N[Cos[v], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot \sin v}{1 + e \cdot \cos v}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot \sin v}}{1 + e \cdot \cos v} \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{e \cdot \frac{\sin v}{1 + e \cdot \cos v}} \]

   4. *-commutative N/A

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v} \cdot e} \]

   5. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v} \cdot e} \]

   6. lower-/.f64 99.8

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v}} \cdot e \]

   7. lift-+.f64 N/A

      \[\leadsto \frac{\sin v}{\color{blue}{1 + e \cdot \cos v}} \cdot e \]

   8. +-commutative N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e \cdot \cos v + 1}} \cdot e \]

   9. lift-*.f64 N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e \cdot \cos v} + 1} \cdot e \]

   10. lower-fma.f64 99.8

       \[\leadsto \frac{\sin v}{\color{blue}{\mathsf{fma}\left(e, \cos v, 1\right)}} \cdot e \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{\sin v}{\mathsf{fma}\left(e, \cos v, 1\right)} \cdot e} \]

5. Final simplification 99.8%

   \[\leadsto e \cdot \frac{\sin v}{\mathsf{fma}\left(e, \cos v, 1\right)} \]
6. Add Preprocessing

Alternative 2: 98.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ e \cdot \frac{\sin v}{e + 1} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (/ (sin v) (+ e 1.0))))

C

double code(double e, double v) {
	return e * (sin(v) / (e + 1.0));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * (sin(v) / (e + 1.0d0))
end function

Java

public static double code(double e, double v) {
	return e * (Math.sin(v) / (e + 1.0));
}

Python

def code(e, v):
	return e * (math.sin(v) / (e + 1.0))

Julia

function code(e, v)
	return Float64(e * Float64(sin(v) / Float64(e + 1.0)))
end

MATLAB

function tmp = code(e, v)
	tmp = e * (sin(v) / (e + 1.0));
end

Wolfram

code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot \sin v}{1 + e \cdot \cos v}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot \sin v}}{1 + e \cdot \cos v} \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{e \cdot \frac{\sin v}{1 + e \cdot \cos v}} \]

   4. *-commutative N/A

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v} \cdot e} \]

   5. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v} \cdot e} \]

   6. lower-/.f64 99.8

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v}} \cdot e \]

   7. lift-+.f64 N/A

      \[\leadsto \frac{\sin v}{\color{blue}{1 + e \cdot \cos v}} \cdot e \]

   8. +-commutative N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e \cdot \cos v + 1}} \cdot e \]

   9. lift-*.f64 N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e \cdot \cos v} + 1} \cdot e \]

   10. lower-fma.f64 99.8

       \[\leadsto \frac{\sin v}{\color{blue}{\mathsf{fma}\left(e, \cos v, 1\right)}} \cdot e \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{\sin v}{\mathsf{fma}\left(e, \cos v, 1\right)} \cdot e} \]

5. Taylor expanded in v around 0

   \[\leadsto \frac{\sin v}{\color{blue}{1 + e}} \cdot e \]
6. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e + 1}} \cdot e \]

   2. lower-+.f64 98.5

      \[\leadsto \frac{\sin v}{\color{blue}{e + 1}} \cdot e \]

7. Applied rewrites 98.5%

   \[\leadsto \frac{\sin v}{\color{blue}{e + 1}} \cdot e \]

8. Final simplification 98.5%

   \[\leadsto e \cdot \frac{\sin v}{e + 1} \]
9. Add Preprocessing

Alternative 3: 98.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ e \cdot \left(\sin v \cdot \left(1 - e \cdot 1\right)\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (* (sin v) (- 1.0 (* e 1.0)))))

C

double code(double e, double v) {
	return e * (sin(v) * (1.0 - (e * 1.0)));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * (sin(v) * (1.0d0 - (e * 1.0d0)))
end function

Java

public static double code(double e, double v) {
	return e * (Math.sin(v) * (1.0 - (e * 1.0)));
}

Python

def code(e, v):
	return e * (math.sin(v) * (1.0 - (e * 1.0)))

Julia

function code(e, v)
	return Float64(e * Float64(sin(v) * Float64(1.0 - Float64(e * 1.0))))
end

MATLAB

function tmp = code(e, v)
	tmp = e * (sin(v) * (1.0 - (e * 1.0)));
end

Wolfram

code[e_, v_] := N[(e * N[(N[Sin[v], $MachinePrecision] * N[(1.0 - N[(e * 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \left(\sin v + -1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto e \cdot \color{blue}{\left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right) + \sin v\right)} \]

   2. distribute-lft-in N/A

      \[\leadsto \color{blue}{e \cdot \left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right) + e \cdot \sin v} \]

   3. mul-1-neg N/A

      \[\leadsto e \cdot \color{blue}{\left(\mathsf{neg}\left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} + e \cdot \sin v \]

   4. associate-*r* N/A

      \[\leadsto e \cdot \left(\mathsf{neg}\left(\color{blue}{\left(e \cdot \cos v\right) \cdot \sin v}\right)\right) + e \cdot \sin v \]

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

      \[\leadsto e \cdot \color{blue}{\left(\left(\mathsf{neg}\left(e \cdot \cos v\right)\right) \cdot \sin v\right)} + e \cdot \sin v \]

   6. associate-*r* N/A

      \[\leadsto \color{blue}{\left(e \cdot \left(\mathsf{neg}\left(e \cdot \cos v\right)\right)\right) \cdot \sin v} + e \cdot \sin v \]

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

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(e \cdot \left(e \cdot \cos v\right)\right)\right)} \cdot \sin v + e \cdot \sin v \]

   8. associate-*l* N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(e \cdot e\right) \cdot \cos v}\right)\right) \cdot \sin v + e \cdot \sin v \]

   9. unpow2 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{{e}^{2}} \cdot \cos v\right)\right) \cdot \sin v + e \cdot \sin v \]

   10. distribute-rgt-out N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   11. lower-*.f64 N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   12. lower-sin.f64 N/A

       \[\leadsto \color{blue}{\sin v} \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right) \]

   13. *-commutative N/A

       \[\leadsto \sin v \cdot \left(\left(\mathsf{neg}\left(\color{blue}{\cos v \cdot {e}^{2}}\right)\right) + e\right) \]

   14. distribute-rgt-neg-in N/A

       \[\leadsto \sin v \cdot \left(\color{blue}{\cos v \cdot \left(\mathsf{neg}\left({e}^{2}\right)\right)} + e\right) \]

   15. lower-fma.f64 N/A

       \[\leadsto \sin v \cdot \color{blue}{\mathsf{fma}\left(\cos v, \mathsf{neg}\left({e}^{2}\right), e\right)} \]

5. Applied rewrites 98.3%

   \[\leadsto \color{blue}{\sin v \cdot \mathsf{fma}\left(\cos v, e \cdot \left(-e\right), e\right)} \]
6. Step-by-step derivation

7. Applied rewrites 98.3%

   \[\leadsto \sin v \cdot \left(\mathsf{fma}\left(\cos v, -e, 1\right) \cdot \color{blue}{e}\right) \]

8. Taylor expanded in v around 0

   \[\leadsto \sin v \cdot \left(\mathsf{fma}\left(1, \mathsf{neg}\left(e\right), 1\right) \cdot e\right) \]
9. Step-by-step derivation

10. Applied rewrites 97.9%

    \[\leadsto \sin v \cdot \left(\mathsf{fma}\left(1, -e, 1\right) \cdot e\right) \]
11. Step-by-step derivation

12. Applied rewrites 98.0%

    \[\leadsto \left(\sin v \cdot \left(1 - e \cdot 1\right)\right) \cdot \color{blue}{e} \]

13. Final simplification 98.0%

    \[\leadsto e \cdot \left(\sin v \cdot \left(1 - e \cdot 1\right)\right) \]
14. Add Preprocessing

Alternative 4: 98.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \sin v \cdot \left(e - e \cdot e\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* (sin v) (- e (* e e))))

C

double code(double e, double v) {
	return sin(v) * (e - (e * e));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = sin(v) * (e - (e * e))
end function

Java

public static double code(double e, double v) {
	return Math.sin(v) * (e - (e * e));
}

Python

def code(e, v):
	return math.sin(v) * (e - (e * e))

Julia

function code(e, v)
	return Float64(sin(v) * Float64(e - Float64(e * e)))
end

MATLAB

function tmp = code(e, v)
	tmp = sin(v) * (e - (e * e));
end

Wolfram

code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * N[(e - N[(e * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \left(\sin v + -1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto e \cdot \color{blue}{\left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right) + \sin v\right)} \]

   2. distribute-lft-in N/A

      \[\leadsto \color{blue}{e \cdot \left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right) + e \cdot \sin v} \]

   3. mul-1-neg N/A

      \[\leadsto e \cdot \color{blue}{\left(\mathsf{neg}\left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} + e \cdot \sin v \]

   4. associate-*r* N/A

      \[\leadsto e \cdot \left(\mathsf{neg}\left(\color{blue}{\left(e \cdot \cos v\right) \cdot \sin v}\right)\right) + e \cdot \sin v \]

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

      \[\leadsto e \cdot \color{blue}{\left(\left(\mathsf{neg}\left(e \cdot \cos v\right)\right) \cdot \sin v\right)} + e \cdot \sin v \]

   6. associate-*r* N/A

      \[\leadsto \color{blue}{\left(e \cdot \left(\mathsf{neg}\left(e \cdot \cos v\right)\right)\right) \cdot \sin v} + e \cdot \sin v \]

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

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(e \cdot \left(e \cdot \cos v\right)\right)\right)} \cdot \sin v + e \cdot \sin v \]

   8. associate-*l* N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(e \cdot e\right) \cdot \cos v}\right)\right) \cdot \sin v + e \cdot \sin v \]

   9. unpow2 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{{e}^{2}} \cdot \cos v\right)\right) \cdot \sin v + e \cdot \sin v \]

   10. distribute-rgt-out N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   11. lower-*.f64 N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   12. lower-sin.f64 N/A

       \[\leadsto \color{blue}{\sin v} \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right) \]

   13. *-commutative N/A

       \[\leadsto \sin v \cdot \left(\left(\mathsf{neg}\left(\color{blue}{\cos v \cdot {e}^{2}}\right)\right) + e\right) \]

   14. distribute-rgt-neg-in N/A

       \[\leadsto \sin v \cdot \left(\color{blue}{\cos v \cdot \left(\mathsf{neg}\left({e}^{2}\right)\right)} + e\right) \]

   15. lower-fma.f64 N/A

       \[\leadsto \sin v \cdot \color{blue}{\mathsf{fma}\left(\cos v, \mathsf{neg}\left({e}^{2}\right), e\right)} \]

5. Applied rewrites 98.3%

   \[\leadsto \color{blue}{\sin v \cdot \mathsf{fma}\left(\cos v, e \cdot \left(-e\right), e\right)} \]

6. Taylor expanded in v around 0

   \[\leadsto \sin v \cdot \left(e + \color{blue}{-1 \cdot {e}^{2}}\right) \]
7. Step-by-step derivation

8. Applied rewrites 97.9%

   \[\leadsto \sin v \cdot \left(e - \color{blue}{e \cdot e}\right) \]
9. Add Preprocessing

Alternative 5: 97.7% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \sin v \cdot e \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* (sin v) e))

C

double code(double e, double v) {
	return sin(v) * e;
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = sin(v) * e
end function

Java

public static double code(double e, double v) {
	return Math.sin(v) * e;
}

Python

def code(e, v):
	return math.sin(v) * e

Julia

function code(e, v)
	return Float64(sin(v) * e)
end

MATLAB

function tmp = code(e, v)
	tmp = sin(v) * e;
end

Wolfram

code[e_, v_] := N[(N[Sin[v], $MachinePrecision] * e), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \sin v} \]
4. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{e \cdot \sin v} \]

   2. lower-sin.f64 97.2

      \[\leadsto e \cdot \color{blue}{\sin v} \]

5. Applied rewrites 97.2%

   \[\leadsto \color{blue}{e \cdot \sin v} \]

6. Final simplification 97.2%

   \[\leadsto \sin v \cdot e \]
7. Add Preprocessing

Alternative 6: 51.9% accurate, 4.6× speedup

Math

\[\begin{array}{l} \\ \frac{e}{\frac{\mathsf{fma}\left(v, v \cdot \mathsf{fma}\left(e, -0.5, \mathsf{fma}\left(e, 0.16666666666666666, 0.16666666666666666\right)\right), e + 1\right)}{v}} \end{array} \]

FPCore

(FPCore (e v)
 :precision binary64
 (/
  e
  (/
   (fma
    v
    (* v (fma e -0.5 (fma e 0.16666666666666666 0.16666666666666666)))
    (+ e 1.0))
   v)))

C

double code(double e, double v) {
	return e / (fma(v, (v * fma(e, -0.5, fma(e, 0.16666666666666666, 0.16666666666666666))), (e + 1.0)) / v);
}

Julia

function code(e, v)
	return Float64(e / Float64(fma(v, Float64(v * fma(e, -0.5, fma(e, 0.16666666666666666, 0.16666666666666666))), Float64(e + 1.0)) / v))
end

Wolfram

code[e_, v_] := N[(e / N[(N[(v * N[(v * N[(e * -0.5 + N[(e * 0.16666666666666666 + 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(e + 1.0), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot \sin v}{1 + e \cdot \cos v}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot \sin v}}{1 + e \cdot \cos v} \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{e \cdot \frac{\sin v}{1 + e \cdot \cos v}} \]

   4. clear-num N/A

      \[\leadsto e \cdot \color{blue}{\frac{1}{\frac{1 + e \cdot \cos v}{\sin v}}} \]

   5. un-div-inv N/A

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]

   6. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e}{\frac{1 + e \cdot \cos v}{\sin v}}} \]

   7. lower-/.f64 99.6

      \[\leadsto \frac{e}{\color{blue}{\frac{1 + e \cdot \cos v}{\sin v}}} \]

   8. lift-+.f64 N/A

      \[\leadsto \frac{e}{\frac{\color{blue}{1 + e \cdot \cos v}}{\sin v}} \]

   9. +-commutative N/A

      \[\leadsto \frac{e}{\frac{\color{blue}{e \cdot \cos v + 1}}{\sin v}} \]

   10. lift-*.f64 N/A

       \[\leadsto \frac{e}{\frac{\color{blue}{e \cdot \cos v} + 1}{\sin v}} \]

   11. lower-fma.f64 99.6

       \[\leadsto \frac{e}{\frac{\color{blue}{\mathsf{fma}\left(e, \cos v, 1\right)}}{\sin v}} \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\frac{e}{\frac{\mathsf{fma}\left(e, \cos v, 1\right)}{\sin v}}} \]

5. Taylor expanded in v around 0

   \[\leadsto \frac{e}{\color{blue}{\frac{1 + \left(e + {v}^{2} \cdot \left(\frac{-1}{2} \cdot e - \frac{-1}{6} \cdot \left(1 + e\right)\right)\right)}{v}}} \]
6. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{e}{\color{blue}{\frac{1 + \left(e + {v}^{2} \cdot \left(\frac{-1}{2} \cdot e - \frac{-1}{6} \cdot \left(1 + e\right)\right)\right)}{v}}} \]

7. Applied rewrites 53.2%

   \[\leadsto \frac{e}{\color{blue}{\frac{\mathsf{fma}\left(v, v \cdot \mathsf{fma}\left(e, -0.5, \mathsf{fma}\left(e, 0.16666666666666666, 0.16666666666666666\right)\right), e + 1\right)}{v}}} \]
8. Add Preprocessing

Alternative 7: 50.9% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ e \cdot \frac{v}{e + 1} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (/ v (+ e 1.0))))

C

double code(double e, double v) {
	return e * (v / (e + 1.0));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * (v / (e + 1.0d0))
end function

Java

public static double code(double e, double v) {
	return e * (v / (e + 1.0));
}

Python

def code(e, v):
	return e * (v / (e + 1.0))

Julia

function code(e, v)
	return Float64(e * Float64(v / Float64(e + 1.0)))
end

MATLAB

function tmp = code(e, v)
	tmp = e * (v / (e + 1.0));
end

Wolfram

code[e_, v_] := N[(e * N[(v / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{e \cdot \sin v}{1 + e \cdot \cos v}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{e \cdot \sin v}}{1 + e \cdot \cos v} \]

   3. associate-/l* N/A

      \[\leadsto \color{blue}{e \cdot \frac{\sin v}{1 + e \cdot \cos v}} \]

   4. *-commutative N/A

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v} \cdot e} \]

   5. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v} \cdot e} \]

   6. lower-/.f64 99.8

      \[\leadsto \color{blue}{\frac{\sin v}{1 + e \cdot \cos v}} \cdot e \]

   7. lift-+.f64 N/A

      \[\leadsto \frac{\sin v}{\color{blue}{1 + e \cdot \cos v}} \cdot e \]

   8. +-commutative N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e \cdot \cos v + 1}} \cdot e \]

   9. lift-*.f64 N/A

      \[\leadsto \frac{\sin v}{\color{blue}{e \cdot \cos v} + 1} \cdot e \]

   10. lower-fma.f64 99.8

       \[\leadsto \frac{\sin v}{\color{blue}{\mathsf{fma}\left(e, \cos v, 1\right)}} \cdot e \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{\sin v}{\mathsf{fma}\left(e, \cos v, 1\right)} \cdot e} \]

5. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{v}{1 + e}} \cdot e \]
6. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{v}{1 + e}} \cdot e \]

   2. +-commutative N/A

      \[\leadsto \frac{v}{\color{blue}{e + 1}} \cdot e \]

   3. lower-+.f64 51.8

      \[\leadsto \frac{v}{\color{blue}{e + 1}} \cdot e \]

7. Applied rewrites 51.8%

   \[\leadsto \color{blue}{\frac{v}{e + 1}} \cdot e \]

8. Final simplification 51.8%

   \[\leadsto e \cdot \frac{v}{e + 1} \]
9. Add Preprocessing

Alternative 8: 50.9% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ v \cdot \frac{e}{e + 1} \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* v (/ e (+ e 1.0))))

C

double code(double e, double v) {
	return v * (e / (e + 1.0));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = v * (e / (e + 1.0d0))
end function

Java

public static double code(double e, double v) {
	return v * (e / (e + 1.0));
}

Python

def code(e, v):
	return v * (e / (e + 1.0))

Julia

function code(e, v)
	return Float64(v * Float64(e / Float64(e + 1.0)))
end

MATLAB

function tmp = code(e, v)
	tmp = v * (e / (e + 1.0));
end

Wolfram

code[e_, v_] := N[(v * N[(e / N[(e + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \frac{\color{blue}{v \cdot e}}{1 + e} \]

   2. associate-*r/ N/A

      \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

   3. lower-*.f64 N/A

      \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

   4. lower-/.f64 N/A

      \[\leadsto v \cdot \color{blue}{\frac{e}{1 + e}} \]

   5. lower-+.f64 51.8

      \[\leadsto v \cdot \frac{e}{\color{blue}{1 + e}} \]

5. Applied rewrites 51.8%

   \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

6. Final simplification 51.8%

   \[\leadsto v \cdot \frac{e}{e + 1} \]
7. Add Preprocessing

Alternative 9: 50.4% accurate, 11.3× speedup

Math

\[\begin{array}{l} \\ e \cdot \mathsf{fma}\left(e, v \cdot e - v, v\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (fma e (- (* v e) v) v)))

C

double code(double e, double v) {
	return e * fma(e, ((v * e) - v), v);
}

Julia

function code(e, v)
	return Float64(e * fma(e, Float64(Float64(v * e) - v), v))
end

Wolfram

code[e_, v_] := N[(e * N[(e * N[(N[(v * e), $MachinePrecision] - v), $MachinePrecision] + v), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \frac{\color{blue}{v \cdot e}}{1 + e} \]

   2. associate-*r/ N/A

      \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

   3. lower-*.f64 N/A

      \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

   4. lower-/.f64 N/A

      \[\leadsto v \cdot \color{blue}{\frac{e}{1 + e}} \]

   5. lower-+.f64 51.8

      \[\leadsto v \cdot \frac{e}{\color{blue}{1 + e}} \]

5. Applied rewrites 51.8%

   \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

6. Taylor expanded in e around 0

   \[\leadsto e \cdot \color{blue}{\left(v + e \cdot \left(e \cdot v - v\right)\right)} \]
7. Step-by-step derivation

8. Applied rewrites 51.6%

   \[\leadsto e \cdot \color{blue}{\mathsf{fma}\left(e, e \cdot v - v, v\right)} \]

9. Final simplification 51.6%

   \[\leadsto e \cdot \mathsf{fma}\left(e, v \cdot e - v, v\right) \]
10. Add Preprocessing

Alternative 10: 50.3% accurate, 16.1× speedup

Math

\[\begin{array}{l} \\ e \cdot \left(v - v \cdot e\right) \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* e (- v (* v e))))

C

double code(double e, double v) {
	return e * (v - (v * e));
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = e * (v - (v * e))
end function

Java

public static double code(double e, double v) {
	return e * (v - (v * e));
}

Python

def code(e, v):
	return e * (v - (v * e))

Julia

function code(e, v)
	return Float64(e * Float64(v - Float64(v * e)))
end

MATLAB

function tmp = code(e, v)
	tmp = e * (v - (v * e));
end

Wolfram

code[e_, v_] := N[(e * N[(v - N[(v * e), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in e around 0

   \[\leadsto \color{blue}{e \cdot \left(\sin v + -1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto e \cdot \color{blue}{\left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right) + \sin v\right)} \]

   2. distribute-lft-in N/A

      \[\leadsto \color{blue}{e \cdot \left(-1 \cdot \left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right) + e \cdot \sin v} \]

   3. mul-1-neg N/A

      \[\leadsto e \cdot \color{blue}{\left(\mathsf{neg}\left(e \cdot \left(\cos v \cdot \sin v\right)\right)\right)} + e \cdot \sin v \]

   4. associate-*r* N/A

      \[\leadsto e \cdot \left(\mathsf{neg}\left(\color{blue}{\left(e \cdot \cos v\right) \cdot \sin v}\right)\right) + e \cdot \sin v \]

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

      \[\leadsto e \cdot \color{blue}{\left(\left(\mathsf{neg}\left(e \cdot \cos v\right)\right) \cdot \sin v\right)} + e \cdot \sin v \]

   6. associate-*r* N/A

      \[\leadsto \color{blue}{\left(e \cdot \left(\mathsf{neg}\left(e \cdot \cos v\right)\right)\right) \cdot \sin v} + e \cdot \sin v \]

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

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(e \cdot \left(e \cdot \cos v\right)\right)\right)} \cdot \sin v + e \cdot \sin v \]

   8. associate-*l* N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\left(e \cdot e\right) \cdot \cos v}\right)\right) \cdot \sin v + e \cdot \sin v \]

   9. unpow2 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{{e}^{2}} \cdot \cos v\right)\right) \cdot \sin v + e \cdot \sin v \]

   10. distribute-rgt-out N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   11. lower-*.f64 N/A

       \[\leadsto \color{blue}{\sin v \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right)} \]

   12. lower-sin.f64 N/A

       \[\leadsto \color{blue}{\sin v} \cdot \left(\left(\mathsf{neg}\left({e}^{2} \cdot \cos v\right)\right) + e\right) \]

   13. *-commutative N/A

       \[\leadsto \sin v \cdot \left(\left(\mathsf{neg}\left(\color{blue}{\cos v \cdot {e}^{2}}\right)\right) + e\right) \]

   14. distribute-rgt-neg-in N/A

       \[\leadsto \sin v \cdot \left(\color{blue}{\cos v \cdot \left(\mathsf{neg}\left({e}^{2}\right)\right)} + e\right) \]

   15. lower-fma.f64 N/A

       \[\leadsto \sin v \cdot \color{blue}{\mathsf{fma}\left(\cos v, \mathsf{neg}\left({e}^{2}\right), e\right)} \]

5. Applied rewrites 98.3%

   \[\leadsto \color{blue}{\sin v \cdot \mathsf{fma}\left(\cos v, e \cdot \left(-e\right), e\right)} \]
6. Step-by-step derivation

7. Applied rewrites 98.3%

   \[\leadsto \sin v \cdot \left(\mathsf{fma}\left(\cos v, -e, 1\right) \cdot \color{blue}{e}\right) \]

8. Taylor expanded in v around 0

   \[\leadsto e \cdot \color{blue}{\left(v \cdot \left(1 + -1 \cdot e\right)\right)} \]
9. Step-by-step derivation

10. Applied rewrites 51.3%

    \[\leadsto e \cdot \color{blue}{\left(v - e \cdot v\right)} \]

11. Final simplification 51.3%

    \[\leadsto e \cdot \left(v - v \cdot e\right) \]
12. Add Preprocessing

Alternative 11: 49.7% accurate, 37.5× speedup

Math

\[\begin{array}{l} \\ v \cdot e \end{array} \]

FPCore

(FPCore (e v) :precision binary64 (* v e))

C

double code(double e, double v) {
	return v * e;
}

Fortran

real(8) function code(e, v)
    real(8), intent (in) :: e
    real(8), intent (in) :: v
    code = v * e
end function

Java

public static double code(double e, double v) {
	return v * e;
}

Python

def code(e, v):
	return v * e

Julia

function code(e, v)
	return Float64(v * e)
end

MATLAB

function tmp = code(e, v)
	tmp = v * e;
end

Wolfram

code[e_, v_] := N[(v * e), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\frac{e \cdot \sin v}{1 + e \cdot \cos v} \]
2. Add Preprocessing

3. Taylor expanded in v around 0

   \[\leadsto \color{blue}{\frac{e \cdot v}{1 + e}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \frac{\color{blue}{v \cdot e}}{1 + e} \]

   2. associate-*r/ N/A

      \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

   3. lower-*.f64 N/A

      \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

   4. lower-/.f64 N/A

      \[\leadsto v \cdot \color{blue}{\frac{e}{1 + e}} \]

   5. lower-+.f64 51.8

      \[\leadsto v \cdot \frac{e}{\color{blue}{1 + e}} \]

5. Applied rewrites 51.8%

   \[\leadsto \color{blue}{v \cdot \frac{e}{1 + e}} \]

6. Taylor expanded in e around 0

   \[\leadsto e \cdot \color{blue}{v} \]
7. Step-by-step derivation

8. Applied rewrites 50.6%

   \[\leadsto e \cdot \color{blue}{v} \]

9. Final simplification 50.6%

   \[\leadsto v \cdot e \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024238 
(FPCore (e v)
  :name "Trigonometry A"
  :precision binary64
  :pre (and (<= 0.0 e) (<= e 1.0))
  (/ (* e (sin v)) (+ 1.0 (* e (cos v)))))