Metrics for Expanding a square

analyze11.0ms (0.4%)

Memory

3.4MiB live, 3.4MiB allocated

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 22 to 13 computations (40.9% saved)

sample2.7s (88.3%)

Memory

26.0MiB live, 814.4MiB allocated

Samples

630.0ms	4 039×	1	valid-baseline
277.0ms	4 039×	1	valid-sollya
275.0ms	4 039×	1	valid-rival
186.0ms	4 215×	0	valid-sollya
181.0ms	4 215×	0	valid-baseline
153.0ms	4 215×	0	valid-rival
0.0ms	1×	1	valid-rival+sollya-real
0.0ms	1×	0	valid-rival+sollya-real

Precisions

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

ival-mult: 75.0ms (29.5% of total)

ival-add: 70.0ms (27.5% of total)

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

adjust: 40.0ms (15.7% of total)

ival-true: 7.0ms (2.8% of total)

...in/eval/compile.rkt:76:19: 4.0ms (1.6% of total)

ival-assert: 4.0ms (1.6% of total)

Precisions

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

ival-sub: 279.0ms (47.7% of total)

ival-mult: 158.0ms (27% of total)

ival-add: 126.0ms (21.6% of total)

const: 22.0ms (3.8% of total)

Bogosity

preprocess322.0ms (10.5%)

Memory

4.5MiB live, 19.8MiB allocated

Algorithm

1×	egg-herbie

Rules

3 207×	`fmm-def`
1 038×	`unsub-neg`
503×	`distribute-neg-in`
426×	`sub-neg`
304×	`fma-define`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	15	128
1	51	108
2	146	88
3	488	76
4	2177	76
5	3786	76
6	4927	76
7	5774	76
8	6199	76
9	6439	76
10	6442	76
11	6442	76
12	6563	76
13	6650	76
14	6823	76
15	6823	76

Stop Event

1×	node limit

Calls

Call 1

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

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

Compiler

Compiled 10 to 5 computations (50% saved)

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 10 computations (50% saved)

simplify2.0ms (0.1%)

Memory

0.4MiB live, 0.4MiB allocated

Algorithm

1×	egg-herbie

Rules

3×	`1-exp`
3×	`+-commutative`
2×	`unsub-neg`
2×	`sub-neg`
2×	`neg-mul-1`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	31
1	18	31
2	22	31
3	25	31
4	28	31
5	31	31

Stop Event

1×

saturated

Calls

Call 1

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

Outputs

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

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

soundness0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated

Stop Event

1×

fuel

Compiler

Compiled 10 to 6 computations (40% saved)

preprocess21.0ms (0.7%)

Memory: -10.3MiB live, 22.8MiB allocated
Compiler: Compiled 40 to 22 computations (45% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze11.0ms (0.4%)

sample2.7s (88.3%)

preprocess322.0ms (10.5%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify2.0ms (0.1%)

soundness0.0ms (0%)

preprocess21.0ms (0.7%)

end0.0ms (0%)

Profiling