Metrics for Data.Random.Dice:roll from dice-0.1

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample472.0ms (59.8%)

Memory

12.5MiB live, 574.0MiB allocated; 106ms collecting garbage

Samples

268.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 88.0ms

ival-mult!: 47.0ms (53.3% of total)

ival-sub!: 39.0ms (44.3% of total)

adjust: 2.0ms (2.3% of total)

Bogosity

preprocess79.0ms (10%)

Memory

-31.6MiB live, 17.0MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	8	16
1	26	16
2	67	16
3	146	16
4	572	15
5	3201	15
6	6936	15

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (*.f64 x x) #s(literal 1 binary64))

Symmetry

(abs x)

Compiler

Compiled 8 to 8 computations (0% saved)

series2.0ms (0.3%)

Memory

3.3MiB live, 3.3MiB allocated; 0ms collecting garbage

Counts

4 → 6

Calls

Call 1

Inputs
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(*.f64 x x)
x
#s(literal 1 binary64)

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x x) 1) (* x x) x 1)
1.0ms	x	@	inf	((- (* x x) 1) (* x x) x 1)
0.0ms	x	@	0	((- (* x x) 1) (* x x) x 1)

rewrite75.0ms (9.5%)

Memory

20.1MiB live, 66.3MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	64
0	20	62
1	71	62
0	504	56

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

10 → 63

Calls

Call 1

Inputs
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(*.f64 x x)
x
#s(literal 1 binary64)
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Outputs
(*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (+.f64 (fabs.f64 x) #s(literal 1 binary64)) (-.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (neg.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(/.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 x x #s(literal 1 binary64)))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64))))
(fma.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 x (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x x #s(literal -1 binary64))
(expm1.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(expm1.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(-.f64 (/.f64 (.f64 (.f64 (*.f64 x x) x) x) (fma.f64 x x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 1 binary64))))
(-.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 (*.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(+.f64 (*.f64 x x) #s(literal -1 binary64))
(.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (*.f64 (neg.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (*.f64 (fabs.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 x #s(literal 1 binary64)) (*.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 x #s(literal 1 binary64)))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(/.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))))
x
#s(literal 1 binary64)
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (- (* x x) 1) (*.f64 x x))
#s(approx (- (* x x) 1) (.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

eval5.0ms (0.7%)

Memory: 9.8MiB live, 9.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 280 to 139 computations (50.4% saved)

prune2.0ms (0.3%)

Memory

3.2MiB live, 3.2MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	57	3	60
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	58	3	61

Accuracy

100.0%

Counts

61 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x x #s(literal -1 binary64))
▶	49.0%	#s(approx (- (* x x) 1) (*.f64 x x))
▶	52.1%	#s(approx (- (* x x) 1) #s(literal -1 binary64))

Compiler

Compiled 15 to 15 computations (0% saved)

series2.0ms (0.2%)

Memory

2.4MiB live, 2.4MiB allocated; 0ms collecting garbage

Counts

6 → 10

Calls

Call 1

Inputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (* x x) 1) (*.f64 x x))
(*.f64 x x)
x
(fma.f64 x x #s(literal -1 binary64))

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* x x) -1) #s(hole binary64 -1))
#s(approx (+ (* x x) -1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (+ (* x x) -1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) -1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((- (* x x) 1) -1 (- (* x x) 1) (* x x) x (+ (* x x) -1))
1.0ms	x	@	-inf	((- (* x x) 1) -1 (- (* x x) 1) (* x x) x (+ (* x x) -1))
0.0ms	x	@	0	((- (* x x) 1) -1 (- (* x x) 1) (* x x) x (+ (* x x) -1))

rewrite54.0ms (6.8%)

Memory

-22.0MiB live, 25.3MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	119
0	26	107
1	87	107
0	634	107

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

16 → 84

Calls

Call 1

Inputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (* x x) 1) (*.f64 x x))
(*.f64 x x)
x
(fma.f64 x x #s(literal -1 binary64))
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* x x) -1) #s(hole binary64 -1))
#s(approx (+ (* x x) -1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (+ (* x x) -1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) -1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Outputs
#s(approx (+ (* x x) -1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (+ (* x x) -1) (*.f64 x x))
(.f64 (.f64 (neg.f64 x) #s(literal -1 binary64)) (*.f64 (neg.f64 x) #s(literal -1 binary64)))
(.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (*.f64 (neg.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 (fabs.f64 x) #s(literal -1 binary64)) (*.f64 (fabs.f64 x) #s(literal -1 binary64)))
(.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (*.f64 (fabs.f64 x) #s(literal 1 binary64)))
(.f64 (.f64 x #s(literal -1 binary64)) (*.f64 x #s(literal -1 binary64)))
(.f64 (.f64 x #s(literal 1 binary64)) (*.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(.f64 (.f64 (neg.f64 x) x) #s(literal -1 binary64))
(.f64 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (fabs.f64 x) (.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 x #s(literal 1 binary64)))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(/.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(exp.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (.f64 (log.f64 x) #s(literal 2 binary64))))
x
(*.f64 (+.f64 (neg.f64 x) #s(literal -1 binary64)) (-.f64 (neg.f64 x) #s(literal -1 binary64)))
(*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (+.f64 (fabs.f64 x) #s(literal -1 binary64)) (-.f64 (fabs.f64 x) #s(literal -1 binary64)))
(*.f64 (+.f64 (fabs.f64 x) #s(literal 1 binary64)) (-.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal -1 binary64)))
(*.f64 (-.f64 x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) (.f64 (.f64 (.f64 x x) x) x)) (-.f64 #s(literal -1 binary64) (.f64 x x)))
(/.f64 (neg.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(/.f64 (fma.f64 (.f64 x x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 x x #s(literal 1 binary64)))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64)) (+.f64 #s(literal 1 binary64) (-.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 (neg.f64 x) x))))
(/.f64 (fma.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x) #s(literal -1 binary64)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64))))
(fma.f64 (.f64 (neg.f64 x) #s(literal -1 binary64)) (.f64 (neg.f64 x) #s(literal -1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (neg.f64 x) #s(literal 1 binary64)) (.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (fabs.f64 x) #s(literal -1 binary64)) (.f64 (fabs.f64 x) #s(literal -1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 (fabs.f64 x) #s(literal 1 binary64)) (.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 x #s(literal -1 binary64)) (.f64 x #s(literal -1 binary64)) #s(literal -1 binary64))
(fma.f64 (.f64 x #s(literal 1 binary64)) (.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) #s(literal -1 binary64))
(fma.f64 (*.f64 (neg.f64 x) x) #s(literal -1 binary64) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 x (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x x #s(literal -1 binary64))
(expm1.f64 (fma.f64 (log.f64 x) #s(literal 2 binary64) #s(literal 0 binary64)))
(expm1.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(-.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 (*.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(-.f64 (/.f64 (.f64 (.f64 (*.f64 x x) x) x) (fma.f64 x x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 1 binary64))))
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(-.f64 #s(literal -1 binary64) (*.f64 (neg.f64 x) x))
(+.f64 (/.f64 (.f64 (.f64 (.f64 (.f64 x x) x) x) (.f64 x x)) (fma.f64 (.f64 (.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))) (/.f64 #s(literal -1 binary64) (fma.f64 (.f64 (*.f64 x x) x) x (fma.f64 x x #s(literal 1 binary64)))))
(+.f64 (*.f64 x x) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (*.f64 x x))
#s(approx (+ (* x x) -1) #s(literal -1 binary64))
#s(approx (+ (* x x) -1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (+ (* x x) -1) #s(literal -1 binary64))
#s(approx (+ (* x x) -1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (+ (* x x) -1) (*.f64 x x))
#s(approx (+ (* x x) -1) (.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))
#s(approx (+ (* x x) -1) (*.f64 x x))
#s(approx (+ (* x x) -1) (.f64 (.f64 (-.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

eval6.0ms (0.8%)

Memory: 10.7MiB live, 10.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 375 to 175 computations (53.3% saved)

prune4.0ms (0.4%)

Memory

5.4MiB live, 5.4MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	77	0	77
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	77	3	80

Accuracy

100.0%

Counts

80 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x x #s(literal -1 binary64))
✓	49.0%	#s(approx (- (* x x) 1) (*.f64 x x))
✓	52.1%	#s(approx (- (* x x) 1) #s(literal -1 binary64))

Compiler

Compiled 29 to 26 computations (10.3% saved)

regimes5.0ms (0.6%)

Memory

8.3MiB live, 8.3MiB allocated; 0ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (*.f64 x x))
(fma.f64 x x #s(literal -1 binary64))
(-.f64 (*.f64 x x) #s(literal 1 binary64))

Outputs
(fma.f64 x x #s(literal -1 binary64))

Calls

3 calls:

2.0ms	x
1.0ms	(*.f64 x x)
1.0ms	(-.f64 (*.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x x)`
100.0%	1	`(-.f64 (*.f64 x x) #s(literal 1 binary64))`
100.0%	1	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

regimes4.0ms (0.5%)

Memory

6.1MiB live, 6.1MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (*.f64 x x))

Outputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))
#s(approx (- (* x x) 1) (*.f64 x x))

Calls

3 calls:

1.0ms	x
1.0ms	(*.f64 x x)
1.0ms	(-.f64 (*.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
99.2%	2	`(*.f64 x x)`
99.2%	2	`(-.f64 (*.f64 x x) #s(literal 1 binary64))`
99.2%	2	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

regimes26.0ms (3.2%)

Memory

-37.7MiB live, 15.6MiB allocated; 4ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))

Outputs
#s(approx (- (* x x) 1) #s(literal -1 binary64))

Calls

3 calls:

9.0ms	(-.f64 (*.f64 x x) #s(literal 1 binary64))
1.0ms	x
1.0ms	(*.f64 x x)

Results

Accuracy	Segments	Branch
52.1%	1	`(*.f64 x x)`
52.1%	1	`(-.f64 (*.f64 x x) #s(literal 1 binary64))`
52.1%	1	`x`

Compiler

Compiled 7 to 7 computations (0% saved)

bsearch9.0ms (1.2%)

Memory

14.3MiB live, 14.3MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
9.0ms	0.002467580383189955	9090422.893389769

Samples

4.0ms

144×

valid

Compiler

Compiled 116 to 134 computations (-15.5% saved)

Precisions

Click to see histograms. Total time spent on operations: 1.0ms

ival-mult!: 1.0ms (85.8% of total)

ival-sub!: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

derivations7.0ms (0.9%)

Memory

9.2MiB live, 9.2MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 14 to 12 computations (14.3% saved)

preprocess39.0ms (4.9%)

Memory: -0.3MiB live, 44.7MiB allocated; 4ms collecting garbage
Remove: (abs x)
Compiler: Compiled 62 to 56 computations (9.7% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample472.0ms (59.8%)

preprocess79.0ms (10%)

series2.0ms (0.3%)

rewrite75.0ms (9.5%)

eval5.0ms (0.7%)

prune2.0ms (0.3%)

series2.0ms (0.2%)

rewrite54.0ms (6.8%)

eval6.0ms (0.8%)

prune4.0ms (0.4%)

regimes5.0ms (0.6%)

regimes4.0ms (0.5%)

regimes26.0ms (3.2%)

bsearch9.0ms (1.2%)

derivations7.0ms (0.9%)

preprocess39.0ms (4.9%)

end0.0ms (0%)

Profiling