Metrics for sqrt sqr

start0.0ms (0%)

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

analyze2.0ms (0.1%)

Memory

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

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 14 to 10 computations (28.6% saved)

sample1.5s (77.5%)

Memory

39.5MiB live, 1 457.4MiB allocated; 931ms collecting garbage

Samples

872.0ms	4 111×	2	valid
226.0ms	4 145×	0	valid

Precisions

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

ival-mult!: 410.0ms (47.5% of total)

adjust: 152.0ms (17.6% of total)

ival-div!: 143.0ms (16.6% of total)

ival-sqrt: 107.0ms (12.4% of total)

ival-sub!: 51.0ms (5.9% of total)

Bogosity

explain157.0ms (8%)

Memory

-3.3MiB live, 197.3MiB allocated; 75ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
123	-	-	`(sqrt.f64 (*.f64 x x))`
0	-	-	`(/.f64 #s(literal 1 binary64) x)`
0	-	-	`#s(literal 1 binary64)`
0	-	-	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
0	-	-	`(/.f64 x x)`
0	-	-	`(.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x)))`
0	-	-	`(*.f64 x x)`
0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`sqrt.f64`	`(sqrt.f64 (*.f64 x x))`	uflow-rescue	64	0
↳	`(*.f64 x x)`	underflow	64
`sqrt.f64`	`(sqrt.f64 (*.f64 x x))`	oflow-rescue	59	0
↳	`(*.f64 x x)`	overflow	59

Confusion

	Predicted +	Predicted -
+	123	8
-	0	125

Precision

1.0

Recall

0.9389312977099237

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	123	0	8
-	0	0	125

Precision?

1.0

Recall?

0.9389312977099237

Freqs

test

number	freq
0	133
1	123

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

78.0ms	256×	2	valid
15.0ms	256×	0	valid

Compiler

Compiled 86 to 28 computations (67.4% saved)

Precisions

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

ival-sub!: 41.0ms (55% of total)

ival-mult!: 12.0ms (16.1% of total)

ival-div!: 8.0ms (10.7% of total)

adjust: 7.0ms (9.4% of total)

ival-sqrt: 6.0ms (8% of total)

preprocess48.0ms (2.5%)

Memory

-17.4MiB live, 40.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	16	27
1	61	19
2	132	18
3	337	18
4	1715	18
5	6496	18

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	52.4%	(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))

Compiler

Compiled 24 to 16 computations (33.3% saved)

series3.0ms (0.1%)

Memory

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

Counts

8 → 10

Calls

Call 1

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

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

Calls

3 calls:

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

Time

Variable

Point

Expression

1.0ms

-inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

1.0ms

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

1.0ms

inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) (/ x x) x (* (/ 1 x) (sqrt (* x x))) (/ 1 x) 1 (sqrt (* x x)) (* x x))

rewrite68.0ms (3.5%)

Memory

4.5MiB live, 97.6MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	29	119
0	38	78
1	94	51
0	541	51

Stop Event

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

Counts

18 → 51

Calls

Call 1

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

Outputs
#s(literal 0 binary64)
#s(literal 1 binary64)
x
#s(literal 1 binary64)
(*.f64 (pow.f64 x #s(literal -1/2 binary64)) (pow.f64 x #s(literal -1/2 binary64)))
(*.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64)))
(pow.f64 x #s(literal -1 binary64))
(/.f64 (/.f64 #s(literal -1 binary64) x) #s(literal -1 binary64))
(/.f64 (neg.f64 x) (*.f64 (neg.f64 x) x))
(/.f64 #s(literal -1 binary64) (neg.f64 x))
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x))
(/.f64 #s(literal 1 binary64) (neg.f64 (neg.f64 x)))
(/.f64 #s(literal 1 binary64) x)
(/.f64 x (*.f64 x x))
(neg.f64 (/.f64 #s(literal -1 binary64) x))
(exp.f64 (*.f64 (log.f64 x) #s(literal -1 binary64)))
#s(literal 1 binary64)
x
(.f64 (.f64 (neg.f64 x) #s(literal -1 binary64)) x)
(.f64 (.f64 x (sqrt.f64 x)) (sqrt.f64 x))
(.f64 (.f64 (neg.f64 x) x) #s(literal -1 binary64))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(.f64 (sqrt.f64 x) (.f64 (sqrt.f64 x) x))
(.f64 #s(literal -1 binary64) (.f64 x (neg.f64 x)))
(.f64 (.f64 x x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 x x))
(.f64 x (.f64 #s(literal -1 binary64) (neg.f64 x)))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (.f64 (.f64 x x) (*.f64 x x)) #s(literal 1/2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(sqrt.f64 (.f64 (.f64 x x) (*.f64 x x)))
(fabs.f64 (*.f64 x x))
(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))))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(literal 1 binary64))
#s(approx (sqrt (* x x)) x)
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(literal 1 binary64))
#s(approx (/ 1 x) (pow.f64 x #s(literal -1 binary64)))
#s(approx (sqrt (* x x)) x)
#s(approx (* x x) (*.f64 x x))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(approx (* (/ 1 x) (sqrt (* x x))) #s(literal -1 binary64))
#s(approx (sqrt (* x x)) (neg.f64 x))

eval4.0ms (0.2%)

Memory: 9.1MiB live, 9.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 687 to 192 computations (72.1% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	45	2	47
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	46	2	48

Accuracy

100.0%

Counts

48 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
▶	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 28 to 20 computations (28.6% saved)

series0.0ms (0%)

Memory

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

Counts

4 → 2

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)

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

Calls

3 calls:

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

Time

Variable

Point

Expression

0.0ms

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

0.0ms

-inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

0.0ms

inf

((- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 0 (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) 2)

rewrite77.0ms (3.9%)

Memory

-6.2MiB live, 40.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	12	58
0	12	42
1	58	14
0	438	14

Stop Event

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

Counts

6 → 6

Calls

Call 1

Inputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 0))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(hole binary64 2))

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(literal 0 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	2	2
Done	0	0
Total	2	2

Accuracy

100.0%

Counts

2 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
✓	51.6%	#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Compiler

Compiled 68 to 39 computations (42.6% saved)

regimes3.0ms (0.2%)

Memory

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

Counts

3 → 2

Calls

Call 1

Inputs

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))

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

Outputs
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 2 binary64))
#s(approx (- (/ x x) (* (/ 1 x) (sqrt (* x x)))) #s(literal 0 binary64))

Calls

2 calls:

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

Results

Accuracy	Segments	Branch
89.4%	2	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
100.0%	2	`x`

Compiler

Compiled 13 to 9 computations (30.8% saved)

regimes2.0ms (0.1%)

Memory

5.4MiB live, 5.4MiB 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 x) (sqrt (* x x)))) #s(literal 0 binary64))

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

Calls

2 calls:

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

Results

Accuracy	Segments	Branch
51.6%	1	`(-.f64 (/.f64 x x) (.f64 (/.f64 #s(literal 1 binary64) x) (sqrt.f64 (.f64 x x))))`
51.6%	1	`x`

Compiler

Compiled 13 to 9 computations (30.8% saved)

bsearch39.0ms (2%)

Memory

1.7MiB live, 49.0MiB allocated; 8ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
36.0ms	-6.397889549203275e-304	4.3173520625769903e-303

Samples

21.0ms	48×	2	valid
7.0ms	112×	0	valid

Compiler

Compiled 295 to 232 computations (21.4% saved)

Precisions

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

ival-sqrt: 8.0ms (49.7% of total)

ival-div!: 3.0ms (18.6% of total)

ival-mult!: 3.0ms (18.6% of total)

adjust: 1.0ms (6.2% of total)

ival-sub!: 1.0ms (6.2% of total)

derivations4.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 46 to 15 computations (67.4% saved)

preprocess29.0ms (1.5%)

Memory: 5.9MiB live, 49.4MiB allocated; 5ms collecting garbage
Compiler: Compiled 128 to 56 computations (56.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze2.0ms (0.1%)

sample1.5s (77.5%)

explain157.0ms (8%)

preprocess48.0ms (2.5%)

series3.0ms (0.1%)

rewrite68.0ms (3.5%)

eval4.0ms (0.2%)

prune2.0ms (0.1%)

series0.0ms (0%)

rewrite77.0ms (3.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

regimes2.0ms (0.1%)

bsearch39.0ms (2%)

derivations4.0ms (0.2%)

preprocess29.0ms (1.5%)

end0.0ms (0%)

Profiling