Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, E

Percentage Accurate: 99.7% → 99.8%

Time: 5.2s

Alternatives: 5

Speedup: 1.3×

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

Specification

Math

\[\begin{array}{l} \\ \left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (* 3.0 (- 2.0 (* x 3.0))) x))

C

double code(double x) {
	return (3.0 * (2.0 - (x * 3.0))) * x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (3.0d0 * (2.0d0 - (x * 3.0d0))) * x
end function

Java

public static double code(double x) {
	return (3.0 * (2.0 - (x * 3.0))) * x;
}

Python

def code(x):
	return (3.0 * (2.0 - (x * 3.0))) * x

Julia

function code(x)
	return Float64(Float64(3.0 * Float64(2.0 - Float64(x * 3.0))) * x)
end

MATLAB

function tmp = code(x)
	tmp = (3.0 * (2.0 - (x * 3.0))) * x;
end

Wolfram

code[x_] := N[(N[(3.0 * N[(2.0 - N[(x * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]

Initial Program: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (* 3.0 (- 2.0 (* x 3.0))) x))

C

double code(double x) {
	return (3.0 * (2.0 - (x * 3.0))) * x;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (3.0d0 * (2.0d0 - (x * 3.0d0))) * x
end function

Java

public static double code(double x) {
	return (3.0 * (2.0 - (x * 3.0))) * x;
}

Python

def code(x):
	return (3.0 * (2.0 - (x * 3.0))) * x

Julia

function code(x)
	return Float64(Float64(3.0 * Float64(2.0 - Float64(x * 3.0))) * x)
end

MATLAB

function tmp = code(x)
	tmp = (3.0 * (2.0 - (x * 3.0))) * x;
end

Wolfram

code[x_] := N[(N[(3.0 * N[(2.0 - N[(x * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, 6, x \cdot \left(x \cdot -9\right)\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma x 6.0 (* x (* x -9.0))))

C

double code(double x) {
	return fma(x, 6.0, (x * (x * -9.0)));
}

Julia

function code(x)
	return fma(x, 6.0, Float64(x * Float64(x * -9.0)))
end

Wolfram

code[x_] := N[(x * 6.0 + N[(x * N[(x * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \]
2. Step-by-step derivation

   1. *-commutative 99.7%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot \left(2 - x \cdot 3\right)\right)} \]

   2. sub-neg 99.7%

      \[\leadsto x \cdot \left(3 \cdot \color{blue}{\left(2 + \left(-x \cdot 3\right)\right)}\right) \]

   3. distribute-rgt-in 99.7%

      \[\leadsto x \cdot \color{blue}{\left(2 \cdot 3 + \left(-x \cdot 3\right) \cdot 3\right)} \]

   4. metadata-eval 99.7%

      \[\leadsto x \cdot \left(\color{blue}{6} + \left(-x \cdot 3\right) \cdot 3\right) \]

   5. distribute-rgt-neg-in 99.7%

      \[\leadsto x \cdot \left(6 + \color{blue}{\left(x \cdot \left(-3\right)\right)} \cdot 3\right) \]

   6. associate-*l* 99.8%

      \[\leadsto x \cdot \left(6 + \color{blue}{x \cdot \left(\left(-3\right) \cdot 3\right)}\right) \]

   7. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \left(\color{blue}{-3} \cdot 3\right)\right) \]

   8. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \color{blue}{-9}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(6 + x \cdot -9\right)} \]
4. Step-by-step derivation

   1. distribute-lft-in 99.8%

      \[\leadsto \color{blue}{x \cdot 6 + x \cdot \left(x \cdot -9\right)} \]

   2. fma-def 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, 6, x \cdot \left(x \cdot -9\right)\right)} \]

5. Applied egg-rr 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, 6, x \cdot \left(x \cdot -9\right)\right)} \]

6. Final simplification 99.8%

   \[\leadsto \mathsf{fma}\left(x, 6, x \cdot \left(x \cdot -9\right)\right) \]

Alternative 2: 97.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.66 \lor \neg \left(x \leq 0.65\right):\\ \;\;\;\;-9 \cdot \left(x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 6\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -0.66) (not (<= x 0.65))) (* -9.0 (* x x)) (* x 6.0)))

C

double code(double x) {
	double tmp;
	if ((x <= -0.66) || !(x <= 0.65)) {
		tmp = -9.0 * (x * x);
	} else {
		tmp = x * 6.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-0.66d0)) .or. (.not. (x <= 0.65d0))) then
        tmp = (-9.0d0) * (x * x)
    else
        tmp = x * 6.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -0.66) || !(x <= 0.65)) {
		tmp = -9.0 * (x * x);
	} else {
		tmp = x * 6.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -0.66) or not (x <= 0.65):
		tmp = -9.0 * (x * x)
	else:
		tmp = x * 6.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -0.66) || !(x <= 0.65))
		tmp = Float64(-9.0 * Float64(x * x));
	else
		tmp = Float64(x * 6.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -0.66) || ~((x <= 0.65)))
		tmp = -9.0 * (x * x);
	else
		tmp = x * 6.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -0.66], N[Not[LessEqual[x, 0.65]], $MachinePrecision]], N[(-9.0 * N[(x * x), $MachinePrecision]), $MachinePrecision], N[(x * 6.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -0.660000000000000031 or 0.650000000000000022 < x

   1. Initial program 99.6%

      \[\left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \]
   2. Step-by-step derivation

      1. associate-*l* 99.7%

         \[\leadsto \color{blue}{3 \cdot \left(\left(2 - x \cdot 3\right) \cdot x\right)} \]

      2. *-commutative 99.7%

         \[\leadsto 3 \cdot \left(\left(2 - \color{blue}{3 \cdot x}\right) \cdot x\right) \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{3 \cdot \left(\left(2 - 3 \cdot x\right) \cdot x\right)} \]

   4. Taylor expanded in x around inf 98.8%

      \[\leadsto \color{blue}{-9 \cdot {x}^{2}} \]
   5. Step-by-step derivation

      1. unpow2 98.8%

         \[\leadsto -9 \cdot \color{blue}{\left(x \cdot x\right)} \]

   6. Simplified 98.8%

      \[\leadsto \color{blue}{-9 \cdot \left(x \cdot x\right)} \]

   if -0.660000000000000031 < x < 0.650000000000000022

   1. Initial program 99.8%

      \[\left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \]
   2. Step-by-step derivation

      1. *-commutative 99.8%

         \[\leadsto \color{blue}{x \cdot \left(3 \cdot \left(2 - x \cdot 3\right)\right)} \]

      2. sub-neg 99.8%

         \[\leadsto x \cdot \left(3 \cdot \color{blue}{\left(2 + \left(-x \cdot 3\right)\right)}\right) \]

      3. distribute-rgt-in 99.8%

         \[\leadsto x \cdot \color{blue}{\left(2 \cdot 3 + \left(-x \cdot 3\right) \cdot 3\right)} \]

      4. metadata-eval 99.8%

         \[\leadsto x \cdot \left(\color{blue}{6} + \left(-x \cdot 3\right) \cdot 3\right) \]

      5. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(6 + \color{blue}{\left(x \cdot \left(-3\right)\right)} \cdot 3\right) \]

      6. associate-*l* 99.8%

         \[\leadsto x \cdot \left(6 + \color{blue}{x \cdot \left(\left(-3\right) \cdot 3\right)}\right) \]

      7. metadata-eval 99.8%

         \[\leadsto x \cdot \left(6 + x \cdot \left(\color{blue}{-3} \cdot 3\right)\right) \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \left(6 + x \cdot \color{blue}{-9}\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \left(6 + x \cdot -9\right)} \]

   4. Taylor expanded in x around 0 97.0%

      \[\leadsto x \cdot \color{blue}{6} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.66 \lor \neg \left(x \leq 0.65\right):\\ \;\;\;\;-9 \cdot \left(x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 6\\ \end{array} \]

Alternative 3: 99.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(6 + x \cdot -9\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* x (+ 6.0 (* x -9.0))))

C

double code(double x) {
	return x * (6.0 + (x * -9.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (6.0d0 + (x * (-9.0d0)))
end function

Java

public static double code(double x) {
	return x * (6.0 + (x * -9.0));
}

Python

def code(x):
	return x * (6.0 + (x * -9.0))

Julia

function code(x)
	return Float64(x * Float64(6.0 + Float64(x * -9.0)))
end

MATLAB

function tmp = code(x)
	tmp = x * (6.0 + (x * -9.0));
end

Wolfram

code[x_] := N[(x * N[(6.0 + N[(x * -9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \]
2. Step-by-step derivation

   1. *-commutative 99.7%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot \left(2 - x \cdot 3\right)\right)} \]

   2. sub-neg 99.7%

      \[\leadsto x \cdot \left(3 \cdot \color{blue}{\left(2 + \left(-x \cdot 3\right)\right)}\right) \]

   3. distribute-rgt-in 99.7%

      \[\leadsto x \cdot \color{blue}{\left(2 \cdot 3 + \left(-x \cdot 3\right) \cdot 3\right)} \]

   4. metadata-eval 99.7%

      \[\leadsto x \cdot \left(\color{blue}{6} + \left(-x \cdot 3\right) \cdot 3\right) \]

   5. distribute-rgt-neg-in 99.7%

      \[\leadsto x \cdot \left(6 + \color{blue}{\left(x \cdot \left(-3\right)\right)} \cdot 3\right) \]

   6. associate-*l* 99.8%

      \[\leadsto x \cdot \left(6 + \color{blue}{x \cdot \left(\left(-3\right) \cdot 3\right)}\right) \]

   7. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \left(\color{blue}{-3} \cdot 3\right)\right) \]

   8. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \color{blue}{-9}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(6 + x \cdot -9\right)} \]

4. Final simplification 99.8%

   \[\leadsto x \cdot \left(6 + x \cdot -9\right) \]

Alternative 4: 51.2% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ x \cdot 6 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* x 6.0))

C

double code(double x) {
	return x * 6.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * 6.0d0
end function

Java

public static double code(double x) {
	return x * 6.0;
}

Python

def code(x):
	return x * 6.0

Julia

function code(x)
	return Float64(x * 6.0)
end

MATLAB

function tmp = code(x)
	tmp = x * 6.0;
end

Wolfram

code[x_] := N[(x * 6.0), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \]
2. Step-by-step derivation

   1. *-commutative 99.7%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot \left(2 - x \cdot 3\right)\right)} \]

   2. sub-neg 99.7%

      \[\leadsto x \cdot \left(3 \cdot \color{blue}{\left(2 + \left(-x \cdot 3\right)\right)}\right) \]

   3. distribute-rgt-in 99.7%

      \[\leadsto x \cdot \color{blue}{\left(2 \cdot 3 + \left(-x \cdot 3\right) \cdot 3\right)} \]

   4. metadata-eval 99.7%

      \[\leadsto x \cdot \left(\color{blue}{6} + \left(-x \cdot 3\right) \cdot 3\right) \]

   5. distribute-rgt-neg-in 99.7%

      \[\leadsto x \cdot \left(6 + \color{blue}{\left(x \cdot \left(-3\right)\right)} \cdot 3\right) \]

   6. associate-*l* 99.8%

      \[\leadsto x \cdot \left(6 + \color{blue}{x \cdot \left(\left(-3\right) \cdot 3\right)}\right) \]

   7. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \left(\color{blue}{-3} \cdot 3\right)\right) \]

   8. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \color{blue}{-9}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(6 + x \cdot -9\right)} \]

4. Taylor expanded in x around 0 49.4%

   \[\leadsto x \cdot \color{blue}{6} \]

5. Final simplification 49.4%

   \[\leadsto x \cdot 6 \]

Alternative 5: 2.4% accurate, 9.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 4.0)

C

double code(double x) {
	return 4.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 4.0d0
end function

Java

public static double code(double x) {
	return 4.0;
}

Python

def code(x):
	return 4.0

Julia

function code(x)
	return 4.0
end

MATLAB

function tmp = code(x)
	tmp = 4.0;
end

Wolfram

code[x_] := 4.0

Derivation

1. Initial program 99.7%

   \[\left(3 \cdot \left(2 - x \cdot 3\right)\right) \cdot x \]
2. Step-by-step derivation

   1. *-commutative 99.7%

      \[\leadsto \color{blue}{x \cdot \left(3 \cdot \left(2 - x \cdot 3\right)\right)} \]

   2. sub-neg 99.7%

      \[\leadsto x \cdot \left(3 \cdot \color{blue}{\left(2 + \left(-x \cdot 3\right)\right)}\right) \]

   3. distribute-rgt-in 99.7%

      \[\leadsto x \cdot \color{blue}{\left(2 \cdot 3 + \left(-x \cdot 3\right) \cdot 3\right)} \]

   4. metadata-eval 99.7%

      \[\leadsto x \cdot \left(\color{blue}{6} + \left(-x \cdot 3\right) \cdot 3\right) \]

   5. distribute-rgt-neg-in 99.7%

      \[\leadsto x \cdot \left(6 + \color{blue}{\left(x \cdot \left(-3\right)\right)} \cdot 3\right) \]

   6. associate-*l* 99.8%

      \[\leadsto x \cdot \left(6 + \color{blue}{x \cdot \left(\left(-3\right) \cdot 3\right)}\right) \]

   7. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \left(\color{blue}{-3} \cdot 3\right)\right) \]

   8. metadata-eval 99.8%

      \[\leadsto x \cdot \left(6 + x \cdot \color{blue}{-9}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \left(6 + x \cdot -9\right)} \]
4. Step-by-step derivation

   1. *-commutative 99.8%

      \[\leadsto \color{blue}{\left(6 + x \cdot -9\right) \cdot x} \]

   2. flip-+ 99.8%

      \[\leadsto \color{blue}{\frac{6 \cdot 6 - \left(x \cdot -9\right) \cdot \left(x \cdot -9\right)}{6 - x \cdot -9}} \cdot x \]

   3. associate-*l/ 92.5%

      \[\leadsto \color{blue}{\frac{\left(6 \cdot 6 - \left(x \cdot -9\right) \cdot \left(x \cdot -9\right)\right) \cdot x}{6 - x \cdot -9}} \]

   4. metadata-eval 92.5%

      \[\leadsto \frac{\left(\color{blue}{36} - \left(x \cdot -9\right) \cdot \left(x \cdot -9\right)\right) \cdot x}{6 - x \cdot -9} \]

   5. pow2 92.5%

      \[\leadsto \frac{\left(36 - \color{blue}{{\left(x \cdot -9\right)}^{2}}\right) \cdot x}{6 - x \cdot -9} \]

5. Applied egg-rr 92.5%

   \[\leadsto \color{blue}{\frac{\left(36 - {\left(x \cdot -9\right)}^{2}\right) \cdot x}{6 - x \cdot -9}} \]

6. Taylor expanded in x around 0 48.3%

   \[\leadsto \frac{\color{blue}{36 \cdot x}}{6 - x \cdot -9} \]
7. Step-by-step derivation

   1. *-commutative 48.3%

      \[\leadsto \frac{\color{blue}{x \cdot 36}}{6 - x \cdot -9} \]

8. Simplified 48.3%

   \[\leadsto \frac{\color{blue}{x \cdot 36}}{6 - x \cdot -9} \]

9. Taylor expanded in x around inf 2.3%

   \[\leadsto \color{blue}{4} \]

10. Final simplification 2.3%

    \[\leadsto 4 \]

Developer target: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 6 \cdot x - 9 \cdot \left(x \cdot x\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (* 6.0 x) (* 9.0 (* x x))))

C

double code(double x) {
	return (6.0 * x) - (9.0 * (x * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (6.0d0 * x) - (9.0d0 * (x * x))
end function

Java

public static double code(double x) {
	return (6.0 * x) - (9.0 * (x * x));
}

Python

def code(x):
	return (6.0 * x) - (9.0 * (x * x))

Julia

function code(x)
	return Float64(Float64(6.0 * x) - Float64(9.0 * Float64(x * x)))
end

MATLAB

function tmp = code(x)
	tmp = (6.0 * x) - (9.0 * (x * x));
end

Wolfram

code[x_] := N[(N[(6.0 * x), $MachinePrecision] - N[(9.0 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023258 
(FPCore (x)
  :name "Diagrams.Tangent:$catParam from diagrams-lib-1.3.0.3, E"
  :precision binary64

  :herbie-target
  (- (* 6.0 x) (* 9.0 (* x x)))

  (* (* 3.0 (- 2.0 (* x 3.0))) x))