Metrics for Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.4MiB live, 0.4MiB 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)

sample766.0ms (24.3%)

Memory

35.9MiB live, 858.3MiB allocated; 317ms collecting garbage

Samples

480.0ms

8 256×

valid

Precisions

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

ival-sub: 129.0ms (55.1% of total)

ival-add: 90.0ms (38.4% of total)

ival-true: 5.0ms (2.1% of total)

exact: 5.0ms (2.1% of total)

adjust: 3.0ms (1.3% of total)

ival-assert: 3.0ms (1.3% of total)

Bogosity

explain51.0ms (1.6%)

Memory

27.1MiB live, 86.0MiB allocated; 17ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 x x)`
-	-	`#s(literal 1 binary64)`
-	-	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

17.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-sub: 3.0ms (47.3% of total)

ival-add: 3.0ms (47.3% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess223.0ms (7.1%)

Memory

-12.8MiB live, 264.1MiB allocated; 34ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	18	16
2	32	16
3	63	16
4	186	16
5	879	15
0	4	5
0	6	5
1	12	5
2	18	5
3	34	5
4	107	5
5	595	5
6	5537	5
0	8040	4

Stop Event

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

Calls

Call 1

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

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

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 4 computations (20% saved)

simplify220.0ms (7%)

Memory

13.7MiB live, 214.8MiB allocated; 80ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x x)
cost-diff	1	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	12	10
2	18	10
3	34	10
4	107	10
5	595	10
6	5537	10
0	8040	9

Stop Event

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

Calls

Call 1

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

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

localize16.0ms (0.5%)

Memory

-7.8MiB live, 36.1MiB allocated; 8ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(-.f64 (+.f64 x x) #s(literal 1 binary64))
accuracy	0.0	(+.f64 x x)

Samples

11.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-sub: 1.0ms (33.5% of total)

ival-add: 1.0ms (33.5% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series2.0ms (0.1%)

Memory

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

Counts

2 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

simplify268.0ms (8.5%)

Memory

-3.4MiB live, 148.0MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56
1	34	56
2	59	56
3	110	56
4	459	56
5	2646	56
6	7111	56
0	8522	48

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

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

rewrite70.0ms (2.2%)

Memory

-6.2MiB live, 136.5MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	77	8
0	1149	7

Stop Event

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

Counts

2 → 118

Calls

Call 1

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

Outputs
(*.f64 (neg.f64 (sqrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))) (neg.f64 (sqrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))))
(*.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
(*.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
(*.f64 (sqrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (sqrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))))
(*.f64 (pow.f64 (cbrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) #s(literal 2 binary64)) (cbrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))))
(*.f64 (cbrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (pow.f64 (cbrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) #s(literal 2 binary64)))
(pow.f64 (sqrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) #s(literal 2 binary64))
(pow.f64 (pow.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) #s(literal 3 binary64)) #s(literal 1/3 binary64))
(pow.f64 (cbrt.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) #s(literal 3 binary64))
(pow.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) #s(literal 1 binary64))
(/.f64 (-.f64 (.f64 x x) (.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) (-.f64 x (-.f64 x #s(literal 1 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 x #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (.f64 x (-.f64 x #s(literal 1 binary64))))))
(/.f64 (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(/.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
(/.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(fma.f64 (.f64 (.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) (sqrt.f64 x)) (sqrt.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))) (cbrt.f64 x) #s(literal -1 binary64))
(fma.f64 (+.f64 (sqrt.f64 x) #s(literal 1 binary64)) (-.f64 (sqrt.f64 x) #s(literal 1 binary64)) x)
(fma.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) (neg.f64 (.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 (sqrt.f64 (-.f64 x #s(literal 1 binary64))) (sqrt.f64 (-.f64 x #s(literal 1 binary64))) x)
(fma.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 (cbrt.f64 (-.f64 x #s(literal 1 binary64))) (cbrt.f64 (-.f64 x #s(literal 1 binary64)))) (cbrt.f64 (-.f64 x #s(literal 1 binary64))) x)
(fma.f64 (cbrt.f64 #s(literal 2 binary64)) (cbrt.f64 x) #s(literal -1 binary64))
(fma.f64 #s(literal 4 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (.f64 x (.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(fma.f64 (sqrt.f64 x) (+.f64 (sqrt.f64 x) (sqrt.f64 x)) #s(literal -1 binary64))
(fma.f64 (pow.f64 (cbrt.f64 x) #s(literal 2 binary64)) (+.f64 (cbrt.f64 x) (cbrt.f64 x)) #s(literal -1 binary64))
(fma.f64 (cbrt.f64 x) (fma.f64 (cbrt.f64 x) (cbrt.f64 x) (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 (.f64 #s(literal 2 binary64) x) (.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(expm1.f64 (+.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64)))
(expm1.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(expm1.f64 (/.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(expm1.f64 (/.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(expm1.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(expm1.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64)))
(expm1.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)))
(cbrt.f64 (pow.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) #s(literal 3 binary64)))
(sqrt.f64 (pow.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) #s(literal 2 binary64)))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(exp.f64 (*.f64 (log.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) #s(literal 1 binary64)))
(exp.f64 (log.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))))
(+.f64 (cosh.f64 (log.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))) (sinh.f64 (log.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))))
(+.f64 (-.f64 x #s(literal 1 binary64)) x)
(+.f64 (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(+.f64 x (-.f64 x #s(literal 1 binary64)))
(log.f64 (exp.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))))
(.f64 (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(.f64 (.f64 #s(literal 2 binary64) (sqrt.f64 x)) (sqrt.f64 x))
(.f64 (.f64 #s(literal 2 binary64) (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))) (cbrt.f64 x))
(.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x))
(*.f64 (cbrt.f64 #s(literal 2 binary64)) (cbrt.f64 x))
(.f64 #s(literal 4 binary64) (.f64 x x))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(.f64 #s(literal 2 binary64) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(.f64 #s(literal 2 binary64) (.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 (sqrt.f64 x) (+.f64 (sqrt.f64 x) (sqrt.f64 x)))
(*.f64 (pow.f64 (cbrt.f64 x) #s(literal 2 binary64)) (+.f64 (cbrt.f64 x) (cbrt.f64 x)))
(*.f64 (cbrt.f64 x) (fma.f64 (cbrt.f64 x) (cbrt.f64 x) (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))))
(.f64 #s(literal 1 binary64) (.f64 #s(literal 2 binary64) x))
(.f64 (.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1/3 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1/2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (cbrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (cbrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(fma.f64 (.f64 #s(literal 2 binary64) x) x (.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (.f64 #s(literal 2 binary64) x) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(cbrt.f64 (*.f64 #s(literal 2 binary64) x))
(sqrt.f64 (*.f64 #s(literal 2 binary64) x))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(-.f64 x (*.f64 (neg.f64 (sqrt.f64 x)) (sqrt.f64 x)))
(-.f64 x (*.f64 (neg.f64 (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))) (cbrt.f64 x)))
(fabs.f64 (*.f64 #s(literal 2 binary64) x))
(exp.f64 (+.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(exp.f64 (/.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(exp.f64 (/.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64)))
(exp.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)))
(+.f64 (.f64 x (.f64 #s(literal 2 binary64) x)) (.f64 x (.f64 #s(literal 2 binary64) x)))
(+.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 (cosh.f64 (log.f64 (.f64 #s(literal 2 binary64) x))) (sinh.f64 (log.f64 (.f64 #s(literal 2 binary64) x))))
(+.f64 x x)
(log.f64 (pow.f64 (E.f64) (*.f64 #s(literal 2 binary64) x)))
(log.f64 (pow.f64 (exp.f64 x) #s(literal 2 binary64)))
(log.f64 (pow.f64 (exp.f64 #s(literal 2 binary64)) x))

eval75.0ms (2.4%)

Memory: -5.4MiB live, 39.8MiB allocated; 4ms collecting garbage
Compiler: Compiled 1 171 to 291 computations (75.1% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	120	2	122
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	120	3	123

Accuracy

100.0%

Counts

123 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	47.4%	#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
▶	54.0%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 17 computations (19% saved)

simplify175.0ms (5.5%)

Memory

-7.4MiB live, 138.4MiB allocated; 18ms collecting garbage

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 #s(literal 2 binary64) x)
cost-diff	0	#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
cost-diff	0	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	22
0	10	22
1	17	22
2	26	22
3	59	22
4	237	22
5	1138	22
6	7879	22
0	8163	20

Stop Event

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

Calls

Call 1

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

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

localize15.0ms (0.5%)

Memory

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

Localize:

Found 3 expressions of interest:

New	Metric	Score
accuracy	0.0	(*.f64 #s(literal 2 binary64) x)
accuracy	33.66800650530025	#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
accuracy	29.452010220909873	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Samples

10.0ms

256×

valid

Compiler

Compiled 18 to 9 computations (50% saved)

Precisions

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

ival-mult: 2.0ms (42.4% of total)

ival-sub: 1.0ms (21.2% of total)

ival-add: 1.0ms (21.2% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series1.0ms (0%)

Memory

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

Counts

3 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

simplify248.0ms (7.8%)

Memory

-17.9MiB live, 222.6MiB allocated; 45ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56
1	33	56
2	58	56
3	109	56
4	458	56
5	2645	56
6	7110	56
0	8521	48

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

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

rewrite57.0ms (1.8%)

Memory

-15.2MiB live, 85.5MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	19
0	10	19
0	151	19

Stop Event

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

Counts

3 → 25

Calls

Call 1

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

Outputs
(*.f64 (sqrt.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64))) (sqrt.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64))))
(.f64 (.f64 (cbrt.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64))) (cbrt.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64)))) (cbrt.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64))))
(pow.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(literal 1 binary64))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
(cbrt.f64 (.f64 (.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64))) #s(approx (- (+ x x) 1) #s(literal -1 binary64))))
(exp.f64 (log.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64))))
(log.f64 (exp.f64 #s(approx (- (+ x x) 1) #s(literal -1 binary64))))
(.f64 (sqrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) (sqrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(.f64 (.f64 (cbrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) (cbrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x)))) (cbrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(pow.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(cbrt.f64 (.f64 (.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x)) #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(exp.f64 (log.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(log.f64 (exp.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(.f64 (sqrt.f64 (.f64 #s(literal 2 binary64) x)) (sqrt.f64 (*.f64 #s(literal 2 binary64) x)))
(.f64 (.f64 (cbrt.f64 (.f64 #s(literal 2 binary64) x)) (cbrt.f64 (.f64 #s(literal 2 binary64) x))) (cbrt.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(/.f64 (-.f64 (.f64 x x) (.f64 x x)) (-.f64 x x))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 x x) (.f64 x x))))
(cbrt.f64 (.f64 (.f64 (.f64 #s(literal 2 binary64) x) (.f64 #s(literal 2 binary64) x)) (*.f64 #s(literal 2 binary64) x)))
(exp.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)))
(+.f64 x x)
(log.f64 (exp.f64 (*.f64 #s(literal 2 binary64) x)))

eval3.0ms (0.1%)

Memory: 9.6MiB live, 9.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 403 to 76 computations (81.1% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	26	1	27
Fresh	0	0	0
Picked	1	1	2
Done	0	1	1
Total	27	3	30

Accuracy

100.0%

Counts

30 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	47.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	54.0%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 16 computations (23.8% saved)

simplify237.0ms (7.5%)

Memory

-25.7MiB live, 210.1MiB allocated; 23ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x x)
cost-diff	0	#s(approx (- (+ x x) 1) (+.f64 x x))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
0	7	13
1	13	13
2	19	13
3	35	13
4	108	13
5	596	13
6	5548	13
0	8051	12

Stop Event

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

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x

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

localize11.0ms (0.4%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 x x)
accuracy	33.66800650530025	#s(approx (- (+ x x) 1) (+.f64 x x))

Samples

7.0ms

256×

valid

Compiler

Compiled 11 to 6 computations (45.5% saved)

Precisions

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

ival-sub: 1.0ms (34.6% of total)

ival-add: 1.0ms (34.6% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series1.0ms (0%)

Memory

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

Counts

2 → 6

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)

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

Calls

3 calls:

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

simplify274.0ms (8.7%)

Memory

-29.3MiB live, 162.0MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56
1	34	56
2	59	56
3	110	56
4	459	56
5	2646	56
6	7111	56
0	8522	48

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

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

rewrite57.0ms (1.8%)

Memory

45.7MiB live, 90.2MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	12
0	7	12
1	91	12
0	1305	11

Stop Event

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

Counts

2 → 76

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)

Outputs
(.f64 (neg.f64 (sqrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x)))) (neg.f64 (sqrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x)))))
(.f64 (sqrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) (sqrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(.f64 (pow.f64 (cbrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) #s(literal 2 binary64)) (cbrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(.f64 (cbrt.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) (pow.f64 (cbrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))) #s(literal 2 binary64)))
(pow.f64 (sqrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))) #s(literal 2 binary64))
(pow.f64 (pow.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)) #s(literal 1/3 binary64))
(pow.f64 (cbrt.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))) #s(literal 3 binary64))
(pow.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(cbrt.f64 (pow.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(sqrt.f64 (pow.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(exp.f64 (.f64 (log.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x))) #s(literal 1 binary64)))
(exp.f64 (log.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(+.f64 (cosh.f64 (log.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x)))) (sinh.f64 (log.f64 #s(approx (- (+ x x) 1) (.f64 #s(literal 2 binary64) x)))))
(log.f64 (exp.f64 #s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))))
(.f64 (.f64 #s(literal 2 binary64) (sqrt.f64 x)) (sqrt.f64 x))
(.f64 (.f64 #s(literal 2 binary64) (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))) (cbrt.f64 x))
(.f64 (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (sqrt.f64 #s(literal 2 binary64)) (sqrt.f64 x))
(*.f64 (cbrt.f64 #s(literal 2 binary64)) (cbrt.f64 x))
(.f64 #s(literal 4 binary64) (.f64 x x))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(.f64 #s(literal 2 binary64) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(.f64 #s(literal 2 binary64) (.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 (sqrt.f64 x) (+.f64 (sqrt.f64 x) (sqrt.f64 x)))
(*.f64 (pow.f64 (cbrt.f64 x) #s(literal 2 binary64)) (+.f64 (cbrt.f64 x) (cbrt.f64 x)))
(*.f64 (cbrt.f64 x) (fma.f64 (cbrt.f64 x) (cbrt.f64 x) (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))))
(.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(.f64 (.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1/3 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1/2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (sqrt.f64 #s(literal 0 binary64)) (sqrt.f64 #s(literal 0 binary64)))
(/.f64 (sqrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (sqrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (cbrt.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (cbrt.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(fma.f64 (.f64 #s(literal 2 binary64) x) x (.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (.f64 #s(literal 2 binary64) x) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(cbrt.f64 (*.f64 #s(literal 2 binary64) x))
(sqrt.f64 (*.f64 #s(literal 2 binary64) x))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(-.f64 x (*.f64 (neg.f64 (sqrt.f64 x)) (sqrt.f64 x)))
(-.f64 x (*.f64 (neg.f64 (pow.f64 (cbrt.f64 x) #s(literal 2 binary64))) (cbrt.f64 x)))
(fabs.f64 (*.f64 #s(literal 2 binary64) x))
(exp.f64 (+.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(exp.f64 (/.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 2 binary64)))
(exp.f64 (/.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 1 binary64)))
(exp.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)))
(+.f64 (.f64 x (.f64 #s(literal 2 binary64) x)) (.f64 x (.f64 #s(literal 2 binary64) x)))
(+.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 (cosh.f64 (log.f64 (.f64 #s(literal 2 binary64) x))) (sinh.f64 (log.f64 (.f64 #s(literal 2 binary64) x))))
(+.f64 x x)
(log.f64 (pow.f64 (exp.f64 x) #s(literal 2 binary64)))
(log.f64 (pow.f64 (E.f64) (*.f64 #s(literal 2 binary64) x)))
(log.f64 (pow.f64 (exp.f64 #s(literal 2 binary64)) x))

eval19.0ms (0.6%)

Memory: -2.1MiB live, 41.9MiB allocated; 5ms collecting garbage
Compiler: Compiled 1 119 to 226 computations (79.8% saved)

prune117.0ms (3.7%)

Memory

-18.7MiB live, 48.5MiB allocated; 114ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	79	0	79
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	79	3	82

Accuracy

100.0%

Counts

82 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	47.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	54.0%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes22.0ms (0.7%)

Memory

-18.0MiB live, 34.6MiB allocated; 15ms 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))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) #s(literal 1 binary64))

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

Calls

3 calls:

15.0ms	x
3.0ms	(+.f64 x x)
3.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 9 to 7 computations (22.2% saved)

regimes32.0ms (1%)

Memory

-17.3MiB live, 28.1MiB allocated; 3ms collecting garbage

Counts

3 → 3

Calls

Call 1

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

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

Calls

3 calls:

26.0ms	(+.f64 x x)
3.0ms	x
2.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
97.8%	3	`(+.f64 x x)`
97.8%	3	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
97.8%	3	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.1%)

Memory

15.5MiB live, 15.5MiB allocated; 0ms 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:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch28.0ms (0.9%)

Memory

25.3MiB live, 68.1MiB allocated; 8ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
9.0ms	0.0008356916569870537	14462.724732856295
17.0ms	-0.6242984392147577	-0.0009803354642289874

Samples

16.0ms

272×

valid

Compiler

Compiled 280 to 246 computations (12.1% saved)

Precisions

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

ival-sub: 1.0ms (32.8% of total)

ival-add: 1.0ms (32.8% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify67.0ms (2.1%)

Memory

0.9MiB live, 52.3MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	37
1	56	37
2	78	37
3	109	37
4	226	37
5	1286	37

Stop Event

1×	node limit

Calls

Call 1

Inputs

(-.f64 (+.f64 x x) #s(literal 1 binary64))

(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))

#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -1/2 binary64)) (not (<=.f64 x #s(literal 1/2 binary64)))) #s(approx (- (+ x x) 1) (+.f64 x x)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

derivations76.0ms (2.4%)

Memory

-33.7MiB live, 59.7MiB allocated; 9ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess18.0ms (0.6%)

Memory: -2.1MiB live, 44.1MiB allocated; 5ms collecting garbage
Compiler: Compiled 84 to 42 computations (50% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample766.0ms (24.3%)

explain51.0ms (1.6%)

preprocess223.0ms (7.1%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify220.0ms (7%)

localize16.0ms (0.5%)

series2.0ms (0.1%)

simplify268.0ms (8.5%)

rewrite70.0ms (2.2%)

eval75.0ms (2.4%)

prune3.0ms (0.1%)

simplify175.0ms (5.5%)

localize15.0ms (0.5%)

series1.0ms (0%)

simplify248.0ms (7.8%)

rewrite57.0ms (1.8%)

eval3.0ms (0.1%)

prune2.0ms (0.1%)

simplify237.0ms (7.5%)

localize11.0ms (0.4%)

series1.0ms (0%)

simplify274.0ms (8.7%)

rewrite57.0ms (1.8%)

eval19.0ms (0.6%)

prune117.0ms (3.7%)

regimes22.0ms (0.7%)

regimes32.0ms (1%)

regimes3.0ms (0.1%)

bsearch28.0ms (0.9%)

simplify67.0ms (2.1%)

derivations76.0ms (2.4%)

preprocess18.0ms (0.6%)

end0.0ms (0%)

Profiling