Metrics for Main:bigenough1 from B

analyze0.0ms (0%)

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 4 computations (42.9% saved)

Precisions

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

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation ival-mult, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample1.0s (75.1%)

Results

610.0ms	6169×	256	valid
239.0ms	2087×	256	infinite

Precisions

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

Operation ival-mult, time spent: 143.0ms, 69.0% of total-time

Operation ival-add, time spent: 56.0ms, 27.0% of total-time

Operation const, time spent: 9.0ms, 4.0% of total-time

Bogosity

preprocess190.0ms (14%)

Algorithm

1×	egg-herbie

Rules

108×	`fma-define`
104×	`fma-neg`
25×	`associate-r`
25×	`unsub-neg`
21×	`distribute-lft-neg-in`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`(*.f64 x x)`
-	-	`(+.f64 x (*.f64 x x))`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	12	94
1	33	76
2	99	74
3	304	74
4	503	74
5	617	74
6	622	74

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 x (*.f64 x x))
(+.f64 x (*.f64 x x))
(+.f64 (neg.f64 x) (*.f64 (neg.f64 x) (neg.f64 x)))
(neg.f64 (+.f64 (neg.f64 x) (*.f64 (neg.f64 x) (neg.f64 x))))

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

Results

28.0ms	360×	256	valid
89.0ms	152×	256	infinite

Compiler

Compiled 28 to 11 computations (60.7% saved)

Precisions

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

Operation ival-mult, time spent: 5.0ms, 54.0% of total-time

Operation ival-add, time spent: 3.0ms, 32.0% of total-time

Operation const, time spent: 1.0ms, 11.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 10 to 5 computations (50% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

localize31.0ms (2.3%)

Results

15.0ms	180×	256	valid
7.0ms	76×	256	infinite

Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions

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

Operation ival-add, time spent: 3.0ms, 49.0% of total-time

Operation ival-mult, time spent: 2.0ms, 33.0% of total-time

Operation const, time spent: 1.0ms, 16.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

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%	(*.f64 (+.f64 x #s(literal 1 binary64)) x)

Compiler

Compiled 17 to 10 computations (41.2% saved)

regimes3.0ms (0.2%)

Accuracy

Total -0.0b remaining (-∞%)

Threshold costs -0b (-∞%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

2 calls:

1.0ms	x
1.0ms	(+.f64 x (*.f64 x x))

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(+.f64 x (*.f64 x x))`

Compiler

Compiled 8 to 4 computations (50% saved)

simplify2.0ms (0.2%)

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
1×	`*-commutative`
1×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	19
1	16	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

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

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

Compiler

Compiled 6 to 4 computations (33.3% saved)

soundness87.0ms (6.4%)

Rules

108×	`fma-define`
104×	`fma-neg`
25×	`associate-r`
25×	`unsub-neg`
21×	`distribute-lft-neg-in`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	12	94
1	33	76
2	99	74
3	304	74
4	503	74
5	617	74
6	622	74

Stop Event

1×

saturated

Compiler

Compiled 11 to 6 computations (45.5% saved)

end0.0ms (0%)

preprocess22.0ms (1.6%)

Compiler: Compiled 24 to 14 computations (41.7% saved)

analyze0.0ms (0%)

sample1.0s (75.1%)

preprocess190.0ms (14%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize31.0ms (2.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.2%)

simplify2.0ms (0.2%)

soundness87.0ms (6.4%)

end0.0ms (0%)

preprocess22.0ms (1.6%)

Profiling