Metrics for Kahan p13 Example 1

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze2.0ms (0.1%)

Memory

0.6MiB live, 0.6MiB allocated

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 37 to 12 computations (67.6% saved)

sample20.0ms (1.5%)

Memory

-0.5MiB live, 8.2MiB allocated

Samples

13.0ms

260×

valid

Precisions

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

ival-div: 3.0ms (33.5% of total)

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

ival-mult: 3.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)

Bogosity

explain1.0s (77.2%)

Memory

6.4MiB live, 864.8MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t))`
-	-	`t`
-	-	`#s(literal 1 binary64)`
-	-	`(/.f64 (+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))`
-	-	`(.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))`
-	-	`(+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t))))`
-	-	`#s(literal 2 binary64)`
-	-	`(+.f64 #s(literal 1 binary64) t)`
-	-	`(*.f64 #s(literal 2 binary64) t)`
-	-	`(+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t))))`

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

2:

4:

8:

16:

32:

64:

128:

256:

512:

1024:

2048:

Freqs

test

number	freq
0	256

Total Confusion?

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

Precision?

0/0

Recall?

0/0

Total Time

7.52001953125

Average Time

0.029375076293945313

Samples

177.0ms

3 072×

valid

Compiler

Compiled 4 044 to 504 computations (87.5% saved)

Precisions

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

ival-add: 35.0ms (32.7% of total)

ival-mult: 34.0ms (31.8% of total)

ival-div: 32.0ms (29.9% of total)

ival-true: 2.0ms (1.9% of total)

exact: 2.0ms (1.9% of total)

adjust: 1.0ms (0.9% of total)

ival-assert: 1.0ms (0.9% of total)

preprocess254.0ms (19.5%)

Memory

8.4MiB live, 45.8MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	79
1	36	71
2	99	62
3	386	62
4	1556	62
5	3812	62
6	5504	62
7	7117	62
8	7588	62
9	7838	62
10	7936	62
0	10	35
0	17	35
1	29	31
2	55	31
3	126	31
4	208	31
5	248	31
6	393	31
7	551	31
8	692	31
9	756	31
10	839	31
11	1197	31
12	2048	29
13	3386	29
14	5487	29
15	5926	29
16	5971	29
17	5978	29
18	5984	29
19	7068	29
0	8144	26

Stop Event

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

Calls

Call 1

Inputs
(/.f64 (+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

Inputs

(/.f64 (+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

Outputs
(/.f64 (+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))
(+.f64 (/.f64 (/.f64 (.f64 t t) (fma.f64 (/.f64 #s(literal 2 binary64) (fma.f64 (+.f64 t #s(literal 2 binary64)) t #s(literal 1 binary64))) (.f64 t t) #s(literal 1 binary64))) (fma.f64 (+.f64 t #s(literal 2 binary64)) t #s(literal 1 binary64))) #s(literal 1/2 binary64))

Outputs

(/.f64 (+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

(+.f64 (/.f64 (/.f64 (*.f64 t t) (fma.f64 (/.f64 #s(literal 2 binary64) (fma.f64 (+.f64 t #s(literal 2 binary64)) t #s(literal 1 binary64))) (*.f64 t t) #s(literal 1 binary64))) (fma.f64 (+.f64 t #s(literal 2 binary64)) t #s(literal 1 binary64))) #s(literal 1/2 binary64))

Compiler

Compiled 35 to 10 computations (71.4% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated

Alt Table

Click to see full alt table

Status	Accuracy	Program
	100.0%	(/.f64 (+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

Status

Accuracy

Program

100.0%

(/.f64 (+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

Compiler

Compiled 70 to 20 computations (71.4% saved)

simplify20.0ms (1.5%)

Memory

-8.2MiB live, 18.1MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	35
1	17	35

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 (+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

Inputs

(/.f64 (+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

Outputs
(/.f64 (+.f64 #s(literal 1 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (.f64 (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))
(/.f64 (+.f64 (.f64 (/.f64 (.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64))) (/.f64 (.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64)))) #s(literal 1 binary64)) (+.f64 (.f64 (/.f64 (.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64))) (/.f64 (.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64)))) #s(literal 2 binary64)))

Outputs

(/.f64 (+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))

(/.f64 (+.f64 (*.f64 (/.f64 (*.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64))) (/.f64 (*.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64)))) #s(literal 1 binary64)) (+.f64 (*.f64 (/.f64 (*.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64))) (/.f64 (*.f64 t #s(literal 2 binary64)) (+.f64 t #s(literal 1 binary64)))) #s(literal 2 binary64)))

soundness0.0ms (0%)

Memory

0.2MiB live, 0.2MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 35 to 10 computations (71.4% saved)

preprocess1.0ms (0%)

Memory: 0.4MiB live, 0.4MiB allocated
Compiler: Compiled 140 to 40 computations (71.4% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze2.0ms (0.1%)

sample20.0ms (1.5%)

explain1.0s (77.2%)

preprocess254.0ms (19.5%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify20.0ms (1.5%)

soundness0.0ms (0%)

preprocess1.0ms (0%)

end0.0ms (0%)

Profiling