Rosa's Benchmark

Percentage Accurate: 99.8% → 99.8%

Time: 8.3s

Alternatives: 6

Speedup: 1.2×

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

Specification

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Fortran

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

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(Float64(x * x) * x)))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Fortran

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

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(Float64(x * x) * x)))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (* x (fma x (* x -0.12900613773279798) 0.954929658551372)))

C

double code(double x) {
	return x * fma(x, (x * -0.12900613773279798), 0.954929658551372);
}

Julia

function code(x)
	return Float64(x * fma(x, Float64(x * -0.12900613773279798), 0.954929658551372))
end

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. cancel-sign-sub-inv 99.8%

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

   2. metadata-eval 99.8%

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

   3. *-commutative 99.8%

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

   4. pow3 99.8%

      \[\leadsto 0.954929658551372 \cdot x + \color{blue}{{x}^{3}} \cdot -0.12900613773279798 \]

   5. +-commutative 99.8%

      \[\leadsto \color{blue}{{x}^{3} \cdot -0.12900613773279798 + 0.954929658551372 \cdot x} \]

   6. cube-mult 99.8%

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

   7. associate-*l* 99.8%

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

   8. *-commutative 99.8%

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

   9. distribute-lft-in 99.8%

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

   10. fma-udef 99.8%

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

   11. *-commutative 99.8%

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

   12. fma-udef 99.8%

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

   13. associate-*l* 99.8%

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

   14. fma-def 99.8%

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

3. Applied egg-rr 99.8%

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

4. Final simplification 99.8%

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

Alternative 2: 99.8% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (* x (fma (* x x) -0.12900613773279798 0.954929658551372)))

C

double code(double x) {
	return x * fma((x * x), -0.12900613773279798, 0.954929658551372);
}

Julia

function code(x)
	return Float64(x * fma(Float64(x * x), -0.12900613773279798, 0.954929658551372))
end

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. associate-*r* 99.8%

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

   2. distribute-rgt-out-- 99.8%

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

   3. sub-neg 99.8%

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

   4. +-commutative 99.8%

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

   5. *-commutative 99.8%

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

   6. distribute-rgt-neg-in 99.8%

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

   7. fma-def 99.8%

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

   8. metadata-eval 99.8%

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

3. Simplified 99.8%

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

4. Final simplification 99.8%

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

Alternative 3: 98.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.8 \lor \neg \left(x \leq 2.75\right):\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.954929658551372\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -2.8) (not (<= x 2.75)))
   (* x (* -0.12900613773279798 (* x x)))
   (* x 0.954929658551372)))

C

double code(double x) {
	double tmp;
	if ((x <= -2.8) || !(x <= 2.75)) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else {
		tmp = x * 0.954929658551372;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-2.8d0)) .or. (.not. (x <= 2.75d0))) then
        tmp = x * ((-0.12900613773279798d0) * (x * x))
    else
        tmp = x * 0.954929658551372d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -2.8) || !(x <= 2.75)) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else {
		tmp = x * 0.954929658551372;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -2.8) or not (x <= 2.75):
		tmp = x * (-0.12900613773279798 * (x * x))
	else:
		tmp = x * 0.954929658551372
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -2.8) || !(x <= 2.75))
		tmp = Float64(x * Float64(-0.12900613773279798 * Float64(x * x)));
	else
		tmp = Float64(x * 0.954929658551372);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -2.8) || ~((x <= 2.75)))
		tmp = x * (-0.12900613773279798 * (x * x));
	else
		tmp = x * 0.954929658551372;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -2.8], N[Not[LessEqual[x, 2.75]], $MachinePrecision]], N[(x * N[(-0.12900613773279798 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * 0.954929658551372), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.7999999999999998 or 2.75 < x

   1. Initial program 99.7%

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

      1. associate-*r* 99.7%

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

      2. distribute-rgt-out-- 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-def 99.7%

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

      8. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 97.0%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   5. Step-by-step derivation

      1. unpow2 97.0%

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

   6. Simplified 97.0%

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

   if -2.7999999999999998 < x < 2.75

   1. Initial program 99.8%

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

      1. associate-*r* 99.8%

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

      2. distribute-rgt-out-- 99.8%

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

      3. sub-neg 99.8%

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

      4. +-commutative 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 99.8%

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

      8. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 99.1%

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

4. Final simplification 98.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.8 \lor \neg \left(x \leq 2.75\right):\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.954929658551372\\ \end{array} \]

Alternative 4: 98.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.8:\\ \;\;\;\;x \cdot \left(x \cdot \left(x \cdot -0.12900613773279798\right)\right)\\ \mathbf{elif}\;x \leq 2.75:\\ \;\;\;\;x \cdot 0.954929658551372\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2.8)
   (* x (* x (* x -0.12900613773279798)))
   (if (<= x 2.75)
     (* x 0.954929658551372)
     (* x (* -0.12900613773279798 (* x x))))))

C

double code(double x) {
	double tmp;
	if (x <= -2.8) {
		tmp = x * (x * (x * -0.12900613773279798));
	} else if (x <= 2.75) {
		tmp = x * 0.954929658551372;
	} else {
		tmp = x * (-0.12900613773279798 * (x * x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2.8d0)) then
        tmp = x * (x * (x * (-0.12900613773279798d0)))
    else if (x <= 2.75d0) then
        tmp = x * 0.954929658551372d0
    else
        tmp = x * ((-0.12900613773279798d0) * (x * x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -2.8) {
		tmp = x * (x * (x * -0.12900613773279798));
	} else if (x <= 2.75) {
		tmp = x * 0.954929658551372;
	} else {
		tmp = x * (-0.12900613773279798 * (x * x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -2.8:
		tmp = x * (x * (x * -0.12900613773279798))
	elif x <= 2.75:
		tmp = x * 0.954929658551372
	else:
		tmp = x * (-0.12900613773279798 * (x * x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2.8)
		tmp = Float64(x * Float64(x * Float64(x * -0.12900613773279798)));
	elseif (x <= 2.75)
		tmp = Float64(x * 0.954929658551372);
	else
		tmp = Float64(x * Float64(-0.12900613773279798 * Float64(x * x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -2.8)
		tmp = x * (x * (x * -0.12900613773279798));
	elseif (x <= 2.75)
		tmp = x * 0.954929658551372;
	else
		tmp = x * (-0.12900613773279798 * (x * x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -2.8], N[(x * N[(x * N[(x * -0.12900613773279798), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.75], N[(x * 0.954929658551372), $MachinePrecision], N[(x * N[(-0.12900613773279798 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.7999999999999998

   1. Initial program 99.6%

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

      1. associate-*r* 99.7%

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

      2. distribute-rgt-out-- 99.7%

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

      3. sub-neg 99.7%

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

      4. +-commutative 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-def 99.7%

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

      8. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 99.2%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   5. Step-by-step derivation

      1. unpow2 99.2%

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

      2. *-commutative 99.2%

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

      3. associate-*r* 99.3%

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

   6. Simplified 99.3%

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

   if -2.7999999999999998 < x < 2.75

   1. Initial program 99.8%

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

      1. associate-*r* 99.8%

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

      2. distribute-rgt-out-- 99.8%

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

      3. sub-neg 99.8%

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

      4. +-commutative 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 99.8%

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

      8. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 99.1%

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

   if 2.75 < x

   1. Initial program 99.8%

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

      1. associate-*r* 99.8%

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

      2. distribute-rgt-out-- 99.8%

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

      3. sub-neg 99.8%

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

      4. +-commutative 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 99.8%

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

      8. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around inf 94.8%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   5. Step-by-step derivation

      1. unpow2 94.8%

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

   6. Simplified 94.8%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.8:\\ \;\;\;\;x \cdot \left(x \cdot \left(x \cdot -0.12900613773279798\right)\right)\\ \mathbf{elif}\;x \leq 2.75:\\ \;\;\;\;x \cdot 0.954929658551372\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \end{array} \]

Alternative 5: 99.8% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (* x (- 0.954929658551372 (* x (* x 0.12900613773279798)))))

C

double code(double x) {
	return x * (0.954929658551372 - (x * (x * 0.12900613773279798)));
}

Fortran

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

Java

public static double code(double x) {
	return x * (0.954929658551372 - (x * (x * 0.12900613773279798)));
}

Python

def code(x):
	return x * (0.954929658551372 - (x * (x * 0.12900613773279798)))

Julia

function code(x)
	return Float64(x * Float64(0.954929658551372 - Float64(x * Float64(x * 0.12900613773279798))))
end

MATLAB

function tmp = code(x)
	tmp = x * (0.954929658551372 - (x * (x * 0.12900613773279798)));
end

Wolfram

code[x_] := N[(x * N[(0.954929658551372 - N[(x * N[(x * 0.12900613773279798), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

   1. associate-*r* 99.8%

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

   2. distribute-rgt-out-- 99.8%

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

   3. associate-*r* 99.8%

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

3. Applied egg-rr 99.8%

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

4. Final simplification 99.8%

   \[\leadsto x \cdot \left(0.954929658551372 - x \cdot \left(x \cdot 0.12900613773279798\right)\right) \]

Alternative 6: 50.5% accurate, 3.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return x * 0.954929658551372

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. associate-*r* 99.8%

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

   2. distribute-rgt-out-- 99.8%

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

   3. sub-neg 99.8%

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

   4. +-commutative 99.8%

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

   5. *-commutative 99.8%

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

   6. distribute-rgt-neg-in 99.8%

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

   7. fma-def 99.8%

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

   8. metadata-eval 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in x around 0 52.9%

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

5. Final simplification 52.9%

   \[\leadsto x \cdot 0.954929658551372 \]

Reproduce

herbie shell --seed 2023221 
(FPCore (x)
  :name "Rosa's Benchmark"
  :precision binary64
  (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))