Graphics.Rendering.Chart.Plot.Vectors:renderPlotVectors from Chart-1.5.3

Time bar (total: 1.9s)

analyze1.0ms (0%)

Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 12 to 9 computations (25% saved)

Precisions
Click to see histograms. Total time spent on operations: 1.0ms
ival-sub: 0.0ms (0% of total)
ival-add: 0.0ms (0% of total)
ival-mult: 0.0ms (0% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

sample1.0s (55.2%)

Results
411.0ms6366×0valid
314.0ms1752×1valid
25.0ms138×2valid
Precisions
Click to see histograms. Total time spent on operations: 436.0ms
ival-sub: 148.0ms (34% of total)
ival-mult: 114.0ms (26.2% of total)
ival-add: 107.0ms (24.6% of total)
backward-pass: 49.0ms (11.2% of total)
const: 18.0ms (4.1% of total)
Bogosity

preprocess241.0ms (12.8%)

Algorithm
egg-herbie
Rules
725×fma-neg
569×unsub-neg
521×sub-neg
432×distribute-lft-out
415×distribute-lft-out--
Iterations

Useful iterations: 4 (0.0ms)

IterNodesCost
025270
157222
2167218
3709218
42707175
55011175
66069175
76595175
86843175
96993175
107082175
117202175
127543175
Stop Event
node limit
Calls
Call 1
Inputs
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
(+.f64 (neg.f64 x) (*.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x)) (-.f64 #s(literal 1 binary64) y)))
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) (neg.f64 y))))
(neg.f64 (+.f64 (neg.f64 x) (*.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x)) (-.f64 #s(literal 1 binary64) y))))
(neg.f64 (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) (neg.f64 y)))))
(+.f64 y (*.f64 (-.f64 #s(literal 1 binary64) y) (-.f64 #s(literal 1 binary64) x)))
Outputs
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
(fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y) x)
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
(fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y) x)
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
(+.f64 (neg.f64 x) (*.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x)) (-.f64 #s(literal 1 binary64) y)))
(+.f64 (neg.f64 x) (*.f64 (-.f64 #s(literal 1 binary64) y) (-.f64 #s(literal 1 binary64) (neg.f64 x))))
(fma.f64 (-.f64 #s(literal 1 binary64) y) (+.f64 x #s(literal 1 binary64)) (neg.f64 x))
(-.f64 (*.f64 (-.f64 #s(literal 1 binary64) y) (+.f64 x #s(literal 1 binary64))) x)
(+.f64 #s(literal 1 binary64) (*.f64 y (-.f64 #s(literal -1 binary64) x)))
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) (neg.f64 y))))
(fma.f64 (-.f64 #s(literal 1 binary64) x) (+.f64 #s(literal 1 binary64) y) x)
(+.f64 #s(literal 1 binary64) (*.f64 (-.f64 #s(literal 1 binary64) x) y))
(neg.f64 (+.f64 (neg.f64 x) (*.f64 (-.f64 #s(literal 1 binary64) (neg.f64 x)) (-.f64 #s(literal 1 binary64) y))))
(neg.f64 (+.f64 (neg.f64 x) (*.f64 (-.f64 #s(literal 1 binary64) y) (-.f64 #s(literal 1 binary64) (neg.f64 x)))))
(-.f64 x (*.f64 (-.f64 #s(literal 1 binary64) y) (+.f64 x #s(literal 1 binary64))))
(fma.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 y #s(literal -1 binary64)) x)
(fma.f64 (-.f64 #s(literal 1 binary64) y) (-.f64 #s(literal -1 binary64) x) x)
(-.f64 #s(literal -1 binary64) (*.f64 y (-.f64 #s(literal -1 binary64) x)))
(neg.f64 (+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) (neg.f64 y)))))
(neg.f64 (fma.f64 (-.f64 #s(literal 1 binary64) x) (+.f64 #s(literal 1 binary64) y) x))
(fma.f64 (+.f64 #s(literal 1 binary64) y) (+.f64 x #s(literal -1 binary64)) (neg.f64 x))
(+.f64 #s(literal -1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
(+.f64 y (*.f64 (-.f64 #s(literal 1 binary64) y) (-.f64 #s(literal 1 binary64) x)))
(+.f64 y (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
(fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y) y)
(+.f64 #s(literal 1 binary64) (*.f64 x (+.f64 y #s(literal -1 binary64))))

explain180.0ms (9.6%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
610-0-(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
00-0-x
00-0-(-.f64 #s(literal 1 binary64) x)
00-0-#s(literal 1 binary64)
00-0-(*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y))
00-0-y
00-0-(-.f64 #s(literal 1 binary64) y)
Results
73.0ms394×0valid
67.0ms110×1valid
3.0ms2valid
Compiler

Compiled 67 to 46 computations (31.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 44.0ms
ival-sub: 21.0ms (47.7% of total)
ival-mult: 9.0ms (20.5% of total)
backward-pass: 8.0ms (18.2% of total)
const: 3.0ms (6.8% of total)
ival-add: 3.0ms (6.8% of total)

eval0.0ms (0%)

Compiler

Compiled 17 to 12 computations (29.4% saved)

prune1.0ms (0.1%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
Compiler

Compiled 9 to 7 computations (22.2% saved)

localize75.0ms (4%)

Results
66.0ms256×0valid
Compiler

Compiled 22 to 15 computations (31.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 10.0ms
ival-add: 6.0ms (58.1% of total)
ival-mult: 4.0ms (38.7% of total)
const: 1.0ms (9.7% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 2 to 2 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
Compiler

Compiled 27 to 20 computations (25.9% saved)

regimes6.0ms (0.3%)

Accuracy

Total -14.2b remaining (-∞%)

Threshold costs -14.2b (-∞%)

Counts
2 → 1
Calls
Call 1
Inputs
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
Outputs
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
Calls

4 calls:

2.0ms
y
1.0ms
x
1.0ms
(-.f64 #s(literal 1 binary64) y)
1.0ms
(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
Results
AccuracySegmentsBranch
100.0%1x
100.0%1y
100.0%1(+.f64 x (*.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) y)))
100.0%1(-.f64 #s(literal 1 binary64) y)
Compiler

Compiled 22 to 16 computations (27.3% saved)

simplify2.0ms (0.1%)

Algorithm
egg-herbie
Rules
1-exp
+-commutative
*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01225
12125
Stop Event
saturated
Calls
Call 1
Inputs
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))
Outputs
(+.f64 #s(literal 1 binary64) (*.f64 y (+.f64 x #s(literal -1 binary64))))

soundness307.0ms (16.3%)

Rules
725×fma-neg
569×unsub-neg
521×sub-neg
432×distribute-lft-out
415×distribute-lft-out--
Iterations

Useful iterations: 4 (0.0ms)

IterNodesCost
025270
157222
2167218
3709218
42707175
55011175
66069175
76595175
86843175
96993175
107082175
117202175
127543175
Stop Event
done
node limit
Compiler

Compiled 212 to 138 computations (34.9% saved)

preprocess27.0ms (1.4%)

Compiler

Compiled 58 to 42 computations (27.6% saved)

end0.0ms (0%)

Profiling

Loading profile data...