Metrics for ReportTypes:explainFloat from gipeda-0.1.2.1

analyze1.0ms (0.1%)

Memory

3.3MiB live, 3.3MiB 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 9 to 7 computations (22.2% saved)

sample973.0ms (80.1%)

Memory

-3.0MiB live, 678.7MiB allocated

Samples

805.0ms

8 256×

valid

Precisions

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

ival-div: 141.0ms (65.7% of total)

ival-sub: 39.0ms (18.2% of total)

ival-mult: 22.0ms (10.3% of total)

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

exact: 4.0ms (1.9% of total)

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

Bogosity

preprocess30.0ms (2.5%)

Memory

-13.1MiB live, 25.2MiB allocated

Algorithm

2×	egg-herbie

Rules

22×	`associate-/r*`
20×	`div-sub`
18×	`sub-neg`
14×	`distribute-lft-neg-in`
12×	`neg-sub0`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	10	9
1	39	3
2	89	3
3	121	3
4	146	3
5	153	3
6	159	3
7	161	3
8	165	3
0	5	3
1	12	1
2	24	1
3	27	1
4	29	1
5	31	1
6	35	1
7	40	1
0	40	1

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* 100 (/ (- x x) x))

Outputs
(* 100 (/ (- x x) x))
#s(literal 0 binary64)

Call 2

Inputs
(* 100 (/ (- x x) x))
(* 100 (/ (- (neg x) (neg x)) (neg x)))
(neg (* 100 (/ (- (neg x) (neg x)) (neg x))))

Outputs
(* 100 (/ (- x x) x))
#s(literal 0 binary64)
(* 100 (/ (- (neg x) (neg x)) (neg x)))
#s(literal 0 binary64)
(neg (* 100 (/ (- (neg x) (neg x)) (neg x))))
#s(literal 0 binary64)

Symmetry

(abs x)

(negabs x)

explain60.0ms (4.9%)

Memory

-0.6MiB live, 159.2MiB allocated

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))`
-	-	`(-.f64 x x)`
-	-	`(/.f64 (-.f64 x x) x)`
-	-	`#s(literal 100 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

23.0ms

512×

valid

Compiler

Compiled 54 to 24 computations (55.6% saved)

Precisions

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

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

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

ival-mult: 1.0ms (13.1% of total)

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

exact: 0.0ms (0% of total)

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

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

1.9MiB live, 1.9MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 5 computations (37.5% saved)

simplify4.0ms (0.3%)

Memory

10.9MiB live, 10.9MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	192	(-.f64 x x)
✓	cost-diff	320	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
✓	cost-diff	704	(/.f64 (-.f64 x x) x)

Rules

10×	`sub-neg`
8×	`+-lowering-+.f64`
8×	`+-lowering-+.f32`
6×	`--lowering--.f32`
6×	`--lowering--.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	11
1	12	5
2	24	5
3	27	5
4	29	5
5	31	5
6	35	5
7	40	5
0	40	5

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

Inputs
(* 100 (/ (- x x) x))
100
(/ (- x x) x)
(- x x)
x

Outputs
(* 100 (/ (- x x) x))
#s(literal 0 binary64)
100
#s(literal 100 binary64)
(/ (- x x) x)
#s(literal 0 binary64)
(- x x)
#s(literal 0 binary64)
x

localize16.0ms (1.3%)

Memory

14.0MiB live, 52.7MiB allocated

Localize:

Found 3 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(/.f64 (-.f64 x x) x)
✓	accuracy	100.0%	(-.f64 x x)
✓	accuracy	100.0%	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Samples

9.0ms

256×

valid

Compiler

Compiled 19 to 7 computations (63.2% saved)

Precisions

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

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

ival-div: 1.0ms (27.6% of total)

ival-mult: 1.0ms (27.6% of total)

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

1.7MiB live, 1.7MiB allocated

Counts

3 → 36

Calls

Call 1

Inputs
#<alt (/ (- x x) x)>
#<alt (* 100 (/ (- x x) x))>
#<alt (- x x)>

Outputs
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>
#<alt 0>

Calls

9 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	(/ (- x x) x)
0.0ms	x	@	-inf	(/ (- x x) x)
0.0ms	x	@	inf	(/ (- x x) x)
0.0ms	x	@	0	(* 100 (/ (- x x) x))
0.0ms	x	@	-inf	(* 100 (/ (- x x) x))

rewrite34.0ms (2.8%)

Memory

1.6MiB live, 80.4MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

34×	`-lowering-.f32`
34×	`-lowering-.f64`
30×	`/-lowering-/.f32`
30×	`/-lowering-/.f64`
28×	`+-lowering-+.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	9
1	30	3
0	154	3

Stop Event

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

Counts

3 → 3

Calls

Call 1

Inputs
(/ (- x x) x)
(* 100 (/ (- x x) x))
(- x x)

Outputs
#s(literal 0 binary64)
#s(literal 0 binary64)
#s(literal 0 binary64)

simplify5.0ms (0.4%)

Memory

-25.7MiB live, 13.7MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	36
0	1	36

Stop Event

1×	saturated
1×	saturated

Counts

36 → 36

Calls

Call 1

Inputs
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Outputs
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)
0
#s(literal 0 binary64)

eval3.0ms (0.2%)

Memory: 7.6MiB live, 7.6MiB allocated
Compiler: Compiled 118 to 6 computations (94.9% saved)

prune1.0ms (0.1%)

Memory

3.8MiB live, 3.8MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	38	1	39
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	39	1	40

Accuracy

100.0%

Counts

40 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(literal 0 binary64)

Compiler

Compiled 2 to 2 computations (0% saved)

simplify3.0ms (0.2%)

Memory

8.4MiB live, 8.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated

Calls

Call 1

Inputs
0

Outputs
0
#s(literal 0 binary64)

localize7.0ms (0.5%)

Memory

-20.5MiB live, 19.1MiB allocated

Samples

3.0ms

256×

valid

Compiler

Compiled 3 to 4 computations (-33.3% saved)

Precisions

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

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.0MiB live, 0.0MiB allocated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

rewrite7.0ms (0.5%)

Memory

17.6MiB live, 17.6MiB allocated

Algorithm

1×	batch-egg-rewrite

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

simplify2.0ms (0.2%)

Memory

5.2MiB live, 5.2MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

2.4MiB live, 2.4MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(literal 0 binary64)

Compiler

Compiled 11 to 8 computations (27.3% saved)

regimes4.0ms (0.4%)

Memory

-26.6MiB live, 12.8MiB allocated

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Outputs
#s(literal 0 binary64)

Calls

3 calls:

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

Results

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

Compiler

Compiled 16 to 9 computations (43.8% saved)

simplify7.0ms (0.6%)

Memory

24.1MiB live, 24.1MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

soundness29.0ms (2.4%)

Memory

-11.8MiB live, 41.1MiB allocated

Rules

34×	`-lowering-.f32`
34×	`-lowering-.f64`
30×	`/-lowering-/.f32`
30×	`/-lowering-/.f64`
28×	`+-lowering-+.f64`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	9
1	30	3
0	154	3

Stop Event

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

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess28.0ms (2.3%)

Memory

-17.1MiB live, 100.8MiB allocated

Remove

(negabs x)

(abs x)

Compiler

Compiled 32 to 26 computations (18.8% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

Iter	Nodes	Cost
0	10	9
1	39	3
2	89	3
3	121	3
4	146	3
5	153	3
6	159	3
7	161	3
8	165	3
0	5	3
1	12	1
2	24	1
3	27	1
4	29	1
5	31	1
6	35	1
7	40	1
0	40	1

Iter	Nodes	Cost
0	10	9
1	39	3
2	89	3
3	121	3
4	146	3
5	153	3
6	159	3
7	161	3
8	165	3
0	5	3
1	12	1
2	24	1
3	27	1
4	29	1
5	31	1
6	35	1
7	40	1
0	40	1

analyze1.0ms (0.1%)

sample973.0ms (80.1%)

preprocess30.0ms (2.5%)

explain60.0ms (4.9%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify4.0ms (0.3%)

localize16.0ms (1.3%)

series0.0ms (0%)

rewrite34.0ms (2.8%)

simplify5.0ms (0.4%)

eval3.0ms (0.2%)

prune1.0ms (0.1%)

simplify3.0ms (0.2%)

localize7.0ms (0.5%)

series0.0ms (0%)

rewrite7.0ms (0.5%)

simplify2.0ms (0.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.4%)

simplify7.0ms (0.6%)

soundness29.0ms (2.4%)

preprocess28.0ms (2.3%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	10	9
1	39	3
2	89	3
3	121	3
4	146	3
5	153	3
6	159	3
7	161	3
8	165	3
0	5	3
1	12	1
2	24	1
3	27	1
4	29	1
5	31	1
6	35	1
7	40	1
0	40	1